• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2233-2252
• /
• 2018

For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.

• International Journal of Advanced Culture Technology
• /
• 제9권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 %.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• 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.

• ETRI Journal
• /
• 제34권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.

• 한국정보통신학회논문지
• /
• 제18권10호
• /
• pp.2382-2388
• /
• 2014

인도어 무선 통신 시스템에서 무선 네트워크의 신뢰성 보장을 위하여, 갑작스런 네트워크 결함 문제의 발생을 신속하게 해결해야 한다. 본 논문에서는, 사용자들에게 끊김없는 연결성 제공을 위하여 적응적 자원관리 (ARM: Adaptive Resource Management) 기법을 제안한다. 시스템 용량 및 사용자 공평성을 동시에 고려하여, ARM 기법에서는 적응적으로 힐링 서브채널 세트를 결정하고, non-convex 최적화 문제를 기반으로 서브채널과 파워를 반복적으로 할당한다. 시뮬레이션을 통하여 평균 셀 용량과 사용자 공평성 관점에서 제안하는 기법의 우수성을 증명한다.

• 디지털융복합연구
• /
• 제10권2호
• /
• pp.161-169
• /
• 2012

선거 시스템을 관리하기 위해서는 많은 비용과 인력이 요구된다. 경제적이고 공정한 선거 시스템 구축을 위해서 전자 투표 기법의 접목은 필수적이다. 특히 스마트폰과 무선 인터넷 사용이 급증하면서 장소에 구애받지 않고 투표할 수 있는 모바일 투표에 대한 관심이 증대하고 있다. 본 논문에서는 후보자들에 의해서 선거의 공정성이 보장되는 모바일 투표 기법을 제안한다. 모바일 전자 투표를 위한 요구사항을 분석하고 법적 구속력이 있는 모바일 ID와 PKI 기반의 서명 키를 생성한다. 제안한 기법에서 투표권은 부인봉쇄 다중서명 기법을 적용하여 후보자들에 의해서 서명된다. 서명된 투표권은 개표 단계에서 모든 후보자들의 동의 없이는 검증할 수 없는 특성을 갖는다.

• ETRI Journal
• /
• 제32권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.

• 한국조리학회지
• /
• 제19권5호
• /
• pp.206-224
• /
• 2013

본 연구는 커피전문점 이용고객의 실질적인 장기적 몰입 상태인 반복적 이용의 형성 과정을 실증적으로 분석하기 위하여 수행되었다. 이를 위한 커피전문점에 대한 이용경험, 고객만족, 고객몰입, 반복적 이용 간의 인과관계를 분석하였으며, 연구표본은 수도권의 커피전문점을 주2회 이상 이용하는 고객들을 대상으로 하였으며, 표본 457부를 PASW 18.0과 AMOS 18.0을 이용하여 분석하였다. 분석 방법에 있어서는 신뢰성 및 타당성 검증, 탐색적 요인분석, 확인적 요인분석, 빈도분석, 구조방정식 모형검증, 매개효과분석을 실시하였다. 가설검증 결과 첫째, 커피전문점에 대한 이용경험 중 이용환경, 가격공정성, 커피상품품질이 고객만족에 유의한 정의 영향이 있었으며, 둘째, 고객만족은 고객몰입과 반복적 이용에 각각 유의한 정의 영향이 있었다. 셋째, 고객만족과 반복적 이용 간에도 고객몰입의 매개효과가 있는 것으로 나타났다. 이상의 가설검증결과를 바탕으로 커피전문점 이용고객들의 반복적 이용을 형성시키기 위한 관리적 시사점으로 커피전문점에 대한 이용경험의 제고전략과 고객몰입제고 전략을 제시하였다.

• 정보통신설비학회논문지
• /
• 제4권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.

• ETRI Journal
• /
• 제26권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.