Fundamentals of large sensor networks: Connectivity, capacity, clocks, and computation

Proceedings of the IEEE

Volumn 98, Issue 11, 2010, Pages 1828-1846

  Freris, Nikolaos M ^a   Kowshik, Hemant ^a   Kumar, P R ^a  

^a United States of America   (United States)

Author keywords

Capacity; clock synchronization; communication complexity; connectivity; function computation; in network information processing; large scale networks; random networks; sensor networks; zero error information theory

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL EFFICIENCY; GRAPH THEORY; INFORMATION THEORY; MECHANICAL CLOCKS; SENSOR NETWORKS; SENSOR NODES;

CAPACITY; CLOCK SYNCHRONIZATION; COMMUNICATION COMPLEXITY; CONNECTIVITY; FUNCTION COMPUTATIONS; IN NETWORKS; LARGE-SCALE NETWORK; RANDOM NETWORK; ZERO ERROR INFORMATION;

COMPLEX NETWORKS;

EID: 77958151307     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2065790     Document Type: Conference Paper

References (73)

1. A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, Wireless sensor networks for habitat monitoring,[ in Proc. 1st ACM Int. Workshop Wireless Sensor Netw. Appl., New York, 2002, pp. 88-97.
2. M. Li and Y. Liu, Underground structure monitoring with wireless sensor networks,[ in Proc. 6th Int. Symp. Inf. Process. Sensor Netw., Apr. 2007, pp. 69-78. (Pubitemid 47582137)
3. C. R. Baker, K. Armijo, S. Belka, M. Benhabib, V. Bhargava, N. Burkhart, A. D. Minassians, G. Dervisoglu, L. Gutnik, M. B. Haick, C. Ho, M. Koplow, J. Mangold, S. Robinson, M. Rosa, M. Schwartz, C. Sims, H. Stoffregen, A. Waterbury, E. S. Leland, T. Pering, andP. K. Wright, Wireless sensor networks forhome health care,[ in Proc. 21st Int. Conf. Adv.Inf. Netw. Appl. Workshop, Washington, DC,2007, pp. 832-837.
4. G. Simon, M. Maroti, A. Ledeczi, G. Balogh,B. Kusy, A. Nadas, G. Pap, J. Sallai, andK. Frampton, Sensor network-basedcountersniper system,[ in Proc. 2nd Int. Conf.Embedded Netw. Sensor Syst., New York, 2004,pp. 1-12.
5. B. Sinopoli, C. Sharp, S. Schaffert,L. Schenato, and S. Sastry, Distributed control applications within sensor networks,[ Proc. IEEE, vol. 91, no. 8, pp. 1235-1246, Aug. 2003.
6. C. Lin, W. Peng, and Y. Tseng, Efficientin-network moving object tracking in wireless sensor networks,[ IEEE Trans. Mobile Comput., vol. 5, no. 8, pp. 1044-1056, Aug. 2006. (Pubitemid 44109571)
7. S. R. Madden, M. J. Franklin,J. M. Hellerstein, and W. Hong, TAG: A Tiny AGgregation service for ad-hoc sensor networks,[ ACM SIGOPS Oper. Syst. Rev., vol. 36, no. SI, pp. 131-146, 2002.
8. S. R. Madden, M. J. Franklin,J. M. Hellerstein, and W. Hong, TinyDB: An acquisitional query processing system for sensor networks,[ ACM Trans. Database Syst. Archive, vol. 30, no. 1, pp. 122-173, Mar. 2005. (Pubitemid 41201813)
9. I. Vasilescu, K. Kotay, D. Rus, M. Dunbabin, and P. Corke, Data collection, storage and retrieval with an underwater sensor network,[ in Proc. 3rd Int. Conf. Embedded Netw. Sensor Syst., New York, 2005, pp. 154-165.
10. C. Fischione, K. H. Johansson, F. Graziosi, and F. Santucci, Distributed cooperative processing and control over wireless sensor networks,[ in Proc. Int. Conf. Wireless Commun. Mobile Comput., New York, pp. 1311-1316.
11. G. Werner-Allen, K. Lorincz, M. Ruiz,O. Marcillo, J. Johnson, J. Lees, and M. Welsh, Deploying a wireless sensor network on anactive volcano,[ Internet Comput., vol. 10,no. 2, pp. 18-25, Mar. 2006.
12. B. Bollobas, Random Graphs. Cambridge,U.K.: Cambridge Univ. Press, 2001.
13. E. N. Gilbert, Random plane networks,[J. Soc. Indust. Appl. Math., vol. 9, pp. 533-543,Dec. 1961.
14. R. Meester and R. Roy, ContinuumPercolation. Cambridge, U.K.: CambridgeUniv. Press, 1996.
15. P. Gupta and P. R. Kumar, Critical powerfor asymptotic connectivity in wirelessnetworks,[ in Stochastic Analysis, Control,Optimization, and Applications: A Volume inHonor of W. H. Fleming, W. M. McEneany,G. Yin, and Q. Zhang, Eds. Boston, MA:Birkhauser, 1998, pp. 547-566.
16. M. Penrose, Random Geometric Graphs.Oxford, U.K.: Oxford Univ. Press, 2003.
17. O. Dousse, F. Baccelli, and P. Thiran, Impactof interferences on connectivity in ad hocnetworks,[ IEEE/ACM Trans. Netw., vol. 13,no. 2, pp. 425-436, Apr. 2005.
18. F. Xue and P. R. Kumar, The number ofneighbors needed for connectivity of wirelessnetworks,[ Wireless Netw., vol. 10, no. 2,pp. 169-181, Mar. 2004.
19. A. Balister, B. Bollobas, A. Sarkar, andM. Walters, Connectivity of randomk-nearest neighbour graphs,[ Adv. Appl.Probab., vol. 37, no. 1, pp. 1-24, 2005.
20. J. Proakis and M. Salehi, CommunicationSystems Engineering. Englewood Cliffs, NJ:Prentice-Hall, 2002.
21. M. Franceschetti, J. Bruck, and L. Schulman, Microcellular systems, random walks andwave propagation,[ in Proc. IEEE Symp.Antennas Propag. Soc., San Antonio, TX,Jun. 2002, vol. 1, pp. 220-223.
22. P. Gupta and P. R. Kumar, The capacityof wireless networks,[ IEEE Trans. Inf.Theory, vol. 46, no. 2, pp. 388-404,Mar. 2000.
23. A. Agarwal and P. R. Kumar, Improvedcapacity bounds for wireless networks,[Wireless Commun. Mobile Comput., vol. 4,pp. 251-261, 2004.
24. D. E. Knuth, Big omicron and big omegaand big theta,[ SIGACT News, vol. 8, no. 2,pp. 18-24, Apr.-Jun. 1976.
25. M. Franceschetti, O. Dousse, D. N. C. Tse,and P. Thiran, Closing the gap in the capacityof wireless networks via percolation theory,[IEEE Trans. Inf. Theory, vol. 53, no. 3,pp. 1009-1018, Mar. 2007.
26. L. Xie and P. R. Kumar, A networkinformation theory for wirelesscommunication: Scaling laws and optimaloperation,[ IEEE Trans. Inf. Theory, vol. 50,no. 5, pp. 748-767, May 2004.
27. T. Cover and J. Thomas, Elements ofInformation Theory. New York: Wiley, 1991.
28. L. Xie and P. R. Kumar, On the path-lossattenuation regime for positive cost and linear scaling of transport capacity in wireless networks,[ IEEE Trans. Inf. Theory/IEEE/ACM Trans. Netw., vol. 52, Joint Special Issue on Networking and Information Theory, no. 6, pp. 2313-2328, Jun. 2006.
29. A. Ozgur, O. Leveque, and D. Tse, Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks,[ IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3549-3572, Oct. 2007. (Pubitemid 47534513)
30. L.-L. Xie, On information-theoretic scaling laws for wireless networks,[ IEEE Trans. Inf. Theory, Sep. 2008, Revised, Jul. 2009.
31. A. S. Avestimehr, S. N. Diggavi, andD. N. C. Tse, A deterministic approach to wireless relay networks,[ in Proc. Allerton Conf. Commun. Control Comput., 2007, pp. 721-728.
32. S. Graham and P. R. Kumar, The convergence of control, communication, and computation," Proc. PWC 2003, vol. 2775, Berlin, Germany: Springer-Verlag, 2003, pp. 458-475.
33. K. Plarre and P. R. Kumar, Tracking objects with networked scattered directional sensors,[ EURASIP J. Adv. Signal Process., vol. 2008, 2008, no. Article 360912.
34. P. Gupta and A. L. Stolyar, Optimalthroughput allocation in general random access networks,[ in Proc. 40th Annu. Conf. Inf. Sci. Syst., Princeton, NJ, Mar. 22-24, pp. 1254-1259.
35. J. T. Chiang, J. J. Haas, Y. Hu, P. R. Kumar, and J. Choi, Fundamental limits on secure clock synchronization and detection of man-in-the-middle attacks,[ in Proc. 28th IEEE Conf. Comput. Commun., Rio de Janeiro, Brazil, Apr. 2009, pp. 1962-1970.
36. N. Freris and P. R. Kumar, Fundamental limits on synchronization of affine clocks in networks,[ in Proc. 46th IEEE Conf. Decision Control, New Orleans, LA, Dec. 12-14, 2007, pp. 921-926.
37. R. Solis, Clock synchronization for multihop wireless sensor networks,[ Ph.D. dissertation, Univ. Illinois Urbana-Champaign, Urbana, IL, 2009.
38. L. Lamport, Time, clocks and the ordering of events in a distributed system,[ Commun. ACM, vol. 21, no. 7, pp. 558-565, Jul. 1978.
39. S. Graham and P. R. Kumar, Time ingeneral-purpose control systems: The control time protocol and an experimental evaluation,[ in Proc. 43rd IEEE Conf. Decision Control, Bahamas, Dec. 14-17, 2004, pp. 4004-4009.
40. N. Freris, S. Graham, and P. R. Kumar, Fundamental limits on synchronizing clocks over networks," IEEE Trans. Autom. Control, to be published.
41. R. Solis, V. Borkar, and P. R. Kumar, A new distributed time synchronization protocol for multihop wireless networks,[ in Proc. 45th IEEE Conf. Decision Control, San Diego, CA, Dec. 13-15, 2006, pp. 2734-2739.
42. A. Giridhar and P. R. Kumar, Distributedclock synchronization over wireless networks: Algorithms and analysis,[ in Proc. 45th IEEE Conf. Decision Control, San Diego, CA, Dec. 13-15, 2006, pp. 4915-4920.
43. H. Kopetz and W. Ochsenreiter, Clock synchronization in distributed real-time systems,[ IEEE Trans. Comput., vol. C-36, no. 8, pp. 933-939, Aug. 1987.
44. M. Maroti, G. Simon, B. Kusy, and A. Ledeczi, The flooding time synchronization protocol,[ in Proc. 2nd Int. Conf. Embedded Netw. Sensor Syst., Baltimore, MD, Nov. 2004, pp. 39-49.
45. D. L. Mills, Internet time synchronization: The network time protocol,[ IEEE Trans. Commun., vol. 39, no. 10, pp. 1482-1493, Oct. 1991.
46. J. Elson, L. Girod, and D. Estrin, Fine-grained network time synchronization using reference broadcasts,[ in Proc. 5th Symp. Oper. Syst. Design Implement., Boston, MA, Dec. 2002, pp. 147-163.
47. S. Ganeriwal, R. Kumar, and M. Srivastava, Timing-sync protocol for sensor networks,[ in Proc. 1st ACM Conf. Embedded Netw. Sensor Syst., Nov. 2003, pp. 138-149.
48. J. Elson, R. M. Karp, C. H. Papadimitriou, and S. Shenker, Global synchronization in sensornets,[ in Proc. Latin Amer. Theor. Inf., 2004, vol. 2976, pp. 609-624.
49. P. Barooah and J. Hespanha, Distributed estimation from relative measurements in sensor networks,[ in Proc. 2nd Int. Conf. Intell. Sens. Inf. Process., Dec. 2005, pp. 226-231.
50. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of markov chains,[ Ann. Appl. Probab., vol. 1, no. 1, pp. 36-61, 1991.
51. N. Freris, V. Borkar, and P. R. Kumar, A model-based approach to clocksynchronization,[ in Proc. 48th IEEE Conf.Decision Control, Shanghai, China,Dec. 16-18, 2009, pp. 5744-5749.
52. D. Slepian and J. Wolf, Noiseless coding ofcorrelated information sources,[ IEEE Trans.Inf. Theory, vol. IT-19, no. 4, pp. 471-480,Jul. 1973.
53. A. D. Wyner and J. Ziv, The rate-distortionfunction for source coding with sideinformation at the decoder,[ IEEE Trans. Inf.Theory, vol. IT-22, no. 1, pp. 1-10, Jan. 1976.
54. A. Giridhar and P. R. Kumar, Computingand communicating functions over sensornetworks,[ IEEE J. Sel. Areas Commun.,vol. 23, no. 4, pp. 755-764, Apr. 2005.
55. H. Kowshik and P. R. Kumar, Zero-errorfunction computation in sensor networks,[ inProc. 48th IEEE Conf. Decision Control,Dec. 2009, pp. 3787-3792.
56. N. Alon and A. Orlitsky, Source coding andgraph entropies,[ IEEE Trans. Inf. Theory,vol. 42, no. 5, pp. 1329-1339, Sep. 1996.
57. R. Ahlswede and N. Cai, On communicationcomplexity of vector-valued functions,[IEEE Trans. Inf. Theory, vol. 40, no. 6,pp. 2062-2067, Nov. 1994.
58. R. Koetter and M. Ḿedard, An algebraicapproach to network coding,[ IEEE/ACMTrans. Netw., vol. 11, no. 5, pp. 782-795,Oct. 2003.
59. A. Dhulipala, C. Fragouli, and A. Orlitsky, Silence based communication,[ IEEE Trans.Inf. Theory, vol. 56, no. 1, pp. 350-366,Jan. 2010.
60. H. Kowshik and P. R. Kumar, Optimalstrategies for computing symmetric Booleanfunctions in collocated networks,[ inProc. IEEE Inf. Theory Workshop, Cairo, Egypt,Jan. 2010, DOI: 10.1109/ITWKSPS.2010.5503141.
61. E. Kushilevitz and N. Nisan, CommunicationComplexity. Cambridge, U.K.: CambridgeUniv. Press, 1997.
62. A. Orlitsky and J. R. Roche, Coding forcomputing,[ IEEE Trans. Inf. Theory, vol. 47,no. 3, pp. 903-917, Mar. 2001.
63. H. Witsenhausen, The zero-error side information problem and chromatic numbers,[ IEEE Trans. Inf. Theory, vol. 22, no. 5, pp. 592-593, Sep. 1976.
64. M. Medard, V. Doshi, D. Shah, and S. Jaggi, Distributed functional compression through graph coloring,[ in Proc. Data Compress. Conf., 2007, pp. 93-102.
65. S. Feizi and M. Medard, When do only sources need to compute? On functional compression in tree networks,[ in Proc. Allerton Conf. Control Commun. Comput., Monticello, IL, 2009, pp. 447-454.
66. D. Krithivasan and S. Pradhan, Lattices for distributed source coding: Jointly Gaussian sources and reconstruction of a linear function," Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Berlin, Germany: Springer-Verlag, 2007, ser. Lecture Notes in Computer Science, pp. 178-188.
67. J. Korner and K. Marton, How to encode the modulo-two sum of binary sources,[ IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 219-221, Mar. 1979.
68. N. Ma and P. Ishwar, Distributed sourcecoding for interactive function computation,[ IEEE Trans. Inf. Theory, 2008.
69. N. Ma, P. Ishwar, and P. Gupta, Information-theoretic bounds for multiround function computation in collocated networks,[ in Proc. IEEE Int. Symp. Inf. Theory, 2009, pp. 2306-2310.
70. R. D. Gallager, Finding parity in a simple broadcast network,[ IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
71. D. Manjunath, C. Dutta, Y. Kanoria, andJ. Radhakrishnan, A tight lower bound for parity in noisy communication networks,[ in Proc. 20th ACM-SIAM Symp. Discrete Algorithms, Jan. 2008, pp. 1056-1065.
72. R. Srikant, L. Ying, and G. E. Dullerud, Distributed symmetric function computation in noisy wireless sensor networks," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007.
73. B. Nazer and M. Gastpar, Computation over multiple-access channels,[ IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007.