Silence is golden and time is money: Power-aware communication for sensor networks

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 2, Issue , 2005, Pages 1026-1035

  Fragouli, Christina ^a   Orlitsky, Alon ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962041253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Karl Von Frisch, "Dancing Bees: An Account of the Life and Senses of the Honey Bee", http://www.polarization.com/bees/bees.html
2. "The ight paths of honeybees recruited by the waggle dance", Nature 435, May 2005, pp.205-207.
3. H. Abelson, "Lower Bounds on Information Transfer in Distributed Computations", Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978.
4. A.C. Yao, "Some Complexity Questions Related to Distributive Computing", Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pp. 209-213, 1979.
5. A. Orlitsky and A. El Gamal, "Communication complexity", Complexity in Information Theory, Y. Abu Mustafa (editor), Springer-Verlag, 1986, pp. 16-61.
6. E. Kushilevitz and N. Nisan, "Communication Complexity", Cambridge Univ. Press, 1996.
7. P. Duris , Z. Galil , G. Schnitger, "Lower bounds on communication complexity", Information and Computation, vol.73 no1, pp. 1-22, April 1987.
8. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks", IEEE Journal on Selected Areas in Communications, pp. 755-764, vol. 23, no. 4, April 2005.
9. S. Verdu, "On Channel Capacity per Unit Cost", IEEE Trans. Information Theory, vol. IT-36, no. 5, pp. 1019-1030, Sep. 1990.
10. S. Savari and A. Naheta, "Bounds on the expected cost of one-to-one codes", International Symposium on Information Theory, pp. 92, June 2004.