Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks


The KIPS Transactions:PartC, Vol. 17, No. 3, pp. 281-290, Jun. 2010
10.3745/KIPSTC.2010.17.3.281,   PDF Download:

Abstract

In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads. Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node’s position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.


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]
J. S. Youn, Y. H. Kim, S. H. Pack, "Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks," The KIPS Transactions:PartC, vol. 17, no. 3, pp. 281-290, 2010. DOI: 10.3745/KIPSTC.2010.17.3.281.

[ACM Style]
Joo Sang Youn, Young Hyun Kim, and Sang Heon Pack. 2010. Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks. The KIPS Transactions:PartC, 17, 3, (2010), 281-290. DOI: 10.3745/KIPSTC.2010.17.3.281.