Data networks
A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Multicluster, mobile, multimedia radio network
Wireless Networks
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Spine routing in ad hoc networks
Cluster Computing
Congestion management in high-speed networks
Congestion management in high-speed networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Price-based resource allocation in wireless ad hoc networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer 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
Resource disconnection management in MANET driven by process time plan
Proceedings of the 1st international conference on Autonomic computing and communication systems
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Policy-based time slot assignment algorithm in a MANET (PBTSA)
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Optimal scheduling in interference limited fading wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Non disruptive data services towards real-time traffic in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed coordination with deaf neighbors: efficient medium access for 60 GHz mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximation algorithms for wireless link scheduling with SINR-based interference
IEEE/ACM Transactions on Networking (TON)
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We present a framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multiple Access (TDMA) protocol nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the demand changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation.We first derive sufficient local feasibility conditions for certain topology classes and show that trees can be maximally utilized.We then introduce a converging distributed link scheduling algorithm that exploits the logical tree structure that arises in several ad hoc network applications.Decoupling bandwidth allocation to multi-hop sessions from link scheduling allows support of various end-to-end Quality of Service (QoS) objectives. We focus on the max-min fairness (MMF) objective and design an end-to-end asynchronous distributed algorithm for the computation of the session MMF rates. Once the end-to-end algorithm converges, the link scheduling algorithm converges to a TDMA schedule that realizes these rates.We demonstrate the applicability of this framework through an implementation over an existing wireless technology. This implementation is free of restrictive assumptions of previous TDMA approaches: it does not require any a-priori knowledge on the number of nodes in the network nor even network-wide slot synchronization.