Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems

In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and sensing measurement. The proposed solution achieves significant throughput gains and better user-fairness compared with the existing designs. Finally, we derived a simple and asymptotically optimal scheduling solution as well as the associated closed-form performance under the proportional fair scheduling for a large number of users. The system throughput is shown to be $\mathcal{O}\left(N(1-q_p)(1-q_p^N)\ln\ln K_c\right)$, where $K_c$ is the number of users in one cluster, $N$ is the number of subchannels and $q_p$ is the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSIN

Impact of Power Allocation and Antenna Directivity in the Capacity of a Multiuser Cognitive Ad Hoc Network

This paper studies the benefits that power control and antenna directivity can bring to the capacity of a multiuser cognitive radio network. The main objective is to optimize the secondary network sum rate under the capacity constraint of the primary network. Exploiting location awareness, antenna directivity, and the power control capability, the cognitive radio ad hoc network can broaden its coverage and improve capacity. Computer simulations show that by employing the proposed method the system performance is significantly enhanced compared to conventional fixed power allocation

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

This paper studies a spectrum sharing scenario between a cooperative relay network (CRN) and a nearby ad-hoc network. In particular, we consider a dynamic spectrum access and resource allocation problem of the CRN. Based on sensing and predicting the ad-hoc transmission behaviors, the ergodic traffic collision time between the CRN and ad-hoc network is minimized subject to an ergodic uplink throughput requirement for the CRN. We focus on real-time implementation of spectrum sharing policy under practical computation and signaling limitations. In our spectrum sharing policy, most computation tasks are accomplished off-line. Hence, little real-time calculation is required which fits the requirement of practical applications. Moreover, the signaling procedure and computation process are designed carefully to reduce the time delay between spectrum sensing and data transmission, which is crucial for enhancing the accuracy of traffic prediction and improving the performance of interference mitigation. The benefits of spectrum sensing and cooperative relay techniques are demonstrated by our numerical experiments.Comment: 5 pages, 3 figures, to appear in IEEE International Conference on Communications (ICC 2011

Optimal Real-time Spectrum Sharing between Cooperative Relay and Ad-hoc Networks

Optimization based spectrum sharing strategies have been widely studied. However, these strategies usually require a great amount of real-time computation and significant signaling delay, and thus are hard to be fulfilled in practical scenarios. This paper investigates optimal real-time spectrum sharing between a cooperative relay network (CRN) and a nearby ad-hoc network. Specifically, we optimize the spectrum access and resource allocation strategies of the CRN so that the average traffic collision time between the two networks can be minimized while maintaining a required throughput for the CRN. The development is first for a frame-level setting, and then is extended to an ergodic setting. For the latter setting, we propose an appealing optimal real-time spectrum sharing strategy via Lagrangian dual optimization. The proposed method only involves a small amount of real-time computation and negligible control delay, and thus is suitable for practical implementations. Simulation results are presented to demonstrate the efficiency of the proposed strategies.Comment: One typo in the caption of Figure 5 is correcte

Effect of Location Accuracy and Shadowing on the Probability of Non-Interfering Concurrent Transmissions in Cognitive Ad Hoc Networks

Cognitive radio ad hoc systems can coexist with a primary network in a scanning-free region, which can be dimensioned by location awareness. This coexistence of networks improves system throughput and increases the efficiency of radio spectrum utilization. However, the location accuracy of real positioning systems affects the right dimensioning of the concurrent transmission region. Moreover, an ad hoc connection may not be able to coexist with the primary link due to the shadowing effect. In this paper we investigate the impact of location accuracy on the concurrent transmission probability and analyze the reliability of concurrent transmissions when shadowing is taken into account. A new analytical model is proposed, which allows to estimate the resulting secure region when the localization uncertainty range is known. Computer simulations show the dependency between the location accuracy and the performance of the proposed topology, as well as the reliability of the resulting secure region