A learning automata-based algorithm for solving coverage problem in directional sensor networks

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.

[1]  Mohammad Reza Meybodi,et al.  An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach , 2010, J. Netw. Comput. Appl..

[2]  Youn-Hee Han,et al.  A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks , 2011, Sensors.

[3]  Mohammad S. Obaidat,et al.  Adaptive wireless networks using learning automata , 2011, IEEE Wireless Communications.

[4]  S. Wolfram,et al.  Two-dimensional cellular automata , 1985 .

[5]  Mohammad Reza Meybodi,et al.  An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata , 2010, Comput. Networks.

[6]  Jian Wang,et al.  Priority-based target coverage in directional sensor networks using a genetic algorithm , 2009, Comput. Math. Appl..

[7]  Mohammad Reza Meybodi,et al.  EEMLA: Energy Efficient Monitoring of Wireless Sensor Network with Learning Automata , 2010, 2010 International Conference on Signal Acquisition and Processing.

[8]  Xiang-Yang Li,et al.  Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks , 2009, IEEE Transactions on Computers.

[9]  Javad Akbari Torkestani.  LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks , 2013, Wirel. Pers. Commun..

[10]  Javad Akbari Torkestani.  A new approach to the job scheduling problem in computational grids , 2011, Cluster Computing.

[11]  Mohammad Reza Meybodi,et al.  A cellular learning automata-based algorithm for solving the vertex coloring problem , 2011, Expert Syst. Appl..

[12]  Youn-Hee Han,et al.  A Greedy Algorithm for Target Coverage Scheduling in Directional Sensor Networks , 2010, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

[13]  M. Amaç Güvensan,et al.  On coverage issues in directional sensor networks: A survey , 2011, Ad Hoc Networks.

[14]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Mohammad Reza Meybodi,et al.  A Mathematical Framework for Cellular Learning Automata , 2004, Adv. Complex Syst..

[16]  Javad Akbari Torkestani.  An adaptive learning automata-based ranking function discovery algorithm , 2012, Journal of Intelligent Information Systems.

[17]  Javad Akbari Torkestani,et al.  An adaptive backbone formation algorithm for wireless sensor networks , 2012, Comput. Commun..

[18]  Mohammad Reza Meybodi,et al.  A Self-Organizing Channel Assignment Algorithm: A Cellular Learning Automata Approach , 2003, IDEAL.

[19]  Huadong Ma,et al.  On Coverage Problems of Directional Sensor Networks , 2005, MSN.

[20]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[21]  Mohammad Reza Meybodi,et al.  Clustering the wireless Ad Hoc networks: A distributed learning automata approach , 2010, J. Parallel Distributed Comput..

[22]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[23]  B. R. Harita,et al.  Learning automata with changing number of actions , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  Panayiotis Kotzanikolaou,et al.  Solving coverage problems in wireless sensor networks using cover sets , 2010, Ad Hoc Networks.

[25]  E. Fredkin.  Digital mechanics: an informational process based on reversible universal cellular automata , 1990 .

[26]  Mohammad Reza Meybodi,et al.  Cellular Learning Automata Based Dynamic Channel Assignment Algorithms , 2009, Int. J. Comput. Intell. Appl..

[27]  Minglu Li,et al.  Target-oriented scheduling in directional sensor networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[28]  Christos Douligeris,et al.  Connected coverage in WSNs based on critical targets , 2011, Comput. Networks.

[29]  Mohammad Reza Meybodi,et al.  A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks , 2010, Comput. Networks.

[30]  Mohammad Reza Meybodi,et al.  A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs , 2012, The Journal of Supercomputing.

[31]  Alhussein A. Abouzeid,et al.  Coverage by directional sensors in randomly deployed wireless sensor networks , 2006, J. Comb. Optim..