2391 search results - page 192 / 479 » The Complexity of Connectivity in Wireless Networks |
168
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
200
click to vote
ALGOSENSORS
2004
Springer
16 years 1 days ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
174
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
193
click to vote
OPODIS
2007
15 years 8 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
179
click to vote
INTERSENSE
2006
ACM
16 years 18 days ago
2006
ACM
— In this paper, we consider the sensor replacement problem in hybrid wireless sensor networks composed of mobile and static sensors. Mobility equipped mobile sensors are utilize...