Data networks
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Floor acquisition multiple access (FAMA) for packet-radio networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Computer networks (3rd ed.)
Average waiting time of customers in an M/D/k queue with nonpreemptive priorities
Computers and Operations Research
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
Proceedings of the 9th annual international conference on Mobile computing and networking
Enhancing throughput over wireless LANs using channel state dependent packet scheduling
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Cross-layer design for wireless networks
IEEE Communications Magazine
Channel quality estimation and rate adaptation for cellular mobile radio
IEEE Journal on Selected Areas in Communications
An approach for bandwidth reservation in ad-hoc networks having infrastructure support
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
PEPD: a priority based packet discard scheme to provide service differentiation in internet
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Capacity of wireless networks with heterogeneous traffic
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Opportunistic link overbooking for resource efficiency under per-flow service guarantee
IEEE Transactions on Communications
Capacity of wireless networks with heterogeneous traffic under physical model
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Differentiated application independent data aggregation in wireless sensor networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
| Hi-index | 0.00 |
Due to the salient characteristics such as the time-varying and error-prone wireless links, the dynamic and limited bandwidth, the time-varying traffic pattern and user locations, and the energy constraints, it is a challenging task to efficiently support heterogeneous traffic with different quality of service (QoS) requirements in multihop mobile ad hoc networks. In the last few years, many channel-dependent mechanisms are proposed to address this issue based on the cross-layer design philosophy. However, a lot of problems remain before more efficient solutions are found. One of the problems is how to alleviate the conflict between throughput and fairness for different prioritized traffic, especially how to avoid the bandwidth starvation problem for low-priority traffic when the high-priority traffic load is very high. In this paper, we propose a novel scheme named Courtesy Piggybacking to address this problem. With the recognition of interlayer coupling, our Courtesy Piggybacking scheme exploits the channel dynamics and stochastic traffic features to alleviate the conflict. The basic idea is to let the high-priority traffic help the low-priority traffic by sharing unused residual bandwidth with courtesy. Another noteworthy feature of the proposed scheme is its implementation simplicity: The scheme is easy to implement and is applicable in networks using either reservation-based or contention-based MAC protocols.