F. Khan, S. Khan, D. Turgut, and L. Bölöni. Scheduling Multiple Mobile Sinks in Underwater Sensor Networks. In Proceedings of IEEE LCN'15, pp. 149–156, October 2015.
Underwater Sensor Networks (UWSNs) provide valuable data for research studies and underwater monitoring and protection. UWSNs suffer from high data rate wireless transmission handicaps. Acoustic communications are used as a medium but they are only good for transmitting e.g. signaling information. Autonomous Underwater Vehicles (AUVs) can serve as mobile sinks that gather and deliver larger amounts of data from the underwater sensor network nodes. Value of Information (VoI) is a data tag that encodes the importance and time-based-relevance of a data chunk residing at a sensor node. VoI, therefore, can serve as a heuristic for path planning and prioritizing data retrieval from nodes. The novelty of this paper lies in providing algorithms which schedule multiple mobile sinks (AUVs) for data retrieval from nodes while maximizing VoI retrieved. The class of algorithms discussed are based on greedy heuristics.
@inproceedings{Khan-2015-LCN,
author = "F. Khan and S. Khan and D. Turgut and L. B{\"o}l{\"o}ni",
title = "Scheduling Multiple Mobile Sinks in Underwater Sensor Networks",
booktitle = "Proceedings of IEEE LCN'15",
pages = "149-156",
month = "October",
year = "2015",
abstract = {
Underwater Sensor Networks (UWSNs) provide valuable data for research
studies and underwater monitoring and protection. UWSNs suffer from
high data rate wireless transmission handicaps. Acoustic
communications are used as a medium but they are only good for
transmitting e.g. signaling information. Autonomous Underwater
Vehicles (AUVs) can serve as mobile sinks that gather and deliver
larger amounts of data from the underwater sensor network nodes.
Value of Information (VoI) is a data tag that encodes the importance
and time-based-relevance of a data chunk residing at a sensor node.
VoI, therefore, can serve as a heuristic for path planning and
prioritizing data retrieval from nodes. The novelty of this paper
lies in providing algorithms which schedule multiple mobile sinks
(AUVs) for data retrieval from nodes while maximizing VoI retrieved.
The class of algorithms discussed are based on greedy heuristics.
},
}
Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Sun Mar 03, 2024 18:41:15