Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity.We present a dynamic and efficient algorithm via conflict shifting,referred as Shifting-base...Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity.We present a dynamic and efficient algorithm via conflict shifting,referred as Shifting-based Channel Assignment(SCA).In this algorithm,the system was modeled with a conflict graph,and users cannot assign the channels that primary users(legacy users) and neighbors already occupied.In order to eliminate the conflicts between neighbors efficiently,secondary users(unlicensed users) try to transfer them through a straight path to the boundary,where conflicts are easier to solve as there are less neighbors for boundary users.Actions in one shift are executed in slots,and users act in a synchronous and separated manner.As a result,some of the conflicting channels are avoid from directly abandoned,and for this,utility of the entire network can be improved.Simulation results show that the proposed algorithm can provide similar utility performance while obviously reducing the communication cost than bargaining-base algorithms.In small scale networks with low user mobility(under 20%),it reduces 50% of the communication overhead than the later.展开更多
A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video tra...A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user's( PU's) collision limitations,non-synchronization between SU and PU,and SU's limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU's constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU's statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60832007)the National Hi-Tech Research and Development Plan of China (No. 2009AA011801)
文摘Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity.We present a dynamic and efficient algorithm via conflict shifting,referred as Shifting-based Channel Assignment(SCA).In this algorithm,the system was modeled with a conflict graph,and users cannot assign the channels that primary users(legacy users) and neighbors already occupied.In order to eliminate the conflicts between neighbors efficiently,secondary users(unlicensed users) try to transfer them through a straight path to the boundary,where conflicts are easier to solve as there are less neighbors for boundary users.Actions in one shift are executed in slots,and users act in a synchronous and separated manner.As a result,some of the conflicting channels are avoid from directly abandoned,and for this,utility of the entire network can be improved.Simulation results show that the proposed algorithm can provide similar utility performance while obviously reducing the communication cost than bargaining-base algorithms.In small scale networks with low user mobility(under 20%),it reduces 50% of the communication overhead than the later.
基金National Natural Science Foundation of China(No.61301101)
文摘A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user's( PU's) collision limitations,non-synchronization between SU and PU,and SU's limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU's constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU's statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.
