2732 search results - page 125 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
171
click to vote
JNW
2007
15 years 6 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
218
click to vote
WISEC
2010
ACM
15 years 11 months ago
2010
ACM
In many applications of wireless sensor networks, sensor nodes are manually deployed in hostile environments where an attacker can disrupt the localization service and tamper with...
156
click to vote
MOBISYS
2005
ACM
16 years 5 months ago
2005
ACM
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
163
click to vote
INFOCOM
2009
IEEE
16 years 27 days ago
2009
IEEE
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...
168
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...