Lightweight coloring and desynchronization for networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2383-2391

  Motskin, Arik ^a   Roughgarden, Tim ^a   Skraba, Primoz ^a   Guibas, Leonidas ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY TOPOLOGY; ASYMPTOTICALLY OPTIMAL; COMPUTATIONAL LIMITATIONS; DESYNCHRONIZATION; MODEL OF COMPUTATION; NODE FAILURE; RANDOMIZED ALGORITHMS; VERTEX COLORING;

COLORING; SENSOR NETWORKS;

COMPUTATION THEORY;

EID: 70349655392     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062165     Document Type: Conference Paper

References (17)

1. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). John Wiley Interscience, March 2004.
2. A. Cerpa, J. L. Wong, L. Kuang, M. Potkonjak, and D. Estrin. Statistical model of lossy links in wireless sensor networks. In Proc. 4th int. symp. on Information processing in sensor networks (IPSN), page 11, 2005.
3. J. Degesys, I. Rose, A. Patel, and R. Nagpal. Desync: self-organizing desynchronization and tdma on wireless sensor networks. In Proc. 6th int. conf. on Information processing in sensor networks (IPSN), pages 11-20, 2007.
4. U. Feige and J. Kilian. Zero knowledge and the chromatic number. Journal of Computer and System Sciences, 57:187:199, 1998.
5. K. Jamieson, B. Hull, A. Miu, and H. Balakrishnan. Understanding the real-world performance of carrier sense. In ACM E-WIND, pages 52-57, 2005.
6. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
7. S. M. Kay. Fundamentals of Statistical Signal Processing, Volume 2: Detection Theory. Prentice Hall PTR, January 1998.
8. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In Proc. 23rd annual ACM symp. on Principles of Distributed Computing (PODC), pages 300-309, 2004.
9. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the locality of bounded growth. In Proc. 24th annual ACM symp. on Principles of Distributed Computing (PODC), pages 60-68, 2005.
10. F. Kuhn and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. 25th annual ACM symp. on Principles of Distributed Computing (PODC), pages 7-15, 2006.
11. H. Lee, A. Cerpa, and P. Levis. Improving wireless simulation through noise modeling. In Proc. 6th int. conf. on Information processing in sensor networks (IPSN), pages 21-30, 2007.
12. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
13. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1055, 1986.
14. A. Patel, J. Degesys, and R. Nagpal. Desynchronization: The theory of self-organizing algorithms for round-robin scheduling. In Proc. 1st int. conf. on Self-Adaptive and Self-Organizing Systems (SASO), pages 87-96, 2007.
15. K. Srinivasan and P. Levis. Rssi is under-appreciated. In Proc. 3rd Workshop on Embedded Networked Sensors (EmNets), 2006.
16. http://db.csail.mit.edu:80/labdata/labdata.html. Intel lab data. accessed 07/2008.
17. F. Zhao and L. Guibas. Wireless Sensor Networks: An Information Processing Approach. Elsevier/Morgan-Kaufmann, 2004.