58 search results - page 5 / 12 » Iterative Local Solutions for Connected Dominating Set in Ad... |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
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. The st...
ISCC
2005
IEEE
2005
IEEE
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
14 years 1 months ago
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
PERVASIVE
2004
Springer
14 years 26 days ago
2004
Springer
Much of the work on networking and communications is based on the premise that components interact in one of two ways: either they are connected via a stable wired or wireless netw...
BROADNETS
2005
IEEE
14 years 1 months ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
CCCG
2010
13 years 9 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...