For the realization of green communications in cognitive radio ad hoc networks(CRAHNs), selfadaptive and efficient power allocation for secondary users(SUs) is essential. With the distributed and timevarying network t...For the realization of green communications in cognitive radio ad hoc networks(CRAHNs), selfadaptive and efficient power allocation for secondary users(SUs) is essential. With the distributed and timevarying network topology, it needs to consider how to optimize the throughput and power consuming, avoid the interference to primary users(PUs) and other SUs, and pay attention to the convergence and fairness of the algorithm. In this study, this problem is modeled as a constraint optimization problem. Each SU would adjust its power and corresponding strategy with the goal of maximizing its throughput. By studying the interactions between SUs in power allocation and strategy selection, we introduce best-response dynamics game theory and prove the existence of Nash equilibrium(NE) point for performance analysis. We further design a fully distributed algorithm to make the SUs formulate their strategy based on their utility functions, the strategy and number of neighbors in local area. Compared with the water-filling(WF) algorithm, the proposed scheme can significantly increase convergent speed and average throughput, and decrease the power consuming of SUs.展开更多
As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels...As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.展开更多
基金the National Natural Science Foundation of China(No.61271182)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20120005120010)
文摘For the realization of green communications in cognitive radio ad hoc networks(CRAHNs), selfadaptive and efficient power allocation for secondary users(SUs) is essential. With the distributed and timevarying network topology, it needs to consider how to optimize the throughput and power consuming, avoid the interference to primary users(PUs) and other SUs, and pay attention to the convergence and fairness of the algorithm. In this study, this problem is modeled as a constraint optimization problem. Each SU would adjust its power and corresponding strategy with the goal of maximizing its throughput. By studying the interactions between SUs in power allocation and strategy selection, we introduce best-response dynamics game theory and prove the existence of Nash equilibrium(NE) point for performance analysis. We further design a fully distributed algorithm to make the SUs formulate their strategy based on their utility functions, the strategy and number of neighbors in local area. Compared with the water-filling(WF) algorithm, the proposed scheme can significantly increase convergent speed and average throughput, and decrease the power consuming of SUs.
文摘As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.
