955 search results - page 17 / 191 » Cover Set Problem in Directional Sensor Networks |
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
DCOSS
2009
Springer
15 years 2 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
MP
1998
14 years 9 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
115
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
With the development of location aware sensor applications, location determination has become an increasingly important middleware technology. Numerous current technologies for lo...