Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

被引：0

作者：

Alzoubi, KM ^{[1
]}

Wan, PJ ^{[1
]}

Frieder, O ^{[1
]}

机构：

[1] IIT, Dept Comp Sci, Chicago, IL 60616 USA

来源：

23RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2002年

关键词：

weakly-connected dominating set; maximal independent set; sparse spanner;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A set S is dominating if each node in the graph G = (V, E) is either in S or adjacent to at least one of the nodes in S. The subgraph weakly induced by S is the graph G' = (V, E') such that each edge in E' has at least one end point in S. The set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G' is connected. G' is a sparse spanner if it has linear edges. In this paper, we present two distributed algorithms for finding a WCDS in O (n) time. The first algorithm has an approximation ratio of 5, and requires O (n log n) messages. The second algorithm has a larger approximation ratio, but it requires only O(n) messages. The graph G' generated by the second algorithm forms a sparse spanner with a topological dilation of 3, and a geometric dilation of 6.

引用

页码：96 / 104

页数：9

共 50 条

[41] On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks
Meghanathan, Natarajan
Farago, Andras
[J]. AD HOC NETWORKS, 2008, 6 (05) : 744 - 769
[42] <bold>Adapting Connected D-Hop Dominating Sets to Topology Changes in Wireless Ad Hoc Networks</bold>
Bolla, Jason A.
Huynh, D. T.
[J]. 2006 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE, VOLS 1 AND 2, 2006, : 207 - +
[43] Connected Dominating sets in Wireless Sensor networks
Zhang, Lili
Li, Chengming
Mao, Yingchi
[J]. 2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3441 - 3444
[44] A 3-hop Message Relay Algorithm for Connected Dominating Sets in Wireless Ad-hoc Sensor Networks
Ren, Sijun
Yi, Ping
Zhu, Ting
Wu, Yue
Li, Jianhua
[J]. 2014 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2014, : 829 - 834
[45] An Improved Formation Method of Connected-Dominating Set in Ad Hoc Wireless Networks
Huang Q.-D.
Yan Q.-Q.
Sun Q.
[J]. 2017, Univ. of Electronic Science and Technology of China (46): : 819 - 824
[46] An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
Dai, F
Wu, J
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (10) : 908 - 920
[47] An efficient approximation scheme for minimum connected dominating set in wireless ad hoc networks
Gao, B
Yang, YH
Ma, HY
[J]. VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 2744 - 2748
[48] A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks
Butenko, S
Cheng, XZ
Oliveira, CA
Pardalos, PM
[J]. RECENT DEVELOPMENTS IN COOPERATIVE CONTROL AND OPTIMIZATION, 2004, 3 : 61 - 73
[49] Reducing connected dominating set size with multipoint relays in ad hoc wireless networks
Chen, X
Shen, J
[J]. I-SPAN 2004: 7TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2004, : 539 - 543
[50] Weakly connected dominating set-assisted ant-based routing protocol for wireless ad-hoc networks
Li, Kuen-Han
Leu, Jenq-Shiou
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 2015, 48 : 62 - 76

← 1 2 3 4 5 →