Sciweavers

254 search results - page 33 / 51
» On randomized one-round communication complexity
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
GLOBECOM
2009
IEEE
14 years 2 months ago
Robust Cooperative Relaying in a Wireless LAN: Cross-Layer Design and Performance Analysis
—A key technology in cooperative communications is distributed space-time coding (DSTC) which achieves spatial diversity gain from multiple relays. A novel DSTC, called randomize...
Pei Liu, Chun Nie, Elza Erkip, Shivendra S. Panwar
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
Managing Network Congestion with a Kohonen-Based RED Queue
— The behaviour of the TCP AIMD algorithm is known to cause queue length oscillations when congestion occurs at a router output link. Indeed, due to these queueing variations, en...
Emmanuel Lochin, Bruno Talavera
INFOCOM
2008
IEEE
14 years 2 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 2 months ago
On the Sum-Rate of Opportunistic Beamforming Schemes with Multiple Antennas at the Receiver
Abstract— The capacity region of Gaussian Multi-InputMultiple-Output (MIMO) broadcast channels has been shown to be achieved by dirty paper coding (DPC). However, due to the high...
Renato G. Bosisio, Umberto Spagnolini