HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks

Abstract

Abstract-Minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. Cluster-based protocols have shown promising energy-efficiency performance, where sensor nodes take turns to act as cluster heads (CHs), which carry out higher-level data routing and relaying. In such case the energy consumption is more evenly distributed for all the nodes. However, most cluster-based protocols improve energy-efficiency at the cost of transmission delay. In this paper, we propose an improved delay-aware and energy-efficient clustered protocol called Hamilton Energy-Efficient Routing Protocol (HEER). HEER forms clusters in the network initialization phase and links members in each cluster on a Hamilton Path, constructed using a greedy algorithm, for data transmission purpose. No cluster reformation is required and the members on the path will take turns to become cluster head. The design allows HEER to save on network administration energy and also balance the load comparing to traditional cluster-based protocols. The algorithms designed in HEER also means that it does not suffer long delay and does not require each node to have global location information comparing with classic chain-based protocols such as PEGASIS and its variations. We implemented the HEER protocol in MATLAB simulation and compared it with several cluster-based and chain-based protocols. We found that HEER is able to achieve an improved network lifetime over the current protocols while maintaining the average data transmission delay. In the simulation, HEER achieved 66.5% and 40.6% more rounds than LEACH and LEACH-EE, which are cluster-based protocols. When compared with chain-based protocols (PEGASIS and Intra-grid-PEGSIS), HEER managed 21.2 times and 16.7 times more rounds than PEGASIS and Intra-grid-PEGASIS respectively. In addition, HEER can eliminated 90% of transmission delay comparing to LEACH and LEACH-EE and 99% comparing with PEGASIS and Intra-grid-PEGASIS. Wireless communication is one of the major power consuming activities on SNs and its usage is controlled mainly by the routing protocol in action. An appropriate protocol design is therefore crucial for minimizing the energy consumption. There are three main types of routing protocols in WSNs, namely flat, hierarchical and location based protocols. KeywordsIn Flat routing protocol, all nodes communicate in a peer-to-peer manner without any hierarchy in the structure. The advantage is having a simple, expandable and low maintenance structure. However, it lacks local and central management of communication resource and usually suffers from long and varied delay.Location-based routing protocols, on the other hand, take in consideration of the location of SNs. Relative coordinates of neighbouring nodes can be extracted from the RF communication between them or, in some cases, by incorporating on-board GPS [3]. However, location tracking devices are huge energy consumers and their performance drops in harsh environme...

Energy Efficient Routing in Wireless Sensor Networks: A Comprehensive Survey

“…Hybrid Energy Efficient Routing (HEER) [79] is reactive routing protocol that combines the operations of TEEN and DEEC protocols. The cluster head election process is based on DEEC along with the threshold mechanism of TEEN.…”

Routing and Clustering of Sensor Nodes in the Honeycomb Architecture

“…HEER (Hamilton energy-efficient routing protocol) [12] is a routing protocol that takes into account energy and delays, based on node clustering and the Hamilton path concept. HEER forms clusters in the initialization phase of the network and connects the members of each cluster on a Hamilton path, built using a greedy algorithm, for data transmission purpose.…”

“…End for (12) End if (13) End for (14) End While in one of the six vertices of the honeycomb cluster. After every round, the location of the CH changes and forms in the cell at the other vertex of the cluster; therefore, the CH cell changes its location in this order:…”

“…If F > 1 then (11) j ⟵ j + 6 * i; (12) Repeat the instructions from 1 to 7 to find L of the new value of [i, j]; (13) Else L ⟵ n r + i; (14) End If index_hop < min then / * we compare the hop index of all adjacent cells * / (7) min ⟵ index_hop; (8) power ⟵ RE(C); (9) [i′, j′] ⟵ C; (10) Else if index_hop � min and RE(C) > power then / * in the case of two adjacent cells with the same hop index we select the cell with the higher value of remaining energy to forward data * / (11) power ⟵ RE(C); (12) [i′, j′] ⟵ C; (13) End if (14) End For (15)…”

A Review: Growth of Energy Efficient Protocols in WSN

“…HEED uses distributed algorithms which are easy to implement and understand. HEED uses a cluster formation algorithm, in which each node is assigned with a cluster head probability which is the function of their amount of remaining energy and also communication cost which is the function of adjacent node [22]. Cluster head probability is used to decide that whether the sensor node that whether a node can be elected as cluster head or not.…”