In ''ad hoc networks'', nodes do not have '' A Priori '' knowledge of topology of network around them, they have to discover it.
The basic idea is that a new node (optionally) announces its presence and listens to broadcast announcements from its neighbors.
The node learns about new near nodes and ways to reach them, and may announce that it can also reach those nodes.
As time goes on, each node knows about all other nodes and one or more ways how to reach them.
Routing algorithms have to
- keep routing table reasonably small
- choose ''best'' route for given destination (this can be the fastest, most reliable, highest throughput, or cheapest route)
- keep table up-to-date when nodes die, move or join
- require small amount of messages/time to converge
Note that in a wider context, an can also mean an improvised and often impromptu Protocol established for a particular specific purpose.
The following is a list of some ad-hoc network routing protocols:
These algorithms maintain fresh list of destinations and their routes.
- CGSR (Clusterhead Gateway Switch Routing protocol) - ''CHING-CHUAN CHIANG, HSIAO-KUANG WU, WINSTON LIU, MARIO GERLA Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel, IEEE Singapore International Conference on Networks, SICON'97, pp. 197-211, Singapore, 16.-17. April 1997, IEEE''
- DBF (Distributed Bellman-Ford Routing Protocol) - ''DIMITRI P. BERTSEKAS, ROBERT G. GALLAGER, Distributed Asynchronous Bellman-Ford Algorithm, Data Networks, pp. 325-333, Prentice Hall, Enlgewood Cliffs, 1987, ISBN 0-13-196825-4''
- DSDV (Highly Dynamic Destination-Sequenced Distance Vector routing protocol) - ''C. E. PERKINS, P. BHAGWAT Highly Dynamic Destination-Sequenced Distance Vector (DTDV) for Mobile Computers Proc. of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, Aug 1994, pp 234-244.''
- Guesswork - ''TOM PARKER AND KOEN LANGENDOEN, Guesswork: Robust Routing in an Uncertain World, to be presented at the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2005), November 2005'' http://www.st.ewi.tudelft.nl/~koen/papers/guesswork.pdf
- HSLS (Hazy Sighted Link State routing protocol) - ''CESAR SANTIVANEZ AND RAM RAMANATHAN Hazy Sighted Link State routing protocol (HSLS),BBN Technical Memorandum No. 1301, 31 August 2001 . http://www.cuwireless.net/OSI/progress_report.html''
- HSR (Hierarchical State Routing protocol) - ''ALAN O'NEILL HONGYI LI HIERARCHICAL STATE ROUTING PROTOCOL Internet Draft, draft-oneill-li-hsr-00.txt http://alternic.net/drafts/drafts-o-p/draft-oneill-li-hsr-00.txt Distance Source Distance Vector routing protocol (DSDV)''
- IARP (Intrazone Routing Protocol/pro-active part of the ZRP) - ''ZYGMUNT J. HAAS, MARC R. PEARLMAN, PRINCE SAMAR The Intrazone Routing Protocol (IARP) for Ad Hoc Networks, Internet Draft, http://www.ietf.org/proceedings/02nov/I-D/draft-ietf-manet-zone-iarp-02.txt, work in progress, July 2002.''
- LCA (Linked Cluster Architecture) - ''M. GERLA, J. T. TSAI Multicluster, Mobile, Multimedia Radio Network ACM Wireless Networks, VOl 1, No.3, 1995, pp. 255-265''
- MMRP (Mobile Mesh Routing Protocol) - ''K. GRACE Mobile Mesh Routing Protocol (MMRP), http://www.mitre.org/work/tech_transfer/mobilemesh/''
- OLSR (Optimized Link State Routing Protocol) - ''PHILIPPE JACQUET, PAUL MUHLETHALER, AMIR QAYYUM, ANIS LAOUITI, LAURENT VIENNOT, THOMAS CLAUSEN Optimized Link State Routing Protocol (OLSR), RFC 3626. http://www.olsr.net/, http://www.olsr.org/''
- STAR (Source Tree Adaptive routing protocol) - ''J.J. GARCIA-LUNA, M. SPOHN Source Tree Adaptive Routing Internet Draft, draft-ietf-manet-star-00.txt, work in progress, October 1999.'' / ''J.J. GARCIA-LUNA, M. SPOHN Source-Tree Routing in Wireless Networks, Proceedings of the 7th International Conference on Network Protocols, IEEE ICNP 99, Toronto, Candada, pp. 273-282, IEEE, October 1999'' http://citeseer.ist.psu.edu/garcia-luna-aceves99sourcetree.html
|
