QoS Management for Wireless Sensor Networks with a Mobile Sink

Authors:
Rob Hoes;Twan Basten;Wai-Leong Yeow;Chen-Khong Tham;Marc Geilen;Henk Corporaal
Affiliations:
National University of Singapore, and Eindhoven University of Technology,;Eindhoven University of Technology, and Embedded Systems Institute,;Institute for Infocomm Research,;National University of Singapore,;Eindhoven University of Technology,;Eindhoven University of Technology,
Venue:
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Year:
2009

Citing 8
Cited 0

The Arrow Distributed Directory Protocol

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Using mobile relays to prolong the lifetime of wireless sensor networks

Proceedings of the 11th annual international conference on Mobile computing and networking
A simulation-based study of wireless sensor network middleware

International Journal of Network Management
Dynamic wake-up and topology maintenance protocols with spatiotemporal guarantees

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
MONSOON: A Coevolutionary Multiobjective Adaptation Framework for Dynamic Wireless Sensor Networks

HICSS '08 Proceedings of the Proceedings of the 41st Annual Hawaii International Conference on System Sciences
An Algebra of Pareto Points

Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Quality-of-service trade-off analysis for wireless sensor networks

Performance Evaluation
MobiRoute: routing towards a mobile sink for improving lifetime 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

The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level QoS metrics. An existing configuration method is available for tree-based static networks. We extend this method to support a mobile sink. First, the routing tree is adapted to the sink's new location, after which the parameters of the nodes are optimised. Both algorithms are distributed and localised, and therefore efficient and scalable, and are able to flexibly trade reconfiguration cost (time and energy) for quality to match the demands of the application. Various options are analysed, and evaluated in simulation.