In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Θ(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Θ(√n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Θ(1) time units per sample, the delay increases to Θ(√n log n). The number of transmissions in both cases is Θ(n) per histogram sample. The achieved Θ(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Θ(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

[1]  D. Shah,et al.  Fast Distributed Algorithms for Computing , 2008 .

[2]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[4]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[5]  Panganamala Ramana Kumar,et al.  Toward a theory of in-network computation in wireless sensor networks , 2006, IEEE Communications Magazine.

[6]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[7]  Devavrat Shah,et al.  Fast Distributed Algorithms for Computing Separable Functions , 2005, IEEE Transactions on Information Theory.

[8]  Sajal K. Das,et al.  Distributed Algorithm for En Route Aggregation Decision in Wireless Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[9]  Yashodhan Kanoria,et al.  A tight lower bound for parity in noisy communication networks , 2008, SODA '08.

[10]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

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

[12]  D. Manjunath,et al.  On distributed function computation in structure-free random networks , 2008, 2008 IEEE International Symposium on Information Theory.

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

[14]  Brian D. O. Anderson,et al.  On the Phase Transition Width of K-Connectivity in Wireless Multihop Networks , 2009, IEEE Transactions on Mobile Computing.

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

[16]  Ilan Newman,et al.  Computing in fault tolerance broadcast networks , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[17]  Sanjay Shakkottai,et al.  Scaling Bounds for Function Computation over Large Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[18]  Anurag Kumar,et al.  Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[19]  Xavier Pérez-Giménez,et al.  Large Connectivity for Dynamic Random Geometric Graphs , 2009, IEEE Transactions on Mobile Computing.

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

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

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

[23]  M. Penrose,et al.  Large deviations for discrete and continuous percolation , 1996, Advances in Applied Probability.

[24]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .