Sciweavers

374 search results - page 36 / 75
» On Communicating Automata with Bounded Channels
Sort
View
186
Voted
GLOBECOM
2009
IEEE
16 years 27 days ago
Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
Seokhwan Park, Inkyu Lee
PIMRC
2010
IEEE
15 years 4 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
INFOCOM
2009
IEEE
16 years 24 days ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
192
Voted
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 8 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
GLOBECOM
2007
IEEE
15 years 10 months ago
Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
Nikhil Karamchandani, Massimo Franceschetti