A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF
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 net...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2015/527594 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558165509537792 |
|---|---|
| author | Vaibhav Soni Dheeresh K. Mallick |
| author_facet | Vaibhav Soni Dheeresh K. Mallick |
| author_sort | Vaibhav Soni |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-3946da2ec08a4280b5e27c26e841af4f |
| institution | Kabale University |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-3946da2ec08a4280b5e27c26e841af4f2025-02-03T01:33:06ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2015-01-01201510.1155/2015/527594527594A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAFVaibhav Soni0Dheeresh K. Mallick1Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand 835215, IndiaDepartment of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, Jharkhand 835215, IndiaIn 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.http://dx.doi.org/10.1155/2015/527594 |
| spellingShingle | Vaibhav Soni Dheeresh K. Mallick A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF Journal of Computer Networks and Communications |
| title | A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF |
| title_full | A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF |
| title_fullStr | A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF |
| title_full_unstemmed | A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF |
| title_short | A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF |
| title_sort | novel scheme to minimize hop count for gaf in wireless sensor networks two level gaf |
| url | http://dx.doi.org/10.1155/2015/527594 |
| work_keys_str_mv | AT vaibhavsoni anovelschemetominimizehopcountforgafinwirelesssensornetworkstwolevelgaf AT dheereshkmallick anovelschemetominimizehopcountforgafinwirelesssensornetworkstwolevelgaf AT vaibhavsoni novelschemetominimizehopcountforgafinwirelesssensornetworkstwolevelgaf AT dheereshkmallick novelschemetominimizehopcountforgafinwirelesssensornetworkstwolevelgaf |