Scaling bounds for function computation over large networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 136-140

  Subramanian, Sundar ^a   Gupta, Piyush ^b   Shakkottai, Sanjay ^a  

^a The University of Texas at Austin   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REFRESH RATE;

COMPUTER NETWORKS; CYBERNETICS; GRAPH THEORY; INFORMATION THEORY; PROBABILITY; RANDOM PROCESSES; SENSORS; TECHNICAL PRESENTATIONS; TELECOMMUNICATION EQUIPMENT;

SENSOR NETWORKS;

EID: 51649128332     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557216     Document Type: Conference Paper

References (15)

1. R. G. Gallager. Finding parity in a simple broadcast network. Inf. Theory, IEEE Trans., 34(2):176-180, March 1988.
2. A. Giridhar and P R. Kumar. Computing and communicating functions over sensor networks. Selected Areas in Comm., IEEE, 23(4):755-764, April 2005.
3. A. Giridhar and P. R. Kumar. Toward a theory of in-network computation in wireless sensor networks. Communications Magazine, IEEE, 44(4):98-107, April 2006.
4. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Edited by W.M. McEneany, G. Yin, and Q. Zhang, pages 547-566, Boston, 1998.
5. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, page 482, 2003.
6. E. Kushilevitz and Y. Mansour. Computation in noisy radio networks. In Proceedings of SODA, pages 236-243, Philadelphia, PA, USA, 1998.
7. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
8. L. Lovasz. Communication Complexity: A survey. Technical Report, Princeton University, 1989.
9. G. Mergen and L. Tong. Type based estimation over multiaccess channels. IEEE Trans. Signal Proc., 54(2):613-626, Feb 2006.
10. D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In Proceedings of PODC, pages 113-122, 2006.
11. B. Nazer and M. Gastpar. Reliable computation over multiple-access channels. In Proceedings of Allerton Conference on Comm., Cont. and Comput., September 2005.
12. S. Subramanian, P. Gupta, and S. Shakkottai. Scaling bounds for function computation over large networks. Technical Report, University of Texas at Austin, 2007. http://www.ece.utexas.edu/∼ssubrama/isit-tech.pdf.
13. P. Tiwari. Lower bounds on communication complexity in distributed computer networks. J. ACM, 34(4), 1987.
14. A. C. Yao. Some complexity questions related to distributive computing(preliminary report). In Proceedings of STOC, pages 209-213, New York, NY, USA, 1979.
15. L. Ying, R. Srikant, and G. E. Dullerud. Distributed symmetric function computation in noisy wireless sensor networks with binary data. In Proc. of WiOpt., pages 336-344, 2006.