Skip to main content
SpringerLink
Log in

On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model – to the best of our knowledge, this connection had not been studied before.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Ahlswede, N. Cai, S.-Y.R. Li and R.W. Yeung, Network information flow, IEEE Trans. Inform. Theory 46(4) (2000) 1204–1216.

    Article  Google Scholar 

  2. T. Berger, Rate Distortion Theory (Prentice Hall, Englewood Cliffs, NJ).

  3. J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed. (Springer, 1998).

  4. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (MIT Press, 1990).

  5. T.M. Cover and J. Thomas, Elements of Information Theory (Wiley, 1991).

  6. A. Gersho and R.M. Gray, Vector Quantization and Signal Compression (Kluwer Academic, 1992).

  7. U. Grenander and G. Szegö, Toeplitz Forms and Their Applications (University of California Press, 1958).

  8. P. Gupta and P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, in: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, eds. W.M. McEneany, G. Yin and Q. Zhang (Birkhauser, 1998).

  9. P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Trans. Inform. Theory 46(2) (2000) 388–404.

    Article  Google Scholar 

  10. H.B. Keller, Numerical Methods for Two-Point Boundary-Value Problems (Dover Publications, 1992).

  11. C. Peraki and S.D. Servetto, On the maximum stable throughput problem in random networks, in: Proc. ACM MobiHoc, Annapolis, MD (2003).

  12. D. Pollard, Convergence of Stochastic Processes (Springer, 1984).

  13. S.S. Pradhan and K. Ramchandran, Distributed source coding: Symmetric rates and applications to sensor networks, in: Proc. IEEE Data Compression Conf. (DCC), Snowbird, UT (2000).

  14. S.D. Servetto, Lattice quantization with side information, in: Proc. IEEE Data Compression Conf. (DCC), Snowbird, UT (2000). An extended journal version, Quantization with side information: Lattice codes, asymptotics, and applications in wireless networks, has been submitted for publication, available from http://people.ece.cornell.edu/servetto/

  15. S.D. Servetto, Distributed signal processing algorithms for the sensor broadcast problem, in: Proc. 37th Annual Conf. Inform. Sciences Syst. (CISS), Baltimore, MD (2003).

  16. S.D. Servetto, Sensing Lena – massively distributed compression of sensor images, in: Proc. IEEE Internat. Conf. Image Proc. (ICIP) (2003).

  17. C.E. Shannon, Coding theorems for a discrete source with a fidelity criterion, Institute of Radio Engineers, International Convention Record 7(4) (1959) 142–163.

    Google Scholar 

  18. D. Slepian and J.K. Wolf, Noiseless coding of correlated information sources, IEEE Trans. Inform. Theory 19 (July 1973) 471–480.

    Google Scholar 

  19. V.A. Vaishampayan, N.J.A. Sloane and S.D. Servetto, Multiple description vector quantization with lattice codebooks: Design and analysis, IEEE Trans. Inform. Theory 47(5) (2001) 1718–1734.

    Article  Google Scholar 

  20. Q. Zhao and M. Effros, Optimal code design for lossless and near lossless source coding in multiple access networks, in: Proc. Data Compression Conf. (DCC), Snowbird, UT (2001).

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, Cornell University, 325 Rhodes Hall, Ithaca, NY, 14850, USA

    Anna Scaglione & Sergio Servetto

Authors
  1. Anna Scaglione
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Servetto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anna Scaglione.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scaglione, A., Servetto, S. On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks. Wireless Netw 11, 149–160 (2005). https://doi.org/10.1007/s11276-004-4752-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-004-4752-y

Keywords

Search

Navigation