返回
A learning automata-based algorithm for solving coverage problem in directional sensor networks
DOI:10.1007/s00607-012-0208-x.png)
摘要
En 中文
Wireless sensor networks have been used in a wide variety of applications. Recently, networks consisting of directional sensors have gained prominence. An important challenge facing directional sensor networks (DSNs) is maximizing the network lifetime while covering all the targets in an area. One effective method for saving the sensors' energy and extending the network lifetime is to partition the DSN into several covers, each of which can cover all targets, and then to activate these covers successively. This paper first proposes a fully distributed algorithm based on irregular cellular learning automata to find a near-optimal solution for selecting each sensor's appropriate working direction. Then, to find a near-optimal solution that can cover all targets with the minimum number of active sensors, a centralized approximation algorithm is proposed based on distributed learning automata. This algorithm takes advantage of learning automata (LA) to determine the sensors that must be activated at each stage. As the presented algorithm proceeds, the activation process is focused on the sensor nodes that constitute the cover set with the minimum number of active sensors. Through simulations, we indicate that the scheduling algorithm based on LA has better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime.
Keyword:
Directional sensor networks
Cover set formation
Distributed learning automata
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
Dysfunctional nurturing behavior in rat dams with limited access to nesting material: A clinically relevant model for early-life stress
Neuroscience
IF0
A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks定向传感器网络中基于遗传算法的目标覆盖调度方案
SENSORS
IF3.5

