End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
- 8 July 2004
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 564-569
- https://doi.org/10.1109/cdc.2003.1272623
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Maxmin fair scheduling in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Back pressure based multicast scheduling for fair bandwidth allocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On max-min fairness and scheduling in wireless ad-hoc networksPublished by Association for Computing Machinery (ACM) ,2001
- A pseudo random coordinated scheduling algorithm for Bluetooth scatternetsPublished by Association for Computing Machinery (ACM) ,2001
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988
- The Architectural Organization of a Mobile Radio Network via a Distributed AlgorithmIEEE Transactions on Communications, 1981