Abstract

In this paper, we investigate the cross-layer optimization problem of congestion and power control in cognitive radio ad hoc networks (CRANETs) under predictable contact constraint. To measure the uncertainty of contact between any pair of secondary users (SUs), we construct the predictable contact model by attaining the probability distribution of contact. In particular, we propose a distributed cross-layer optimization framework achieving the joint design of hop-by-hop congestion control (HHCC) in the transport layer and per-link power control (PLPC) in the physical layer for upstream SUs. The PLPC and the HHCC problems are further formulated as two noncooperative differential game models by taking into account the utility function maximization problem and the linear differential equation constraint with regard to the aggregate power interference to primary users (PUs) and the congestion bid for a bottleneck SU. In addition, we obtain the optimal transmit power and the optimal data rate of upstream SUs by taking advantage of dynamic programming and maximum principle, respectively. The proposed framework can balance transmit power and data rate among upstream SUs while protecting active PUs from excessive interference. Finally, simulation results are presented to demonstrate the effectiveness of the proposed framework for congestion and power control by jointly optimizing the PLPC-HHCC problem simultaneously.

Highlights

  • 1.1 Background and motivation Cognitive radio (CR) [1] has been widely recognized as a critical technique to mitigate the spectrum scarcity problem and enhance the overall efficiency of spectrum usage, aiming to accommodate for the evolution of wireless systems towards 5G [2]

  • This figure clearly depicts that an increased discount factor from 0.1 to 0.9 will increase the optimal transmit power of each flow under the optimal transmit power update (OTPU) algorithm

  • This is due to the fact that the optimal transmit power of each flow via the distributed constrained power control (DCPC) algorithm converges to an expected equilibrium point after 300 iterations

Read more

Summary

Introduction

1.1 Background and motivation Cognitive radio (CR) [1] has been widely recognized as a critical technique to mitigate the spectrum scarcity problem and enhance the overall efficiency of spectrum usage, aiming to accommodate for the evolution of wireless systems towards 5G [2]. Other recent schemes that exploit the cross-layer interaction information try to deal with congestion control problem in decentralized CRNs from a crosslayer design perspective The objective of these schemes is to improve the overall network utility while protecting active PUs’ communications from excessive interference introduced by SUs. In [29], Cammarano et al presented a distributed cross-layer framework for joint optimization of MAC, scheduling, routing, and congestion control in CRAHNs, by maximizing the throughput of a set of multi-hop end-to-end packet flows. In [31], Nguyen et al further devised an optimization framework achieving trade-off between energy efficiency and network utility maximization for CRAHNs. By adjusting transmit power, persistence probability, and data rate simultaneously via the interaction between MAC and other layers, the proposed framework can jointly balance interference, collision, and congestion among SUs both of the frameworks in [30, 31] fail to take into account the impact of predictable contact or priori available contact between any pair of SUs on overall cross-layer performance.

Network model
Predictable contact model
CCCA ð36Þ
Power controller in the physical layer
Rate controller in the transport layer
Simulation results
Results
Optimal data rate performance of ODRU algorithm
Conclusions
Proof of Proposition 1
10 Appendix 3
11 Appendix 4
12 Appendix 5
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.