• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.77-86
• /
• 2013

Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.134-147
• /
• 2009

Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3568-3584
• /
• 2016

In mobile opportunistic networks (MONs), human-carried mobile devices such as PDAs and smartphones, with the capability of short range wireless communications, could form various intermittent contacts due to the mobility of humans, and then could use the contact opportunity to communicate with each other. The dynamic changes of the network topology are closely related to the human mobility patterns. In this paper, we propose a social motivation-aware mobility model for MONs, which explains the basic laws of human mobility from the psychological point of view. We analyze and model social motivations of human mobility mainly in terms of expectancy value theory and affiliation motivation. Furthermore, we introduce a new concept of geographic functional cells, which not only incorporates the influence of geographical constraints on human mobility but also simplifies the complicated configuration of simulation areas. Lastly, we validate our model by simulating three real scenarios and comparing it with reality traces and other synthetic traces. The simulation results show that our model has a better match in the performance evaluation when applying social-based forwarding protocols like BUBBULE.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.340-350
• /
• 2016

The performance of large-scale cognitive radio (CR) networks with secondary users sustained by opportunistically harvesting radio-frequency (RF) energy from nearby primary transmissions is investigated. Using an advanced RF energy harvester, a secondary user is assumed to be able to collect ambient primary RF energy as long as it lies inside the harvesting zone of an active primary transmitter (PT). A variable power (VP) transmission mode is proposed, and an energy-based opportunistic spectrum access (OSA) strategy is considered, under which a secondary transmitter (ST) is allowed to transmit only if its harvested energy is larger than a predefined transmission threshold and it is outside the guard zones of all active PTs. The transmission probability of the STs is derived. The outage probabilities and the throughputs of the primary and the secondary networks, respectively, are characterized. Compared with prior work, the throughput can be increased by as much as 29%. The energy-based OSA strategy can be generally applied to a non-CR setup, where distributed power beacons (PBs) are deployed to power coexisting wireless signal transmitters (WSTs) in a wireless powered sensor network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.675-681
• /
• 2014

As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper studies interference mitigation methods for random-access small-cell networks. Although inter-cell interference between small random-access cells is one of the main factors to degrade overall performance, most of the previous works focused on interference mitigation between users in each cell. To address such limitation, dynamic opportunistic interference alignment is proposed exploiting statistical characteristics of random-access. It is demonstrated by simulation that the proposed scheme outperforms the previous approach as the number of cells or the number of users in each cell increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.389-405
• /
• 2014

Outdated Channel State Information (CSI) was proved to have negative effect on performance in two-way relay networks. The diversity order of widely used opportunistic relay selection (ORS) was degraded to unity in networks with outdated CSI. This paper proposed a multiple relay selection scheme for amplify-and-forward (AF) based two-way relay networks (TWRN) with outdated CSI. In this scheme, two sources exchange information through more than one relays. We firstly select N best relays out of all candidate relays with respect to signal-noise ratio (SNR). Then, the ratios of the SNRs on the rest of the candidate relays to that of the Nth highest SNR are tested against a normalized threshold ${\mu}{\in}[0,1]$, and only those relays passing this test are selected in addition to the N best relays. Expressions of outage probability, average bit error rate (BER) and ergodic channel capacity were obtained in closed-form for the proposed scheme. Numerical results and Simulations verified our theoretical analyses, and showed that the proposed scheme had significant gains comparing with conventional ORS.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.593-609
• /
• 2012

We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.104-114
• /
• 2009

In this paper, a technique is proposed that enables secondary users to evaluate channel availability in cognitive radio networks. Here, secondary users estimate the utilization of channels via predicting the traffic pattern of primary user, and select a proper channel for radio transmission. The proposed technique reduces the channel switching rate of secondary users (the rate of switching from one channel to another) and the interference on primary users, while maintaining a reasonable call blocking rate of secondary users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.924-927
• /
• 2016

In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.