1783 search results - page 179 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
140
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
145
click to vote
EUC
2007
Springer
15 years 9 months ago
2007
Springer
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...
121
click to vote
CLUSTER
2008
IEEE
15 years 9 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
132
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
141
click to vote
MOBICOM
2003
ACM
15 years 8 months 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...