Abstract
As the population application of GPS, some greedy forwarding algorithms based on geographic information for MANETs (mobile ad hoc networks) are proposed in recent years. These algorithms have been well-designed from different aspects to improve its performance. On the basis of analysis of these algorithms, this paper presents modified methods to address some issues of GPSR (greedy perimeter stateless routing): dynamically adjusting the time interval of sending beacons according to the radio transmission; not only considering the distance between each neighbor and the destination, but also the neighbor node surviving ratio. Some relevant algorithms are described in the paper as well. The simulation results show the improved routing algorithm excels GPSR markedly in terms of delivery ratio and routing overhead while the transmission range is larger or the motion velocity of nodes is greater.
Publisher
Darcy & Roy Press Co. Ltd.
Reference15 articles.
1. KARP B, KUNG H T, GPSR:greedy perimeter stateless routing for wireless networks[C]//Proc of Mobi Com, New York: ACM Press, 2000:243-254,
2. STOJMENOVIC I, LIN X, Power-aware localized routing in wireless networks[J], IEEE Trans on Parallel and Distributed Systems, 2001, 12(11):1122-1133,
3. HOU T C, LIV O K, Transmission range control in multi hop packet radio networks[J], IEEE Trans on Communications, 1986, 34 (1):38-44,
4. KRANAKIS E, SINGH H, URRUTIA J, Compass routing on geometric networks[C]//Proc of the 11th Canadian Conference on Computational Geometry, 1999,
5. BOSE P, MORN P, On-line routing in triangulations[C]//Proc of the 10th Annual International Symposium on Algorithms and Computation, 1999,