661 search results - page 81 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
120
Voted
WISEC
2009
ACM
15 years 9 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
119
click to vote
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
151
click to vote
COMPGEOM
2004
ACM
15 years 7 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...
148
click to vote
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
118
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...