Open Access   Article Go Back

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

Prashant Dixit1 , Anuradha Pillai2 , Rahul Rishi3

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-9 , Page no. 361-364, Sep-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i9.361364

Online published on Sep 30, 2018

Copyright © Prashant Dixit, Anuradha Pillai, Rahul Rishi . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Prashant Dixit, Anuradha Pillai, Rahul Rishi, “Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.9, pp.361-364, 2018.

MLA Style Citation: Prashant Dixit, Anuradha Pillai, Rahul Rishi "Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs." International Journal of Computer Sciences and Engineering 6.9 (2018): 361-364.

APA Style Citation: Prashant Dixit, Anuradha Pillai, Rahul Rishi, (2018). Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs. International Journal of Computer Sciences and Engineering, 6(9), 361-364.

BibTex Style Citation:
@article{Dixit_2018,
author = {Prashant Dixit, Anuradha Pillai, Rahul Rishi},
title = {Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2018},
volume = {6},
Issue = {9},
month = {9},
year = {2018},
issn = {2347-2693},
pages = {361-364},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2873},
doi = {https://doi.org/10.26438/ijcse/v6i9.361364}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i9.361364}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2873
TI - Back tracking with exclusion: A solution for local maxima problem in greedy location based packet forwarding for MANETs
T2 - International Journal of Computer Sciences and Engineering
AU - Prashant Dixit, Anuradha Pillai, Rahul Rishi
PY - 2018
DA - 2018/09/30
PB - IJCSE, Indore, INDIA
SP - 361-364
IS - 9
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
404 335 downloads 250 downloads
  
  
           

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.

Key-Words / Index Term

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

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.