The subcarrier allocation problem in cognitive radio(CR)networks with multi-user orthogonal frequency-division multiplexing(OFDM)and distributed antenna is analyzed and modeled for the flat fading channel and the ...The subcarrier allocation problem in cognitive radio(CR)networks with multi-user orthogonal frequency-division multiplexing(OFDM)and distributed antenna is analyzed and modeled for the flat fading channel and the frequency selective channel,where the constraint on the secondary user(SU)to protect the primary user(PU)is that the total throughput of each PU must be above the given threshold instead of the "interference temperature".According to the features of different types of channels,the optimal subcarrier allocation schemes are proposed to pursue efficiency(or maximal throughput),using the branch and bound algorithm and the 0-1 implicit enumeration algorithm.Furthermore,considering the tradeoff between efficiency and fairness,the optimal subcarrier allocation schemes with fairness are proposed in different fading channels,using the pegging algorithm.Extensive simulation results illustrate the significant performance improvement of the proposed subcarrier allocation schemes compared with the existing ones in different scenarios.展开更多
Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allo...Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.展开更多
In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple ...In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.展开更多
The pursuit of high data rate and assurance of quality of experience(QoE) for end users represent the main goals of future wireless communication systems.By introducing MOS(Mean Opinion Score) based assessment models ...The pursuit of high data rate and assurance of quality of experience(QoE) for end users represent the main goals of future wireless communication systems.By introducing MOS(Mean Opinion Score) based assessment models for different types of applications,this paper proposed novel QoE-oriented radio resource allocation(RRA) algorithms for multiuser-multiservice femtocell networks.An optimal QoE-oriented RRA strategy is first analyzed using time-sharing method which is applicable to best effort applications.RRA algorithms based on the cross-layer architecture are then proposed for all types of applications by considering parameters extracted from different layers of networking protocols.In the proposed algorithms,a priority mechanism is employed to ensure fairness.Simulation results show that the proposed algorithms can significantly improve the overall perceived quality from the users' perspective in comparison with traditional Quality of Service(QoS)oriented algorithms.展开更多
Resource allocation is an important problem in ubiquitous network. Most of the existing resource allocation methods considering only wireless networks are not suitable for the ubiquitous network environment, and they ...Resource allocation is an important problem in ubiquitous network. Most of the existing resource allocation methods considering only wireless networks are not suitable for the ubiquitous network environment, and they will harm the interest of individual users with instable resource requirements. This paper considers the multi-point video surveillance scenarios in a complex network environment with both wired and wireless networks. We introduce the utility estimated by the total costs of an individual network user. The problem is studied through mathematical modeling and we propose an improved problem-specific branch-and-cut algorithm to solve it. The algorithm follows the divide-and-conquer principle and fully considers the duality feature of network selection. The experiment is conducted by simulation through C and Lingo. And it shows that compared with a centralized random allocation scheme and a cost greed allocation scheme, the proposed scheme has better per- formance of reducing the total costs by 13.0% and 30.6% respectively for the user.展开更多
基金The National Natural Science Foundation of China(No.60832009)Beijing Municipal Natural Science Foundation(No.4102044)National Major Science & Technology Project(No.2009ZX03003-003-01)
文摘The subcarrier allocation problem in cognitive radio(CR)networks with multi-user orthogonal frequency-division multiplexing(OFDM)and distributed antenna is analyzed and modeled for the flat fading channel and the frequency selective channel,where the constraint on the secondary user(SU)to protect the primary user(PU)is that the total throughput of each PU must be above the given threshold instead of the "interference temperature".According to the features of different types of channels,the optimal subcarrier allocation schemes are proposed to pursue efficiency(or maximal throughput),using the branch and bound algorithm and the 0-1 implicit enumeration algorithm.Furthermore,considering the tradeoff between efficiency and fairness,the optimal subcarrier allocation schemes with fairness are proposed in different fading channels,using the pegging algorithm.Extensive simulation results illustrate the significant performance improvement of the proposed subcarrier allocation schemes compared with the existing ones in different scenarios.
基金supported by National Natural Science Foundation of China under Grants No. 61371087 and 61531013The Research Fund of Ministry of Education-China Mobile (MCM20150102)
文摘Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.
基金Project(61471194)supported by the National Natural Science Foundation of ChinaProject(BK20140828)supported by the Natural Science Foundation of Jiangsu Province,ChinaProject supported by the Scientific Research Foundation for the Returned Overseas Chinese Scholars,Ministry of Education,China
文摘In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.
基金supported in part by the National Nature Science Foundation of China under Grant 61372117the 863 project under grant No.2014AA01A701the National Key Technology Support Program under grant No.2012BAH41F03
文摘The pursuit of high data rate and assurance of quality of experience(QoE) for end users represent the main goals of future wireless communication systems.By introducing MOS(Mean Opinion Score) based assessment models for different types of applications,this paper proposed novel QoE-oriented radio resource allocation(RRA) algorithms for multiuser-multiservice femtocell networks.An optimal QoE-oriented RRA strategy is first analyzed using time-sharing method which is applicable to best effort applications.RRA algorithms based on the cross-layer architecture are then proposed for all types of applications by considering parameters extracted from different layers of networking protocols.In the proposed algorithms,a priority mechanism is employed to ensure fairness.Simulation results show that the proposed algorithms can significantly improve the overall perceived quality from the users' perspective in comparison with traditional Quality of Service(QoS)oriented algorithms.
基金Supported by the National Science and Technology Major Project (No.2011ZX03005-004-04)the National Grand Fundamental Research 973 Program of China (No.2011CB302-905)+2 种基金the National Natural Science Foundation of China (No.61170058,61272133,and 51274202)the Research Fund for the Doctoral Program of Higher Education of China (No.20103402110041)the Suzhou Fundamental Research Project (No.SYG201143)
文摘Resource allocation is an important problem in ubiquitous network. Most of the existing resource allocation methods considering only wireless networks are not suitable for the ubiquitous network environment, and they will harm the interest of individual users with instable resource requirements. This paper considers the multi-point video surveillance scenarios in a complex network environment with both wired and wireless networks. We introduce the utility estimated by the total costs of an individual network user. The problem is studied through mathematical modeling and we propose an improved problem-specific branch-and-cut algorithm to solve it. The algorithm follows the divide-and-conquer principle and fully considers the duality feature of network selection. The experiment is conducted by simulation through C and Lingo. And it shows that compared with a centralized random allocation scheme and a cost greed allocation scheme, the proposed scheme has better per- formance of reducing the total costs by 13.0% and 30.6% respectively for the user.