Abstract
In this paper we investigate the capability of large-scale sensor networks to measure and transport a two-dimensional field. We consider a data-gathering wireless sensor network in which densely deployed sensors take periodic samples of the sensed field, and then scalar quantize, encode and transmit them to a single receiver/central controller where snapshot images of the sensed field are reconstructed. The quality of the reconstructed field is limited by the ability of the encoder to compress the data to a rate less than the single-receiver transport capacity of the network. Subject to a constraint on the quality of the reconstructed field, we are interested in how fast data can be collected (or equivalently how closely in time these snapshots can be taken) due to the limitation just mentioned. As the sensor density increases to infinity, more sensors send data to the central controller. However, the data is more correlated, and the encoder can do more compression. The question is: Can the encoder compress sufficiently to meet the limit imposed by the transport capacity? Alternatively, how long does it take to transport one snapshot? We show that as the density increases to infinity, the total number of bits required to attain a given quality also increases to infinity under any compression scheme. At the same time, the single-receiver transport capacity of the network remains constant as the density increases. We therefore conclude that for the given scenario, even though the correlation between sensor data increases as the density increases, any data compression scheme is insufficient to transport the required amount of data for the given quality. Equivalently, the amount of time it takes to transport one snapshot goes to infinity.
This work is supported by NSF ITR grant number ANI-0112801.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Transactions on Information Theory, vol. 46, no. 2, March 2000.
D. Marco and D. L. Neuhoff, “On the entropy of quantized data at high sampling rates,” in preparation.
A. Scaglione and S. Servetto, “On the interdependence of routing and data compression in multi-hop sensor networks,” in Mobicom, September 2002.
D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” in Trans. Information Theory, July 1973, vol. IT-19, pp. 471–480.
E. J. Duarte-Melo and M. Liu, “Data-gathering wireless sensor networks: Organization and capacity,” Tech. Rep., EECS Department, University of Michigan, 2002, CSPL-333.
G. Chartrand, Introductory Graph Theory, Dover Publications, INC, 1985.
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing INC, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marco, D., Duarte-Melo, E.J., Liu, M., Neuhoff, D.L. (2003). On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data. In: Zhao, F., Guibas, L. (eds) Information Processing in Sensor Networks. IPSN 2003. Lecture Notes in Computer Science, vol 2634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36978-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-36978-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-02111-7
Online ISBN: 978-3-540-36978-3
eBook Packages: Springer Book Archive