Bounds on Contention Management in Radio Networks
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable a...
Main Authors: | Ghaffari, Mohsen (Contributor), Haeupler, Bernhard (Contributor), Newport, Calvin Charles (Author), Lynch, Nancy Ann (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2014-09-26T12:01:31Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Bounds on contention management in radio networks
by: Ghaffari, Mohsen
Published: (2013) -
The cost of radio network broadcast for different models of unreliable links
by: Ghaffari, Mohsen, et al.
Published: (2014) -
Modeling radio networks
by: Newport, Calvin Charles, et al.
Published: (2012) -
Modeling radio networks
by: Newport, Calvin Charles, et al.
Published: (2019) -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
by: Censor-Hillel, Keren, et al.
Published: (2014)