Energy-efficient and self-adaptive routing algorithm based on event-driven in wireless sensor network

2016 ◽  
Vol 7 (1) ◽  
pp. 41 ◽  
Author(s):  
Jing Zhang ◽  
Ting Yang ◽  
Chengli Zhao
2015 ◽  
Vol 8 (4) ◽  
pp. 137-146
Author(s):  
Lin Zhigui ◽  
Li Min ◽  
Liu Yingping ◽  
Yang Ziyuan ◽  
Zhang Huiqi

Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).


Sign in / Sign up

Export Citation Format

Share Document