1,759 research outputs found
Efficient Resource Management Mechanism for 802.16 Wireless Networks Based on Weighted Fair Queuing
Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases in host devices. This can effectively lead to very huge bottlenecks in the network causing slow sluggish performance, which may eventually reduce the speed of the network. With continuous advancement being the trend in this technology, the proposal of an efficient scheme for wireless resource allocation is an important solution to the problem of congestion. The primary area of focus will be the emerging standard for wireless networks, the 802.16 or âWiMAXâ. This project, attempts to propose a mechanism for an effective resource management mechanism between subscriber stations and the corresponding base station
A Delay-Optimal Packet Scheduler for M2M Uplink
In this paper, we present a delay-optimal packet scheduler for processing the
M2M uplink traffic at the M2M application server (AS). Due to the
delay-heterogeneity in uplink traffic, we classify it broadly into
delay-tolerant and delay-sensitive traffic. We then map the diverse delay
requirements of each class to sigmoidal functions of packet delay and formulate
a utility-maximization problem that results in a proportionally fair
delay-optimal scheduler. We note that solving this optimization problem is
equivalent to solving for the optimal fraction of time each class is served
with (preemptive) priority such that it maximizes the system utility. Using
Monte-Carlo simulations for the queuing process at AS, we verify the
correctness of the analytical result for optimal scheduler and show that it
outperforms other state-of-the-art packet schedulers such as weighted round
robin, max-weight scheduler, fair scheduler and priority scheduling. We also
note that at higher traffic arrival rate, the proposed scheduler results in a
near-minimal delay variance for the delay-sensitive traffic which is highly
desirable. This comes at the expense of somewhat higher delay variance for
delay-tolerant traffic which is usually acceptable due to its delay-tolerant
nature.Comment: Accepted for publication in IEEE MILCOM 2016 (6 pages, 7 figures
A Survey of Wireless Fair Queuing Algorithms with Location-Dependent Channel Errors
The rapid development of wireless networks has brought more and more attention to topics related to fair allocation of resources, creation of suitable algorithms, taking into account the special characteristics of wireless environment and insurance fair access to the transmission channel, with delay bound and throughput guaranteed. Fair allocation of resources in wireless networks requires significant challenges, because of errors that occur only in these networks, such as location-dependent and bursty channel errors. In wireless networks, frequently hap-pens, because interference of radio waves, that a user experiencing bad radio conditions during a period of time, not to receive resources in that period. This paper analyzes some resource allocation algorithms for wireless networks with location dependent errors, specifying the base idea for each algorithm and the way how it works. The analyzed fair queuing algorithms differ by the way they treat the following aspects: how to select the flows which should receive additional services, how to allocate these resources, which is the proportion received by error free flows and how the flows affected by errors are compensated.Fair Scheduling, Wireless Networks, Location Dependent Channel Errors, Sched-uling Algorithms
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems
This paper proposes a fair and efficient QoS scheduling scheme for IEEE
802.16 BWA systems that satisfies both throughput and delay guarantee to
various real and non-real time applications. The proposed QoS scheduling scheme
is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can
provide a tight QoS guarantee in terms of delay, delay violation rate and
throughput for all types of traffic as defined in the WiMAX standard, thereby
maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the
resources are also encountered to validate the QoS provided by our proposed
scheduling scheme
- âŠ