Please use this identifier to cite or link to this item:
Title: Lifetime maximization for connected target coverage in wireless sensor networks
Authors: ZHAO QUN
Keywords: Wireless Sensor Networks, Network Lifetime, Coverage, Connectivity, Sensor Activity Scheduling, Approximation algorithms
Issue Date: 22-Apr-2008
Citation: ZHAO QUN (2008-04-22). Lifetime maximization for connected target coverage in wireless sensor networks. ScholarBank@NUS Repository.
Abstract: Network lifetime is one of the critical issues in Wireless Sensor Networks (WSNs). In this thesis, we consider the connected target coverage (CTC) problem in WSNs with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity. The CTC problems with different data generation models, coverage requirements as well as observation scenarios are discussed and the complexity of each problem is analyzed. For P problem, the polynomial-time algorithm which can achieve the optimal solution is developed. For NP-complete problems, performance bounds are determined. Further, approximation algorithms and faster low-cost heuristics are developed for the problems. The performance of the proposed algorithms and heuristics are studied through extensive simulations. Finally, we present a general framework of approximation algorithm for the CTC problem, which is applicable to various possible instances of the CTC problem described by different application scenarios.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ZHAOQUN_PHD_2007.pdf5.39 MBAdobe PDF



Page view(s)

checked on Apr 19, 2019


checked on Apr 19, 2019

Google ScholarTM


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