Discrete Mathematics - Topics on domination
On weakly connected domination in graphs
Discrete Mathematics
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Virtual backbones in wireless ad hoc networks
Virtual backbones in wireless ad hoc networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Locating cache proxies in manets
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
Maintaining a quality of service routing tree for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
Discrete Applied Mathematics
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
The Journal of Supercomputing
QoSRT: a quality of service routing tree for wireless ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Self-stabilizing wireless connected overlays
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Journal of Combinatorial Optimization
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
| Hi-index | 0.00 |
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 thenodes in S. The subgraph weakly induced by S is the graphG' = (V,E') such that each edge in E' has at least one endpoint 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, wepresent two distributed algorithms for finding a WCDS inO(n) time. The first algorithm has an approximation ratioof 5, and requires O(n log n) messages. The second algorithmhas a larger approximation ratio, but it requires onlyO(n) messages. The graph G' generated by the second algorithmforms a sparse spanner with a topological dilationof 3, and a geometric dilation of 6.