Finding the K largest metrics in a noisy broadcast network

Distributed computing in an N-node noisy broadcast network is considered. Each node holds an n-bit integer as an input instead of a binary input assumed by most work in literature. The goal is for all the nodes to find out the K largest values with fault tolerance Q. We focus on protocol designs for the K = o(Nbeta) scenario, and investigate the communication complexity, i.e., the total number of broadcasts, with respect to various parameters: N, n,K. In particular, we show that the goal can be achieved by an oblivious protocol of complexity O(nN log K/Q ), admitting linear growth with n and N and sublinear growth with K.

[1]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[2]  R. Srikant,et al.  Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks with Binary Data , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[4]  Ilan Newman.  Computing in fault tolerance broadcast networks , 2004 .

[5]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[6]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[7]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.

[8]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[9]  Leonard J. Schulman.  Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[10]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[11]  Aditya Dua,et al.  Downlink Wireless Packet Scheduling with Deadlines , 2007, IEEE Transactions on Mobile Computing.

[12]  Eli Upfal,et al.  Computing with Noisy Information , 1994, SIAM J. Comput..

[13]  Guy Kindler,et al.  Lower Bounds for the Noisy Broadcast Problem , 2008, SIAM J. Comput..

[14]  R. Srikant,et al.  Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks , 2007, IEEE Transactions on Information Theory.

[15]  Uriel Feige,et al.  Finding OR in a noisy broadcast network , 2000, Inf. Process. Lett..

[16]  Eyal Kushilevitz,et al.  Computation in noisy radio networks , 2005, SODA '98.

[17]  Leonard J. Schulman,et al.  A coding theorem for distributed computation , 1994, STOC '94.

[18]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[19]  Yashodhan Kanoria,et al.  On Distributed Computation in Noisy Random Planar Networks , 2007, 2007 IEEE International Symposium on Information Theory.