8,568 research outputs found
Recommended from our members
FHCF: A simple and efficient scheduling scheme for IEEE 802.11e wireless networks
The IEEE 802.11e medium access control (MAC) layer protocol is an emerging standard to support quality of service (QoS) in 802.11 wireless networks. Some recent works show that the 802.11e hybrid coordination function (HCF) can improve signi¯cantly the QoS support in 802.11 networks. A simple HCF referenced scheduler has been proposed in the 802.11e which takes into account the QoS requirements of °ows and allocates time to stations on the basis of the mean sending rate. As we show in this paper, this HCF referenced scheduling algorithm is only e±cient and works well for °ows with strict constant bit rate (CBR) characteristics. However, a lot of real-time applications, such as videoconferencing, have some variations in their packet sizes, sending rates or even have variable bit rate (VBR) characteristics. In this paper we propose FHCF, a simple and e±cient scheduling algorithm for 802.11e that aims to be fair for both CBR and VBR °ows. FHCF uses queue length estimations to tune its time allocation to mobile stations. We present analytical model evaluations and a set of simulations results, and provide performance comparisons with the 802.11e HCF referenced scheduler. Our performance study indicates that FHCF provides good fairness while supporting bandwidth and delay requirements for a large range of network loads
A QoS-Aware Scheduling Algorithm for High-Speed Railway Communication System
With the rapid development of high-speed railway (HSR), how to provide the
passengers with multimedia services has attracted increasing attention. A key
issue is to develop an effective scheduling algorithm for multiple services
with different quality of service (QoS) requirements. In this paper, we
investigate the downlink service scheduling problem in HSR network taking
account of end-to-end deadline constraints and successfully packet delivery
ratio requirements. Firstly, by exploiting the deterministic high-speed train
trajectory, we present a time-distance mapping in order to obtain the highly
dynamic link capacity effectively. Next, a novel service model is developed for
deadline constrained services with delivery ratio requirements, which enables
us to turn the delivery ratio requirement into a single queue stability
problem. Based on the Lyapunov drift, the optimal scheduling problem is
formulated and the corresponding scheduling service algorithm is proposed by
stochastic network optimization approach. Simulation results show that the
proposed algorithm outperforms the conventional schemes in terms of QoS
requirements.Comment: 6 pages, 3 figures, accepted by IEEE ICC 2014 conferenc
A combined polling and ISMA-DS/CDMA protocol to provide QoS in packet mobile communications systems
This paper presents a new mechanism that combines the flexibility of an access protocol such as ISMA-DS/CDMA with the ability of a polling mechanism to provide a specific bound for the access delay. This protocol is proposed for a packet transmission mobile communication system together with a scheduling algorithm that arranges the different transmissions depending on the quality of service required by the set of considered services.Peer ReviewedPostprint (published version
Scheduling for Multi-Camera Surveillance in LTE Networks
Wireless surveillance in cellular networks has become increasingly important,
while commercial LTE surveillance cameras are also available nowadays.
Nevertheless, most scheduling algorithms in the literature are throughput,
fairness, or profit-based approaches, which are not suitable for wireless
surveillance. In this paper, therefore, we explore the resource allocation
problem for a multi-camera surveillance system in 3GPP Long Term Evolution
(LTE) uplink (UL) networks. We minimize the number of allocated resource blocks
(RBs) while guaranteeing the coverage requirement for surveillance systems in
LTE UL networks. Specifically, we formulate the Camera Set Resource Allocation
Problem (CSRAP) and prove that the problem is NP-Hard. We then propose an
Integer Linear Programming formulation for general cases to find the optimal
solution. Moreover, we present a baseline algorithm and devise an approximation
algorithm to solve the problem. Simulation results based on a real surveillance
map and synthetic datasets manifest that the number of allocated RBs can be
effectively reduced compared to the existing approach for LTE networks.Comment: 9 pages, 10 figure
Energy-efficient wireless communication
In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters
- …