2732 search results - page 255 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
199
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
159
click to vote
SBACPAD
2003
IEEE
15 years 12 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
176
click to vote
SPAA
2005
ACM
16 years 6 days ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
162
click to vote
EUROPDS
1997
15 years 8 months ago
1997
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite nat...
171
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...