309 search results - page 51 / 62 » Communication Complexity Lower Bounds by Polynomials |
MOBICOM
2003
ACM
14 years 25 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...