Geographic Position Based Routing Protocol for Ad Hoc Networks
Abstract
Geographic routing is a routing principle that relies on
geographic position information of the nodes in the network
topology. Both the proactive and reactive protocols do not make use of the location information for routing. In General, Geographic routing encompasses a primary forwarding strategy and a secondary fall back or recovery strategy to route the packets to destination. A Geographic routing protocol called Boundary State Routing (BSR)
employs two components namely Greedy-Bounded Compass
forwarding, primary forwarding strategy and Boundary Mapping Protocol (BMP), a secondary recovery strategy. The main ideabehind this routing protocol is that the source sends a message to thegeographic location of the destination instead of using the network address. This combination together forms an improved forwardin
strategy which can forward the packets around concave boundaries without looping. The Boundary Mapping Protocol is used to detect avoids in the network topology and the outer boundary. Boundary Mapping Protocol also maintains the link state information for boundaries containing concave vertices in order to route the packets around local minima.
Keywords
Full Text:
PDFReferences
Colin J. Lemmon and Phillip Musumeci, ―Boundary Mapping and
Boundary State Routing (BSR) in Ad Hoc Networks‖, IEEE
Transactions on Mobile Computing, Vol. 7, No. 1, January (2008).
B. Karp and H.T. Kung, ―GPSR: Greedy Perimeter Stateless Routing for
Wireless Networks‖, Proc. ACM MobiCom, pp. 243-254, (2000).
S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, ―A
Distance Routing Effect Algorithm for Mobility (DREAM)‖,
Proc.ACM MobiCom, pp. 76-84, Oct. (1998).
Y.B. KO and N.H. Vaidya, ―Location-Aided Routing (LAR) in Mobile
Ad Hoc Networks‖, Proc. ACM MobiCom, pp. 66-75, (1998).
B.Karp, ―Geographic Routing for Wireless Networks‖, Harvard Univ.,
(2000).
G.Finn, ―Routing and Addressing Problems in Large Metropolitan-Scale
Internetworks‖, Technical Report ISI/RR-87-180, ISI, (1987).
I.Stojmenovic and X.Lin, ―Loop-Free Hybrid Single-Path/Flooding
Routing Algorithms with guaranteed Delivery for Wireless Networks‖,
IEEE Trans. Parallel and Distributed systems, vol.12, pp.1023 1032, oct.
(2001).
J.C. Navas and T. Imielinski, ―GeoCast—Geographic Addressing and
Routing,‖ Proc. ACM MobiCom, pp. 66-76, 1997.
T. Imielinski and J.C. Navas, ―GPS-Based Addressing and Routing‖,
IETF RFC 2009, Dept. of Computer Science, Rutgers Univ., 1996.
T. Camp, ―Location Information Services in Mobile Ad Hoc Networks.‖
Colorado School of Mines, Oct. 2003.
E. Kranakis, H. Singh, and J. Urrutia, ―Compass Routing on Geometric
Networks,‖ Proc. 11th Canadian Conf. Computational Geometry (CCCG
’99), 1999.
R. Jain, A. Puri, and R. Sengupta, ―Geographical Routing Using Partial
Information in Wireless Ad Hoc Networks,‖ IEEE Personal Comm., pp.
-57, Feb. 2001.
S.-C. Woo and S. Singh, ―Scalable Routing Protocol for Ad Hoc
Networks,‖ ACM Wireless Networks, vol. 7, pp. 513-529, 2001.
P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, ―Routing with
Guaranteed Delivery in Ad Hoc Wireless Networks,‖ Proc. Third ACM
Int’l Workshop Discrete Algorithms for Mobile Computing and Comm.
(DIALM ’99), pp. 48-55, 1999.
L. Blazevic, S. Giordano, and J.-Y.L. Boudec, ―A Location-Based
Routing Method for Mobile Ad Hoc Networks,‖ IEEE Trans. Mobile
Computing, vol. 4, pp. 97-110, Mar./Apr. 2005.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.