Sciweavers

Share
58 search results - page 1 / 12
» Iterative Local Solutions for Connected Dominating Set in Ad...
Sort
View
TC
2008
11 years 5 months ago
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
Jie Wu, Fei Dai, Shuhui Yang
TPDS
2002
155views more  TPDS 2002»
11 years 5 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
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...
Jie Wu
ISPAN
2002
IEEE
11 years 10 months ago
On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
Jie Wu, Fei Dai
DCOSS
2011
Springer
10 years 5 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
MOBIHOC
2002
ACM
12 years 5 months ago
Message-optimal connected dominating sets in mobile 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. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
books