Please use this persistent identifier to cite or link to this item: doi:10.24405/417
Title: The cover scheduling problem arising in wireless sensor networks
Authors: Rossi, A.
Singh, A.
Geiger, Martin Josef 
Sevaux, Marc
Language: eng
Keywords: Wireless Sensor Networks
Subject (DDC): 330 Wirtschaft
Issue Date: 2011
Document Type: Working Paper
Journal / Series / Working Paper (HSU): Arbeitspapier / Research Paper, Lehrstuhl für Betriebswirtschaftslehre, insbes. Logistik-Management 
One critical problem in wireless sensor networks is to assemble the sensors in different covers in order to solve different objectives such as maximum duration of the network lifetime of minimizing the coverage breach. The output of these problems is a set of covers with a duration of usage. Another problem coming just after is how to schedule the covers. Most of the time, this part is left unsolved as the challenges appear less important than generating the covers. Our current work will describe the wireless sensor network cover scheduling problem (WSN- CSP), a non-linear mathematical model, a MILP model and a heuristic (CSH) that solves this problem. To improve the quality of the solutions, we also propose a memetic algorithm (CSMA). Both approaches will be tested on a large set of instances. Moreover, some complexity results and theorical properties are also given in the paper.
Organization Units (connected with the publication): BWL, insb. Logistik-Management 
Appears in Collections:1 - Open Access Publications (except Theses)

Files in This Item:
File Description SizeFormat
openHSU_417.pdf230.16 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Google ScholarTM


Items in openHSU are protected by copyright, with all rights reserved, unless otherwise indicated.