• Title/Summary/Keyword: User-fairness

Search Result 150, Processing Time 0.02 seconds

Analysis on Bit Error Rate Performance of Negatively Asymmetric Binary Pulse Amplitude Modulation Non-Orthogonal Multiple Access in 5G Mobile Networks

  • Chung, Kyuhyuk
    • International Journal of Advanced Culture Technology
    • /
    • v.9 no.4
    • /
    • pp.307-314
    • /
    • 2021
  • Recently, positively asymmetric binary pulse amplitude modulation (2PAM) has been proposed to improve the bit error rate (BER) performance of the weak channel gain user, with a tolerable BER loss of the strong channel gain user, for non-orthogonal multiple access (NOMA). However, the BER loss of the stronger channel gain user is inevitable in such positively asymmetric 2PAM NOMA scheme. Thus, we propose the negatively asymmetric 2PAM NOMA scheme. First, we derive closed-form expressions for the BERs of the negatively asymmetric 2PAM NOMA. Then, simulations demonstrate that for the stronger channel gain user, the BER of the proposed negatively asymmetric 2PAM NOMA improves, compared to that of the conventional positively asymmetric 2PAM NOMA. Moreover, we also show that for the weaker channel gain user, the BER of the proposed negatively asymmetric 2PAM NOMA is comparable to that of the conventional positively asymmetric 2PAM NOMA, over the power allocation range less than about 10 %.

Study on efficient scheduing strategies for multiuser MIMO systems (멀티유저 MIMO 시스템에서 효과적인 스케쥴링 정책 연구)

  • Kim, Jae-Hong;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.201-204
    • /
    • 2006
  • In this paper, we propose efficient scheduling strategy for Multi-user MIMO systems that find advantageous trade off solution between multiuser diversity and spatial diversity, spatial multiplexing technique. Specifically, we suggest P-SFS(Pseudo-SNR Fair scheduling) algorithm that consider throughput and fairness problem. also we propose channel aware Antenna deployment that decide how to use assigned multiple antennas by the information of each user's channel condition.

  • PDF

Multimedia Service Discrimination Based on Fair Resource Allocation Using Bargaining Solutions

  • Shin, Kwang-Sup;Jung, Jae-Yoon;Suh, Doug-Young;Kang, Suk-Ho
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.341-351
    • /
    • 2012
  • We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai-Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.

ARM: Adaptive Resource Management for Wireless Network Reliability (무선 네트워크의 신뢰성 보장을 위한 적응적 자원 관리 기법)

  • Lee, Kisong;Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2382-2388
    • /
    • 2014
  • To provide network reliability in indoor wireless communication systems, we should resolve the problem of unexpected network failure rapidly. In this paper, we propose an adaptive resource management (ARM) scheme to support seamless connectivity to users. In consideration of system throughput and user fairness simultaneously, the ARM scheme adaptively determines the set of healing channels, and performs scheduling and power allocation iteratively based on a constrained non-convex optimization technique. Through intensive simulations, we demonstrate the superior performance results of the proposed ARM scheme in terms of the average cell capacity and user fairness.

The Mobile Voting Scheme Providing Voting Fairness Assured by Candidates (후보자들에 의한 선거의 공정성을 제공하는 모바일 투표 기법)

  • Yun, Sung-Hyun
    • Journal of Digital Convergence
    • /
    • v.10 no.2
    • /
    • pp.161-169
    • /
    • 2012
  • It requires a lot of costs and manpower to manage the election system. The electronic voting scheme is needed to make the election system to be economic and fair. Especially, wide spread use of smart phones and wireless networks makes the mobile voting is of major concern. In mobile voting scheme, a smart phone user can vote regardless of the places. In this paper, the mobile voting scheme is proposed where candidates can guarantee fairness of the election system. We analyze mobile voting requirements and create the mobile ID which has legal binding forces and PKI based digital signature keys. In the proposed scheme, a voter's ballot is signed by all candidates using undeniable multi-signature scheme. During the counting stage, the multi-signature on the ballot is not verified without help of all candidates.

Adaptive Cooperative Spectrum Sharing Based on Fairness and Total Profit in Cognitive Radio Networks

  • Chen, Jian;Zhang, Xiao;Kuo, Yonghong
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.512-519
    • /
    • 2010
  • A cooperative model is presented to enable sharing of the spectrum with secondary users. Compared with the optimal model and competitive model, the cooperative model could reach the maximum total profit for secondary users with better fairness. The cooperative model is built based on the Nash equilibrium. Then a conceding factor is introduced so that the total spectrum required from secondary users will decrease. It also results in a decrease in cost which the primary user charges to the secondary users. The optimum solution, which is the maximum total profit for the secondary users, is called the collusion state. It is possible that secondary users may leave the collusion state to pursue the maximum of individual profit. The stability of the algorithm is discussed by introducing a vindictive factor to inhabit the motive of deviation. In practice, the number of secondary users may change. Adaptive methods have been used to deal with the changing number of secondary users. Both the total profit and fairness are considered in the spectrum allocating. The shared spectrum is 11.3893 with a total profit of 65.2378 in the competitive model. In the cooperative model, the shared spectrum is 8.5856 with the total profit of 73.4963. The numerical results reveal the effectiveness of the cooperative model.

The Effects of Customer Satisfaction Based on User Experience on Commitment, Loyalty and Repeated Use in Franchise and Chain Coffee Shops (프랜차이즈와 체인 커피전문점의 이용경험에 따른 고객만족이 몰입, 충성도, 반복적 이용에 미치는 영향)

  • Yang, Jeong-Yeong;Kim, Tae-Hee;Kim, Mi-Ja
    • Culinary science and hospitality research
    • /
    • v.19 no.5
    • /
    • pp.206-224
    • /
    • 2013
  • The purpose of this study was to examine the formation of customer's repeated use that is real long-term commitment in franchise/chain coffee shops. 457 effective samples were analyzed using PASW 18.0 and AMOS 18.0. The results of the analysis of the relationships between user experience, customer satisfaction, customer commitment and repeated use are as follows. First, it was presented that atmosphere, price fairness and coffee product quality had a positive impact on customer satisfaction. Second, customer satisfaction had a positive impact on customer commitment and repeated use. Finally, there was the mediating effect of continuous commitment between customer satisfaction and repeated use. Based on the results of the above analysis, the managerial implications for increasing repeated use of coffee shops are as follows. First, the strategy for enhancing performance of user experience is to try to improve atmosphere(facilities, ambient/lighting), price fairness, coffee product quality(taste, flavor, temperature). Second, the strategy for forming repeated use is to enhance customer commitment(affective commitment, continuous/normative commitment).

  • PDF

Implementation of proportional fair scheduler in OFDMA/TDMA wireless access networks (OFDMA/TDMA 시스템에서 PF 스케줄러의 구현)

  • Choi, Jin-Ghoo;Choi, Jin-Hee
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.4 no.2
    • /
    • pp.37-43
    • /
    • 2005
  • A simple scheduler satisfying the proportional fairness (PF) was introduced in wireless access networks and revealed that it can achieve a good compromise between total throughput and user fairness. Though it has received much attention for some time, its application was mainly restricted to the single channel systems. In this paper, we study how to implement the PF scheduler in the multi-channel environments such as OFDMA/TDMA. Besides the traditional PF-SC scheme, we propose a new PF-OPT scheme that is the genuine PF scheduler in a sense of maximizing the total log-utility of users. The simulation results show that PF-OPT gives large throughput under the heterogeneous subchannel statistics.

  • PDF

Packet Loss Fair Scheduling Scheme for Real-Time Traffic in OFDMA Systems

  • Shin, Seok-Joo;Ryu, Byung-Han
    • ETRI Journal
    • /
    • v.26 no.5
    • /
    • pp.391-396
    • /
    • 2004
  • In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.

  • PDF

ID-Based Optimistic Fair Exchange Scheme Based on RSA

  • Youn, Taek-Young;Chang, Ku-Young
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.673-681
    • /
    • 2014
  • Fairness of exchange is a significant property for secure online transactions, and a fair exchange scheme is a useful tool for ensuring the fairness of exchanges conducted over networks. In this paper, we propose an ID-based optimistic fair exchange scheme based on the RSA function, one which is designed by combining a well-known RSA-based signature scheme and the (naive) RSA function. Note that the main contribution of this paper is to give the first provably secure ID-based fair exchange scheme based on the RSA function, whose security can be proved under fully formalized security models. Our scheme has the following additional strongpoints. The scheme is setup-free; hence, there is no registration step between a user and an arbitrator. Moreover, the proposed scheme is designed in an ID-based setting; thus, it is possible to eliminate the need for certificates and avoid some related problems.