D. Tian and N. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. of the 1st ACM Workshop on Wireless Sensor Networks and Applications, 2002
Carle J. and Simplot-Ryl D. (2004). Energy efficient area monitoring by sensor networks. IEEE Computer 37(2):40–46
J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proc. of the 3rd Int’l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M), 1999
M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. Proc. of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2005
T. Yan, T. He, and J. Stankovic, Differentiated surveillance for sensor networks. Proc. of the First International Conference on Embedded Networked Sensor Systems (SenSys), 2003.
Y. Xu and J. Heidemann, Geography-informed energy conservation for ad hoc routing. Proc. of MOBICOM, 2003
F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, PEAS: A robust energy conserving protocol for long-lived sensor networks. Proc. of ICDCS, 2003
S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks. Proc. of ICC, 2001
Z. Abrams, A. Goel, and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. Proc. of Information Processing in Sensor Networks, 2004.
Dai F. and Wu J. (2004). An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10):908–920CrossRef
Harary F. and Haynes T. (2000). Double domination in graphs. ARS Combinatoria 55:201–213MATHMathSciNet
H. Koubaa and E. Fleury, On the performance of double domination in ad hoc networks. Proc. of IFIP Medhoc, 2000
J. Shaikh, J. Solano, I. Stojmenovic, and J. Wu, New metrics for dominating set based energy efficient activity scheduling in ad hoc networks. Proc. of the International Workshop on Wireless Local Networks (WLN), 2003
F. Dai and J. Wu, On constructing k-connected k-dominating set in wireless networks. Proc. of IPDPS, Apr. 2005
M. Franceschetti, M. Cook, and J. Bruck, A geometric theorem for approximate disk covering algorithms. Technical Report ETR035, Caltech, 2001
Hochbaum D. S. and Maass W. (1985). Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM 32(1):130–136MATHMathSciNetCrossRef
H. Zhang and J. Hou, Maintaining sensing coverage and connectivity in large sensor networks. Technical Report UIUC. UIUCDCS-R-2003-2351, 2003
X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, Integrated coverage and connectivity configuration in wireless sensor networks. Proc. of the 1st ACM Conference on Embedded Networked Sensor Systems, 2003
D. Tian and N. Georganas, Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Networks Journal, pp. 744–761, 2005.
Z. Jiang, R. Kline, J. Wu, and F. Dai, A Practical Method to Form Energy Efficient Connected Kcoverage in Wireless Sensor Networks, accepted to appear in WASN workshop, in conjunction with IEEE ICDCS, 2006.
Stojmenovic I., Seddigh M., and Zunic J. (2002). Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 13(1):14–25CrossRef
Clark B. N., Colbourn C. J., and Johnson D. S. (1990). Unit disk graphs. Discrete Mathematics 86:165–177MATHMathSciNetCrossRef
D. Z. Du, Design and analysis of approximation algorithms. Lecture Notes, Department of Computer Science, University of Minnesota
Y. Ye, An o
) potential reduction algorithm for linear programming. Mathematical Programming
, Vol. 50, No. 2, pp. 239–258, 1991.MATHMathSciNetCrossRef
Wu J. and Lou W. (2003). Forward node set based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3(2):141–154MATHCrossRef
Lin C. R. and Gerla M. (1996). Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7):1265–1275CrossRef
T. Moscibroda and R. Wattenhofer, Efficient computation of maximal independent sets in unstructured multi-hop radio networks. Proc. of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004
Alzoubi K., Li X.-Y., Wang Y., Wan P.-J., Frieder O. (2003). Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 14(5):408–421CrossRef
Hogg R. V. and Tanis E. A. (1993). Probability and Statistical Inference, 4th edition. MacMillan Publishing Company, NYMATH