• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.559-573
• /
• 2016

In this paper, we investigate the problem of achieving proportional fairness in hierarchical wireless sensor networks. Combining clustering formulation and scheduling, we maximize total bandwidth utility for proportional fairness while controlling the power consumption to a minimum value. This problem is decomposed into two sub-problems and solved in two stages, which are Clustering Formulation Stage and Scheduling Stage, respectively. The above algorithm, called CSPF_PC, runs in a network formulation sequence. In the Clustering Formulation Stage, we let the sensor nodes join to the cluster head nodes by adjusting transmit power in a greedy strategy; in the Scheduling Stage, the proportional fairness is achieved by scheduling the time-slot resource. Simulation results verify the superior performance of our algorithm over the compared algorithms on fairness index.

• ETRI Journal
• /
• 제31권5호
• /
• pp.481-488
• /
• 2009

This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an antenna trade-off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade-off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade-off scheme combined with QF scheduling can improve the probability of QoS-guaranteed transmission when supporting different QoS groups.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.261-270
• /
• 2011

The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.81-84
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, Scheduling algorithm allocates network resources fairly to each VC. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4419-4435
• /
• 2015

The use of an efficient packet scheduling scheme for a forward link in satellite communication networks is very important to support fairness for each return channel satellite terminal (RCST) and the service differentiations for user traffics. To support fairness and QoS for each RCST with service-level agreement (SLA), the Adaptive Coding and Modulation (ACM) system in a satellite hub has to process packets with considering modulation and coding (MODCOD) and packet types. Although a DVB-S2 system with ACM scheme has higher transmission efficiency, it cannot offer fairness or quality of service (QoS) to RCSTs. Because the data are transmitted with high MODCOD in regions with clear skies, while data are transmitted using low MODCOD in regions experiencing rain events. In this paper, we propose a two-step scheduling scheme offering fairness and QoS to RCSTs, while minimizing a decrease in throughput. The proposed scheme is carried out performance evaluations using a computer simulation. As results of this simulation, the proposed scheduler was shown to support bandwidth fairness to an individual RCST, and provide a level of QoS differentiation for user traffics.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.

• ETRI Journal
• /
• 제36권1호
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• 한국통신학회논문지
• /
• 제35권2A호
• /
• pp.121-127
• /
• 2010

이 논문에서는 다중 사용자 무선통신 환경에서 전송률-형평성 트레이드오프를 임의로 제어할 수 있는 계산이 효율적인 전송률-형평성 제어 스케줄링 알고리즘을 제안한다. 제안되는 스케줄링 기준은 최대의 전송률 합을 추구하는 스케줄링 기준과 최대의 형평성을 추구하는 스케줄링 기준을 제어 인자에 따라 전송률과 형평성을 조정할 수 있도록 선형적으로 결합한다. 이때, 선형 결합을 통한 전송률-형평성 트레이드오프 제어를 위하여 스케줄링 기준의 단위와 최적화 방향을 일치시키는 것이 필요하다. 제안된 알고리즘은 이러한 조건들을 만족시키기 위하여 순시 전송률과 평균 제공 전송률을 스케줄링 기준으로 결정하고, 이들을 제어 인자를 사용하여 최적화 방향이 일치하도록 선형적으로 결합하여 제어 인자 값에 따라 다양한 전송률형평성 성능을 제공할 수 있도록 한다. 추가적인 계산 간소화를 위하여 순시 전송률에 대한 높은 SNR (signal-to-noise ratio) 근사화 관계를 이용한다. 모의 실험을 통하여 독립적인 레일리 페이딩 다중 사용자 채널에서 제안된 스케줄링 알고리즘에 대하여 제어 인자 값에 따른 전송률과 형평성 성능을 분석하였고, 순시 전송률의 높은 SNR 근사화 관계를 이용한 성능 분석도 이루어졌다. 모의실험 결과, 제안된 스케줄링 알고리즘은 최대 전송률을 추구하는 스케줄링과 최대 형평성을 추구하는 스케줄링 사이에서 전송률-형평성 성능을 임의로 조절할 수 있음을 확인할 수 있었고, 근사화 결과도 만족스러운 결과를 얻을 수 있었다.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권4호
• /
• pp.291-303
• /
• 2009

라운드 로빈 기반 비례지분 스케줄링(Round Robin based Proportional Share scheduling, RRPS)은 각 태스크에게 지분(share)을 결정하는 비중(weight)이라는 속성을 정의하고 각 태스크의 비중에 비례하여 CPU 자원을 할당한다. 라운드 로빈 기반 비례지분 스케줄링은 공평성(fairness)을 성능의 척도로 사용하며 스케줄링의 높은 공평성을 목표로 한다. 그러나 태스크를 간의 동기화로 인한 스케줄링의 공평성 문제에 대한 연구는 부족하다. 본 논문에서는 라운드 로빈 기반 비례지분 스케줄링에서 동기화로 인한 스케줄링의 지연이 높은 불공평성을 발생시킴을 보인다. 이를 비중역전(weight inversion)이라는 현상으로 설명한다. 다음, 비중역전을 방지하는 동기화 기법인 비중상속 프로토콜(weight inheritance protocol, WIP)을 제안한다. 또한, 공평성분석과 시뮬레이션을 통해 비중상속 프로토콜이 불공평성을 감소시킴을 보인다.