A self-adapting greedy forwarding algorithm for MANETs

Authors

  • Yunzheng Ding

DOI:

https://doi.org/10.54097/jceim.v10i1.5226

Keywords:

MANET, Routing algorithm, Greedy forwarding, Beacons, Neighbor node surviving ratio

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.

References

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,

STOJMENOVIC I, LIN X, Power-aware localized routing in wireless networks[J], IEEE Trans on Parallel and Distributed Systems, 2001, 12(11):1122-1133,

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,

KRANAKIS E, SINGH H, URRUTIA J, Compass routing on geometric networks[C]//Proc of the 11th Canadian Conference on Computational Geometry, 1999,

BOSE P, MORN P, On-line routing in triangulations[C]//Proc of the 10th Annual International Symposium on Algorithms and Computation, 1999,

STOJMENOVIC I, LIN X, Loop-ree hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks[J], IEEE Trans on Parallel and Distributed Systems, 2001, 12(10):1023-1032,

SSU K F, YANG C H, CHOU C H, et al, Improving routing distance for geographic multicast with Fermat points in mobile Ad hoc networks [J], Computer Networks, 2009, 53(15):2663-2673,

GIRUKA V C, SINGHAL M, A self-healing on-demand geographic path routing protocol for mobile Ad hoc networks[J], Ad hoc Networks, 2007, 5(7):1113-1128,

TRAN T M C, SCHEUERMANN B, MAUVE M, Lightweight detection of node presence in MANETs[J], Ad hoc Networks, 2009, 7(7):1386-1399,

WU Mou, ZHANG Qing. Adaptive mobile Ad hoc greedy geographical routing protocol[J]. Application Research of Computers, Vol, 27 No, 8 Aug, 2010

LIAO W H, WANG S L, SHEN J P, A multi-path QoS routing protocol in a wireless mobile Ad hoc network[J], Telecommunication Systems, 2002, 19(3):329-347,

CHEN B,JAMIESON K,BALAKRISHNAN H, et al, Span: an energy-efficient coordination algorithm for topology maintenance in Ad hoc wireless networks[J], Wireless Networks, 2002, 8(5):481-494,

LIU Jin-ding, YAN Han. Improved AODV routing algorithms based on neighbor survival ratio [J]. Application Research of Computers, Vol 27 No.3 Mar. 2010

The Network Simulator ns-2, version 2.34, Online, http://www.isi.edu/nsnam/ns/.

Tracy Camp, Jeff Boleng, Vanessa Davies. A Survey of Mobility Models for Ad Hoc Network Research[C] Wireless communication & Mobile Computing(WCMC):Special issue on Mobile Ad-hoc Networking: Research, Trends and Applications,2002:483-502

Downloads

Published

14-02-2023

Issue

Section

Articles

How to Cite

Ding, Y. (2023). A self-adapting greedy forwarding algorithm for MANETs. Journal of Computing and Electronic Information Management, 10(1), 20-23. https://doi.org/10.54097/jceim.v10i1.5226

Similar Articles

1-10 of 60

You may also start an advanced similarity search for this article.