Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Elements of information theory
Elements of information theory
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Connecting the Physical World with Pervasive Networks
IEEE Pervasive Computing
Distributed Source Coding: Symmetric Rates and Applications to Sensor Networks
DCC '00 Proceedings of the Conference on Data Compression
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
On the scalability of hierarchical cooperation for dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
On the scaling laws of dense wireless sensor networks: the data gathering channel
IEEE Transactions on Information Theory
PC3: Principal Component-based Context Compression
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
In this paper we study the problem of efficient data dissemination over one- and two-dimensional multi-hop wireless sensor grids with spatially correlated sample measurements. In particular, we investigate the trade-offs of exploiting correlations via cooperatively compressing the sensor data as it hops around the network. We focus on two performance metrics, namely transport traffic and scheduling latency. More specifically, we investigate using basic information theory the feasibility of sublinear scaling laws, with the number of nodes, under a variety of cooperation strategies ranging from naive non-cooperative forwarding to sophisticated hierarchical cooperation. First, we show that a simple cooperation scheme, namely forward/reverse cooperation, achieves a logarithmic growth rate for the transport traffic and a linear growth rate for the schedule length with the number of nodes. Thus, we shift our focus to multiphase cooperation to show that: i) O(√N) schedule length is achievable using two-phase cooperation which is a combination of non-cooperative and forward/reverse cooperation schemes and ii) Logarithmic schedule length and transport traffic are both achievable using hierarchical cooperation, yet at the expense of more complexity in coordinating nodes' cooperation. This also opens room for optimizing these performance measures for a given network size. Finally, we analyze the impact of fixed bit rate and derive upper bounds on the scheduling latency.