Please use this identifier to cite or link to this item:
|Title:||Optimal observation scheduling for connected target coverage problem in wireless sensor networks|
|Citation:||Qun, Z., Gurusamy, M. (2007). Optimal observation scheduling for connected target coverage problem in wireless sensor networks. IEEE International Conference on Communications : 3728-3733. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2007.614|
|Abstract:||In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We assume that each sensor can distinguish and select up to L targets in its sensing range to observe and sends all the observed-data back to the sink via single or multiple hop communications. We develop a polynomial-time algorithm which can achieve optimal solution based on the theory of Linear Programming and Integer Theorem. We then develop an flexible efficient heuristic algorithm and demonstrate the effectiveness of its performance through extensive simulation results. ©2007 IEEE.|
|Source Title:||IEEE International Conference on Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 12, 2018
WEB OF SCIENCETM
checked on Oct 17, 2018
checked on Jul 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.