The coverage problem for myopic sensors
暂无分享,去创建一个
T. Znati | M. Aly | K. Pruhs | B. Hunsaker | M. Aly | K. Pruhs | T. Znati | B. Hunsaker
[1] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[2] Yu-Chee Tseng,et al. The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..
[3] Roland Wunderling,et al. Paralleler und objektorientierter Simplex-Algorithmus , 1996 .
[4] Di Tian,et al. A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.
[5] Yu-Chee Tseng,et al. The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.
[6] Kurt Mehlhorn,et al. Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) , 1991, Inf. Process. Lett..
[7] TsengYu-Chee,et al. The coverage problem in a wireless sensor network , 2005 .
[8] Mitali Singh,et al. Decentralized Utility-based Sensor Network Design , 2006, Mob. Networks Appl..
[9] A. Pierce. An Introduction to its Physical Principles and Applications , 1981 .
[10] Bruce A. Draper,et al. A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..
[11] Miodrag Potkonjak,et al. Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).