Share Email Print
cover

Proceedings Paper

Issues in ad hoc networks: scaling laws, media access control, and power control
Author(s): Panganamala R. Kumar
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We present a brief account of three problems in wireless networks. First, on the problem of scalability, we show that under a certain model of interference, a network with n nodes can only provide a per-node throughput of order square-root of n bits/sec. However, an experimental investigation with IEEE 802.11 technology yielded the considerably worse power law of n raised to -1.68. We then present a new media access control protocol for ad hoc networks, called SEEDEX. It attempts to make reservations without explicitly doing so for each and every packet. Nodes use random schedule, and can inform each other about their schedules merely by exchanging the seeds of their pseudo random number generators. Last we turn to the problem of power control in ad hoc networks. We present a new protocol called COMPOW, which is designed to find the lowest power level at which the entire network is connected. We provide the theoretical justification for it, and a solution of the architectural issues involved. Using a notion of parallel modularity at the network layer, this protocol provides a joint solution for both the routing and power control problems. It has been implemented in the Linux kernel.

Paper Details

Date Published: 27 July 2001
PDF: 8 pages
Proc. SPIE 4531, Modeling and Design of Wireless Networks, (27 July 2001); doi: 10.1117/12.434453
Show Author Affiliations
Panganamala R. Kumar, Univ. of Illinois/Urbana-Champaign (United States)


Published in SPIE Proceedings Vol. 4531:
Modeling and Design of Wireless Networks
Edwin K. P. Chong, Editor(s)

© SPIE. Terms of Use
Back to Top