Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

Abstract

Abstract-We present a novel 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 TDMA protocol, nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation.We first identify an inherent trade-off between the degree of topology control and fraction of feasible allocations that can be captured by the local conditions. We show that tree topologies can be maximally utilized in this respect and that a converging distributed link scheduling algorithm exists in this case.Decoupling end-to-end bandwidth allocation from link scheduling allows support of various end-to-end QoS objectives. Focusing on Available Bit Rate (ABR) service, we design an asynchronous distributed algorithm for sharing bandwidth to the sessions in a maxmin fair (MMF) manner.Finally, we present the implementation of this framework over Bluetooth, an existing wireless technology that enables the formation of ad hoc networks. This implementation is free of the usual 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.

Delay Guarantees for Throughput-Optimal Wireless Link Scheduling

“…Subsequently, several policies have been shown to attain (in some cases, for specific topology classses and interference constraints), either the maximum throughput region [1], [5], [18], [21], [23], [24] or a guaranteed fraction thereof [2], [4], [13], [15], [26], while requiring lower computation time. However, whether these algorithms are able to provide low delay guarantees remains largely unknown.…”

Resource Disconnection Management in MANET Driven by Process Time Plan

“…In recent years, research in the manet area has mainly focused on the development of appropriate routing protocols, security and reliability of the communications, methods for energy preservation, and other issues on the lower four ISO/OSI layers [35][36][37][38][39]41]. Effective routing in ad hoc networks is still an actively-addressed open problem [33,35,37], with some interesting proposals presented in the literature (e.g., Dynamic Source Routing -DSR, Ad hoc On demand Distance Vector -AODV routing, Zone Routing Protocol -Z-RP, etc.).…”

Interference-aware QoS routing (IQRouting) for ad-hoc networks

“…This is difficult to implement in a real network due to issues of code and time synchronization between the nodes. More recently, [9] and [10] have proposed other algorithms to determine the exact schedule of slots for a flow through the network. These schedules take interference into account, and guarantee bandwidth for constant bit rate flows.…”