Maximising lifetime for fault-tolerant target coverage in sensor networks
暂无分享,去创建一个
[1] Thomas Erlebach,et al. A (4â+âε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs; 7th International Workshop on Approximation and Online Algorithms (WAOA 2009); Lecture notes in computer science; Approximation and online algorithms , 2010 .
[2] Thomas Erlebach,et al. Approximating node-weighted multicast trees in wireless ad-hoc networks , 2009, IWCMC.
[3] Jochen Könemann,et al. Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..
[4] Raheem A. Beyah,et al. Composite Event Detection in Wireless Sensor Networks , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.
[5] Weili Wu,et al. New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..
[6] Mihaela Cardei,et al. Energy-Efficient Composite Event Detection in Wireless Sensor Networks , 2009, WASA.
[7] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[8] Weili Wu,et al. Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[9] Changyuan Yu,et al. A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph , 2009, Theor. Comput. Sci..
[10] Weili Wu,et al. A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..
[11] Weili Wu,et al. Node-weighted Steiner tree approximation in unit disk graphs , 2009, J. Comb. Optim..
[12] Xiaohua Jia,et al. Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.
[13] Qun Zhao,et al. Lifetime Maximization for Connected Target Coverage in Wireless Sensor Networks , 2008, IEEE/ACM Transactions on Networking.
[14] Thomas Erlebach,et al. A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs , 2009, WAOA.
[15] Yingshu Li,et al. Maximum Lifetime of Sensor Networks with Adjustable Sensing Range , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).
[16] Ding-Zhu Du,et al. Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.
[17] Thomas Erlebach,et al. Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.
[18] Noga Alon,et al. Algorithmic construction of sets for k-restrictions , 2006, TALG.
[19] Peter Sanders,et al. Lifetime Maximization of Monitoring Sensor Networks , 2010, ALGOSENSORS.
[20] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[21] Kenneth L. Clarkson,et al. On the set multi-cover problem in geometric settings , 2009, SCG '09.
[22] Fabrizio Grandoni,et al. An improved LP-based approximation for steiner tree , 2010, STOC '10.