Sciweavers

147 search results - page 25 / 30
» A Distributed CSMA Algorithm for Throughput and Utility Maxi...
Sort
View
MOBICOM
2006
ACM
14 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
INFOCOM
2007
IEEE
14 years 2 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
MOBIHOC
2008
ACM
14 years 7 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
MSN
2007
Springer
208views Sensor Networks» more  MSN 2007»
14 years 1 months ago
QoS-Aware Cooperative and Opportunistic Scheduling Exploiting Multi-user Diversity for Rate Adaptive Ad Hoc Networks
— The recent researches in wireless networks prompt the opportunistic transmission that exploiting channel fluctuations to improve the overall system performance. In wireless ad...
Zhisheng Niu
TON
2010
163views more  TON 2010»
13 years 6 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...