Access the full text.
Sign up today, get DeepDyve free for 14 days.
Calvin Newport, D. Kotz, Yougu Yuan, R. Gray, Jason Liu, C. Elliott (2004)
Experimental Evaluation of Wireless Simulation AssumptionsSimulation, 83
M. Bender, Martín Farach-Colton, Simai He, Bradley Kuszmaul, C. Leiserson (2005)
Adversarial contention resolution for simple channels
C. Koo (2004)
Broadcast in radio networks tolerating byzantine adversarial behavior
J. Håstad, F. Leighton, B. Rogoff (1987)
Analysis of backoff protocols for multiple access channelsProceedings of the nineteenth annual ACM symposium on Theory of computing
Bogdan Chlebus, D. Kowalski, Mariusz Rokicki (2006)
Adversarial queuing on the multiple-access channel
M. Fischer, N. Lynch, M. Paterson (1983)
Impossibility of distributed consensus with one faulty process
A. Wells (2006)
Usability: reconciling theory and practice
R. Metcalfe (1988)
Ethernet: distributed packet switching for local computer networks
L. Goldberg, M. Jerrum, Sampath Kannan, M. Paterson (2004)
A bound on the capacity of backoff and acknowledgment-based protocolsSIAM J. Comput., 33
Jerry Zhao, R. Govindan (2003)
Understanding packet delivery performance in dense wireless sensor networks
G. Chockler, M. Demirbas, Seth Gilbert, Calvin Newport, Tina Nolte (2005)
Consensus and collision detectors in wireless Ad Hoc networks
D. Kowalski (2005)
On selection problem in radio networks
A. Clementi, A. Monti, R. Silvestri (2001)
Selective families, superimposed codes, and broadcasting on unknown radio networks
P and r > 0: either C r [i] = trans A(i) (C r −1 [i], N r [i], D r [i], W r [i]) or C r
P: C 0 [i] ∈ start A(i)
G. Chockler, M. Demirbas, Seth Gilbert, Calvin Newport (2005)
A Middleware Framework for Robust Applications in Wireless Ad Hoc Networks
J. Haringstad, T. Leighton, B. Rogoff (1996)
Analysis of backoff protocols for mulitiple access channelsSIAM J. Comput., 25
J. Sheu, Chih-Shun Hsu, Yen-Jung Chang (2003)
Efficient broadcasting protocols for regular wireless sensor networks2003 International Conference on Parallel Processing, 2003. Proceedings.
L. Goldberg, P. MacKenzie, M. Paterson, A. Srinivasan (2000)
Contention resolution with constant expected delayJ. ACM, 47
Z. Haas, Jing Deng (2002)
Dual busy tone multiple access (DBTMA)-a multiple access control scheme for ad hoc networksIEEE Trans. Commun., 50
(1999)
References 1. IEEE 802.11. Wireless lan mac and physical layer specifications
Jing Deng, P. Varshney, Z. Haas (2004)
A New Backoff Algorithm for the IEEE 802.11 Distributed Coordination Function
T. Moscibroda, Roger Wattenhofer (2005)
Maximal independent sets in radio networks
N. Abramson (1985)
Development of the ALOHANETIEEE Trans. Inf. Theory, 31
T. Chandra, S. Toueg (1996)
Unreliable failure detectors for reliable distributed systemsJ. ACM, 43
A. Woo, Terence Tong, D. Culler (2003)
Taming the underlying challenges of reliable multihop routing in sensor networks
N. Santoro, P. Widmayer (1990)
Distributed Function Evaluation in the Presence of Transmission Faults
P. Raghavan, E. Upfal (1995)
Stochastic contention resolution with short delaysSIAM J. Comput., 28
L. Lamport (2001)
Paxos Made Simple
J. Aspnes, Faith Ellen, E. Ruppert (2004)
Relationships between broadcast and shared memory in reliable anonymous distributed systemsDistributed Computing, 18
N. Santoro, P. Widmayer (1989)
Time is Not a Healer
Seif Haridi (1992)
Distributed Algorithms, 647
Martín Farach-Colton, Rohan Fernandes, Miguel Mosteiro (2006)
Lower Bounds for Clear Transmissions in Radio Networks
A. Clementi, A. Monti, R. Silvestri (2001)
Distributed multi-broadcast in unknown radio networks
W. Ye, J. Heidemann, D. Estrin (2002)
An energy-efficient MAC protocol for wireless sensor networksProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 3
C. Dwork, N. Lynch, L. Stockmeyer (1988)
Consensus in the presence of partial synchronyJ. ACM, 35
T. Jurdzinski, Grzegorz Stachowiak (2005)
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio NetworksTheory of Computing Systems, 38
Deepak Ganesan, D. Estrin, A. Woo, D. Culler, B. Krishnamachari, S. Wicker (2002)
Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks
K. Whitehouse, A. Woo, Fred Jiang (2005)
Exploiting the capture effect for collision detection and recoveryThe Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.
V. Bharghavan, A. Demers, S. Shenker, Lixia Zhang (1994)
MACAW: a media access protocol for wireless LAN'sProceedings of the conference on Communications architectures, protocols and applications
(2003)
A consensus protocol for wireless sensor networks. Master's thesis
J. Polastre, Jason Hill, D. Culler (2004)
Versatile low power media access for wireless sensor networks
We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of each other. In a novel break from existing work, we introduce a collision-prone communication model in which each node may lose an arbitrary subset of the messages sent by its neighbors during each round. This model is motivated by behavior observed in empirical studies of these networks. To cope with this communication unreliability we augment nodes with receiver-side collision detectors and present a new classification of these detectors in terms of accuracy and completeness. This classification is motivated by practical realities and allows us to determine, roughly speaking, how much collision detection capability is enough to solve the consensus problem efficiently in this setting. We consider nine different combinations of completeness and accuracy properties in total, determining for each whether consensus is solvable, and, if it is, a lower bound on the number of rounds required. Furthermore, we distinguish anonymous and non-anonymous protocols—where “anonymous” implies that devices do not have unique identifiers—determining what effect (if any) this extra information has on the complexity of the problem. In all relevant cases, we provide matching upper bounds.
Distributed Computing – Springer Journals
Published: Mar 11, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.