
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Srikanth K. Iyer, D. Manjunath, Rajesh Sundaresan, "InNetwork 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. 146155, January, 2011.  
BibTex  x  
@article{ 10.1109/TMC.2010.59, author = {Srikanth K. Iyer and D. Manjunath and Rajesh Sundaresan}, title = {InNetwork Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs}, journal ={IEEE Transactions on Mobile Computing}, volume = {10}, number = {1}, issn = {15361233}, year = {2011}, pages = {146155}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2010.59}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  InNetwork Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs IS  1 SN  15361233 SP146 EP155 EPD  146155 A1  Srikanth K. Iyer, A1  D. Manjunath, A1  Rajesh Sundaresan, PY  2011 KW  Ad hoc network KW  wireless sensor network KW  function computation KW  PAC computation KW  percolation. VL  10 JA  IEEE Transactions on Mobile Computing ER   
[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. 755764, 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. 617632, 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. 48264833, Dec. 2007.
[4] A. Giridhar and P.R. Kumar, "Toward a Theory of InNetwork Computation in Wireless Sensor Networks," IEEE Comm. Magazine, vol. 44, no. 4, pp. 98107, Apr. 2006.
[5] J. Díaz, D. Mitsche, and X. PérezGiménez, "Large Connectivity for Dynamic Random Geometric Graphs," IEEE Trans. Mobile Computing, vol. 8, no. 6, pp. 821835, June 2009.
[6] R.G. Gallager, "Finding Parity in a Simple Broadcast Network," IEEE Trans. Information Theory, vol. 34, no. 2, pp. 176180, Mar. 1988.
[7] E. Kushilevitz and Y. Mansour, "Computation in Noisy Radio Networks," Proc. Ninth ACMSIAM Symp. Discrete Algorithms, pp. 236243, 1998.
[8] U. Feige and J. Kilian, "Finding OR in a Noisy Broadcast Network," Information Processing Letters, vol. 73, nos. 1/2, pp. 6975, Jan. 2000.
[9] I. Newman, "Computing in Fault Tolerance Broadcast Networks," Proc. 19th IEEE Ann. Conf. Computational Complexity, pp. 113122, 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 StructureFree 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. 936949, 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. 113, 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. 27562761, June 2006.
[16] P. Gupta and P.R. Kumar, "Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388404, 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. 10091018, 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. 10561065, 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. 4052, 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. 2952, 1996.
[22] R.G. Gallager, Information Theory and Reliable Communication. John Wiley & Sons, 1968.
[23] D. MoskAoyama 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. 29973007, July 2008.