Routing and Aggregation Strategies for Contour Map Applications in Sensor Networks

Authors:
Shoudong Zou;Ioanis Nikolaidis;Janelle Harms
Affiliations:
Computing Science Department, University of Alberta, Edmonton, Canada;Computing Science Department, University of Alberta, Edmonton, Canada;Computing Science Department, University of Alberta, Edmonton, Canada
Venue:
WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
Year:
2009

Citing 11
Cited 0

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
ENCAST: Energy-Critical Node Aware Spanning Tree for Sensor Networks

CNSR '05 Proceedings of the 3rd Annual Communication Networks and Services Research Conference
Ef.cient Continuous Mapping in Sensor Networks Using Isolines

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Contour map matching for event detection in sensor networks

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Contour maps: monitoring and diagnosis in sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximate isocontours and spatial summaries for sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Maximizing lifetime of sensor surveillance systems

IEEE/ACM Transactions on Networking (TON)
Efficient aggregation using first hop selection in WSNs

International Journal of Sensor Networks
Isolines: efficient spatio-temporal data aggregation in sensor networks

Wireless Communications & Mobile Computing - Distributed Systems of Sensors and Actuators
Contour approximation in sensor networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the limitations inherent in data aggregation techniques for wireless sensor networks. In particular, we illustrate the limitations of schemes in which data from a sensor are routed to the node that can perform the most effective data aggregation. We then seek alternative forms of aggregation where, in principle, it is possible to aggregate readings from many sensors into a single one. To this end, we select contour maps as the most convenient example of data representation because they are used by various applications and, at the same time, allow for aggressive data aggregation. We describe particular aggregation and routing strategies that exploit the structure of contour maps. Namely, we use clustering based on the contour map values, as well as intra---cluster and inter---cluster routing and aggregation heuristics. Simulation results demonstrate the capabilities and limitations of the various varieties of aggregation/routing strategies.