284 search results - page 41 / 57 » Distributed Agreement with Optimal Communication Complexity |
129
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
139
Voted
CORR
2010
Springer
15 years 5 days ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
123
click to vote
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
128
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
139
Voted
SECON
2008
IEEE
15 years 9 months ago
2008
IEEE
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...