|
|
|
|
|
Dynamic Address RoutingThe goal of the DART project is to develop a scalable network layer routing protocol for mobile ad hoc and mesh networks. While today's routing protocols perform adequately in networks of dozens, perhaps even hundreds of nodes, they do not scale to large networks. DART addresses this scalability problem by separating the address of a node into two separate numbers: a) a unique and static node identifier, serving the same purpose as today's IP addresses and b) a dynamic routing address, which indicates the node's current position in the network topology. The use of dynamic routing addresses creates an opportunity for route aggregation, which, in the case of DART, greatly improves scalability. DART proactively maintains accurate routing addresses as well as O(log N) size routing tables on all nodes, where N is the number of nodes in the network. Through the use of dynamic routing addresses, routing is greatly simplified. However, this creates a new problem of address allocation. We describe our method of address allocation, which executes locally on each node, and relies only on routing updates from immediate neighbors to select an available and accurate routing address. DART does not require any geographical location information, nor does it make any assumption as to the underlying medium. Wireless omnidirectional links, as well as directional and even wired links are supported equally well. In addition, nodes participating in a DART network do not require any manual network configuration, making DART a strong candidate for future mesh networking applications in additional to current ad hoc networking applications.
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|