An Energy-Efficient MCDS-based Routing Algorithm for Wireless Sensor Networks: Learning Automata Approach

Wireless sensor networks which are used to monitor and control a specific area, are made of many small sensor nodes; they are compressed and spread in an environment. One of the most challenges in these types of networks is Energy limitation which has direct influence on sensor network lifetime. Unicast routing in wireless sensor networks is a way for data delivery to a receiver. In this paper we are intended to present a unicast routing algorithm in wireless sensor networks, and we make a virtual backbone out of Minimum Connected Dominating Set (MCDS). This virtual backbone is initiated according to Energy level, Neighboring, and distance from Sink node. So, to this end we use an algorithm based on learning automata named UMCDS- LA deal with the unicast routing problem. Finally, we simulate proposed method by ns2 simulator. Thus the results show high performance of the proposed algorithm. Streszczenie. W artykule zaprezentowano algorytm routowania typu unicast w sieci bezprzewodowej (ang. Wireless Sensor Network). Szkielet sieci oparty zostal na strukturze typu MCDS (ang. Minimum Connected Dominating Set). Do realizacji wykorzystano algorytm oparty na automacie uczącym sie UMCDS-LA. Metode przebadano na symulatorze ns2. (Energowydajny algorytm routowania w sieciach bezprzewodowych oparty na strukturze MCDS - automaty uczące sie)

[1]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

[2]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[3]  Yingshu Li,et al.  Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[4]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[5]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[6]  Bo Han,et al.  Zone-based virtual backbone formation in wireless ad hoc networks , 2009, Ad Hoc Networks.

[7]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[8]  Sajid Hussain,et al.  Energy Efficient Routing in Wireless Sensor Networks through Virtual Backbone , 2009, 2009 Seventh Annual Communication Networks and Services Research Conference.

[9]  P. Minet,et al.  Energy Efficient Routing , 2009 .

[10]  Kumpati S. Narendra,et al.  Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..

[11]  David Levin,et al.  Survivable mobile wireless networks: issues, challenges, and research directions , 2002, WiSE '02.

[12]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

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

[14]  Ivan Stojmenović,et al.  Handbook of Sensor Networks: Algorithms and Architectures , 2005, Handbook of Sensor Networks.

[15]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[16]  Mohammad Ilyas,et al.  Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems , 2004 .

[17]  M. Meybodi,et al.  Approximating the Minimum Connected Dominating Set in Stochastic Graphs Based on Learning Automata , 2009, 2009 International Conference on Information Management and Engineering.

[18]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[19]  Ding-Zhu Du,et al.  Localized Construction of Connected Dominating Set in Wireless Networks , 2004 .

[20]  OPHIR FRIEDER,et al.  Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..

[21]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[22]  Leandros Tassiulas,et al.  Maximum lifetime routing in wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.