7133 search results - page 183 / 1427 » Communication algorithms with advice |
138
click to vote
OPODIS
2004
15 years 6 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
149
click to vote
JNW
2007
15 years 4 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...
128
click to vote
ACIVS
2008
Springer
15 years 11 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
159
click to vote
ICC
2011
IEEE
14 years 4 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
148
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...