A channel access scheme for large dense packet radio networks

Prior work in the field of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insufficient to model interference in large dense packet radio networks accurately. In this paper we present a model that more closely approximates communication theory and the underlying physics of radio communication. Using this model we present a decentralized channel access scheme for scalable packet radio networks that is free of packet loss due to collisions and that at each hop requires no per-packet transmissions other than the single transmission used to convey the packet to the next-hop station. We also show that with a modest fraction of the radio spectrum, pessimistic assumptions about propagation resulting in maximum-possible self-interference, and an optimistic view of future signal processing capabilities that a self-organizing packet radio network may scale to millions of stations within a metro area with raw per-station rates in the hundreds of megabits per second.

[1]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[2]  H. R. Reed,et al.  Ultra high frequency propagation , 1953 .

[3]  Elvino S. Sousa,et al.  Interference modeling in a direct-sequence spread-spectrum packet radio network , 1990, IEEE Trans. Commun..

[4]  J. J. Garcia-Luna-Aceves,et al.  FAMA-PJ: a channel access protocol for wireless LANs , 1995, MobiCom '95.

[5]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[6]  Marvin K. Simon,et al.  Spread spectrum communications handbook (revised ed.) , 1994 .

[7]  S.A. Gronemeyer,et al.  Advances in packet radio technology , 1978, Proceedings of the IEEE.

[8]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[9]  M.B. Pursley The role of spread spectrum in packet radio networks , 1987, Proceedings of the IEEE.

[10]  H. Vincent Poor,et al.  An introduction to signal detection and estimation (2nd ed.) , 1994 .

[11]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[12]  P. Karn,et al.  MACA-a New Channel Access Method for Packet Radio , 1990 .

[13]  Louis J. Ippolito,et al.  Attenuation by Atmospheric Gases , 1986 .

[14]  T. J. Shepard Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks , 1995 .

[15]  Claude E. Shannon,et al.  The Mathematical Theory of Communication , 1950 .

[16]  L. Kleinrock,et al.  Spatial reuse in multihop packet radio networks , 1987, Proceedings of the IEEE.

[17]  David Slepian,et al.  Key papers in the development of information theory , 1974 .

[18]  Laurence B. Milstein,et al.  Spread-Spectrum Communications , 1983 .

[19]  Aaron D. Wyner,et al.  Claude Elwood Shannon: Collected Papers , 1993 .

[20]  John A. Silvester,et al.  Spreading code protocols for distributed spread-spectrum packet radio networks , 1988, IEEE Trans. Commun..

[21]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[22]  Sergio Verdu,et al.  Recent progress in Multiuser Detection , 1989 .

[23]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM 1992.

[24]  J. J. Garcia-Luna-Aceves,et al.  Floor acquisition multiple access (FAMA) for packet-radio networks , 1995, SIGCOMM '95.

[25]  Gregory D. Troxel Time surveying: clock synchronization over packet networks , 1994 .

[26]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[27]  P. F. Tsuchiya The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.