Connected Dominating Set in Sensor Networks and MANETs

3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338 3.3 Cheng’s Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 340 3.4 Min’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 3.5 Butenko’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 341

[1]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[2]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[3]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[5]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[6]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[7]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[8]  Panos M. Pardalos,et al.  On the Construction of Virtual Backbone for Ad Hoc Wireless Network , 2003 .

[9]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[10]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[12]  Israel Cidon,et al.  Propagation and Leader Election in a Multihop Broadcast Environment , 1998, DISC.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[15]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[16]  Jie Wu,et al.  A generic broadcast protocol in ad hoc networks based on self-pruning , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[17]  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.

[18]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[19]  Jian Shen,et al.  Reducing connected dominating set size with multipoint relays in ad hoc wireless networks , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[20]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  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.

[22]  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..

[23]  Tzung-Shi Chen,et al.  Service Discovery in Mobile Ad Hoc Networks , 2006, ICOIN.

[24]  Xiuzhen Cheng,et al.  An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks , 2004 .

[25]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[26]  Lusheng Wang,et al.  The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points , 2001, COCOON.

[27]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[28]  Chong-Kwon Kim,et al.  Flooding in wireless ad hoc networks , 2001, Comput. Commun..

[29]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[30]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

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

[32]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[33]  Philippe Jacquet,et al.  Computing Connected Dominated Sets with Multipoint Relays , 2005, Ad Hoc Sens. Wirel. Networks.

[34]  Budhaditya Deb,et al.  Multi-resolution state retrieval in sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[35]  Ding-Zhu Du,et al.  Connected Domination in Multihop Ad Hoc Wireless Networks , 2002, JCIS.

[36]  Ching-Chi Hsu,et al.  Routing in wireless/mobile ad‐hoc networks via dynamic group construction , 2000, Mob. Networks Appl..

[37]  Panos M. Pardalos,et al.  A reliable virtual backbone scheme in mobile ad-hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[38]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[39]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[40]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[41]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[42]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[43]  Mario Gerla,et al.  Routing and multicast in multihop, mobile wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[44]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[45]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[46]  Jie Wu,et al.  On Locality of Dominating Set in ad hoc Networks with Switch-On/Off Operations , 2002, J. Interconnect. Networks.

[47]  Ahmed Helmy.  Efficient Resource Discovery in Wireless AdHoc Networks: Contacts Do Help , 2005 .

[48]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[49]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[50]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, J. Glob. Optim..

[51]  R. De Gaudenzi,et al.  DS-CDMA techniques for mobile and personal satellite communications: An overview , 1994, IEEE Second Symposium on Communications and Vehicular Technology in the Benelux.

[52]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[53]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[54]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[55]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[56]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[57]  Jie Wu.  An enhanced approach to determine a small forward node set based on multipoint relays , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[58]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[59]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[60]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[61]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[62]  Symeon Papavassiliou,et al.  A mobility‐based clustering approach to support mobility management and multicast routing in mobile ad‐hoc wireless networks , 2001, Int. J. Netw. Manag..

[63]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[64]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[65]  Azim Eskandarian,et al.  Mobility management in IVC networks , 2003, IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No.03TH8683).

[66]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[67]  Stefano Basagni,et al.  Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[68]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[69]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[70]  Jie Wu,et al.  A transmission range reduction scheme for power-aware broadcasting in ad hoc networks using connected dominating sets , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[71]  Jie Wu,et al.  On locality of dominating set in ad hoc networks with switch-on/off operations , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[72]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[73]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[74]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[75]  OPHIR FRIEDER,et al.  Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks , 2003, Int. J. Found. Comput. Sci..