Sciweavers

7133 search results - page 411 / 1427
» Communication algorithms with advice
Sort
View
TWC
2010
15 years 1 months ago
Adaptive linearly constrained minimum variance beamforming for multiuser cooperative relaying using the kalman filter
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
Amr El-Keyi, Benoît Champagne
INFOCOM
2011
IEEE
14 years 10 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
16 years 7 months ago
Parallel repetition: simplifications and the no-signaling case
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
Thomas Holenstein
PDPTA
2004
15 years 8 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
ICDCN
2011
Springer
14 years 10 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan