• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.646-652
• /
• 2015

In this paper, the system-level performance is evaluated for the feedback scheme on the pre-coding matrix index (PMI) and channel quality indication (CQI), which are required for user selection in the multi-user MIMO system. Our analysis demonstrates that the number of users, the number of selected users, and codebook size are the key factors that govern the performance of the best companion grouping (BCG)-based user scheduling. Accordingly, we have confirmed that the probability of forming the co-scheduled user group is determined by these factors, which implies that the number of PMI's and codebook size can be dynamically determined so as to maximize the average system throughput as the number of users varies in the cell.

• Journal of Communications and Networks
• /
• v.11 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1817-1836
• /
• 2020

Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.892-901
• /
• 2016

In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.634-642
• /
• 2008

Radio wave is the valuable resources in $21^{st}$ century. It will be widely used in various applications such as DMB, USN, telematics, and home network as well as mobile and wireless communications. Cognitive Radio technology is devised to maximize the utilization of radio resources by sensing near-by spectrum and dynamic and allocating free resources dynamically and adaptively. Wireless links for the secondary user need to be frequently switched to idle frequencies during the transmission of multimedia data in the cognitive radio based system. This may cause delay and information loss, and QoS degradations occur inevitably. The efficient frequency allocation scheme is necessary to support the seamless multimedia service to the secondary user while maintaining QoS of the primary user. This paper suggests a frequency selection scheme which considers other parameters such as cell load, data rate, and available bandwidth than just received signal strength during the frequency selection process. The performance of our proposed scheme is analyzed by simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.11-18
• /
• 2018

To interact with a virtual object in immersive virtual environment, the target object should be selected quickly and accurately. Conventional 3D ray casting method using a direction of user's hand or head allows the user to select an object quickly. However, accuracy problem occurs when selecting an object using conventional methods among occlusion of objects. In this paper, we propose a region of interest based selection method that enables to select an object among occlusion of objects using a combination of gaze tracking and hand gesture recognition. When a user looks at a group of occlusion of objects, the proposed method recognizes user's gaze input, and then region of interest is set by gaze input. If the user wants to select an object among them, the user gives an activation hand gesture. Then, the proposed system relocates and visualizes all objects on a virtual active window. The user can select an object by a selecting hand gesture. Our experiment verified that the user can select an object correctly and accurately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.568-574
• /
• 2006

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths and predict the goal position and the path to the goal by observing the user's current moving path. We develop a spatiotemporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatiotemporal position is estimated. Through experiments we confirm this method is useful and effective.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1279-1286
• /
• 2021

This study suggests the user's needs for a smart parking service that enables parking lot search and advance reservation service, and is a study on the user's preference selection model related to fees (reservation fee, penalty fee), etc. Two types of user preference models in the form of logit models were constructed by composing a response questionnaire for smart parking service. The first is a model for selecting a smart parking lot, which suggests a situation in which the probability of selection is higher than that of a general parking lot in the relationship between usage fee and cost. The second is a parking ticket reservation discount selection model, and the smart parking service selection probability was analyzed through the relationship model between the reservation amount and the penalty. It can be used as a design requirement that enables sophisticated and various types of smart parking service considering users' preferences.