Abstract

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.

Keywords

Packet radioComputer scienceComputer networkNetwork packetUMTS Terrestrial Radio Access NetworkScalabilityRadio Link ProtocolRadio access networkRadio resource managementTelecommunicationsWireless networkWirelessBase stationMobile station

Related Publications

Publication Info

Year
1996
Type
article
Volume
26
Issue
4
Pages
219-230
Citations
131
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

131
OpenAlex

Cite This

Timothy J. Shepard (1996). A channel access scheme for large dense packet radio networks. ACM SIGCOMM Computer Communication Review , 26 (4) , 219-230. https://doi.org/10.1145/248157.248176

Identifiers

DOI
10.1145/248157.248176