• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.306-317
• /
• 2021

The unbalance between system ergodic sum rate and high fairness is one of the key issues affecting the performance of non-orthogonal multiple access (NOMA) system. To solve the problem, this paper proposes a power allocation algorithm to realize the ergodic sum rate maximization of NOMA system. The scheme is mainly achieved by the construction algorithm of fair model based on α fair utility function and the optimal solution algorithm based on the interior point method of penalty function. Aiming at the construction of fair model, the fair target is added to the traditional power allocation model to set the reasonable target function. Simultaneously, the problem of ergodic sum rate and fairness in power allocation is weighed by adjusting the value of α. Aiming at the optimal solution algorithm, the interior point method of penalty function is used to transform the fair objective function with unequal constraints into the unconstrained problem in the feasible domain. Then the optimal solution of the original constrained optimization problem is gradually approximated within the feasible domain. The simulation results show that, compared with NOMA and time division multiple address (TDMA) schemes, the proposed method has larger ergodic sum rate and lower Fairness Index (FI) values.

• Safety and Health at Work
• /
• v.13 no.4
• /
• pp.475-481
• /
• 2022

Background: This study investigated the association between fair and supportive leadership and symptoms of burnout and insomnia in police employees. Burnout and insomnia can have negative consequences for health, performance, and safety among employees in the police profession, and risk and protective factors should be thoroughly investigated. Methods: Data were collected in a police district in Norway through questionnaires administered in October 2018 and May 2019. The sample consisted of 206 police employees (52% males), with an average age of 42 years and 16 years of experience in the police occupation. Results: The results showed that a high degree of fair and supportive leadership was associated with lower levels of burnout and insomnia six months later. Fair and supportive leadership explained a greater amount of variance in burnout compared to insomnia. This finding indicates that fair and supportive leadership is a more important buffer factor against burnout than it is against insomnia. Stress was positively associated with burnout and insomnia, whereas quantitative job demands had no significant association with the concepts. Conclusion: Fair and supportive leadership can help protect employees from adverse consequences of stress and contribute to improved occupational health, whereas a low degree of support and fair treatment from leaders can both represent a stressor by itself and contribute to poorer coping of stressful events at work. The important role of leadership should be incorporated in measures aimed at preventing and reducing burnout and sleep problems.

• Journal of Industrial Convergence
• /
• v.20 no.1
• /
• pp.35-42
• /
• 2022

This study divided employee performance factors into individual, organizational, and institutional factors, and empirically analyzed their relationship with performance evaluation results. Based on the final 417 samples, the results using the SPSS and AMOS are summarized as follows. Among the performance factors, job satisfaction and a fair performance system showed a significant positive (+) relationship with the individual performance evaluation results, and it was difficult to find a clear correlation with stable interpersonal relationships. Job satisfaction (β= 0.432, t= 7.375^***) had the greatest impact, followed by a fair performance system (β= 0.127, t= 2.406^*). This can be said to be the case where the cause of performance is satisfaction with the job and the recognition that the organization's performance system is fair. However, it was found that stable interpersonal relationships, that is, interpersonal relationships that have smooth relationships with other people and are accompanied by psychological stability, are not a performance factor. Based on the empirical analysis results, a discussion on performance factors, implications of this study, and future research directions are presented.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.585-591
• /
• 2006

Generalized Processor Sharing(GPS) model provides instantaneous fair services to currently backlogged sessions. Since this fair service distributes server capacity to backlogged sessions in proportion to their weights, the fairness is only valid between the sessions serviced at the same time. From the long time view, however, this fair service provides different server capacity with one session or another, even if these sessions have the same weights. This paper proposes a cumulative fair service(CFS) model to provide fair server capacity to all sessions in the long time view. This model provides fair service in session Viewpoint because it distributes server capacity in proportion to the weights of sessions. The model and an algorithm referencing that model are analyzed for their properties and performances. Performance evaluations verify that the proposed algorithm provides proportional service capacity to sessions in the long time view.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.386-395
• /
• 2010

Widespread deployment of infrastructure WLANs has made Wi-Fi an integral part of today's Internet access technology. Despite its crucial role in affecting end-to-end performance, past research has focused on MAC protocol enhancement, analysis, and simulation-based performance evaluation without sufficiently considering a misbehavior stemming from capture effect. It is well known that the capture effect occurs frequently in wireless environment and incurs throughput unfairness between nodes. In this paper, we propose a novel Fair MAC algorithm which achieves fairness even under physically unfair environment. While satisfying the fairness, the proposed algorithm maximizes the system throughput. Extensive simulation results show that the proposed Fair MAC algorithm substantially improves fairness without throughput reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.611-619
• /
• 2005

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.1006-1013
• /
• 2009

This paper proposes a data stream allocation technique for fair capacity performance in multiuser multiple-input multiple-output (MIMO) systems using block diagonalization (BD) algorithm. Conventional studies have been focused on maximum sum capacity. Thus, there is a very large difference of capacity among users, since user capacity unfairly distributed according to each user channel environment. In additional, poor channel user has very small capacity, since base station allocates the power by using water-filling technique. Also, almost studies limited itself to obtain the additional gain by using the same number of data streams for all users. In this paper, we propose the technique for maximizing sum capacity under the fair performance constraint by allocating data stream according to user channel environment. Also, proposed algorithm has more gain of sum capacity and transmit power than conventional equal allocation via computer simulation.

• Survey Research
• /
• v.11 no.3
• /
• pp.57-79
• /
• 2010

This study evaluated the policy performance of i) Public Notice of Critical Information, ii) Substantiation of Facts in Labeling and Advertising, iii) Temporary Injunctions, and iv) Advertisement Correcting Misrepresented Facts, which were main policies belonged to Fair Labeling and Advertising Act(hereinafter referred to as "FLA Act"). The data was collected by visiting 76 persons personally, who were consumer policy and law experts, labeling and advertising staffs of corporations, and persons in charge of policies including public officials dealing with consumer policies at Korea Fair Trade Commission, while using a structured questionnaire at the same time. The survey was performed to examine the general policy performance and evaluation the results of FLA Act by evaluation methods. The results of the analysis are comprehensively summarized as follows. There were differences in the ranking of policies evaluated by labeling and advertising staffs of corporations and persons in charge of policies according to evaluation methods, and, in Simple Evaluation, higher scores were gained compared to Weighted Evaluation which reflected weighted values or Fuzzy Evaluation. The result shows that evaluation results can vary in policy performance evaluation according to evaluation methods.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.