955 search results - page 7 / 191 » Cover Set Problem in Directional Sensor Networks |
ALGOSENSORS
2006
Springer
15 years 1 months ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
ICDCSW
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
IWDC
2005
Springer
15 years 3 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
ICCNMC
2005
Springer
15 years 3 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...