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

• Autorzy: Rezaei Z. , Torkestani J.A.

Warianty tytułu

PL

Energowydajny algorytm routowania w sieciach bezprzewodowych oparty na strukturze MCDS - automaty uczące się

• Języki publikacji: EN

Abstrakty

EN

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.

PL

W artykule zaprezentowano algorytm routowania typu unicast w sieci bezprzewodowej (ang. Wireless Sensor Network). Szkielet sieci oparty został na strukturze typu MCDS (ang. Minimum Connected Dominating Set). Do realizacji wykorzystano algorytm oparty na automacie uczącym się UMCDS-LA. Metodę przebadano na symulatorze ns2.

Słowa kluczowe

EN

wireless sensor network; Minimum Connected Dominating Set; Backbone formation; distributed learning automata

PL

bezprzewodowa sieć sensorów; Minimum Connected Dominating Set MCDS; szkielet sieci; rozproszony automat uczący się

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Elektrotechniczny
• Rocznik: 2012
• Tom: R. 88, nr 11a
• Strony: 147--151
• Opis fizyczny: Bibliogr. 19 poz., rys.

Twórcy

autor

Rezaei Z.

autor

Torkestani J.A.

• Department of Computer Engineering, Arak Branch, Islamic Azad University, Arak, Iran,

Bibliografia

• [1] Sterbenz J. P. G., Krishnan R., Hain R. R., Jackson A. W., Levin D., Ramanathan R. and Zao J., Survivable Mobile Wireless Networks: Issues, Challenges, and Research Directions, ACM Workshop on Wireless Security,(2002), 31–40
• [2] AkyildizI. F., Su W., Sankarasubramaniam Y. and Cayircl E., A survey on sensor networks, in: Proceedings of the IEEE Communication Magazine., 40(2002)
• [3] Ilyas M. and Mahgoub I., Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, in: Proceedings of the CRC Press,(2005)
• [4] Wu J.,Dai F.,Gao M., Stojmenovic I., On calculating poweraware connected dominating sets for efficient routing in ad-hoc wireless networks, Journal of Communications and Networks, 4(2002), No.1, 1–12
• [5] Han B., Zone-based virtual backbone formation in wireless adhoc networks, Ad-Hoc Networks,7(2009)
• [6] Alzoubi K. M., Wan P-J. and Frieder O., Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad-hoc networks, International Journal of Foundations of Computer Science, 14(2003)No. 2, 287–303
• [7] Clark B. N., Colbourn C. J. andJohnson D. S., Unit Disk Graphs. Discrete Mathematics, 86(1990), 165–177
• [8] Marathe M. V., Breu H., Hunt H. B., Ravi S. S. and Rosenkrantz D. J., Simple Heuristics for Unit Disk Graphs Networks,25(1995),59–68
• [9] NarendraK. S. and ThathacharM. A. L. ,Learning automata: An introduction, Printice-Hall,(1989)
• [10] NarendraK.S.,Thathachar M. A. L., Learning automata a survey, IEEE transactions on Systems, 4(1974), No.4
• [11] Akbari Torkestani J. and MeybodiM. R., Approximating the minimum connected dominating set in stochastic graphs based on learning automata, international conference on information management and engineering,(2009)
• [12] Akbari Torkestani J. and Meybodi M. R., Clustering the wireless ad-hoc networks: A distributed learning automata approach, Journal of Parallel and Distributed Computing, Elsevier Publishing Company,(2010)
• [13] Akyildiz I. F, Su W., Sankarasubramaniam Y., Cayirci E., Wireless sensor networks: a survey, Computer Networks, 38(2002), 393-422
• [14] Chang J. H. and Tassiulas L., Routing for maximum system lifetime in wireless ad-hoc networks, in Proc. of 37th Annual Allerton Conf. on Communication, Control, and Computing,(1999)
• [15] Chang J. H. and Tassiulas L., Maximum lifetime routing in wireless sensor networks, IEEE/ACM Trans. on Networking, 12(2004), No. 4,609-619
• [16] Hedetniemi S. and Liestman A., A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319–349
• [17] Li Y., Zhu S., Thai M. and Du D-Z., Localized construction of connected dominating set in wireless networks, in Proceedings of NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks ,(2004)
• [18] Wu Y., Wang F., Thai M. and Li Y., Constructing k-connected m dominating sets in wireless sensor networks, in Proceedings of the IEEE Military Communications Conference ,(2007),1– 7
• [19] Hussain S. and MubashsharulI. S., Energy Efficient Routing in Wireless Sensor Networks through Virtual Backbone, IEEE,(2009)