Call for Paper - Upcoming Issues

GEDIR-MST: Geographic Routing Enhanced By Minimum Spanning Tree for Efficient Data Transmission in Wireless Sensor Networks

International Journal of Electronics and Communication Engineering
© 2024 by SSRG - IJECE Journal
Volume 11 Issue 11
Year of Publication : 2024
Authors : K. Nithya, R. Kousalya
10.14445/23488549/IJECE-V11I11P103
pdf
How to Cite?

K. Nithya, R. Kousalya, "GEDIR-MST: Geographic Routing Enhanced By Minimum Spanning Tree for Efficient Data Transmission in Wireless Sensor Networks," SSRG International Journal of Electronics and Communication Engineering, vol. 11,  no. 11, pp. 26-37, 2024. Crossref, https://doi.org/10.14445/23488549/IJECE-V11I11P103

Abstract:

Wireless Sensor Networks (WSN) are decentralized networks of autonomous sensor nodes equipped with sensing, processing and communication capabilities. Geographic Routing Enhanced by Minimum Spanning Tree is a novel routing algorithm specifically designed for WSNs. This algorithm integrates the principles of geographic routing with the construction of a Minimum Spanning Tree (MST) to enhance data transmission efficiency within the network. The process begins with networks’ initialization, where the sensor nodes are deployed and assigned unique IDs and geographic coordinates. Data transmission uses the Geographic Distance Routing GEDIR method, whereby each node chooses the neighbour geographically near the target. Simultaneously, a distributed algorithm constructs a Minimum Spanning Tree, ensuring the minimal total edge weight and optimizing factors like communication cost and energy consumption. MST is the backbone of routing path determination in which the nodes navigate through a tree using geographic routing principles to reach the destination efficiently. The combination of GEDIR and MST in GEDIR-MST Routing aims to significantly improve routing efficiency, reduce energy consumption, and enhance the overall network performance in WSN.

Keywords:

Data Transmission, Geographic Routing, Minimum Spanning Tree, Network Initialization, Wireless Sensor Networks.

References:

[1] D. Roopa, and Shilpa Chaudhari, “A Survey on Geographic Multipath Routing Techniques in Wireless Sensor Networks,” 2019 5th International Conference on Advanced Computing & Communication Systems, Coimbatore, India, pp. 257-262, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Zuleyha Akusta Dagdevıren, “A Minimum Spanning Tree based Clustering Algorithm for Cloud Based Large Scale Sensor Networks,” European Journal of Science and Technology, no. 26, pp. 415-420, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Kun Hao et al., “Integrating Localization and Energy-Awareness: A Novel Geographic Routing Protocol for Underwater Wireless Sensor Networks,” Mobile Networks and Applications, vol. 23, pp. 1427-1435, 2018.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Haojun Huang et al., “Energy-Aware Dual-Path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks,” IEEE Transactions on Mobile Computing, vol. 17, no. 6, pp. 1339-1352, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Haojun Huang et al., “EMGR: Energy-Efficient Multicast Geographic Routing in Wireless Sensor Networks,” Computer Networks, vol. 129, no. 1, pp. 51-63, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Rencheng Jin, Xiaolei Fan, and Ting Sun, “Centralized Multi-Hop Routing Based on Multi-Start Minimum Spanning Forest Algorithm in the Wireless Sensor Networks,” Sensors, vol. 21, no. 5, pp. 1-16, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Maleq Khan, Gopal Pandurangan, and Bharat Bhargava, “Energy-Efficient Routing Schemes for Wireless Sensor Networks,” Technical Report, Department of Computer Science, pp. 1-12, 2003.
[Google Scholar]
[8] Yuanzhen Li, Yang Zhao, and Yingyu Zhang, “A Spanning Tree Construction Algorithm for Industrial Wireless Sensor Networks Based on Quantum Artificial Bee Colony,” EURASIP Journal on Wireless Communications and Networking, vol. 2019, no. 1, pp. 1-12, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Moysés M. Lima et al., “Geographic Routing and Hole Bypass Using Long Range Sinks for Wireless Sensor Networks,” Ad Hoc Networks, vol. 67, pp. 1-10, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Deyu Lin et al., “CMSTR: A Constrained Minimum Spanning Tree Based Routing Protocol for Wireless Sensor Networks,” Ad Hoc Networks, vol. 146, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Sana Messous et al., “Hop-Based Routing Protocol Based on Energy Efficient Minimum Spanning Tree for Wireless Sensor Network,” 2018 International Conference on Advanced Systems and Electric Technologies (IC_ASET), Hammamet, Tunisia, pp. 421-426, 2018.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Sara Nasirian et al., “Pizzza: A Joint Sector Shape and Minimum Spanning Tree-Based Clustering Scheme for Energy Efficient Routing in Wireless Sensor Networks,” IEEE Access, vol. 11, pp. 68200-68215, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Mamtha M. Pandith et al., “A Comprehensive Review of Geographic Routing Protocols in Wireless Sensor Network,” Information Dynamics and Applications, vol. 1, no. 1, pp. 14-25, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Rani Poonam, and Sharma Avinash, “Minimum Spanning Tree Structure Based Routing Technique for Homogeneous Wireless Sensor Network,” Journal of Computational and Theoretical Nanoscience, vol. 17, no. 6, pp. 2763-2767, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Messous Sana, and Liouane Noureddine, “Multi-Hop Energy-Efficient Routing Protocol Based on Minimum Spanning Tree for Anisotropic Wireless Sensor Networks,” 2019 International Conference on Advanced Systems and Emergent Technologies (IC_ASET), Hammamet, Tunisia, pp. 209-214, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Arun Kumar Sangaiah et al., “Energy-Aware Geographic Routing for Real-Time Workforce Monitoring in Industrial Informatics,” IEEE Internet of Things Journal, vol. 8, no. 12, pp. 9753-9762, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[17] M. Sridhar, and P.B. Pankajavalli, “An Optimization of Distributed Voronoi-Based Collaboration for Energy-Efficient Geographic Routing in Wireless Sensor Networks,” Cluster Computing, vol. 23, no. 3, pp. 1741-1754, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Anas Abu Taleb, and Ammar Odeh, “Utilizing Minimum Spanning Trees for Effective Mobile Sink Routing in Wireless Sensor Networks,” Indonesian Journal of Electrical Engineering and Computer Science, vol. 36, no. 3, pp. 1938-1949, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Shahrokh Vahabi, Mohammadreza Eslaminejad, and Seyed Ebrahim Dashti, “Integration of Geographic and Hierarchical Routing Protocols for Energy Saving in Wireless Sensor Networks with Mobile Sink,” Wireless Networks, vol. 25, no. 5, pp. 2953-2961, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Jinxue Zhang, and Ming Zhang, “Energy Efficient Least Spanning Routing Tree Algorithm Based on Virtual Grid in Wireless Sensor Networks,” Sensors & Transducers, vol. 158, no. 11, pp. 113-119, 2013.
[Google Scholar] [Publisher Link]