Approximating Maximum Disjoint Coverage in Wireless Sensor Networks
暂无分享,去创建一个
[1] Frank L. Lewis,et al. Energy-efficient wireless sensor network design and implementation for condition-based maintenance , 2007, TOSN.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[4] Ashish Goel,et al. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[5] Xiang-Yang Li,et al. Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.
[6] Panayiotis Kotzanikolaou,et al. Solving coverage problems in wireless sensor networks using cover sets , 2010, Ad Hoc Networks.
[7] Weili Wu,et al. Coverage breach problems in bandwidth-constrained sensor networks , 2007, TOSN.
[8] Mihaela Cardei,et al. Energy-efficient connected-coverage in wireless sensor networks , 2008, Int. J. Sens. Networks.
[9] Miodrag Potkonjak,et al. Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.
[10] Antoine Gallais,et al. An Adaptive Localized Algorithm for Multiple Sensor Area Coverage , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).
[11] Zygmunt J. Haas. On the relaying capability of the reconfigurable wireless networks , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.
[12] Ding-Zhu Du,et al. Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.
[13] 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..