Distributed symmetric function computation in noisy wireless sensor networks

IEEE Transactions on Information Theory

Volumn 53, Issue 12, 2007, Pages 4826-4833

  Ying, Lei ^a   Srikant, R ^a   Dullerud, Geir E ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Binary symmetric channel; Function computation; Reception diversity; Sensor network; Wireless network

Indexed keywords

BINARY SYMMETRIC CHANNEL; ENERGY USAGES; FUSION CENTERS; HIGH PROBABILITIES; INTEGER VALUES; NETWORK ALGORITHMS; PROBABILITY OF ERRORS; RECEPTION DIVERSITY; SYMMETRIC FUNCTIONS; TOTAL TRANSMISSIONS; TRANSMISSION RANGES; WIRELESS CHANNELS;

ROUTING PROTOCOLS; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 64549142483     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.909156     Document Type: Article

References (17)

1. H. El Gamal, "On the scaling laws of dense wireless sensor networks," IEEE Trans. Inf. Theory, vol. 51, pp. 1229-1234, Mar. 2005.
2. R. G. Gallager, Information Theory and Reliable Communication. New York, NY: Wiley, 1968.
3. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inf. Theory, vol. 34, pp. 176-180, 1988.
4. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 455-764, Apr. 2005.
5. N. Goyal, G. Kindler, and M. Saks, "Lower bounds for the noisy broadcast problem," in Proc. Ann. IEEE Symp. Found. Comput. Sci., Oct. 2005, pp. 40-49.
6. P. Gupta and P. Kumar, "Critical power for asymptotic connectivity," in Proc. Conf. Dec. Contr., 1998, pp. 1106-1110.
7. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, pp. 388-404, 2000.
8. N. Khude, A. Kumar, and A. Karnik, "Time and energy complexity of distributed computation in wireless sensor networks," in Proc. IEEE INFOCOM, 2005, pp. 2625-2637.
9. S. R. Kulkarni and P. Viswanath, "A deterministic approach to throughput scaling in wireless networks," IEEE Trans. Inf. Theory vol. 50, pp. 1041-1049, 2004.
10. E. Kushilevitz and Y. Mansour, "Computation in noisy radio networks," in Proc. 9th Ann. ACM-SIAM Symp. Discr. Algor., 1998, pp. 236-243.
11. K. Liu and A. Sayeed, "Optimal distributed detection strategies for wireless sensor networks," in Proc. 42nd Ann. Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 2004.
12. G. Mergen and L. Tong, "Type based estimation over multiaccess channels," IEEE Trans. Signal Processing, vol. 54, no. 2, pp. 613-626, Feb. 2006.
13. S. Rajagopalan and L. J. Schulman, "A coding theorem for distributed computation," in Proc. 26th Ann. ACM Symp. Theory Comput., 1994, pp. 790-799.
14. L. J. Schulman, "Communication on noisy channels: A coding theorem for computation," in Proc. Ann. IEEE Symp. Found. Comput. Sci., Pittsburgh, PA, Oct. 1992, pp. 724-733.
15. L. J. Schulman, "Deterministic coding for interactive communication," in Proc. 25th Ann. ACM Symp. Theory Comput., 1993, pp. 747-756.
16. S. Toumpis and A. J. Goldsmith, "Large wireless networks under fading, mobility, and delay constraints," in Proc. IEEE INFOCOM, 2004, vol. 1, pp. 619-627.
17. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Netw., vol. 10, no. 2, pp. 169-181, Mar. 2004.