Abstract
In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes. The cost function we consider is given by the product [rate] × [link weight]. The minimization is achieved by jointly optimizing the transmission structure, which we show consists of a superposition of trees from each of the source nodes to its corresponding sink nodes, and the rate allocation across the source nodes. We show that the overall minimization can be achieved in two concatenated steps. First, the optimal transmission structure has to be found, which in general amounts to finding a Steiner tree and second, the optimal rate allocation has to be obtained by solving a linear programming problem with linear cost weights determined by the given optimal transmission structure. We also prove that, if any arbitrary traffic matrix is allowed, then the problem of finding the optimal transmission structure is NP-complete. For some particular traffic matrix cases, we fully characterize the optimal transmission structures and we also provide a closed-form solution for the optimal rate-allocation. Finally, we analyze the design of decentralized algorithms in order to obtain exactly or approximately the optimal rate allocation, depending on the traffic matrix case. For the particular case of data gathering, we provide experimental results showing a good performance in terms of approximation ratios.
The work presented in this paper was supported (in part) by the National Competence Center in Research on Mobile Information and Communications Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaron, A., Girod, B.: Compression with side information using turbo codes. In: Data Compression Conference 2002 (2002)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–116 (2002)
Arora, S.: Polynomial time approximation scheme for Euclidean TSP and other geometric problems. In: Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 2–11. IEEE Computer Society, Los Alamitos (1996)
Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett. 32, 171–176 (1989)
Bertsekas, D.: Network optimization: continuous and discrete models. Athena Scientific, Belmont (1998)
Cover, T.M., Thomas, J.A.: Elements of information theory. John Wiley and Sons, Inc., Chichester (1991)
Cristescu, R., Beferull-Lozano, B., Vetterli, M.: On network correlated data gathering. Submitted to Infocom 2004 (2004)
Goel, A., Estrin, D.: Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. In: ACM-SIAM Symposium on Discrete Algorithms (2003)
Lindsey, S., Raghavendra, C.S., Sivalingam, K.: Data gathering in sensor networks using the energy*delay metric. In: Proc. of IPDPS Workshop on Issues in Wireless Networks and Mobile Computing (April 2001)
Luenberger, D.: Linear and nonlinear programming. Addison-Wesley, Reading (1984)
Marco, D., Duarte-Melo, E., Liu, M., Neuhoff, D.L.: On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data. IPSN (2003)
Pottie, G.J., Kaiser, W.J.: Wireless integrated sensor networks. Communications of the ACM 43, 51–58 (2000)
Pradhan, S.: Distributed Source Coding Using Syndromes (DISCUS), Ph.D. thesis, U.C. Berkeley (2001)
Pradhan, S., Ramchandran, K.: Distributed Source Coding Using Syndromes (DISCUS): Design and construction. In: Proc. IEEE DCC (March 1999)
Rabaey, J., Ammer, M.J., da Silva, J.L., Patel, D., Roundy, S.: PicoRadio supports ad-hoc ultra-low power wireless networking. IEEE Computer 33(7), 42–48 (2000)
Rabiner-Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energyefficient communication protocol for wireless microsensor networks. In: Proc. of the 33rd International Conference on System Sciences (HICSS 2000) (January 2000)
Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 770–779 (2000)
Scaglione, A., Servetto, S.D.: On the interdependence of routing and data compression, in multi-hop sensor networks. In: Proc. ACM MOBICOM (2002)
Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Information Theory, IT 19, 471–480 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cristescu, R., Beferull-Lozano, B., Vetterli, M. (2004). Networked Slepian-Wolf: Theory and Algorithms. In: Karl, H., Wolisz, A., Willig, A. (eds) Wireless Sensor Networks. EWSN 2004. Lecture Notes in Computer Science, vol 2920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24606-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24606-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20825-9
Online ISBN: 978-3-540-24606-0
eBook Packages: Springer Book Archive