Local Computation in Unstructured Radio Networks

[1]  Miguel A. Mosteiro,et al.  Bootstrapping a hop-optimal network in the weak sensor model , 2009, TALG.

[2]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[3]  Marek Chrobak,et al.  The wake-up problem in multi-hop radio networks , 2004, SODA '04.

[4]  Andrzej Pelc,et al.  The wakeup problem in synchronous broadcast systems (extended abstract) , 2000, PODC '00.

[5]  Reuven Bar-Yehuda,et al.  On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization , 1987, PODC '87.

[6]  Roger Wattenhofer,et al.  Initializing newly deployed ad hoc and sensor networks , 2004, MobiCom '04.

[7]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[8]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[9]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[10]  Rajiv Gandhi,et al.  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks , 2004, FSTTCS.

[11]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

[12]  Thomas Moscibroda,et al.  Locality, scheduling, and selfishness: algorithmic foundations of highly decentralized networks , 2006 .

[13]  Tomasz Jurdzinski,et al.  Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks , 2002, ISAAC.

[14]  Roger Wattenhofer,et al.  Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[16]  Fikret Sivrikaya,et al.  Contention-Free MAC Protocols for Wireless Sensor Networks , 2004, DISC.

[17]  Miguel A. Mosteiro,et al.  Lower Bounds for Clear Transmissions in Radio Networks , 2006, LATIN.

[18]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..