A novel Scheduling Algorithm emphasizing fairness for Cross Layer Design in wireless networks

Praveena, T. Lakshmi; Nagaraja, G S; S, Shashank C; Reddy, N. Sujith Kumar

doi:10.1109/csitss.2016.7779424

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both these parameters should be maximum for any network or system that is designed. So, in [5] the author discusses scheduling algorithms that can be used in the network to increase the throughput and fairness.…”

Section: Literature Surveymentioning

confidence: 99%

Design and Implementation of Broadband Services for Small Scale Organization

Nagaraja¹

2023

IJRASET

View full text Add to dashboard Cite

Nodes are building blocks of telecommunication network which are interconnected by telecommunication links for exchanging messages and data. Broadband Integrated Services Digital Network commonly called as Broadband ISDN or BISDN is a high-speed telecommunication network that carry data, voice and video simultaneously over a single channel. It provides interactive services where there is bidirectional flow of information between one or more subscribers and a service provider or distributive services with unidirectional information flow between service provider and subscriber. Speed of B-ISDN normally ranges from 2 Mbps to 1 Gbps and transmission very much relates to Asynchronous Transfer Mode. To design BISDN services for small scale organization, resource management and organization requirements play an important role. This paper provides a design of network model and implementation of broadband services for a small-scale organization by considering advance technology requirements, the challenges faced during the implementation and total estimation of budget for entire implementation.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Design and Implementation of Broadband Services for Small Scale Organization

Nagaraja¹

2023

IJRASET

View full text Add to dashboard Cite

show abstract

“…In spite of the fact that numerous data users are delay-tolerant and scandalous delays can trigger upper-layer problems, such as timeout for TCP. [17] 6) Between scheduling benefit and temporary performance, there is a trade-off. As a rule, the more grounded the channel circumstances time relationship (i.e., the slower the channel variation), the more horrible the transient performance, and the more prominent the temporary performance improvement, the less the scheduling gain.…”

Section: Introductionmentioning

confidence: 99%

Implementation of Max-SNR Opportunistic Scheduling in Cross Layer Design

T*,

2019

IJEAT

View full text Add to dashboard Cite

The spectrum efficiency in wireless networks is becoming increasingly important to satisfy the expanding need for remote services, particularly reasonable remote Internet services. Various wireless users will encounter distinct circumstances on the channel, which are time-varying and location dependent at a given time. To exploit the wireless time-varying nature, a cross-layer design method called Opportunistic scheduling is used. Opportunistic scheduling increases the overall system performance and user fairness requirements under certain Quality of Service (QoS). The main idea behind this opportunistic scheduling algorithm is to make use of the time-varying channel and a user with the highest channel condition should be scheduled at a specified moment. The progressions in Wireless innovation made opportunistic scheduling a famous research point as of late. The demand for QoS provisioning is increasing and using a scheme which allows only users with best channel conditions to transmit at high transmission power cannot be satisfied. The objective of this paper is to implement opportunistic scheduling while adhering to fairness and QoS constraints, using Max-Min fair algorithm. In brief, a wireless network has been simulated using Qualnet simulator. An opportunistic scheduler that uses Max-Min fairness scheduling has been implemented, at the Media Access Control (MAC) layer. Here, the base station gathers the Signal to Noise Ratio (SNR) of all the nodes and then schedules the users using Max-Min algorithm, based on these SNR values. The same scenario is then implemented using Strict Priority, which is a Non-opportunistic scheduling algorithm. The resulting throughput, fairness, delay and jitter of both the algorithms are then compared.

show abstract