A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF

Abstract

In wireless sensor networks, geographic adaptive fidelity (GAF) is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF). Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF) where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.

A geodesic deployment and radial shaped clustering (RSC) algorithm with statistical aggregation in sensor networks

“…The major objective of angular routing model is to identify the optimal routing path as followed in [23][24][25] from every CH to the Sink. The procedure to discover the routing path is clearly depicted in the algorithm format 3 as shown below: In this work, a radial structure is framed between two CHs and the data forwarding is done with the angular aligned from one CH to another.…”

A Heuristic Angular Clustering Framework for Secured Statistical Data Aggregation in Sensor Networks

“…Transmission range adjustment and multihop forwarding are global positioning system (GPS)-based approaches. Considering the node’s radio and electrical energy, the combination of Geographic Adaptive Fidelity (GAF) and DGAF works well [ 27 ].…”

“…Therefore, we propose a routing algorithm based on the angular inclination technique used in Lalitha et al [ 17 ] mainly to transmit data toward the sink node. The primary objective is to identify an optimal routing path from every CH to the sink node, as implemented in [ 23 , 27 , 28 , 29 ].…”

A Heuristic Algorithm of Cooperative Agents Communication for Enhanced GAF Routing Protocol in WSNs

“…In addition, it allows avoiding the problem of basic GAF, where forwarding packets arise only in two directions: vertical and horizontal way. Two-level GAF (TGAF) routing protocol [22] is proposed in order to overcome the problem of communication between only neighboring grids. It helps in reducing the number of hop counts, to facilitate to the sensors in the same grid forwarding the data packets to the neighbor in its adjacent grids.…”