Dynamic source routing (DSR) protocol with euclidean effect in mobile ad hoc networks

Node mobility in mobile ad hoc networks (MANETs) can cause frequent topology changes. therefore finding and maintaining the route(s) in such an environment is a challenging problem. In recent years, numerous ad hoc routing protocols have been proposed. This paper investigates the routing problem in a MANET by utilizing Euclidean effect to improve performance of routing protocols for MANETs. By using Euclidean information the proposed Euclidean Effect Routing (EER) protocols minimize disruptions of mobile multimedia when the network topology changes. One important feature of our protocol is the intermediate nodes of a route can perform rerouting before a path becomes invalid similar to that in well-studied cellular networks when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to node mobility. We present an protocol based on the EER to choose the route that best meets the strict requirements of multimedia applications.

[1]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[2]  Mike Spreitzer,et al.  PROVIDIN G LOCATIO N INFORMATIO N IN A UBIQUITOU S COMPUTIN G ENVIRONMEN T , 1993 .

[3]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Chai-Keong Toh,et al.  A novel distributed routing protocol to support ad-hoc mobile computing , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[6]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Mark Weiser.  The computer for the 21st century , 1991 .

[9]  Raj Jain,et al.  Potential Networking Applications of Global Positioning Systems (GPS) , 1998, ArXiv.

[10]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[11]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[12]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[13]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[14]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[15]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[16]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[17]  Elliott D. Kaplan.  Understanding GPS : principles and applications , 1996 .

[18]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[19]  B.W. Parkinson,et al.  NAVSTAR: Global positioning system—Ten years later , 1983, Proceedings of the IEEE.