On Connected Multiple Point Coverage in Wireless Sensor Networks
暂无分享,去创建一个
[1] Jie Wu,et al. New metrics for dominating set based energy efficient activity scheduling in ad hoc networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..
[2] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[3] M. Kendall. Probability and Statistical Inference , 1956, Nature.
[4] Jie Wu,et al. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..
[5] Tian He,et al. Differentiated surveillance for sensor networks , 2003, SenSys '03.
[6] David Simplot-Ryl,et al. Energy-efficient area monitoring for sensor networks , 2004, Computer.
[7] Jehoshua Bruck,et al. A Geometric Theorem for Approximate Disk Covering Algorithms , 2001 .
[8] Deborah Estrin,et al. Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.
[9] Jie Wu,et al. Forward-node-set-based broadcast in clustered mobile ad hoc networks , 2003, Wirel. Commun. Mob. Comput..
[10] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[11] Di Tian,et al. Connectivity maintenance and coverage preservation in wireless sensor networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).
[12] Xiang-Yang Li,et al. Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[13] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[14] Guoliang Xing,et al. Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.
[15] Mario Gerla,et al. Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..
[16] MaassWolfgang,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985 .
[17] P. J. Green,et al. Probability and Statistical Inference , 1978 .
[18] Jennifer C. Hou,et al. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.
[19] 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.
[20] Songwu Lu,et al. PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..
[21] Michael A. Henning,et al. On Double Domination in Graphs , 2005, Discuss. Math. Graph Theory.
[22] Lali Barrière,et al. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges , 2003, Wirel. Commun. Mob. Comput..
[23] Roger Wattenhofer,et al. Efficient computation of maximal independent sets in unstructured multi-hop radio networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).
[24] Di Tian,et al. A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.
[25] Mahtab Seddigh,et al. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..
[26] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[27] Jie Wu,et al. On constructing k-connected k-dominating set in wireless networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.
[28] Jie Wu,et al. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.