1612 search results - page 116 / 323 » Analysing Randomized Distributed Algorithms |
121
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
125
click to vote
PIMRC
2010
IEEE
15 years 9 days ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
140
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Topology control and routing protocols are used by designers of wireless packet data networks to lower the node degree, simplify routing and lower the nodes’ energy consumpti...
204
Voted
TON
2010
14 years 9 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
122
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...