| CAPACITY COMPATIBLE TWO-LEVEL LINK STATE ROUTING FOR (2007) | |||||||||||||||
Abstract | |||||||||||||||
| The throughput of mobile ad hoc networks (MANETs) has been analyzed previously. A possible network traffic pattern is one where communication sessions are between pairs of nodes arbitrarily situated throughout the network. Thus, the lengthy multiple hop paths of such communication sessions constrict network throughput. However, the property of spatial reuse still allows the aggregate network throughput to scale at a rate that is proportional to the square root of the node count. On the other hand, the throughput per node scales at a rate that is inversely proportional to the square root of the node count. Therefore, to maintain throughput per node that is constant with increasing node count, transceiver link capacity must grow at a rate that is proportional to the square root of the node count. Not only must link capacity scale appropriately, but so must the control overhead incurred by network communication protocols (i.e., overhead should not grow at a rate that exceeds the growth in link capacity). This paper describes how twolevel link state routing can afford such scalability. That is, by adding only a single level of hierarchy to an otherwise flat routing architecture, it is possible to implement communication protocols that enable datagram forwarding while conforming to the network capacity constraints. PROBLEM FORMULATION A mobile ad hoc network (MANET) is a best effort, multiple hop datagram-forwarding network consisting of mobile nodes interconnected by wireless links. Among the envisioned MANET scenarios is the battlefield, where little or no existing network infrastructure exists and adaptive communications between mobile nodes is required. In this paper it is assumed that each network node is equipped with a single transceiver supporting a link capacity of C bits/second. Further, it is assumed that two nodes can directly communicate with one another if they are situated within RTX meters of one another. Otherwise, one or more intermediate nodes must function as datagram forwarders to support communications. Within RTX of any | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||