2010 4th International Conference on Signal Processing and Communication Systems 2010
DOI: 10.1109/icspcs.2010.5709660
|View full text |Cite
|
Sign up to set email alerts
|

A low complexity scheduling for maximizing satisfied users in wireless networks

Abstract: Traditional scheduling algorithms are focused in maximizing system throughput considering a grade of fairness. However, maximizing the system throughput does not necessarily result in maximizing the number of satisfied users (users with a packet delay below a threshold). More over, the throughput maximization could cause a low grade of fairness. In this paper, we propose a low complexity scheduling algorithm that improves fairness and maximizes the number of satisfied users in the system. The main idea of this… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Several research studies have been carried out to describe and explore algorithms or statistical models to optimize network infrastructures considering user satisfaction. In this section, the work developed by Uc-Rios and Lara-Rodriguez [14], whose objective was to create an algorithm that would guarantee the satisfaction of connectivity of the users of a wireless network, seeking an optimal transmission rate for each user, based on the variable use of the channel and its quality of service. A fascinating investigation was developed by Rugelj et al [15].…”
Section: A Sdwn and Predictive Model A Literature Reviewmentioning
confidence: 99%
“…Several research studies have been carried out to describe and explore algorithms or statistical models to optimize network infrastructures considering user satisfaction. In this section, the work developed by Uc-Rios and Lara-Rodriguez [14], whose objective was to create an algorithm that would guarantee the satisfaction of connectivity of the users of a wireless network, seeking an optimal transmission rate for each user, based on the variable use of the channel and its quality of service. A fascinating investigation was developed by Rugelj et al [15].…”
Section: A Sdwn and Predictive Model A Literature Reviewmentioning
confidence: 99%
“…Considered centralized CRN architecture [22]. over, the work in [13] concentrated on the downlink of a CDMA cellular network and proposed a scheduling algorithm to maximize the number of satisfied users, where a user is satisfied if its packet delay is below a certain threshold.…”
Section: Related Workmentioning
confidence: 99%