Elements of information theory
Elements of information theory
Wireless integrated network sensors
Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Approximation algorithms for terrain guarding
Information Processing Letters
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
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
Networked Slepian-Wolf: theory, algorithms, and scaling laws
IEEE Transactions on Information Theory
Lossy network correlated data gathering with high-resolution coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On efficient deployment of sensors on planar grid
Computer Communications
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
Pervasive and Mobile Computing
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
Using Context Annotated Mobility Profiles to Recruit Data Collectors in Participatory Sensing
LoCA '09 Proceedings of the 4th International Symposium on Location and Context Awareness
Approximating sensor network queries using in-network summaries
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
An efficient relay sensors placing algorithm for connectivity in wireless sensor networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Aggregate node placement for maximizing network lifetime in sensor networks
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be reconstructed at a sink within specified distortion bounds while minimizing the energy consumed for communication. We assume that the nodes use either joint entropy coding based on explicit communication between sensor nodes, where coding is done when side information is available, or Slepian-Wolf coding where nodes have knowledge of network correlation statistics. We consider both maximum and average distortion bounds. We prove that this optimization is NP-complete since it involves an interplay between the spaces of possible transmission structures given radio reachability limitations, and feasible placements satisfying distortion bounds.We address this problem by first looking at the simplified problem of optimal placement in the one-dimensional case. An analytical solution is derived for the case when there is a simple aggregation scheme, and numerical results are provided for the cases when joint entropy encoding is used. We use the insight from our 1-D analysis to extend our results to the 2-D case and compare it to typical uniform random placement and shortest-path tree. Our algorithm for two-dimensional placement and transmission structure provides two to three fold reduction in total power consumption and between one to two orders of magnitude reduction in bottleneck power consumption. We perform an exhaustive performance analysis of our scheme under varying correlation models and model parameters and demonstrate that the performance improvement is typical over a range of data correlation models and parameters. We also study the impact of performing computationally-efficient data conditioning over a local scope rather than the entire network. Finally, we extend our explicit placement results to a randomized placement scheme and show that such a scheme can be effective when deployment does not permit exact node placement.