Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks

Full Text (PDF, 1095KB), PP.46-57

Views: 0 Downloads: 0

Author(s)

Sivaraj Chinnasamy 1,* Alphonse P J A 1 Janakiraman T N 2

1. Department of Computer Applications, National Institute of Technology, Tiruchirappalli, 620015, INDIA

2. Department of Mathematics, National Institute of Technology, Tiruchirappalli, 620015, INDIA

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2017.09.06

Received: 16 Feb. 2017 / Revised: 22 Mar. 2017 / Accepted: 10 Apr. 2017 / Published: 8 Sep. 2017

Index Terms

Wireless sensor networks, energy-efficient routing, connected dominating set, load distribution, on-demand rotation

Abstract

Energy-efficient routing is an extremely critical issue in unattended, tiny and battery equipped Wireless Sensor Networks (WSNs). Clustering the network is a promising approach for energy aware routing in WSN, as it has a hierarchical structure. The Connected Dominating Set (CDS) is an appropriate and prominent approach for cluster formation. This paper proposes an Energy-efficient Self-load Balanced Clustering algorithm (SLBC) for routing in WSN. SLBC has two phases: The first phase clusters the network by constructing greedy connected dominating set and the nodes are evenly distributed among them, using the defined parent fitness cost. The second phase performs data manipulations and new on-demand re-clustering. The efficiency of the proposed algorithm is analysed through simulation study. The obtained results show that SLBC outperforms than the recent algorithms like GSTEB and DGA-EBCDS in terms of network lifetime, CDS size, load dissemination, and efficient energy utilization of the network.

Cite This Paper

Sivaraj Chinnasamy, Alphonse P J A, Janakiraman T N, "Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks", International Journal of Intelligent Systems and Applications(IJISA), Vol.9, No.9, pp.46-57, 2017. DOI:10.5815/ijisa.2017.09.06

Reference

[1]Vamsi, P. Raghu, and Krishna Kant. "Self-adaptive trust model for secure geographic routing in wireless sensor networks." International Journal of Intelligent Systems and Applications 7.3 (2015): 21.
[2]Ashrafuddin, Md, Md Manowarul Islam, and Md Mamun-or-Rashid. "Energy efficient fitness based routing protocol for underwater sensor network." International Journal of Intelligent Systems and Applications 5.6 (2013): pp.61-69.
[3]Khan, Koffka, and Wayne Goodridge. "Fault Tolerant Multi-Criteria Multi-Path Routing in Wireless Sensor Networks." International Journal of Intelligent Systems and Applications 7.6 (2015): 55.
[4]Liu, Yunhuai, Qian Zhang, and Lionel Ni. "Opportunity-based topology control in wireless sensor networks." IEEE Transactions on Parallel and Distributed Systems 21.3 (2010): 405-416.
[5]Wightman, Pedro M., and Miguel A. Labrador. "A3: A topology construction algorithm for wireless sensor networks." Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE. IEEE, 2008.
[6]Li, Deying, et al. "Minimum total communication power connected dominating set in wireless networks." International Conference on Wireless Algorithms, Systems, and Applications. Springer Berlin Heidelberg, 2012.
[7]Guha, Sudipto, and Samir Khuller. "Approximation algorithms for connected dominating sets." Algorithmica 20.4 (1998): 374-387.
[8]Younis, Ossama, and Sonia Fahmy. "HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks." IEEE Transactions on mobile computing 3.4 (2004): 366-379.
[9]Dai, Fei, and Jie Wu. "An extended localized algorithm for connected dominating set formation in ad hoc wireless networks." IEEE transactions on parallel and distributed systems 15.10 (2004): 908-920.
[10]J. Wu and Cardei, “Extended dominating set and its applications in ad hoc networks using cooperative communication,” Parallel and Distributed Systems, IEEE Transactions on, vol. 17, no. 8, pp. 851– 864, 2006.
[11]Wu, Jie, et al. "Extended dominating set and its applications in ad hoc networks using cooperative communication.” IEEE Transactions on Parallel and Distributed Systems 17.8 (2006): 851-864.
[12]Cheng, Xiuzhen, et al. "A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks." Networks 42.4 (2003): 202-208.
[13]Yu, Jiguo, et al. "Connected dominating sets in wireless ad hoc and sensor networks–A comprehensive survey." Computer Communications 36.2 (2013): 121-134.
[14]Ruan, Lu, et al. "A greedy approximation for minimum connected dominating sets." Theoretical Computer Science 329.1-3 (2004): 325-330.
[15]R Misra, Rajiv, and Chittaranjan Mandal. "Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks." IEEE Transactions on parallel and distributed systems 21.3 (2010): 292-302.
[16]Das, Ariyam, et al. "An improved greedy construction of minimum connected dominating sets in wireless networks." Wireless Communications and Networking Conference (WCNC), 2011 IEEE. IEEE, 2011.
[17]Tang, Qiang, et al. "An energy efficient MCDS construction algorithm for wireless sensor networks." EURASIP Journal on Wireless Communications and Networking 2012.1 (2012): 83.
[18]Clark, Brent N., Charles J. Colbourn, and David S. Johnson. "Unit disk graphs." Discrete mathematics 86.1-3 (1990): 165-177.
[19]Al-Nabhan, Najla, Mznah Al-Rodhaan, and Abdullah Al-Dhelaan. "Distributed energy-efficient approaches for connected dominating set construction in wireless sensor networks." International Journal of Distributed Sensor Networks (2014).
[20]Aziz, Azrina Abd, and Y. Ahmet Şekercioğlu. "A distributed energy aware connected dominating set technique for wireless sensor networks." Intelligent and Advanced Systems (ICIAS), 2012 4th International Conference on. Vol. 1. IEEE, 2012.
[21]Qayyum, Amir, Laurent Viennot, and Anis Laouiti. "Multipoint relaying for flooding broadcast messages in mobile wireless networks." System Sciences, 2002. HICSS. Proceedings of the 35th Annual Hawaii International Conference on. IEEE, 2002.
[22]X. Kui, Y. Sheng, H. Du, and J. Liang, “Constructing a CDS-based network backbone for data collection in wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2013, 2013.
[23]Han, Zhao, et al. "A general self-organized tree-based energy-balance routing protocol for wireless sensor network." IEEE Transactions on Nuclear Science 61.2 (2014): 732-740.
[24]Kui, Xiaoyan, et al. "Constructing a CDS-based network backbone for data collection in wireless sensor networks." International Journal of Distributed Sensor Networks 9.4 (2013): 258081.
[25]Benkic, Karl, et al. "Using RSSI value for distance estimation in wireless sensor networks based on ZigBee." Systems, signals and image processing, 2008. IWSSIP 2008. 15th international conference on. IEEE, 2008.
[26]Heinzelman, Wendi Rabiner, Anantha Chandrakasan, and Hari Balakrishnan. "Energy-efficient communication protocol for wireless microsensor networks." System sciences, 2000. Proceedings of the 33rd annual Hawaii international conference on. IEEE, 2000.
[27]Santi, Paolo, and Douglas M. Blough. "The critical transmitting range for connectivity in sparse wireless ad hoc networks." IEEE transactions on Mobile Computing 2.1 (2003): 25-39.
[28]Li, Jianpo, Xue Jiang, and I-Tai Lu. "Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks." Journal of Sensors (2014):1-7