Abstract
Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink and the congestion situation. In the data transmission procedure, the high-efficiency CEDOR opportunistic routing algorithm is applied into the ED-HEED as the data transmission mode between cluster headers. A novel adaptive dynamic clustering mechanism is also considered into the algorithm, as well as the data redundancy and security control. Our Simulation demonstrates that the ED-HEED algorithm can reduce the energy consumption, prolong the network life and keep the security and availability of the network compared with the HEED algorithm.
Highlights
With the rapid development of mobile communication, embedded computing and sensing technology, wireless sensor network is considered as a more convenient and economical solution in many scopes [1]
We propose an efficiency dynamic clustering routing algorithm (ED-HEED)
We propose an efficiency dynamic clustering routing algorithm ED-HEED based on comparison and analysis of the existing classic clustering routing algorithm HEED
Summary
With the rapid development of mobile communication, embedded computing and sensing technology, wireless sensor network is considered as a more convenient and economical solution in many scopes [1]. Cluster head are randomly selected in order to distribute the energy load among the sensors and prolong the network lifetime. A number of efficient algorithms are presented based on the idea of LEACH, such as TEEN (Threshold Sensitive Energy Efficient Sensor Network Protocol) [5], DCHS (Deterministic Cluster-head Selection) [6], HEED (Hybrid Energy-efficient Distributed Clustering) [7], etc. An energy-efficient routing protocol using message success rate in wireless sensor networks is proposed in [8]. There still exists unnecessary energy consumption during communication In these above algorithms, the network topology is reasonable and cluster heads are well distributed. We improve HEED protocol including cluster head selection, inter-cluster routing method, re-clustering mechanism, data redundancy and network security control.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
