Abstract
With the network size growing, routing protocols of mobile ad-hoc networks (MANET) face many challenges. The most critical issue is the lack of bandwidth and computation capability. This paper describes the Parallel Link State Routing protocol (PLSR) that is suitable for MANET. The key concept used in the protocol is that of graph decomposition. This technique substantially raises the rate of routing updating; meanwhile it reduces the message overload as compared with a classical flooding mechanism and some other link state routing protocols. In PLSR, the network is a two-levels topology, and many problems caused by “flat” multi-hoppings will disappear. Thus, the second optimization is achieved by sub-network that reduces the control messages. As a third optimization, the routing computation will be in several sub-networks simultaneity. Hence, comparing with current link state algorithms, the routing table of PLSR will be regenerated quickly as the network topology changes.
Chapter PDF
References
Royer, E.M., Toh, C.-K.: A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. Personal Communications 6(2), 46–55 (1999)
Clausen, T., Jacquet, P.: ’Optimized Link State Routing Protocol, RFC 3626 (October 2003)
Ogier, R., Templin, F., Lewis, M.: Topology Dissemination Based on Reverse-Path Forwarding, RFC 3684 (February 2004)
Berteskas, D.P., Gallagre, R.G.: Distributed Asynchronous Bellman-Ford Algorithm, Data Networks, pp. 325–333. Prentice Hall, Enlgewood Cliffs (1987)
Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance Vector (DTDV) for Mobile Computers. In: Proc. of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, pp. 234–244 (August 1994)
Perkins, C., Royer, E., Das, S.: Ad hoc On-demand Distance Vector (AODV) Routing, RFC 3561, http://www.ietf.org/rfc/rfc3561.txt
Park, V., Corson, S.: Temporally-Ordered Routing Alogorithm(TORA) VERSION 1 Internet Draft, draft-ietf-manet-tora-spec- 03.txt, work in progress (June 2001)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing. Ch. 5, vol. 353, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)
Toh, C.-k.: A Novel Distributed Routing Protocol To Support Ad hoc Mobile Computing. In: IEEE IPCCC 1996. Proc. IEEE 15th Annual International Phoenix Conference on Computers and Communications, Phoenix, AZ, USA, pp. 480–486 (March 27, 1996)
Haas, Z.J., Pearlman, M.R., Samar, P.: The Zone Routing Protocol (ZRP) for Ad Hoc Networks, Internet Draft, work in progress (July 2002), http://www.ietf.org/proceedings/02nov/I-D/draft-ietf-manet-zone-zrp-04.txt
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and distributed computation. Prentice-Hall, Englewood Cli!s, NJ (1989)
Quinn, M.J.: Designing efficient algorithms for parallel computers. McGraw-Hill, New York (1987)
Edwin, H., Smith, L.: Parallel Algorithms for Solving Aggregated Shortest-path Problem. Computers & Operations Research, 941–953 (1999)
The BRITE webpage, http://www.cs.bu.edu/brite/
The NRL OLSR webpage, http://pf.itd.nrl.navy.mil/olsr/
The NS-2 webpage, http://www.isi.edu/nsnam/ns/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, D., Zhang, H., Wang, H., Wang, B., Yang, S. (2007). A Parallel Link State Routing Protocol for Mobile Ad-Hoc Networks. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds) Mobile Ad-Hoc and Sensor Networks. MSN 2007. Lecture Notes in Computer Science, vol 4864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77024-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-77024-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77023-7
Online ISBN: 978-3-540-77024-4
eBook Packages: Computer ScienceComputer Science (R0)