Filters








9,745 Hits in 4.3 sec

A Fair Scheduling Model for Centralized Cognitive Radio Networks [article]

Didem Gözüpek, Fatih Alagöz
2013 arXiv   pre-print
We formulate throughput maximizing, max-min fair, weighted max-min fair, and proportionally fair scheduling problems for cognitive radio networks managed by a centralized cognitive base station.  ...  Furthermore, we make extensive simulations to evaluate our schedulers' performance in terms of both total throughput and fairness for varying number of secondary users, frequencies, antennas, and window  ...  Moreover, we propose a greedy heuristic algorithm for (weighted) max-min fair and proportionally fair schedulers.  ... 
arXiv:1309.2233v1 fatcat:usfgbvzbmfcpzmczbwus5ufyii

Clique-Based Utility Maximization in Wireless Mesh Networks

Erwu Liu, Qinqing Zhang, Kin K. Leung
2011 IEEE Transactions on Wireless Communications  
We call it a clique-based proportionally fair scheduling (CBPFS) algorithm.  ...  To this end, we provide a clique-based method with efficient spatial reuse, which is then incorporated into proportionally fair scheduling (PFS) for fair resource management in WMNs.  ...  proportionally fair scheduling (CBPFS) algorithm.  ... 
doi:10.1109/twc.2011.011111.100790 fatcat:is5c2obyabeg5eclnbe4mgyxou

Efficient Scheduling Algorithm For Qos Support In High Speed Downlink Packet Access Networks

MohammadReza HeidariNezhad, Zuriati Ahmad Zukarnain, Nur Izura Udzir, Mohamed Othman
2009 Zenodo  
In this paper, we propose APO, a new packet scheduling scheme with Quality of Service (QoS) support for hybrid of real and non-real time services in HSDPA networks.  ...  Simulation results demonstrate the effectiveness of the proposed algorithm.  ...  Popular algorithms for NRT packet scheduling include Maximum Carrier to Interference (Max C/I), Round Robin (RR), Proportionally Fair (PF) and Fast Fair Throughput (FFTH) [4] .  ... 
doi:10.5281/zenodo.1076709 fatcat:yavdo4e2znasja2zndqf3v7sr4

Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis [chapter]

Erwu Liu, Qinqing Zhang, Kin K. Leung
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In the considered system, a node and a cooperative relay are selected in a proportionally fair (PF) manner to transmit to the base station (BS), which uses the maximal ratio combining (MRC) for reception  ...  The proposed scheme integrates the PF criterion in selective cooperation to maximize the overall utility of all 2-node cooperative transmissions, and is called proportionally fair selective cooperation  ...  In light of this, we apply the proportionally fair (PF) criterion in selecting the pair (m, r) for cooperative communication in cellular networks and the scheduling algorithm is called proportionally fair  ... 
doi:10.1007/978-3-642-29222-4_28 fatcat:uhme4z6kajc2dm3ccbs4talcvi

Class and channel condition-based scheduler for EDGE/GPRS

Rajeev Agrawal, Anand Bedekar, Richard J. La, Rajesh S. Pazhyannur, Vijay Subramanian, Edwin K. P. Chong
2001 Modeling and Design of Wireless Networks  
Using a utility maximization formulation based on the data-rates that the mobiles can transmit at, we decide on the weights for a weighted proportionally fair allocation based scheduling algorithm.  ...  We also show how one can adapt the weights and the algorithm for a time-varying channel.  ...  Acknowledgement We thank Juan Alvarez, and Yiannis Argyropolous for their help in developing the software used to obtain the simulation results.  ... 
doi:10.1117/12.434467 fatcat:5djwmisevfa75hz6lfwwn7hn7m

E-Token Energy-Aware Proportionate Sharing Scheduling Algorithm for Multiprocessor Systems

Pasupuleti Ramesh, Uppu Ramachandraiah
2017 Wireless Communications and Mobile Computing  
Energy efficiency is commonly carried out by using proportionate fair scheduler. This introduces abnormal overloading effect.  ...  In order to overcome the existing problems E-token Energy-Aware Proportionate Sharing (EEAPS) scheduling is proposed here.  ...  The Proposed Work Here, we proposed an energy efficient scheduling algorithm based on preemptive mechanism called E-token Energy-Aware Proportionate Sharing (EEAPS) scheduling algorithm.  ... 
doi:10.1155/2017/8382026 fatcat:a5pl6yr54zelxktr3bgn66vgbe

Adaptive Distributed Fair Scheduling and Its Implementation in Wireless Sensor Networks

James W. Fonda, Maciej Zawodniok, S. Jagannathan, Steve E. Watkins
2006 2006 IEEE International Conference on Systems, Man and Cybernetics  
A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks is shown through hardware implementation.  ...  The algorithm is implemented using UMR/SLU motes for an industrial monitoring application.  ...  Kyle Mitchell of St. Louis University, St. Louis, MO. His continued support and advice on the G4-SSN system and hardware implementation issues is much appreciated.  ... 
doi:10.1109/icsmc.2006.384641 dblp:conf/smc/FondaZJW06 fatcat:4mjw7o4vdnfd7bko3k5mf46xna

Class and channel condition based weighted proportional fair scheduler [chapter]

Rajeev Agrawal, Anand Bedekar, Richard J. La, Vijay Subramanian
2001 Teletraffic science and engineering  
Using a utility maximization formulation based on the data-rates that the mobiles can transmit at, we decide on the weights for a weighted proportionally fair allocation based scheduling algorithm.  ...  We conclude with a simulation based performance analysis for infinitely-backlogged sources on a UMTS system.  ...  Acknowledgement We thank Eric Villier, Peter Legg, and Stephen Barrett for their help in developing the software used to obtain the simulation results.  ... 
doi:10.1016/s1388-3437(01)80151-7 fatcat:q3mzsdg6ajhdtik3m2jpiqcqvq

Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control

Atilla Eryilmaz, R. Srikant
2007 IEEE/ACM Transactions on Networking  
In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource  ...  We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver.  ...  However, if one is interested in providing long-term flow isolation as in the proportionally fair scheduler in [35] , then our algorithm suggests an alternate implementation of the proportionally-fair  ... 
doi:10.1109/tnet.2007.897944 fatcat:qmkbulfru5fz5flyzqo4hzouam

Fair and efficient scheduling in wireless networks with successive interference cancellation

Mohsen Mollanoori, Majid Ghaderi
2011 2011 IEEE Wireless Communications and Networking Conference  
For scheduling in multiple time-slots, we develop a greedy algorithm that computes a highly fair schedule in polynomial time.  ...  Specifically, we consider maximum throughput scheduling and proportional fair scheduling problems and study optimal and heuristic algorithms for these problems.  ...  algorithm for the proportional fair scheduling problem.  ... 
doi:10.1109/wcnc.2011.5779164 dblp:conf/wcnc/MollanooriG11 fatcat:uwvzew4wqfgflfbrwpvq7am6qm

Scheduling in heterogeneous cellular networks with mobility

Pooya Monajemi, Richa Sahasrabudhe, John Villasenor
2012 2012 Information Theory and Applications Workshop  
We examine the scheduling problem in the context of heterogeneous cellular networks in the presence of mobility.  ...  We demonstrate that the QoS for users in a cellular network can be optimized using an interference-aware approach that is most effective at low Doppler frequency scenarios or a channel-aware approach that  ...  A fairness criterion introduced by [4] referred to as proportionally fair scheduling is a well known and widely deployed mechanism.  ... 
doi:10.1109/ita.2012.6181769 dblp:conf/ita/MonajemiSV12 fatcat:dxf3na2r7vgere6d7n25aqmfre

Variance Based Algorithm for Grouped-Subcarrier Allocation in OFDMA Wireless Systems [article]

Noureddine Hamdi
2012 arXiv   pre-print
by a step of fairness proportionality enhancement.  ...  In this paper, a reduced complexity algorithm is proposed for grouped-subcarriers and power allocation in the downlink of OFDMA packet access wireless systems.  ...  The fairness index of the proposed algorithm is better than that of "Sup" if L ≥ 4 for K = 8 to 24.  ... 
arXiv:1207.4973v1 fatcat:z4ymzwjghfdefgn2zugtd3qrk4

Relay-Assisted Transmission with Fairness Constraint for Cellular Networks

Erwu Liu, Qinqing Zhang, K. K. Leung
2012 IEEE Transactions on Mobile Computing  
Compared with the proportional fair scheduling (PFS) algorithm, PFC provides improved efficiency and fairness.  ...  The proposed algorithm incorporates the PF criterion and cooperative diversity, and is called proportionally fair cooperation (PFC).  ...  Proportionally Fair Cooperation (PFC) For the above optimization problem, we propose the following proportionally fair cooperation (PFC) algorithm.  ... 
doi:10.1109/tmc.2011.64 fatcat:by3j3k435rc4tc6z4tbshpdo2e

Clique-Based Utility Maximization in Wireless Mesh Networks-Algorithm, Simulation, and Mathematical Analysis

Erwu Liu, Qinqing Zhang, Kin Leung
2009 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops  
To this end, we develop a clique-based proportional fair scheduling (CBPFS) algorithm for WMNs.  ...  It is the first time a mathematical model is developed to quantify the throughput of links and end-to-end flows in a multi-hop network where links are proportionally fair scheduled.  ...  The PFS algorithm is proposed for cellular networks; in this paper, we proposed a Clique-Based PFS (CBPFS) scheme, where links are grouped into link cliques which are proportionally fair scheduled to achieve  ... 
doi:10.1109/sahcnw.2009.5172923 fatcat:7qfevuupbzgttlsl6g7xgqqkti

Supporting lock-free synchronization in Pfair-scheduled real-time systems

Philip Holman, James H. Anderson
2006 Journal of Parallel and Distributed Computing  
In this paper, we explain how the quantum-based nature of Pfair scheduling enables the effective use of such objects on real-time multiprocessors and present analysis specific to Pfair-scheduled systems  ...  We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems.  ...  Fair scheduling of real-time multiprocessors In recent years, there has been considerable interest in fair scheduling algorithms for real-time multiprocessor systems [3] [4] [5] 7, 8, 10] .  ... 
doi:10.1016/j.jpdc.2005.06.011 fatcat:4xuexyks4ve27nilgq2mobxt5q
« Previous Showing results 1 — 15 out of 9,745 results