• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.4
• /
• pp.1-8
• /
• 2012

This paper presents a method for obtaining an exact average symbol error rate (ASER) of M-ary Phase Shift Keying (MPSK) for opportunistic amplify-and-forward (OAF) relay systems over Rayleigh fading channels. This is based on the relay selection probability when a relay is selected as the best one with respect to the received signal-to-noise ratio. We then derive the modified moment generating function (MGF) for OAF relay systems by taking the given relay selection probability into consideration. Based on the modified MGF, we derive the exact ASER which accurately explicates OAF relay system characteristics. Our results confirm that the derived ASER provides a tight upper bound for OAF relay systems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.4
• /
• pp.97-106
• /
• 2014

In this paper, we propose a design method to extend certain cognitive radio (CR) MAC protocols originally proposed only for the one hop applications in distributed CR networks to MANET routing protocols. Among several CR MAC protocols, the opportunistic MAC (called O-MAC) and the opportunistic period MAC (called OP-MAC) are considered, and AODV as MANET routing protocol is used. We implement the protocols using OPNET network simulator, and compare the performances in both MAC and AODV routing environments. With the experiments, we analyze the relationship between MAC and routing performances of the CR protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3867-3886
• /
• 2015

This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.6
• /
• pp.439-447
• /
• 2020

The study examines direct and indirect impacts of organizational commitment on employee motivation through two mediating factors - opportunistic behavior and knowledge sharing - in Vietnamese enterprises. The samples were selected by the non-probability sampling method followed convenient sampling, relatively stratified by localities in Vietnam. The sample size was 636 employees in Vietnamese enterprises. The number of collected online questionnaires was 379, while the number of valid questionnaires was 329. In the direct survey, the number of distributed questionnaires was 750, while the number of collected questionnaires was 421 and the number of valid questionnaires was 307. The total number of valid questionnaires used for analysis was 636. The study used quantitative methods with structural equation modeling analysis. The results indicate that among the components of organizational commitment, normative commitment has both direct and indirect impacts on employee motivation through two mediating factors: opportunistic behavior and knowledge sharing. Meanwhile, affective commitment has only an indirect impact on employee motivation through these mediating factors. Continuance commitment has both direct and indirect impacts; however, it has only an indirect impact on employee motivation through opportunistic behavior. In addition, the results show opportunistic behavior has a negative impact on the knowledge sharing of employees in enterprises.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.71-78
• /
• 2013

Recently, the opportunistic incremental relaying systems have been studied to improve the system performance effectively in wireless fading channel. Most of the performance analysis of the system includes a source-destination direct link. And there are few analysis which consider source-relay-destination indirect paths only. Therefore this paper proposes a transmission protocol which relays the source information using the selected relay from the partial channel information at the first stage in an opportunistic incremental relaying system. If the transmission fails, the selected best relay from the full channel information retransmits the information to the destination incrementally. The performance of the proposed system is derived analytically and verified from Monte Carlo simulation. The derived results can be applied to the system design and the performance estimation of the mobile systems and the bidirectional TV broadcasting systems which adapt an opportunistic incremental relaying system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1804-1810
• /
• 2013

In this paper, we study the opportunistic cooperation scheme that improves the outage performance through the efficient selection between a cooperative mode and a non-cooperative mode. Especially, in decode-and-forward relaying systems, we analyze the outage performance for the opportunistic cooperation using partial relay selection, where closed-form expressions of exact and asymptotic outage probabilities are derived assuming independent and identically distributed Rayleigh fading channels. In the numerical results, we verify the derived expressions, and investigate the outage performances for various target data rates and different numbers of relays. Also, we compare the outage performances of the conventional cooperation scheme and the opportunistic cooperation scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.10
• /
• pp.1254-1260
• /
• 2019

Recently, 5G cellular systems have been attracted great attention as a key enabler for Industry 4.0. In this paper, we propose a novel random access based on pilot-assisted opportunistic transmission to support internet-of-things (IoT) scenario in cellular networks. A key feature of our proposed scheme is to enable each of IoT devices to attempt opportunistic transmission of its data packet in Step 3 with randomly selected uplink pilot signal. Both the opportunistic transmission and the pilot randomization in Step 3 are effective to significantly mitigate the occurrence of packet collisions. We mathematically analyze our proposed scheme in terms of packet collision probability and uplink resource efficiency. Through simulations, we verify the validity of our analysis and evaluate the performance of our proposed scheme. Numerical results show that our proposed scheme outperforms other competitive schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1638-1643
• /
• 2019

In this paper, we propose an adaptive-perturbation-aided opportunistic precoding (APOP) scheme for multiple-input multiple-output (MIMO) systems. To update a precoding matrix in MIMO systems, the proposed algorithm produces a random perturbation in each time slot. Then the additional adaptive perturbation is also applied, which depends on the reports of achievable data-rates from users. If the prior random perturbation increased the data rate, the adaptive perturbation is set to be the same as the prior random perturbation, otherwise the negative value of the prior random perturbation is applied for adaptive perturbation. Furthermore, to enhance the achievable data rates, the information on the stored precoding matrices in the memory as well as the currently generated precoding matrix is used for scheduling. Simulation results show that compared to conventional opportunistic precoding schemes, higher data rates are achieved by the proposed APOP scheme, especially when there are a relatively small number of users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2675-2690
• /
• 2014

We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.