List of ad hoc routing protocols. An ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to routepackets between computing devices in a mobile ad hoc network. In ad hoc networks, nodes are not familiar with the topology of their networks. Instead, they have to discover it: typically, a new node announces its presence and listens for announcements broadcast by its neighbors. Each node learns about others nearby and how to reach them, and may announce that it too can reach them. Note that in a wider sense, ad hoc protocol can also be used literally, to mean an improvised and often impromptu protocol established for a specific purpose. Ad Hoc Mobile Wireless Networks. Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications explains the concepts.The following is a list of some ad hoc network routing protocols. Table- driven (proactive) routing. The main disadvantages of such algorithms are: Respective amount of data for maintenance. Slow reaction on restructuring and failures. Examples of proactive algorithms are: On- demand (reactive) routing. The main disadvantages of such algorithms are: High latency time in route finding. Excessive flooding can lead to network clogging. Examples of on- demand algorithms are: Hybrid (both proactive and reactive) routing. Routing Protocols for Ad-Hoc Networks. This type of protocols maintains fresh. Very low routing overhead even. Buy Ad Hoc Mobile Wireless Networks: Protocols and Systems on Amazon.com FREE. Chapter 5 then gives an overview of existing ad hoc routing protocols.
The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. The choice of one or the other method requires predetermination for typical cases. The main disadvantages of such algorithms are: Advantage depends on number of other nodes activated. Reaction to traffic demand depends on gradient of traffic volume. Examples of hybrid algorithms are: ZRP (Zone Routing Protocol). The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding on the lower levels. The choice for one or the other method requires proper attributation for respective levels. The main disadvantages of such algorithms are: Advantage depends on depth of nesting and addressing scheme. Reaction to traffic demand depends on meshing parameters. Examples of hierarchical routing algorithms are: CBRP (Cluster Based Routing Protocol). Supports large groups. ZHLS (Zone- based Hierarchical Link State Routing Protocol) . Das: Ad hoc On- demand Distance Vector (AODV) Routing, RFC 3. David Johnson, David Maltz, Yih- Chun Hu: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks for IPv. RFC 4. 72. 8^David B. Maltz: Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, Thomasz Imielinski and Hank Korth (Editors), Vol. Maltz: Flow State in the Dynamic Source Routing Protocol Internet Draft, work in progress, June 2. D. On Eliminating Packet Droppers in MANET: A Modular Solution, Ad hoc Networks Journal, Vol 7, Issue 6, pp 1. Pearlman, Prince Samar: The Zone Routing Protocol (ZRP) for Ad Hoc Networks, Internet Draft, work in progress, July 2. Mario Joa- Ng and I- Tai Lu. The special issue on Wireless Ad Hoc Networks of IEEE JSAC, Vol. Tay: Cluster Based Routing Protocol (CBRP) Functional Specification, Internet Draft, work in progress, June 1. Draft has expired.^Maria Gerla, Guangyu Pei, Xiaoyan Hong, Tsu- Wei Chen: Fisheye State Routing Protocol (FSR) for Ad Hoc Networks, Internet Draft, work in progress, June 2. Draft has expired.
0 Comments
Leave a Reply. |
作者简单介绍一下自己。不需要很花哨,概括一下就行。 存档
September 2017
类别 |