Sciweavers

58 search results - page 4 / 12
» Channel Sharing of Competing Flows in Ad Hoc Networks
Sort
View
WINET
2010
105views more  WINET 2010»
13 years 5 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
INFOCOM
2009
IEEE
14 years 2 months ago
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
Lei Ying, Sanjay Shakkottai
ICC
2007
IEEE
173views Communications» more  ICC 2007»
14 years 1 months ago
Using Incompletely Cooperative Game Theory in Mobile Ad Hoc Networks
—Recently, game theory becomes a useful and powerful tool to research mobile ad hoc networks (MANETs). Wireless LANs (WLANs) can work under both infrastructure and ad hoc modes, ...
Liqiang Zhao, Jie Zhang, Kun Yang, Hailin Zhang
WIMOB
2008
IEEE
14 years 1 months ago
An Ad Hoc Network Infrastructure: Communication and Information Sharing for Emergency Response
— During an emergency response, access to a reliable communication infrastructure is required to exchange accurate information in a timely manner. Various communication technolog...
Raheleh B. Dilmaghani, Ramesh R. Rao
INFOCOM
2006
IEEE
14 years 1 months ago
Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation
— In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad ...
Yaling Yang, Robin Kravets