9401 search results - page 1867 / 1881 » Wireless Networks |
108
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
105
Voted
EMSOFT
2003
Springer
15 years 2 months ago
2003
Springer
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
138
click to vote
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
JSAC
2008
14 years 9 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
JUCS
2008
14 years 9 months ago
2008
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...