Please use this identifier to cite or link to this item:
|Title:||Lifetime maximization using observation time scheduling in multi-hop sensor networks|
|Citation:||Zhao, Q.,Gurusamy, M. (2005). Lifetime maximization using observation time scheduling in multi-hop sensor networks. 2nd International Conference on Broadband Networks, BROADNETS 2005 2005 : 1-8. ScholarBank@NUS Repository. https://doi.org/10.1109/ICBN.2005.1589703|
|Abstract:||Prolonging lifetime is a key challenge in wireless sensor networks comprising unattended, limited resource sensor nodes. As sensors are usually densely deployed, redundant data is produced by multiple observations on the same event, which decreases the network lifetime. With each observing sensor acting as a source of data, we schedule the time when these sources are allowed to send data to prolong the network lifetime with the guarantee that the total data provided satisfies the application requirement at any time. Considering k-coverage of each target as the application requirement, we propose the Observation time Scheduling for network Lifetime Maximization (OSLM) problem and solve it for two observation scenarios: a) A sensor node can distinguish the targets in its sensing range and selects a subset of targets to observe and b) A sensor node has to simultaneously observe all the targets in its sensing range as it cannot distinguish targets. We develop an optimal solution using a linear programming (LP) problem formulation for OSLM problem for the first observation scenario and solve it using CPLEX package. We prove that OSLM problem for the second observation scenario is NP-complete. A heuristic algorithm for the second scenario is then proposed. The performance is evaluated by the numerical results obtained from CPLEX and extensive simulation results. © 2005 IEEE.|
|Source Title:||2nd International Conference on Broadband Networks, BROADNETS 2005|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2019
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.