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
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
Communication Models for Algorithm Design in Networked Sensor Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
On communication models for algorithm design in networked sensor systems: A case study
Pervasive and Mobile Computing
IEEE Transactions on Wireless Communications
A tag-based solution for data sensing conflicts in multiple sensing agent systems
Advances in Engineering Software
| Hi-index | 0.00 |
In this paper we study the problem of information dissemination in dense multi-hop sensor networks characterized by highly correlated sample measurements. In particular, we investigate the benefits, and trade-offs, of exploiting correlations via cooperatively compressing the data as it hops around the network. First, we study two extreme cooperation strategies, namely no cooperation and network-wide cooperation. We show that network-wide cooperation achieves logarithmic growth rate for the transport traffic with the network size whereas the schedule length growth rate remains linear. Next, we analyze a two-phase cooperation strategy which localizes cooperation within regions of the network in an attempt to assess the performance of strategies bounded by the two aforementioned extremes. Finally, we extend two-phase cooperation to a multi-phase hierarchical cooperation strategy where the number of phases depends on the number of nodes and the size of the cooperation set. The rationale behind this strategy is to achieve logarithmic scaling laws at the expense of more complexity in coordinating nodes' cooperation. In addition, hierarchical cooperation opens room for optimizing the transport traffic and schedule length for a given network size.