The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2011 vol.10)
pp: 146-155
Srikanth K. Iyer , Indian Institute of Science, Bangalore
D. Manjunath , Indian Institute of Technology, Bombay
Rajesh Sundaresan , Indian Institute of Science, Bangalore
ABSTRACT
We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of \Theta (1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is \Theta (\sqrt{n}) time units. We further extend our approach to a network with noisy links. While the refresh rate remains \Theta (1) time units per sample, the delay increases to \Theta (\sqrt{n} \log n). The number of transmissions in both cases is \Theta (n) per histogram sample. The achieved \Theta (1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of \Theta (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.
INDEX TERMS
Ad hoc network, wireless sensor network, function computation, PAC computation, percolation.
CITATION
Srikanth K. Iyer, D. Manjunath, Rajesh Sundaresan, "In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs", IEEE Transactions on Mobile Computing, vol.10, no. 1, pp. 146-155, January 2011, doi:10.1109/TMC.2010.59
REFERENCES
[1] A. Giridhar and P.R. Kumar, "Computing and Communicating Functions over Sensor Networks," IEEE J. Selected Areas in Comm., vol. 23, no. 4, pp. 755-764, Apr. 2005.
[2] N. Khude, A. Kumar, and A. Karnik, "Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 7, no. 5, pp. 617-632, May 2005.
[3] L. Ying, R. Srikant, and G.E. Dullerud, "Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks," IEEE Trans. Information Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007.
[4] A. Giridhar and P.R. Kumar, "Toward a Theory of In-Network Computation in Wireless Sensor Networks," IEEE Comm. Magazine, vol. 44, no. 4, pp. 98-107, Apr. 2006.
[5] J. Díaz, D. Mitsche, and X. Pérez-Giménez, "Large Connectivity for Dynamic Random Geometric Graphs," IEEE Trans. Mobile Computing, vol. 8, no. 6, pp. 821-835, June 2009.
[6] R.G. Gallager, "Finding Parity in a Simple Broadcast Network," IEEE Trans. Information Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
[7] E. Kushilevitz and Y. Mansour, "Computation in Noisy Radio Networks," Proc. Ninth ACM-SIAM Symp. Discrete Algorithms, pp. 236-243, 1998.
[8] U. Feige and J. Kilian, "Finding OR in a Noisy Broadcast Network," Information Processing Letters, vol. 73, nos. 1/2, pp. 69-75, Jan. 2000.
[9] I. Newman, "Computing in Fault Tolerance Broadcast Networks," Proc. 19th IEEE Ann. Conf. Computational Complexity, pp. 113-122, 2004.
[10] Y. Kanoria and D. Manjunath, "On Distributed Computation in Noisy Random Planar Networks," Proc. IEEE Int'l Symp. Information Theory, June 2007.
[11] S. Kamath and D. Manjunath, "On Distributed Function Computation in Structure-Free Random Networks," Proc. IEEE Int'l Symp. Information Theory, May 2008.
[12] X. Ta, G. Mao, and B.D.O. Anderson, "On the Phase Transition Width of $K$ -Connectivity in Wireless Multihop Networks," IEEE Trans. Mobile Computing, vol. 8, no. 7, pp. 936-949, July 2009.
[13] S. Subramanian, P. Gupta, and S. Shakkottai, "Scaling Bounds for Function Computation over Large Networks," Proc. IEEE Int'l Symp. Information Theory, June 2007.
[14] H. Luo, Y. Liu, and S.K. Das, "Distributed Algorithm for En Route Aggregation Decision in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 8, no. 1, pp. 1-13, Jan. 2009.
[15] O. Dousse, M. Franceschetti, and P. Thiran, "On the Throughput Scaling of Wireless Relay Networks," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2756-2761, June 2006.
[16] P. Gupta and P.R. Kumar, "Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[17] M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "Closing the Gap in the Capacity of Wireless Networks via Percolation Theory," IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. 2007.
[18] C. Dutta, Y. Kanoria, D. Manjunath, and J. Radhakrishnan, "A Tight Lower Bound for Parity in Noisy Communication Networks," Proc. 19th Ann. Symp. Discrete Algorithms, pp. 1056-1065, Jan. 2008.
[19] N. Goyal, G. Kindler, and M.E. Saks, "Lower Bounds for the Noisy Broadcast Problem," Proc. 46th Ann. IEEE Symp. Foundations of Computer Science, pp. 40-52, Oct. 2005.
[20] M. Penrose, Random Geometric Graphs. Oxford Univ. Press, 2003.
[21] M. Penrose and A. Pisztora, "Large Deviations for Discrete and Continuous Percolation," Advances in Applied Probability, vol. 28, pp. 29-52, 1996.
[22] R.G. Gallager, Information Theory and Reliable Communication. John Wiley & Sons, 1968.
[23] D. Mosk-Aoyama and D. Shah, Fast Distributed Algorithms for Computing Separable Functions, http://arxiv.org/abs/cs0504029, Apr. 2005.
[24] S. Kamath, D. Manjunath, and R. Mazumdar, "Fast Distributed Algorithms for Computing Separable Functions," IEEE Trans. Information Theory, vol. 54, no. 7, pp. 2997-3007, July 2008.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool