Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 6, 2004, Pages 1130-1140

  Baek, Seung Jun ^a   De Veciana, Gustavo ^a   Su, Xun ^b  

^a The University of Texas at Austin   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data aggregation; Distributed data compression; Sensor networks; Stochastic geometry

Indexed keywords

ACTUATORS; COMPUTER AIDED NETWORK ANALYSIS; COMPUTER SIMULATION; COST EFFECTIVENESS; DATA COMPRESSION; OPTIMIZATION; RANDOM PROCESSES; SENSORS; TELECOMMUNICATION NETWORKS;

DATA AGGREGATION; DISTRIBUTED DATA COMPRESSION; SENSORS NETWORKS; STOCHASTIC GEOMETRY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 4344582402     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.830934     Document Type: Article

References (24)

1. J. M. Kahn, R. H. Katz, and K. S. Pister, "Next century challenges: Mobile networking for smart dust," in Proc. MOBICOM, Seattle. WA, 1999, pp. 271-278.
2. D. Estrin, R. Govindan, J. Heidmann, and S. Kumar, "Next century challenges: Scalable coordination in sensor netwroks," in Proc. MOBICOM. Seattle, WA, 1999, pp. 263-270.
3. I. F. Akyldiz. W. Su, Y. Sankarasubermanian, and E. Cayirici, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, pp. 102-114, Aug. 2002.
4. A. J. Goldsmith and S. B. Wicker, "Design challenges for energy-constrained ad hoc wireless networks," IEEE Wireless Commun., vol. 9, pp. 8-27, Aug. 2002.
5. S. S. Pradhan, J. Kusuma, and K. Ramachandran, "Distributed compression in a dense mircosensor network." IEEE Signal Processing Mag., pp. 51-60, Mar. 2002.
6. A. Scaglione and S. D. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," in Proc. ACM Mobicom, Atlanta, GA, 2002, pp. 140-147.
7. J. Chou, D. Petrovic, and K. Ramchandran, "A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks," in Proc. IEEE INFOCOM, 2003, pp. 1054-1062.
8. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. Hawaii Int. Conf. System Sciences, Maui, HI, 2000, p. 10.
9. D. Petrovic, R. C. Shah, K. Ramchandran, and J. Rabaey, "Data funneling: Routing with aggregation and compression for wireless sensor networks," in Proc. IEEE Sensor Network Protocols Applications, Anchorage, AK, May 2003, pp. 156-162.
10. S. Singh, M. Woo, and C. Raghavendra, "Power-aware routing in mobile ad hoc networks," in Proc. ACM Mobicom, Dallas, TX, Oct. 2002, pp. 181-190.
11. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE J. Select. Areas Commun., vol. 17, pp. 1333-1344, 1999.
12. B. Sadeghi, V. Kanodia, A. Sabharwal, and E. Knightly, "Opportunistic media access for multirate ad hoc networks," in Proc. ACM Mobicom, Atlanta, GA, Sept. 2002, pp. 24-35.
13. E. Duarte-Melo, M. Liu, and A. Misra, "A computational approach to the joint design of distributed data compression and data dissemination in a data-gathering wireless sensor network," in Proc. 34th Allerton Conf. Communications Control, Monticello, IL, Oct. 2003.
14. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE INFOCOM, San Francisco, CA, 2003, pp. 1713-1723.
15. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inform. Theory, vol. IT-22, pp. 226-228, 1975.
16. J. Edmonds, "Submodular functions, matroids and certain polyhedra," in Proc. Calgary Int. Conf. Combinatorial Structures Applications, 1970, pp. 69-87.
17. S. J. Baek, G. de Veciana, and X. Su, "Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation," Wireless Networking and Communication Group, Univ. Texas, Austin, TX, 2004.
18. F. Baccelli and S. Zuyev, "Poisson-Voronoi spanning trees with applications to the optimization of communication networks," INRIA, Sophia Antipolis, France, Res. Rep. 3040, 1996.
19. J. Moller, "Random Johnson-Mehl tessellations," Adv. Appl. Prob., vol. 24, pp. 814-844, 1992.
20. D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and Its Applications, New York; Wiley, 1995.
21. S. D. Servetto and G. Barrenechea, "Constrained random walks on random graphs: Routing algorithms for large-scale wireless sensor networks," in Proc. 1st ACM Int. Workshop Wireless Sensor Networks Applications, Atlanta, GA, 2002, pp. 186-195.
22. J. H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad hoc networks," in Proc. INFOCOM, Tel-Aviv, Israel, 2000, pp. 22-31.
23. F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, "Stochastic geometry and architecture of communication networks," J. Telecommun. Syst., vol. 7, pp. 209-227, 1997. [Online], Available: http://www-sop.inria.fr/mistral/personnel/Sergei.Zuyev/ftp/tcom_eng.ps.gz.
24. d," Adv. Appl. Prob., vol. 21, pp. 37-73, 1989.