DART - Dynamic Address Routing: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
= Motivation = |
= Motivation = |
||
How large can an ad-hoc network be? Current ad hoc routing architectures do not scale well and work inefficiently in networks of more than a few hundred nodes. Those routing protocols use static addressing which leads to a massive overhead problem in mobile networks as the number of nodes grows. The main idea behind DART is to seperate node's adress and identity. Using dynamic addressing and appropriate routing, DART is a promising approach for achieving scalable routing in large ad hoc networks. |
|||
How large can an ad-hoc network be? |
|||
= Principles = |
= Principles = |
||
Revision as of 21:32, 5 August 2007
Motivation
How large can an ad-hoc network be? Current ad hoc routing architectures do not scale well and work inefficiently in networks of more than a few hundred nodes. Those routing protocols use static addressing which leads to a massive overhead problem in mobile networks as the number of nodes grows. The main idea behind DART is to seperate node's adress and identity. Using dynamic addressing and appropriate routing, DART is a promising approach for achieving scalable routing in large ad hoc networks.