Jian-Ming Chang
ABSTRACT
Geographic Forwarding is part of geographic routing that each node only needs to know the location of its neighbor and the destination. This method can reduce the cost that table-driven routing needs to maintain the whole path even if the path are not in use, and save time when searching the path compared with the reactive routing. When we using geographic forwarding, it usually encountered the local maximum that cannot forward the packet directly to the destination; this fundamental problem is also called "Dead End". We use the algorithm called "A star" that usually used in role playing game or strategic game to detour the terrain that cannot pass through directly. Nodes must vote their agent in a specific area to be a decision-maker to find a reference route for source node. When the route is decided, then we will use geographic forwarding according to this reference path to the destination to avoid the dead end.
- Chih-Hsun Chou; Kuo-Feng Ssu; Jiau, H. C., "Geographic Forwarding with Dead-End Reduction in Mobile Ad Hoc Networks," Vehicular Technology, IEEE Transactions, Vol. 57, Issue 4, pp. 2375--2386", July 2008.Google Scholar
Cross Ref
- B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," MobiCom '00: Proceedings of the 6th annual international conference on Mobile computing and networking, 2000, pp. 243--254. Google ScholarDigital Library
- K. Seada and A. Helmy, "An overview of geographic protocols in ad hoc and sensor networks," ACS/IEEE 2005 Int. Conf. on Computer Systems and Applications, pp. 62--I, 2005. Google ScholarDigital Library
- J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris, "A scalable Location Service for geographic ad hoc routing," MobiCom '00: Proceedings of the 6th annual international conference on Mobile computing and networking, 2000, pp. 120--130. Google ScholarDigital Library
- Geographic routing - Wikipedia, http://en.wikipedia.org/wiki/Geographic_routing.Google Scholar
- Amit's, A* Pages, http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html.Google Scholar
- Patrick Lester, GameDev.net - A* Pathfinding for Beginners, http://www.gamedev.net/reference/articles/article2003.asp.Google Scholar
- Judea Pearl, 1984, "HEURISTICS: INTELLIGENT SEARCH STRATEGIES FOR COMPUTER PROBLEM SOLVING", ADDISON-WESLEY, 1st Ed., pp73--111. Google ScholarDigital Library
- Daniel Sanchez-Crespo Dalmau, "Core Techniques and Algorithms in Game Programming," GrandTech, 6th Ed, pp D2, 2004Google Scholar
- W.-H. Liao, Y.-C. Tseng and J.-P. "GRID: a fully location-aware routing protocol for mobile ad hoc networks," Telecommunication Systems, vol. 18, pp. 37--60, Sep. 2001.Google ScholarDigital Library
Index Terms
- A dead end avoidance method for geographic forwarding in MANETs
Recommendations
Geographic Forwarding and Routing for Ad-hoc Wireless Network: A Survey
NCM '09: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDCRouting for ad-hoc wireless network is challenging, and there is no single routing strategy to deal with the complex and dynamic nature of the ad-hoc network. Given the availability of the low cost of location-aware devices, geographic forwarding and ...
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks
Minimizing energy consumption is a fundamental requirement when deploying wireless sensor networks. Accordingly, various topology control protocols have been proposed, which aim to conserve energy by turning off unnecessary sensors while simultaneously ...
Performance Analysis of a Propagation Territory-based Routing in MANETs with Obstacles
MISNC '17: Proceedings of the 4th Multidisciplinary International Social Networks ConferenceThis study considers constructing an efficient routing protocol in MANETs with obstacles. We take advantage of the location information provided by Global Position System (GPS) and propose a novel greedy propagation territory-based routing mechanism to ...
Comments