Target Q-Coverage Problem with Bounded Service Delay in Directional Sensor Networks
Author(s) -
Deying Li,
Hui Liu,
Xianling Lu,
Wenping Chen,
Hongwei Du
Publication year - 2012
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2012/386093
Subject(s) - computer science , bounded function , wireless sensor network , quality of service , computer network , constraint (computer aided design) , protocol (science) , network delay , upper and lower bounds , service (business) , set (abstract data type) , topology (electrical circuits) , distributed computing , mathematical optimization , real time computing , mathematics , medicine , mathematical analysis , geometry , alternative medicine , economy , pathology , combinatorics , network packet , economics , programming language
Maximizing network lifetime is an important objective for the target-coverage problem. With practicable manufacture and cost reduction, directional sensor has been widely used in wireless sensor networks to save energy. In this paper, we address the target Q-coverage (TQC) problem to prolong the network lifetime with bounded service delay constraint in directional sensor networks. We propose a protocol to find a collection of coverage sets that satisfy the coverage quality requirement and the bounded service delay constraint, where the target in each coverage set may not be served continuously but can be served with tolerant service delay. By steering some sensors' directional antennas, our protocol could deal with the changes of network topology or monitoring tasks. Simulation results show that the performance of our protocol is close to the upper bound of the optimal solution.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom