Weighted Connected Dominating Set

[1]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

[2]  Xiang-Yang Li,et al.  Efficient distributed low-cost backbone formation for wireless networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Xiang-Yang Li,et al.  Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks , 2005, COCOON.

[4]  Xiang-Yang Li,et al.  Distributed low-cost backbone formation for wireless ad hoc networks , 2005, MobiHoc '05.

[5]  Rong Zheng,et al.  Time indexing in sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[6]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[7]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[8]  J. J. Garcia-Luna-Aceves,et al.  Topology management in ad hoc networks , 2003, MobiHoc '03.

[9]  O. Kachirski,et al.  Intrusion detection using mobile agents in wireless ad hoc networks , 2002, Proceedings. IEEE Workshop on Knowledge Media Networking.

[10]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[11]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[12]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[13]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[14]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[15]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.