Throughput of ideally routed wireless ad hoc networks

ABSTRACT

In our present work we model the maximum throughput of stationary ad hoc networks. The routing process we apply is ideal in the sense that it includes collision avoidance and transmits using shortest paths between random source-destination pairs. Our model not only confirms the n^-1/2 decay of the throughput that was published earlier in the literature, but also provides an approach to acquire the function relations between various network parameters. This way the effects of changes in surface topology occupied by the network, traffic generation algorithm or other network characteristics can be predicted using first order approximation

REFERENCES

• 1: S. Das, C. Perkins, and E. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proc. IEEE Infocom, 2000.
• 2: J. Gomez et al. A power-aware routing optimization scheme for mobile ad hoc networks. Work in Progress, draft-gomez-paro-manet-00, 2001.
• 3: P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, 1999.
• 4: P. R. Kumar et al. Protocols for media access control and power control in wireless networks. Work in Progress, 2001.
• 5: Jinyang Li , Charles Blake , Douglas S.J. De Couto , Hu Imm Lee , Robert Morris, Capacity of Ad Hoc wireless networks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.61-69, July 2001, Rome, Italy [doi>10.1145/381677.381684]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

General Terms:
Performance