On distributed function computation in structure-free random networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 647-651

  Kamath, Sudeep ^a   Manjunath, D ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED FUNCTIONS; HIGH PROBABILITY; INTERNATIONAL SYMPOSIUM; MAC PROTOCOLS; MAX VALUE; MULTI-HOP WIRELESS NETWORKS; PIPELINED COMPUTATION; RANDOM NETWORKS; STRUCTURE-FREE;

CYBERNETICS; INFORMATION THEORY; LAWS AND LEGISLATION; RANDOM PROCESSES; SENSOR NETWORKS; TECHNICAL PRESENTATIONS;

NETWORK PROTOCOLS;

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

References (7)

1. R. G. Gallager, "Finding parity in simple broadcast networks," IEEE Trans. on Info. Theory, vol. 34, pp. 176-180, 1988.
2. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE Journal on Selected Areas in Communications, vol. 23, no. 4, pp. 755-764, April 2005.
3. 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, W. M. McEneaney, G. Yin, and Q. Zhang, Eds. Birkhauser, Boston, 1998.
4. Y. Kanoria and D. Manjunath, "On distributed computation in noisy random planar networks," in Proc. of IEEE ISIT, Nice, France, June 2007.
5. N. Khude, A. Kumar, and A. Karnik, "Time and energy complexity of distributed computation in wireless sensor networks," in Proceedings of IEEE INFOCOM, 2005, pp. 2625-2637.
6. E. Kushilevitz and Y. Mansour, "Computation in noisy radio networks," in Proc. of SODA, 1998, pp. 236-243.
7. F. Xue and P. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, vol. 10, no. 2, pp. 169-181, March 2004.