Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs

Authors

  • Dixit P Department of CSE ,FET, Manav Rachna International institute of research and studies Faridabad Haryana India
  • Pillai A Department of CE, YMCA university of science and technology, Faridabad, Haryana , India
  • Rishi R UIET MDU, Rohtak , Haryana ,India

DOI:

https://doi.org/10.26438/ijcse/v6i9.361364

Keywords:

local maxima, Greedy forwarding, adhoc network, Styling, mobile node

Abstract

Location aided routing is an emerging approach in mobile ad-hoc networks. Location based routing propagates the packet toward the destination on the basis of location information of transmitting node and destination node. Many algorithms are devised to forward the packet in location based environment among them greedy forwarding is simplest one. In this a transmitting node forwards the packet to next node which is closer to destination than itself. Most forwarding within r and nearest within forwarding progress are the examples of greedy forwarding. With the simple and straight forward method greedy forwarding may suffers from local maxima problem where a node itself is closest to destination, therefore unable to construct the path nevertheless it exist. Many solutions were made to encounter the local maxima problem but suffers with other problem such as packet looping. In this work an efficient solution to local maxima “back tracking with exclusion” is proposed and compared with existing solutions.

References

[1] C. Prehofer, C. Bettstetter. “Self organization in communication networks: Principles and design paradigms”. IEEE Communications Magazine. Vol. 43. Issue 7. 2005. pp. 78-85.

[2] C. Perkins and P. Bhagwat, “Highly Dynamic Destination Sequenced Distance-vector Routing (dsdv) for Mobile Computers,” Comp. Commun. Rev., Oct. 1994, pp. 234–44.

[3] C. Perkins and E. Royer, “Ad-hoc on-demand Distance Vector Routing,” Proc.2nd IEEE Wksp. Mobile Comp. Sys. App., Feb. 1999, pp. 90–100.

[4] Z. Haas and M. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol,” ACM/IEEE Trans. Net., vol. 9, no. 4, Aug. 2001, pp. 427–38.

[5] Y.-B. Ko and N. H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” ACM/Baltzer WINET J., vol. 6, no. 4, 2000, pp. 307–21.

[6] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for RandomlyDistributed Packet Radio Terminals,” IEEE Trans. Commun., vol. 32, no. 3,Mar. 1984, pp. 246–57.

[7] T.-C. Hou and V. O.K. Li, “Transmission Range Control in Multihop PacketRadio Networks,” IEEE Trans. Commun., vol. 34, no. 1, Jan. 1986, pp.38–44.

[8] B. Karp and H. T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. 6th Annual ACM/IEEE Int’l. Conf. Mobile Comp. Net., Boston, MA, Aug. 2000, pp. 243–54.

[9] B. N. Karp, “Geographic Routing for Wireless Networks,” Ph.D. thesis, Harvard Univ., 2000.

Downloads

Published

2018-09-30
CITATION
DOI: 10.26438/ijcse/v6i9.361364
Published: 2018-09-30

How to Cite

[1]
P. Dixit, A. Pillai, and R. Rishi, “Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs”, Int. J. Comp. Sci. Eng., vol. 6, no. 9, pp. 361–364, Sep. 2018.

Issue

Vol. 6 No. 9 (2018): IJCSE September Editor

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.