A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks


The KIPS Transactions:PartC, Vol. 17, No. 3, pp. 259-270, Jun. 2010
10.3745/KIPSTC.2010.17.3.259,   PDF Download:

Abstract

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
M. Y. Bang and B. H. Lee, "A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks," The KIPS Transactions:PartC, vol. 17, no. 3, pp. 259-270, 2010. DOI: 10.3745/KIPSTC.2010.17.3.259.

[ACM Style]
Min Young Bang and Bong Hwan Lee. 2010. A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks. The KIPS Transactions:PartC, 17, 3, (2010), 259-270. DOI: 10.3745/KIPSTC.2010.17.3.259.