[PDF][PDF] On calculating connected dominating set for efficient routing in ad hoc wireless networks
J Wu, H Li - Proceedings of the 3rd international workshop on …, 1999 - dl.acm.org
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important
functions in ad-hoc wireless networks. Routing based on a connected dominating set is a …
functions in ad-hoc wireless networks. Routing based on a connected dominating set is a …
A dominating-set-based routing scheme in ad hoc wireless networks
J Wu, H Li - Telecommunication Systems, 2001 - Springer
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important
functions in ad hoc wireless networks. Routing based on a connected dominating set is a …
functions in ad hoc wireless networks. Routing based on a connected dominating set is a …
On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important
functions in ad hoc wireless networks. Routing based on a connected dominating set is a …
functions in ad hoc wireless networks. Routing based on a connected dominating set is a …
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc
wireless networks. Routing based on a connected dominating set is a promising approach …
wireless networks. Routing based on a connected dominating set is a promising approach …
Distributed dominant pruning in ad hoc networks
Efficient routing among mobile hosts is an important function in ad hoc networks. Routing
based on a connected dominating set is a promising approach, where the search space for …
based on a connected dominating set is a promising approach, where the search space for …
Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
J Wu - IEEE transactions on parallel and distributed systems, 2002 - ieeexplore.ieee.org
We extend dominating-set-based routing to networks with unidirectional links. Specifically,
an efficient localized algorithm for determining a dominating and absorbant set of vertices …
an efficient localized algorithm for determining a dominating and absorbant set of vertices …
Distributed heuristics for connected dominating sets in wireless ad hoc networks
A connected dominating set (CDS) for a graph G (V, E) is a subset V'of V, such that each
node in V—V'is adjacent to some node in V', and V'induces a connected subgraph. CDSs …
node in V—V'is adjacent to some node in V', and V'induces a connected subgraph. CDSs …
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
YP Chen, AL Liestman - Proceedings of the 3rd ACM international …, 2002 - dl.acm.org
We present a series of approximation algorithms for finding a small weakly-connected
dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks …
dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks …
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G (V, E) is a subset V1 of V, such that each
node in V--V1 is adjacent to some node in V1, and V1 induces a connected subgraph. A …
node in V--V1 is adjacent to some node in V1, and V1 induces a connected subgraph. A …
Routing in ad-hoc networks using minimum connected dominating sets
B Das, V Bharghavan - … of ICC'97-International Conference on …, 1997 - ieeexplore.ieee.org
We impose a virtual backbone structure on the ad-hoc network, in order to support unicast,
multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs …
multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs …