Fundamental Bound on the Capacity of Ad Hoc Networks with Conventional Hop-by-Hop Routing
Peer-to-peer wireless networks have recently attracted a great deal of attention. In this paper, we establish two fundamental bounds on the capacity of such networks with conventional hop-by-hop routing. One of these bounds is based on fundamental information theory, but applied to switching systems instead of transmission systems. This bound scales well with network size. The second bound, based on more traditional network flow optimization, is somewhat tighter, but doesn’t scale well to large networks. Both bounds present a yardstick against which the capabilities of cooperation in peer-to-peer wireless networking may be compared.
KeywordsPath Loss Link Capacity Length Packet Receive Node Output Probability
Unable to display preview. Download preview PDF.