This paper studies the achievable spectral efficiency(SE)of downlink multiuser multiple-input-multiple-output(MIMO)system,where the base station(BS)is deployed an arbitrary finite antenna number and communicates simul...This paper studies the achievable spectral efficiency(SE)of downlink multiuser multiple-input-multiple-output(MIMO)system,where the base station(BS)is deployed an arbitrary finite antenna number and communicates simultaneously with many users. We assume that the BS has accurate channel state information(CSI)and adopt maximum ratio transmission(MRT)precoding. An accurate analytical result for the achievable SE is obtained. Based on the analytical result on the achievable SE,we further study the achievable energy efficiency(EE)of multiuser MIMO system by considering an energy consumption model. Results indicate that the increasing number of BS antennas can boost the achievable SE of system,whilst the achievable SE tends to a saturated rate in the high signal-tonoise ratios(SNR)regime. Furthermore,an important conclusion is that the increasing number of users is beneficial for the achievable EE and there is an optimal antenna number to maximize the EE of system.展开更多
Cooperation allows wireless network users to benefit from various gains such as an in- crease in the achieved rate or an improvement in the bit error rate. In the paper, we propose a distributed Hierarchical Game (HG...Cooperation allows wireless network users to benefit from various gains such as an in- crease in the achieved rate or an improvement in the bit error rate. In the paper, we propose a distributed Hierarchical Game (HG) theoretic framework over multi-user cooperative communication networks to stimulate cooperation and improve the network performance. First, we study a two- user decision making game in the OFDMA based subscriber cooperative relaying network, in which subscribers transmit their own data in the first phase, while helping to retransmit their partner's or choosing to freeride in the second phase. Instead of consulting to a global optimal solution, we decouple the cooperation resource allocation into two level subproblems: a user level Nash game for distributed cooperation decision and a Base Station (BS) level coalition game for centralized resource allocation. In the proposed HG algorithm, where mutual cooperation is preferred and total payoff is transferable, we prove it converges to a unique optimal equilibrium and resolve the subcarrier as-signment and power allocation among the couples. Besides, we discuss the existence of the publishing and rewarding coefficients in order to encourage cooperation. Then, we extend the HG to multi-user cases by coupling among subscribers according to the location information. The simulation results show that the proposed scheme with the distributed HG game achieves a well tradeoff between fairness and efficiency by improving the transmission efficiency of adverse users and outperforms those employing centralized schemes.展开更多
In the IEEE g02. 11 protocol, the adoption of the exponential backoff technique leads to throughput performance strongly dependent on the initial contention window size and, most importantly, on the number of contendi...In the IEEE g02. 11 protocol, the adoption of the exponential backoff technique leads to throughput performance strongly dependent on the initial contention window size and, most importantly, on the number of contending stations considered in the network. This paper proposes a simple but accurate method to dynamically estimate the number of contending stations in a wireless local area network ( WLAN ). Based on estimation, all the mobile stations dynamically adjust the initial contention window in medium access control ( MAC ) layer to avoid collisions. The simulation results show that the proposed algorithm can achieve efficient channel utilization, higher system throughput, and better fairness performance.展开更多
Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.To achieve better time efficiency in key establishment,we propose a Location-based Huffman(L-...Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.To achieve better time efficiency in key establishment,we propose a Location-based Huffman(L-Huffman) scheme.First,users are separated into several small groups to minimize communication cost when they are distributed over large networks.Second,both user's computation difference and message transmission delay are taken into consideration when Huffman coding is employed to forming the optimal key tree.Third,the combined weights in Huffman tree are located in a higher place of the key tree to reduce the variance of the average key generation time and minimize the longest key generation time.Simulations demonstrate that L-Huffman has much better performance in wide area networks and is a little better in local area network than Huffman scheme.展开更多
基金supported by the National Natural Science Foundation of China under Grants 61531011 and 61450110445the International Science and Technology Cooperation Program of China under Grant 2014DFT10300 and China Scholarship Council
文摘This paper studies the achievable spectral efficiency(SE)of downlink multiuser multiple-input-multiple-output(MIMO)system,where the base station(BS)is deployed an arbitrary finite antenna number and communicates simultaneously with many users. We assume that the BS has accurate channel state information(CSI)and adopt maximum ratio transmission(MRT)precoding. An accurate analytical result for the achievable SE is obtained. Based on the analytical result on the achievable SE,we further study the achievable energy efficiency(EE)of multiuser MIMO system by considering an energy consumption model. Results indicate that the increasing number of BS antennas can boost the achievable SE of system,whilst the achievable SE tends to a saturated rate in the high signal-tonoise ratios(SNR)regime. Furthermore,an important conclusion is that the increasing number of users is beneficial for the achievable EE and there is an optimal antenna number to maximize the EE of system.
基金Acknowledgements This work is supported by the National Natural Science Foundation of China under Grant No. 60971083, National High-Tech Research and Development Plan of China under Grant No. 2009AA01Z206 and National International Science and Technology Cooperation Project under Granted NO.2008DFA12090.
文摘Cooperation allows wireless network users to benefit from various gains such as an in- crease in the achieved rate or an improvement in the bit error rate. In the paper, we propose a distributed Hierarchical Game (HG) theoretic framework over multi-user cooperative communication networks to stimulate cooperation and improve the network performance. First, we study a two- user decision making game in the OFDMA based subscriber cooperative relaying network, in which subscribers transmit their own data in the first phase, while helping to retransmit their partner's or choosing to freeride in the second phase. Instead of consulting to a global optimal solution, we decouple the cooperation resource allocation into two level subproblems: a user level Nash game for distributed cooperation decision and a Base Station (BS) level coalition game for centralized resource allocation. In the proposed HG algorithm, where mutual cooperation is preferred and total payoff is transferable, we prove it converges to a unique optimal equilibrium and resolve the subcarrier as-signment and power allocation among the couples. Besides, we discuss the existence of the publishing and rewarding coefficients in order to encourage cooperation. Then, we extend the HG to multi-user cases by coupling among subscribers according to the location information. The simulation results show that the proposed scheme with the distributed HG game achieves a well tradeoff between fairness and efficiency by improving the transmission efficiency of adverse users and outperforms those employing centralized schemes.
基金Supported by National Natural Science Foundation of China ( No. 60472078) , and Cisco University Research Program Fund at Community Foundation Silicon Valley( No. 20029303 ).
文摘In the IEEE g02. 11 protocol, the adoption of the exponential backoff technique leads to throughput performance strongly dependent on the initial contention window size and, most importantly, on the number of contending stations considered in the network. This paper proposes a simple but accurate method to dynamically estimate the number of contending stations in a wireless local area network ( WLAN ). Based on estimation, all the mobile stations dynamically adjust the initial contention window in medium access control ( MAC ) layer to avoid collisions. The simulation results show that the proposed algorithm can achieve efficient channel utilization, higher system throughput, and better fairness performance.
基金Supported by National Basic Research and Development Program of China (2007CB307102)
文摘Time efficiency of key establishment and update is one of the major problems contributory key managements strive to address.To achieve better time efficiency in key establishment,we propose a Location-based Huffman(L-Huffman) scheme.First,users are separated into several small groups to minimize communication cost when they are distributed over large networks.Second,both user's computation difference and message transmission delay are taken into consideration when Huffman coding is employed to forming the optimal key tree.Third,the combined weights in Huffman tree are located in a higher place of the key tree to reduce the variance of the average key generation time and minimize the longest key generation time.Simulations demonstrate that L-Huffman has much better performance in wide area networks and is a little better in local area network than Huffman scheme.