A Multi-hop Routing Mechanism Based on Local Competitive and Weighted Dijkstra Algorithm for Wireless Sensor Networks

• Published in: Journal of physics. Conference series 2020-08, Vol.1621 (1), p.12074
• Main Authors: Liu, Qingwei, Liu, Mandan
• Format: Article
• Language: English
• Subjects: Algorithms; Clusters; Competition; Dijkstra's algorithm; Energy consumption; Energy costs; Energy efficiency; Physics; Sensors; Wireless networks; Wireless sensor networks
• ISSN: 1742-6588; 1742-6596
• DOI: 10.1088/1742-6596/1621/1/012074

Extending the lifetime of the networks with limited energy has always been an important issue in the research of wireless sensor networks. Many researchers have contributed lots of routing techniques to improve energy efficiency and extend lifetime of the networks. In this paper, we proposed a Multi-hop Routing mechanism Based on local Competitive and Dijkstra algorithm (MRBCD). In MRBCD, CHs are elected by local competitive and CHs send data to the base station by their shortest energy cost path. By running local competitive mechanism, CHs in the network can be evenly distributed, which will balance energy consumption between sensor nodes. The inter-cluster routing mechanism can minimize the energy consumption in the inter-cluster communications. By combining the two mechanisms, MRBCD algorithm can balance energy consumption and improve energy efficiency, which will extend the lifetime of wireless sensor networks. Simulation results show that MRBCD algorithm extended the lifetime of the networks than LEACH and Multi-LEACH.