A new packet forwarding algorithm in geographical location based mobile ad hoc routing protocol

Authors:
Changxing Shen;Yuhong Li;Jian Ma
Affiliations:
National Key Laboratory of Networking and Switching, Beijing University of Posts & Telecommunications, Beijing, P. R. China;National Key Laboratory of Networking and Switching, Beijing University of Posts & Telecommunications, Beijing, P. R. China;Nokia Research Center, Beijing, P. R. China
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 4
Cited 0

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Integrating heterogeneous wireless technologies: a cellular aided mobile Ad Hoc network (CAMA)

Mobile Networks and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The packet forwarding algorithms in the existing geographical location based Ad Hoc routing protocols consider only one factor that influences the performance of the routing protocols. Therefore, the performance of these protocols is not good enough. In this paper, we present a new packet forwarding algorithm--Universal Weighted Greedy (UWG) algorithm, which takes two factors into account. The two factors are the distance of next hop and destination, and the angel that the next hop deviates the beeline between source and destination node. The algorithm has good universality and can improve the routing performance because the two considered factors are critical factors for routing. In the following paper, first the design principle of geographical location based Ad Hoc routing protocol is introduced and the packet forwarding algorithms in some typical routing protocols are reviewed. Then the principle of the UWG algorithm is elaborated. We simulate the UWG algorithm and determine the parameter scope when the performance of the routing protocol is optimal.