Routing and data compression in sensor networks: stochastic models for sensor data that guarantee scalability
Scaglione, A.
Information Theory, 2003. Proceedings. IEEE International Symposium on
Volume , Issue , 29 June-4 July 2003 Page(s): 174 -
Digital Object Identifier   10.1109/ISIT.2003.1228188
Summary: This paper discusses the compression of correlated data samples in multihop sensor network by means of distributed source coding techniques under plausible stochastic models. This paper shows that there are cases where high density sensor networks are not only possible but increased density can potentially be used to increase the precision of the measurements or decrease the transmission error. The routing algorithms and reencoding of the sensor data is proposed in this paper to provide a perfect feasible sensor networks.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.