139 search results - page 3 / 28 » Enhancing the Routing Performance of Wireless Sensor Network... |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
IWDC
2005
Springer
13 years 10 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
JCO
2008
13 years 5 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ISCC
2005
IEEE
2005
IEEE
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
13 years 10 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...