Network correlated data gathering with explicit communication: NP-completeness and algorithms

IEEE/ACM Transactions on Networking

Volumn 14, Issue 1, 2006, Pages 41-54

  Cristescu, Rǎzvan ^a   Beferull Lozano, Baltasar ^b   Vetterli, Martin ^b,c   Wattenhofer, Roger ^d  

^a California Institute of Technology   (United States)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

Conditional coding; Correlated data gathering; Distributed algorithms; NP completeness; Routing tree; Sensor networks; Traveling salesman

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DATA PROCESSING; INFORMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

CONDITIONAL CODING; CORRELATED DATA GATHERING; DISTRIBUTED ALGORITHMS; ROUTING TREE; SENSOR NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 33144459063     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.863711     Document Type: Article

References (29)

1. I. F. Akyildiz,W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, no. 8, pp. 102-116, Aug. 2002.
2. B. Awerbuch, A. Baratz, and D. Peleg, "Cost-sensitive analysis of communication protocols," in Proc. 9th Annu. ACM Symp. Principles of Distributed Computing, 1990, pp. 177-187.
3. J. Barros, C. Peraki, and S. D. Servetto, "Efficient network architectures for sensor reachback," in Proc. Int. Zurich Seminar on Communications, Zurich, Switzerland, 2004, pp. 184-187.
4. D. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998.
5. K. Bharat-Kumar and J. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
7. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "Networked Slepian-Wolf: Theory, algorithms and scaling laws," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4057-4073, Dec. 2005.
8. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "On network correlated data gathering," in Proc. IEEE INFOCOM, 2004, pp. 2571-2582.
9. M. Enachescu, A. Goel, R. Govindan, and R. Motwani, "Scale free aggregation in sensor networks," in Proc. 1st Int.Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2004, pp. 71-84.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: W. H. Freeman, 1979.
11. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk," in ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 499-507.
12. G. M. Guisewite and P. M. Pardalos, "Algorithms for the single-source uncapacitated minimum concave-cost network flow problem," J. Global Optimization, vol. 1, no. 3, pp. 245-265, 1991.
13. B. Hajek, "Cooling schedules for optimal annealing," Math. Oper. Res., no. 13, pp. 311-329, 1988.
14. W. Rabiner Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. 33rd Annu. Hawaii Int. Conf. System Sciences (HICSS'00), Jan. 2000, pp. 3005-3014.
15. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, "Directed diffusion for wireless sensor networking," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 2-16, Feb. 2003.
16. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning and shortest path trees," in Proc. 4th Annu. ACM-SIAM Symp. Discrete Algorithms, 1993, pp. 243-250.
17. B. Krishnamachari, D. Estrin, and S. Wicker, "Modeling Data Centric Routing in Wireless Sensor Networks," Dept. Comput. Eng., Univ. Southern California, Los Angeles, CA, Tech. Rep.:02-14, 2002.
18. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, Eds., The Traveling Salesman Problem. New York: Wiley, 1990.
19. S. Lindsey, C. S. Raghavendra, and K. Sivalingam, "Data gathering in sensor networks using the energy delay metric," in Proc. IPDPS Workshop on Issues in Wireless Networks and Mobile Computing, San Francisco, CA, Apr. 2001.
20. M. Lundy and A. Mees, "Convergence of an annealing algorithm," Math. Programming, no. 34, pp. 111-124, 1986.
21. S. Pattem, B. Krishnamachari, and R. Govindan, "The impact of spatial correlation on routing with compression in wireless sensor networks," in Proc. Information Processing in Sensor Networks (IPSN), 2004, pp. 28-35.
22. C. Perkins, Ad Hoc Networking. Reading, MA: Addison-Wesley, 2000.
23. G. J. Pottie and W. J. Kaiser, "Wireless integrated sensor networks," Commun. ACM, vol. 5, no. 43, pp. 51-58, 2000.
24. S. Pradhan and K. Ramchandran, "Distributed Source Coding Using Syndromes (DISCUS): Design and construction," in Proc. IEEE Data Compression Conf., Mar. 1999, pp. 158-167.
25. J. Rabaey, M. J. Ammer, J. L. da Silva, D. Patel, and S. Roundy, "Pico-Radio supports ad hoc ultra-low power wireless networking," IEEE Computer, vol. 33, no. 7, pp. 42-48, Jul. 2000.
26. C. Reidys and P. Stadler, "Combinatorial landscapes," SIAM Rev., vol. 44, pp. 3-54, 2002.
27. A. Scaglione and S. D. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," in Proc. MobiCom, Atlanta, GA, 2002.
28. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
29. E. Tardos, "A strongly polynomial minimum cost circulation algorithm," Combinatorica, vol. 5, pp. 247-255, 1985.