非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难...非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难以获得最优解的问题,构建了以D2D组和速率为优化目标的联合资源分配算法的方案:首先,在子信道分配上,将问题转换为双边匹配问题,提出了一种基于多对一场景下的D2D组信道分配算法;然后运用基于逐次凸逼近的凸差分(Difference of two Convex functions,DC)编程方法求出接近最优的功率分配值。仿真结果表明,提出的多对一场景下信道匹配算法在和速率上明显优于一对一场景下的信道匹配算法,提出的功率分配算法相比起对偶迭代算法更接近最优功率分配。展开更多
This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the...This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.展开更多
The tremendous performance gain of heterogeneous networks(Het Nets) is at the cost of complicated resource allocation. Considering information security, the resource allocation for Het Nets becomes much more challengi...The tremendous performance gain of heterogeneous networks(Het Nets) is at the cost of complicated resource allocation. Considering information security, the resource allocation for Het Nets becomes much more challenging and this is the focus of this paper. In this paper, the eavesdropper is hidden from the macro base stations. To relax the unpractical assumption on the channel state information on eavesdropper, a localization based algorithm is first given. Then a joint resource allocation algorithm is proposed in our work, which simultaneously considers physical layer security, cross-tier interference and joint optimization of power and subcarriers under fairness requirements. It is revealed in our work that the considered optimization problem can be efficiently solved relying on convex optimization theory and the Lagrangian dual decomposition method is exploited to solve the considered problem effectively. Moreover, in each iteration the closed-form optimal resource allocation solutions can be obtained based on the Karush-Kuhn-Tucker(KKT) conditions. Finally, the simulation results are given to show the performance advantages of the proposed algorithm.展开更多
The characteristics of underwater acoustic channel such as long propagation delay and low bit rate cause the MAC(Medium Access Control) protocols designed for radio channels to be either inapplicable,or have low effic...The characteristics of underwater acoustic channel such as long propagation delay and low bit rate cause the MAC(Medium Access Control) protocols designed for radio channels to be either inapplicable,or have low efficiency for UWSN(Underwater Sensor Network).We propose a hierarchical and distributed code assignment algorithm based on divisive probability function which can avoid conflict between spread codes with high probability,and provide a statebased MAC protocol for UWSN.Without RTS/CTS(Request To Send/Clear To Send) handshaking,each node maintains a neighbor table including state field,and packages are forwarded according to the state of the receiver,so it can avoid the interference caused by transmitting to a sending node in a half-duplex system and improve channel utilization.The design of power control minimizes the nearfar effect inherent in CDMA.Simulation results reveal that state-based CDMA protocol shows outstanding performance in throughput,delivery ratio and resource-consumption.展开更多
Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable si...Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable signal to interference plus noise ratio(SINR) loss constraint in cognitive transmission to protect primary users.Considering power allocation problem for cognitive users over flat fading channels,in order to maximize throughput of cognitive users subject to the allowable SINR loss constraint and maximum transmit power for each cognitive user,we propose a new power allocation algorithm.The comparison of computer simulation between our proposed algorithm and the algorithm based on interference power constraint is provided to show that it gets more throughput and provides stability to cognitive radio networks.展开更多
With its rapid development in the wireless markets, IEEE 802.11 WLAN is experiencing a huge popularity. However, due to the limitation of frequency bandwidth of WLANs, it is essential that the available radio resource...With its rapid development in the wireless markets, IEEE 802.11 WLAN is experiencing a huge popularity. However, due to the limitation of frequency bandwidth of WLANs, it is essential that the available radio resource should be fully utilized to offer different services to multiple users. In order to maximize system throughput while still guaranteeing the fairness among users, a proportional fairness based algorithm is proposed in this work. Since most of the previous resource allocation algorithms were simply based on the channel conditions without taking into account user's demand, in this paper, we introduce the theory of fuzzy synthetic evaluation(FSE) which also allows us to consider user's demand as an important factor. As such, the fairness among users can be improved based on different users' requirements for services. In addition, a channel state information based rate adaptation scheme is also proposed. Through simulation studies, the results clearly validate that our proposed scheme shows advantages on providing user fairness while still improving the system throughput.展开更多
Random Access Channel （RACH） is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless corrn...Random Access Channel （RACH） is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless corrnunication systel In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access （OFDMA） systen. Based on the PseudoBayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to irrprove the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.展开更多
文摘非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难以获得最优解的问题,构建了以D2D组和速率为优化目标的联合资源分配算法的方案:首先,在子信道分配上,将问题转换为双边匹配问题,提出了一种基于多对一场景下的D2D组信道分配算法;然后运用基于逐次凸逼近的凸差分(Difference of two Convex functions,DC)编程方法求出接近最优的功率分配值。仿真结果表明,提出的多对一场景下信道匹配算法在和速率上明显优于一对一场景下的信道匹配算法,提出的功率分配算法相比起对偶迭代算法更接近最优功率分配。
基金supported in part by the National Natural Science Foundation under Grant No.61072069National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2012ZX03003012
文摘This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.
基金supported by the National Natural Science Foundation of China under Grant No.61371075the 863 project SS2015AA011306
文摘The tremendous performance gain of heterogeneous networks(Het Nets) is at the cost of complicated resource allocation. Considering information security, the resource allocation for Het Nets becomes much more challenging and this is the focus of this paper. In this paper, the eavesdropper is hidden from the macro base stations. To relax the unpractical assumption on the channel state information on eavesdropper, a localization based algorithm is first given. Then a joint resource allocation algorithm is proposed in our work, which simultaneously considers physical layer security, cross-tier interference and joint optimization of power and subcarriers under fairness requirements. It is revealed in our work that the considered optimization problem can be efficiently solved relying on convex optimization theory and the Lagrangian dual decomposition method is exploited to solve the considered problem effectively. Moreover, in each iteration the closed-form optimal resource allocation solutions can be obtained based on the Karush-Kuhn-Tucker(KKT) conditions. Finally, the simulation results are given to show the performance advantages of the proposed algorithm.
基金supported by the Program for New Century Excellent Talents in University of China(NCET-11-1025)the NationalNatural Science Foundation of China(No.61162003,61163050,6126104)+1 种基金Qinghai office of science and technology(grant No.2012-Z-902)the Natural Science Foundation of Tianjin(No.10JCYBJC00600)
文摘The characteristics of underwater acoustic channel such as long propagation delay and low bit rate cause the MAC(Medium Access Control) protocols designed for radio channels to be either inapplicable,or have low efficiency for UWSN(Underwater Sensor Network).We propose a hierarchical and distributed code assignment algorithm based on divisive probability function which can avoid conflict between spread codes with high probability,and provide a statebased MAC protocol for UWSN.Without RTS/CTS(Request To Send/Clear To Send) handshaking,each node maintains a neighbor table including state field,and packages are forwarded according to the state of the receiver,so it can avoid the interference caused by transmitting to a sending node in a half-duplex system and improve channel utilization.The design of power control minimizes the nearfar effect inherent in CDMA.Simulation results reveal that state-based CDMA protocol shows outstanding performance in throughput,delivery ratio and resource-consumption.
基金ACKNOWLEDGEMENTS This work is supported by National Natural Science Foundation of China （No. 61171079）. The authors would like to thank the editors and the anonymous reviewers for their detailed constructive comments that helped to improve the presentation of this paper.
文摘Most resource allocation algorithms are based on interference power constraint in cognitive radio networks.Instead of using conventional primary user interference constraint,we give a new criterion called allowable signal to interference plus noise ratio(SINR) loss constraint in cognitive transmission to protect primary users.Considering power allocation problem for cognitive users over flat fading channels,in order to maximize throughput of cognitive users subject to the allowable SINR loss constraint and maximum transmit power for each cognitive user,we propose a new power allocation algorithm.The comparison of computer simulation between our proposed algorithm and the algorithm based on interference power constraint is provided to show that it gets more throughput and provides stability to cognitive radio networks.
基金partially supported by the Academy of Finland (Decision No. 284748, 288473)
文摘With its rapid development in the wireless markets, IEEE 802.11 WLAN is experiencing a huge popularity. However, due to the limitation of frequency bandwidth of WLANs, it is essential that the available radio resource should be fully utilized to offer different services to multiple users. In order to maximize system throughput while still guaranteeing the fairness among users, a proportional fairness based algorithm is proposed in this work. Since most of the previous resource allocation algorithms were simply based on the channel conditions without taking into account user's demand, in this paper, we introduce the theory of fuzzy synthetic evaluation(FSE) which also allows us to consider user's demand as an important factor. As such, the fairness among users can be improved based on different users' requirements for services. In addition, a channel state information based rate adaptation scheme is also proposed. Through simulation studies, the results clearly validate that our proposed scheme shows advantages on providing user fairness while still improving the system throughput.
基金Acknowledgements This paper was supported by the National Natural Science Foundation of China under Cants No.60971125, No.61121001 the National Key Project under Cant No. 2011ZX03005-005+2 种基金 the project under Cant No. 201105.Acknowledgements This paper was supported by the National Natural Science Foundation of China under Crants No.60971125, No.61121001 the National Key Project under Cant No. 2011ZX03005-005 the project under Cant No. 201105.
文摘Random Access Channel （RACH） is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless corrnunication systel In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access （OFDMA） systen. Based on the PseudoBayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to irrprove the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.
