The absence of network infrastructure and opportunistic spectrum access in cognitive radio ad hoc networks （CRAHNs） results in connectivity and stability problems. Clustering is known as an effective technique to ov...The absence of network infrastructure and opportunistic spectrum access in cognitive radio ad hoc networks （CRAHNs） results in connectivity and stability problems. Clustering is known as an effective technique to overcome this problem. Clustering improves network performance by implementing a logical network backbone. Therefore, how to efficiently construct this backbone among CRAHNs is of interest. In this paper, we propose a new clustering algorithm for CRAHNs. Moreover, we model a novel cluster head selection function based on the channel heterogeneity in term of transmission ranges. To the best of our knowledge, this is the first attempt to model the channel heterogeneity into the clustering formation in cognitive radio networks. Simulation results show that the performance of clustering is significantly improved by the channel heterogeneity considerations.展开更多
近年来,关于无线电Ad Hoc网络(Cognitive Radio Ad Hoc Networks,CRAHN)接入的研究较多。该文研究了基于竞争型(CP)和时隙分配型(CFP)两种机制混合的混合型MAC层接入机制,在EDCA机制的前提下,给出了在CP时段的帧突发机制(Frame Bursting...近年来,关于无线电Ad Hoc网络(Cognitive Radio Ad Hoc Networks,CRAHN)接入的研究较多。该文研究了基于竞争型(CP)和时隙分配型(CFP)两种机制混合的混合型MAC层接入机制,在EDCA机制的前提下,给出了在CP时段的帧突发机制(Frame Bursting EDCA,F-EDCA),通过仿真验证了所提基于帧突发机制的F-EDCA算法的优越性。该算法可提高系统性能,尤其是音频业务的Qo S性能。展开更多
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.展开更多
文摘The absence of network infrastructure and opportunistic spectrum access in cognitive radio ad hoc networks （CRAHNs） results in connectivity and stability problems. Clustering is known as an effective technique to overcome this problem. Clustering improves network performance by implementing a logical network backbone. Therefore, how to efficiently construct this backbone among CRAHNs is of interest. In this paper, we propose a new clustering algorithm for CRAHNs. Moreover, we model a novel cluster head selection function based on the channel heterogeneity in term of transmission ranges. To the best of our knowledge, this is the first attempt to model the channel heterogeneity into the clustering formation in cognitive radio networks. Simulation results show that the performance of clustering is significantly improved by the channel heterogeneity considerations.
文摘近年来,关于无线电Ad Hoc网络(Cognitive Radio Ad Hoc Networks,CRAHN)接入的研究较多。该文研究了基于竞争型(CP)和时隙分配型(CFP)两种机制混合的混合型MAC层接入机制,在EDCA机制的前提下,给出了在CP时段的帧突发机制(Frame Bursting EDCA,F-EDCA),通过仿真验证了所提基于帧突发机制的F-EDCA算法的优越性。该算法可提高系统性能,尤其是音频业务的Qo S性能。
基金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.
