Constant-Time Distributed Scheduling Policies for <i>Ad Hoc</i> Wireless Networks

Lin, Xiaojun; Rasool, S.B.

doi:10.1109/tac.2008.2010888

Cited by 72 publications

(85 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the value of C should be chosen carefully to achieve the optimal performance, which supports our analysis result. With more than 80% and 60% capacity empirically obtained, the performance of MM and CT coincide with those in the literature [20,9]. About Algorithm 1, we observe that even though it can attain 100% capacity, it suffers a large queue length, which agrees with the Corollary 1.…”

Section: Simulation Resultssupporting

confidence: 86%

“…In this section, first we evaluate the throughput performance between the Constant-Time (CT) [20], Maximal Matching (MM), Greedy Maximal Matching (GMM) [15] algorithms and our proposed algorithms with the Compare operation. We use the performance of centralized GMM, which was shown to achieve a nearly optimal performance in most practical scenarios [20], as a reference value.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…We use the performance of centralized GMM, which was shown to achieve a nearly optimal performance in most practical scenarios [20], as a reference value. All of the simulations are carried out by our own C++ simulator.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…In contrast to existing algorithms based on queue lengths information such as those in [19,4,20,8], in our algorithm each node with backlogged links does not need to exchange queue length information for constructing a feasible schedule. Also, it is fully distributed with constant time-complexity, which is much more flexible and general than existing ones in the literature.…”

Section: Randomized Feasible Allocation Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks

Tran

Hong

Lee

2011

Mathematical and Computer Modelling

View full text Add to dashboard Cite

a b s t r a c tIn wireless networks, due to the shared medium, we require sophisticated algorithms to schedule concurrent transmissions that meet the interference constraint where two nodes cannot transmit simultaneously in a guaranteed interference range of each other.For the general (K -hop) interference model, 1 especially with K ≥ 2, the throughputoptimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. Inspired by this problem, we generalize a randomized scheduling framework for a K -hop interference model and prove that any scheduling algorithm can achieve the capacity of the system if it satisfies the constraints of this framework. Then, we develop two randomized distributed scheduling algorithms which can be integrated into this framework. In spite of having the constant time-complexity, the first proposed algorithm can lead to the exponential growth of the network delay. The second one is a maximal matching algorithm having better delay performance with polynomial growth of delay in the network size. We also show that the whole time-complexity of this randomized distributed scheduling framework is polynomial in network size with any finite value of K .

show abstract

Section: Simulation Resultssupporting

confidence: 86%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Randomized Feasible Allocation Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks

Tran

Hong

Lee

2011

Mathematical and Computer Modelling

View full text Add to dashboard Cite

show abstract

“…Therefore, developing a scheduling algorithm with low and constant-time overhead is very desirable. In fact, some queue-length-based constant-time scheduling algorithms were proposed for one and two hop interference models [15][16][17] recently in the literature. These scheduling algorithms only achieve a guaranteed faction of the capacity region but they have constant time overhead.…”

Section: Introductionmentioning

confidence: 99%

Control of wireless networks with flow level dynamics under constant time scheduling

Mazumdar

2009

Wireless Netw

View full text Add to dashboard Cite

We consider a network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the control problem in low load and high load regimes. In the low load regime, we show that the network can be stabilized by a regulated maximal scheduling policy considering flow level dynamics if the offered load satisfies a constraining bound condition. Because maximal scheduling is a general scheduling rule whose implementation is not specified, we propose a constant-time and distributed scheduling algorithm for a general k-hop interference model which can approximate the maximal scheduling policy within an arbitrarily small error. Under the stability condition, we show how to calculate transmission rates for different user classes such that the long-term (time average) network utility is maximized. This long-term network utility captures the real network performance due to the fact that under flow level dynamics, the number of users randomly change so instantaneous network utility maximization does not result in useful network performance. Our results imply that congestion control is unnecessary when the offered load is low and optimal user rates can be determined to maximize users' long-term satisfaction. In the high load regime where the network can be unstable under the regulated maximal scheduling policy, we propose a cross-layer congestion control and scheduling algorithm which can stabilize the network under arbitrary network load. Through extensive numerical analysis for some typical networks, we show that the proposed scheduling algorithm has much lower overhead than other existing queue-length-based constant-time scheduling schemes in the literature, and it achieves performance much better than the guaranteed bound.

show abstract

Towards utility‐optimal random access without message passing

Liu

Proutière

et al. 2009

Wireless Communications

107

View full text Add to dashboard Cite

It has been recently suggested by Jiang and Walrand that adaptive carrier sense multiple access (CSMA) can achieve optimal utility without any message passing in wireless networks. In this paper, after a survey of recent work on random access, a generalization of this algorithm is considered. In the continuous-time model, a proof is presented of the convergence of these adaptive CSMA algorithms to be arbitrarily close to utility optimality, without assuming that the network dynamics converge to an equilibrium in between consecutive CSMA parameter updates. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between optimality and short-term fairness is quantified.

show abstract

Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks

Cited by 72 publications

References 41 publications

Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks

Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks

Control of wireless networks with flow level dynamics under constant time scheduling

Towards utility‐optimal random access without message passing

Contact Info

Product

Resources

About