Link scheduling with end-to-end delay constraints in Wireless Mesh Networks

Cappanera, Paola; Lenzini, Luciano; Lori, Alessandro; Stea, Giovanni; Vaglini, Gigliola

doi:10.1109/wowmom.2009.5282472

Cited by 13 publications

(27 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Section IX-B.3, we evaluate the performance of our column-generation-based algorithm under fixed power and variable power for the 20-node network. In Section IX-B.4, we compare on the channel use with the other two performing approaches from [19] and [29], respectively as mentioned in Section II, which also stressed the delay problem.…”

Section: B Simulation Resultsmentioning

confidence: 99%

“…[15] showed the scaling of the average packet delay with respect to the overall load on the network and the chromatic number of the link conflict graph; and in Ref. [19], the authors also studied the delay performance and proposed a linear integer programming formulation for the link scheduling problem in TDM wireless mesh networks under a sink-tree topology and constant bit rate traffic. Meanwhile, fairness problem and power efficiency in link scheduling have been taken into consideration in algorithm/protocol designs for multihop wireless networks.…”

Section: Related Workmentioning

confidence: 99%

“…Finally, we propose a new distributed protocol to implement the link scheduling based on the column generation algorithm. Meanwhile, to evaluate the efficiency of our proposed scheme, we compare with some existing approaches, including the works [19] [29], which also considered delay and channel efficiency. In summary, we aim to find the shortest schedule that can achieve the specified link traffic demands, power efficiency, and QoS requirements such as link rates, delay bound, and delay bound violation probability under SINR constraints.…”

Section: Related Workmentioning

confidence: 99%

“…To evaluate the efficiency of our SINR-EC scheduler, we compare our scheme with the approach from Cappanera et al [19] and the scheme proposed by Djukic and Valaee [29], as mentioned in Section II. For the fairness of comparison, we use the same randomly generated 20-node network, including the node positions, link numbers, channel conditions, etc, with the same source rate and delay bound requirement.…”

Section: ) Performance Comparison With the Other Two Performing Schementioning

confidence: 99%

See 3 more Smart Citations

Delay-Constrained Optimal Link Scheduling in Wireless Sensor Networks

Wang

Fan

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

We consider the optimal link scheduling problem in wireless sensor networks. The optimal link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability; we study the problem under fading channels and a signal-to-interference-plus-noise ratio (SINR) based interference model. To the best of our knowledge, this problem has not been studied previously. We use the effective capacity model to formulate the optimal link scheduling as a mixed integer optimization problem. We first discuss a simple case, namely the scheduling with a fixed power allocation and then, extend to the case with variable transmit power. Moreover, because the mixed integer optimization problem is NP-hard, we propose a computationally feasible columngeneration-based iterative algorithm to search for a sub-optimal solution to the problem. Finally, we design a medium access control (MAC) protocol to implement our optimal link scheduling strategy in practical wireless networks. Simulation results demonstrate that our proposed scheme achieves a larger throughput, a larger admission region, and a higher power efficiency than a benchmark time division multiple access (TDMA) system.

show abstract

Section: B Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: ) Performance Comparison With the Other Two Performing Schementioning

confidence: 99%

See 2 more Smart Citations

Delay-Constrained Optimal Link Scheduling in Wireless Sensor Networks

Wang

Fan

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…To overcome the above limitations, several articles (e.g., [9][10][11][12]) propose to replace CSMA/CA by TDMA in WMNs. As TDMA is not a competition access scheme, it does not need methods to avoid collision (such as the backoff algorithm used in CSMA/CA) and can, thus, gain in throughput [12,13].…”

Section: Introductionmentioning

confidence: 99%

An efficient admission control model based on dynamic link scheduling in wireless mesh networks

Dromard

Khoukhi

Khatoun

2013

J Wireless Com Network

View full text Add to dashboard Cite

Background: Wireless mesh networks (WMNs) are a very attractive new field of research. They are low cost, easily deployed, and a high-performance solution to last-mile broadband Internet access. In WMNs, admission control (AC) is one of the key traffic management mechanisms that should be deployed to provide quality of service (QoS) support for real-time traffic. Results: In this paper, we introduce a novel admission control model, based on bandwidth and delay parameters, which integrates a dynamic link scheduling scheme. The proposed model is built on two different methods to access the medium: on a contention-based channel access method for control packets and on a dynamic time division multiple access (DTDMA) for data packets. Each time a new flow is admitted in the network, the WMN's link scheduling is modified according to the flows' requirement and network conditions while respecting the signal-to-interference-plus-noise ratio (SINR); this allows establishing collision-free transmissions. Conclusions: Using extensive simulations, we demonstrate that our model achieves high resource utilization by improving throughput, establishing collision-free transmission, as well as respecting requirements of admitted flows in terms of delay and bandwidth.

show abstract

MDP based link scheduling in wireless networks to maximize the reliability

Yang

Xie

et al. 2015

Wireless Netw

View full text Add to dashboard Cite

Link scheduling with end-to-end delay constraints in Wireless Mesh Networks

Cited by 13 publications

References 19 publications

Delay-Constrained Optimal Link Scheduling in Wireless Sensor Networks

Delay-Constrained Optimal Link Scheduling in Wireless Sensor Networks

An efficient admission control model based on dynamic link scheduling in wireless mesh networks

MDP based link scheduling in wireless networks to maximize the reliability

Contact Info

Product

Resources

About