This page has only limited features, please log in for full access.
Wanguo Jiao received a B.S. degree in network engineering from Shijiazhuang Tiedao University, Shijiazhuang, China, in 2009, and a Ph.D. degree in telecommunication engineering from Xidian University, Xi'an, China, in September 2015. Since 2015, she has been with the College of Information Science and Technology, Nanjing Forestry University, where she is currently an Associate Professor. Her research interests include the performance analysis and protocol design of multi-hop wireless networks, cognitive radio networks, and wireless sensor networks.
In wireless rechargeable sensor networks, mobile vehicles (MVs) combining energy replenishment and data collection are studied extensively. To reduce data overflow, most recent work has utilized more vehicles to assist the MV to collect buffered data. However, the practical network environment and the limitations of the vehicle in the data collection are not considered. UAV-enabled data collection is immune to complex road environments in remote areas and has higher speed and less traveling cost, which can overcome the lack of the vehicle in data collection. In this paper, a novel framework joining the MV and UAV is proposed to prolong the network lifetime and reduce data overflow. The network lifetime is correlated with the charging order; therefore, we first propose a charging algorithm to find the optimal charging order. During the charging period of the MV, the charging time may be longer than the collecting time. An optimal selection strategy of neighboring clusters, which could send data to the MV, was found to reduce data overflow. Then, to further reduce data overflow, an algorithm is also proposed to schedule the UAV to assist the MV to collect buffered data. Finally, simulation results verified that the proposed algorithms can maximize network lifetime and minimize the data loss simultaneously.
Mengqiu Tian; Wanguo Jiao; Yaqian Chen. A Joint Energy Replenishment and Data Collection Strategy in Heterogeneous Wireless Rechargeable Sensor Networks. Sensors 2021, 21, 2930 .
AMA StyleMengqiu Tian, Wanguo Jiao, Yaqian Chen. A Joint Energy Replenishment and Data Collection Strategy in Heterogeneous Wireless Rechargeable Sensor Networks. Sensors. 2021; 21 (9):2930.
Chicago/Turabian StyleMengqiu Tian; Wanguo Jiao; Yaqian Chen. 2021. "A Joint Energy Replenishment and Data Collection Strategy in Heterogeneous Wireless Rechargeable Sensor Networks." Sensors 21, no. 9: 2930.
The utilization of mobile wireless charging vehicles (WCVs) is a promising solution to address the problem of the energy shortage in wireless rechargeable sensor networks. Most existing works just scheduled WCVs to replenish energy to keep the continuous operation of the network, without taking any action on sensor nodes. In this paper, an interesting idea occurs to us, can we achieve this goal through scheduling WCVs and sensor nodes simultaneously? Define such scheme as the charging strategy combined with the node sleep mechanism. Note that when sensor node only senses data, the energy consumption will be reduced significantly. We then propose a novel charging model, schedule sensor node whose energy cannot keep it alive before getting charged to go into the sleep mode. Therefore, more energy can be saved and the corresponding residual lifetime can be improved. Under the proposed charging model, two problems are formulated, which are (i) maximizing the lifetime of the network combining with the node sleep mechanism and (ii) minimizing the travel path while the network lifetime can be ensured. Efficient algorithms are also proposed to address these problems. First, considering the residual lifetime, the importance in the connectivity and the coverage of the network comprehensively, to maximize the network lifetime, an efficient charging algorithm is proposed to schedule WCVs with limited energy to charge sensor nodes and schedule some appropriate sensor nodes to be in sleep. After determining the trajectories of WCVs, considering the travel cost, a minimum travel path algorithm is further proposed. Through rearranging the charging sequence of sensor nodes, the travel distance can be optimized. Finally, our algorithms are verified by MATLAB. The simulation results show that proposed algorithms are very promising.
Mengqiu Tian; Wanguo Jiao; Guozhong Shen. The Charging Strategy Combining with The Node Sleep Mechanism in The Wireless Rechargeable Sensor Network. IEEE Access 2020, 8, 1 -1.
AMA StyleMengqiu Tian, Wanguo Jiao, Guozhong Shen. The Charging Strategy Combining with The Node Sleep Mechanism in The Wireless Rechargeable Sensor Network. IEEE Access. 2020; 8 ():1-1.
Chicago/Turabian StyleMengqiu Tian; Wanguo Jiao; Guozhong Shen. 2020. "The Charging Strategy Combining with The Node Sleep Mechanism in The Wireless Rechargeable Sensor Network." IEEE Access 8, no. : 1-1.
In the wireless sensor network, the lifetime of the network can be prolonged by improving the efficiency of limited energy. Existing works achieve better energy utilization, either through node scheduling or routing optimization. In this paper, an efficient solution combining node scheduling with routing protocol optimization is proposed in order to improve the network lifetime. Firstly, to avoid the redundant coverage, a node scheduling scheme that is based on a genetic algorithm is proposed to find the minimum number of sensor nodes to monitor all target points. Subsequently, the algorithm prolongs the lifetime of the network through choosing redundant sleep nodes to replace the dead node. Based on the obtained minimum coverage set, a new routing protocol, named Improved-Distributed Energy-Efficient Clustering (I-DEEC), is proposed. When considering the energy and the distance of the sensor node to the sink, a new policy choosing the cluster head is proposed. To make the energy load more balanced, uneven clusters are constructed. Meanwhile, the data communication way of sensor nodes around the sink is also optimized. The simulation results show that the proposed sensor node scheduling algorithm can reduce the number of redundant sensor nodes, while the I-DEEC routing protocol can improve the energy efficiency of data transmission. The lifetime of the network is greatly extended.
Yun Xu; Wanguo Jiao; Mengqiu Tian. Energy-Efficient Connected-Coverage Scheme in Wireless Sensor Networks. Sensors 2020, 20, 6127 .
AMA StyleYun Xu, Wanguo Jiao, Mengqiu Tian. Energy-Efficient Connected-Coverage Scheme in Wireless Sensor Networks. Sensors. 2020; 20 (21):6127.
Chicago/Turabian StyleYun Xu; Wanguo Jiao; Mengqiu Tian. 2020. "Energy-Efficient Connected-Coverage Scheme in Wireless Sensor Networks." Sensors 20, no. 21: 6127.
By utilizing solar energy, the wireless sensor network has the potential to survive longer. However, the solar energy is varying with the time and is susceptible to the surrounding. How to effectively manage the dynamic harvested energy is important for the solar-powered wireless sensor network. In this paper, we design an energy scheduling for the wireless sensor network which consists of fewer sensors powered by the solar energy. First, to effectively cover targets and reduce coverage cost, we design a new node deployment scheme which can reduce required sensors while guarantees target coverage. Then, based on this deployment, we propose a node scheduling algorithm to improve network lifetime. Through choosing relays and dynamically adjusting the role of the sensor with different energy levels, the harvested energy can be utilized effectively, and the network lifetime is prolonged. The simulation results verify that our proposed scheme can prolong the network lifetime while requires fewer sensors to achieve the coverage requirement.
Wanguo Jiao; Xin Zhang; Hao Wang. A Novel Node Scheduling Algorithm for Solar-Powered Wireless Sensor Networks. Blockchain Technology and Innovations in Business Processes 2020, 19 -28.
AMA StyleWanguo Jiao, Xin Zhang, Hao Wang. A Novel Node Scheduling Algorithm for Solar-Powered Wireless Sensor Networks. Blockchain Technology and Innovations in Business Processes. 2020; ():19-28.
Chicago/Turabian StyleWanguo Jiao; Xin Zhang; Hao Wang. 2020. "A Novel Node Scheduling Algorithm for Solar-Powered Wireless Sensor Networks." Blockchain Technology and Innovations in Business Processes , no. : 19-28.
Energy shortage obstructs the applications of the wireless rechargeable sensor network (WRSN). With the development of the wireless energy transfer technology, the mobile wireless charging vehicle (WCV) becomes a promising solution to solve that problem. However, the importance of different sensor nodes in the data transmission and uneven energy consumptions are often ignored. In this paper, the charging strategy of the WCV is studied in the WRSN considering these two phenomena. According to the importance of the sensor node, which is associated with the distance to the base station, we divide sensor nodes into two types: sensor nodes in ring 0 and sensor nodes in outer ring. We propose a novel charging model, the WCV adopts different charging strategies for different sensor nodes. To make the charging more efficient the WCV charges sensor nodes one by one in ring 0 first and then charges multiple sensor nodes simultaneously in outer ring. To estimate the lifetime of the network, a new metric named as the normalized dead time is proposed. Maximizing the lifetime of the network is modeled as minimizing the sum normalized dead time, and an efficient algorithm is proposed to minimize the sum normalized dead time through searching the optimal charging timeslots sequences. Then, through reassigning charging timeslots of sensor nodes, the proposed minimum travel cost algorithm minimizes the travel distance of the WCV and guarantee the lifetime of the network. We further deploy a cluster head node which has larger battery capacity in each cluster and can charge other sensor nodes within a limited distance. An algorithm is proposed to pre-distribute energy of the cluster head node. At last, the performance of proposed algorithms is verified by MATLAB. The results indicate that the performance of the WRSN can be improved by our proposed algorithms.
Mengqiu Tian; Wanguo Jiao; Jiaming Liu. The Charging Strategy of Mobile Charging Vehicles in Wireless Rechargeable Sensor Networks With Heterogeneous Sensors. IEEE Access 2020, 8, 73096 -73110.
AMA StyleMengqiu Tian, Wanguo Jiao, Jiaming Liu. The Charging Strategy of Mobile Charging Vehicles in Wireless Rechargeable Sensor Networks With Heterogeneous Sensors. IEEE Access. 2020; 8 (99):73096-73110.
Chicago/Turabian StyleMengqiu Tian; Wanguo Jiao; Jiaming Liu. 2020. "The Charging Strategy of Mobile Charging Vehicles in Wireless Rechargeable Sensor Networks With Heterogeneous Sensors." IEEE Access 8, no. 99: 73096-73110.
Recently, wireless energy transfer technology becomes a popular way to address energy shortage in wireless sensor networks. The capacity of the mobile wireless charging car (WCV) and the wireless channel between the WCV and the sensor are two important factors influencing the energy efficiency of the wireless sensor network, which has not been well considered. In this paper, we study the energy efficiency of a wireless rechargeable sensor network charged by a finite capacity WCV through an imperfect wireless channel. To estimate the energy efficiency, we first propose a new metric named waste rate, which is defined as a function of the charging channel quality. Then, energy efficiency optimization is modeled as minimizing the waste rate. Through optimizing the distance between the WCV and sensor nodes, the set of optimal charging sensor nodes is obtained. By using the Hamiltonian circle, the nearest neighbor algorithm is proposed to find the traveling path of the WCV. Furthermore, to avoid the untimely death of sensor nodes and the coverage hole, an extended node dynamic replacement strategy is proposed. The simulation results show that the proposed method can reduce the waste rate and the total charging time; i.e., the sum of traveling time and charging delay can be significantly reduced, which indicates that the proposed algorithm can improve the energy efficiency of the network.
Mengqiu Tian; Wanguo Jiao; Jiaming Liu; Siyuan Ma. A Charging Algorithm for the Wireless Rechargeable Sensor Network with Imperfect Charging Channel and Finite Energy Storage. Sensors 2019, 19, 3887 .
AMA StyleMengqiu Tian, Wanguo Jiao, Jiaming Liu, Siyuan Ma. A Charging Algorithm for the Wireless Rechargeable Sensor Network with Imperfect Charging Channel and Finite Energy Storage. Sensors. 2019; 19 (18):3887.
Chicago/Turabian StyleMengqiu Tian; Wanguo Jiao; Jiaming Liu; Siyuan Ma. 2019. "A Charging Algorithm for the Wireless Rechargeable Sensor Network with Imperfect Charging Channel and Finite Energy Storage." Sensors 19, no. 18: 3887.
In the MIMO broadcasting system, channel state information (CSI) is often used for data detection at the receiver or preprocessing techniques such as the power control and user scheduling at the transmitter and hence, the study of its acquisition is important. Usually, the CSI can be obtained by the training-based channel estimation. Assuming that the users have the channels' statistical information and adopt the minimum mean-square-error (MMSE) receivers, this paper studies how to design an optimal training sequence to minimize the total weighted mean square error (MSE) of channel estimation. Following this objective, we formulate this problem as a positive semidefinite problem (SDP) with two constraints, and further transform it into a dual problem. In the solving process of the dual problem, we model it as an optimization problem on the positive definite matrix manifold and solve it by use of the iterative geodesic equation on the matrix manifold. The convergence and correctness of the proposed method are demonstrated by computer simulation; the effects of key system parameters on the weighted MSE are also investigated. Under various system configurations, the superiority of the proposed method is shown by comparing with a few other existing schemes.
Wen Zhou; Xutao Li; Junjuan Xia; Wanguo Jiao; Min Hua. Optimal Pilot Design for MIMO Broadcasting Systems Based on the Positive Definite Matrix Manifold. IEEE Access 2019, 7, 99589 -99601.
AMA StyleWen Zhou, Xutao Li, Junjuan Xia, Wanguo Jiao, Min Hua. Optimal Pilot Design for MIMO Broadcasting Systems Based on the Positive Definite Matrix Manifold. IEEE Access. 2019; 7 ():99589-99601.
Chicago/Turabian StyleWen Zhou; Xutao Li; Junjuan Xia; Wanguo Jiao; Min Hua. 2019. "Optimal Pilot Design for MIMO Broadcasting Systems Based on the Positive Definite Matrix Manifold." IEEE Access 7, no. : 99589-99601.
Wanguo Jiao; Guoqing Liu; Haiqing Wu. Queue Performance of Energy Harvesting Cognitive Radio Sensor Networks With Cooperative Spectrum Sharing. IEEE Access 2018, 6, 73548 -73560.
AMA StyleWanguo Jiao, Guoqing Liu, Haiqing Wu. Queue Performance of Energy Harvesting Cognitive Radio Sensor Networks With Cooperative Spectrum Sharing. IEEE Access. 2018; 6 ():73548-73560.
Chicago/Turabian StyleWanguo Jiao; Guoqing Liu; Haiqing Wu. 2018. "Queue Performance of Energy Harvesting Cognitive Radio Sensor Networks With Cooperative Spectrum Sharing." IEEE Access 6, no. : 73548-73560.
Spectrum efficiency (SE) and QoS guarantee are two critical issues in wireless communication systems. The truncated ARQ and the adaptive modulation and coding (AMC) are often used to improve the SE and transmission reliability in wireless communications. In this paper, we study the SE and QoS performance of a system with a cross-layer combining of the truncated ARQ with the AMC. First, we analyze the performance of current combinations of the ARQ and the AMC. The analysis results indicate that the current combination is too “ineffectiveness” or “conservative.” Then, based on the analysis, we design a new rule for the AMC, which is used to adaptively choose transmission mode. Through analyzing the AMC and the combination algorithm using the proposed rule, both the SE and the packet dropped probability of the system are improved. Furthermore, the analysis result also point outs the suitable scenario of each algorithm. Simulation results verify the analysis result and demonstrate that the proposed algorithm can achieve higher SE while the QoS requirement is guaranteed. At last, to further improve the SE of the system, we propose an algorithm jointing power control and the combination of the ARQ with the AMC under the QoS constraint.
Wanguo Jiao; Haofan Ding; Haiqing Wu; Gang Yu. Spectrum Efficiency of Jointing Adaptive Modulation Coding and Truncated ARQ With QoS Constraints. IEEE Access 2018, 6, 46915 -46925.
AMA StyleWanguo Jiao, Haofan Ding, Haiqing Wu, Gang Yu. Spectrum Efficiency of Jointing Adaptive Modulation Coding and Truncated ARQ With QoS Constraints. IEEE Access. 2018; 6 ():46915-46925.
Chicago/Turabian StyleWanguo Jiao; Haofan Ding; Haiqing Wu; Gang Yu. 2018. "Spectrum Efficiency of Jointing Adaptive Modulation Coding and Truncated ARQ With QoS Constraints." IEEE Access 6, no. : 46915-46925.
As the base of quality-of-service (QoS) guarantee and system optimizing, performance analysis is very important for interference-limited networks. The performance of a user is closely related to its service rate. However, in interference-limited networks, the transmissions of users interfere with each other, and the power control and unsaturated traffic make the interference relationship among users more complicated. Hence, the service rates of users are correlated with each other and are difficult to derive. According to the relation between the queue length and the service rate, we propose an N-dimensional Markov chain, which models queue states of users, to study the performance of an interference-limited system. By calculating the conditional service rate, which is only related to the channel quality given the power policy, the transition matrix is derived. By using the transition matrix, we solve the Markov chain and obtain the stationary probability of the queue length of each user, which enables the calculations of other performance metrics, i.e., delay and packet overflow probability, and so on. Furthermore, to reduce the computational complexity, we decompose the proposed N-dimensional Markov chain. Then, based on the decomposition, we propose an iterative algorithm. The comparisons between simulation results and analytical results under different scenarios verify that our method can provide good estimations of each user's performance. The results derived by our method can determine the condition under which the power control algorithm for the saturated system is suitable in unsaturated networks and in which the new power policy is needed.
Min Sheng; Wanguo Jiao; Xijun Wang; Guoqing Liu. Effect of Power Control on Performance of Users in an Interference-Limited Network With Unsaturated Traffic. IEEE Transactions on Vehicular Technology 2016, 66, 2740 -2755.
AMA StyleMin Sheng, Wanguo Jiao, Xijun Wang, Guoqing Liu. Effect of Power Control on Performance of Users in an Interference-Limited Network With Unsaturated Traffic. IEEE Transactions on Vehicular Technology. 2016; 66 (3):2740-2755.
Chicago/Turabian StyleMin Sheng; Wanguo Jiao; Xijun Wang; Guoqing Liu. 2016. "Effect of Power Control on Performance of Users in an Interference-Limited Network With Unsaturated Traffic." IEEE Transactions on Vehicular Technology 66, no. 3: 2740-2755.
In this paper, we propose an interference alignment and cancellation (IAC) scheme for the uplink of heterogeneous networks (HetNets). Due to the random deployment of small cells and the heterogeneous deployment of macro cells and small cells, complex interference occurs in the HetNets. This makes the optimal interference cancellation order and the corresponding interference alignment (IA) scheme of IAC hard to determine. To address this problem, we first develop a set of constraints that should be satisfied by users, base stations (BSs), and interference cancellation when IAC is carried out in the HetNets. Meanwhile, by giving the design method of the precoding and decoding vectors, we prove that IAC is feasible if the developed constraints are satisfied. Then, in order to determine the optimal IAC scheme, based on the developed constraints, we construct an optimization problem with the aim to maximize the number of data streams that can be transmitted in the network. By solving the optimization problem, the optimal interference cancellation order and the corresponding IA scheme can be obtained. The simulation results show that the proposed IAC scheme can significantly increase the number of data streams transmitted in the whole network.
Min Sheng; Guoqing Liu; Xijun Wang; Wanguo Jiao; Jiandong Li. Interference Alignment and Cancelation for the Uplink of Heterogeneous Networks. IEEE Transactions on Vehicular Technology 2016, 66, 1104 -1115.
AMA StyleMin Sheng, Guoqing Liu, Xijun Wang, Wanguo Jiao, Jiandong Li. Interference Alignment and Cancelation for the Uplink of Heterogeneous Networks. IEEE Transactions on Vehicular Technology. 2016; 66 (2):1104-1115.
Chicago/Turabian StyleMin Sheng; Guoqing Liu; Xijun Wang; Wanguo Jiao; Jiandong Li. 2016. "Interference Alignment and Cancelation for the Uplink of Heterogeneous Networks." IEEE Transactions on Vehicular Technology 66, no. 2: 1104-1115.
The quality of service (QoS) performance analysis is of great guiding significance for a QoS guarantee of secondary users (SUs). However, the QoS performance of SUs has not been well studied, especially how it is impacted by the traffic property of primary users (PUs). In this study, the authors propose a method to analyse the queue performance of the SU when the active and inactive durations of PUs follow general distributions. To characterise the non-memoryless property of the channel when the distributions of PUs active/inactive durations are general distributions, they propose a two-dimensional Markov chain to model the states of the channel. By using this Markov chain, they derive the effective capacity (EC) function of the cognitive radio network. On the basis of the EC function and the effective bandwidth function, the queue performance of the SU, that is, the stationary tail distribution of the queue length, is estimated. The author's result can not only be used to calculate other QoS metrics, such as the buffer overflow probability and throughput, but also provide some guidelines for QoS guarantee of the SU. Finally, they verify their work by comparing the analytical results with simulation results.
Wanguo Jiao; Min Sheng; King‐Shan Lui; Guoqing Liu. Queue performance of cognitive radio networks with general primary user activity model. IET Communications 2015, 9, 1821 -1828.
AMA StyleWanguo Jiao, Min Sheng, King‐Shan Lui, Guoqing Liu. Queue performance of cognitive radio networks with general primary user activity model. IET Communications. 2015; 9 (15):1821-1828.
Chicago/Turabian StyleWanguo Jiao; Min Sheng; King‐Shan Lui; Guoqing Liu. 2015. "Queue performance of cognitive radio networks with general primary user activity model." IET Communications 9, no. 15: 1821-1828.
In this letter, we propose an opportunistic interference alignment and cancellation (OIAC) scheme for cellular networks to exploit the multi-user diversity gain and the backhual resources among base stations. Particularly, an opportunistic user scheduling strategy is proposed by synthesizing opportunistic interference alignment (OIA) and successive interference cancellation (SIC). In the OIAC scheme, we propose a new user scheduling metric and a sequential user selection scheme based on the characteristics of SIC, and guarantee a target signal-to-interference-plus-noise ratio (SINR) for each selected user by performing user selection, decoder design and power control jointly in the user selection process. The OIAC scheme improves system performance by using SIC and keeps the low implementation complexity property of OIA. The simulation results show that the OIAC scheme can improve the achievable sum rate significantly compared to OIA and other schemes.
Guoqing Liu; Min Sheng; Xijun Wang; Wanguo Jiao; Ying Li; Jiandong Li; Li Ying. Opportunistic Interference Alignment and Cancellation for the Uplink of Cellular Networks. IEEE Communications Letters 2015, 19, 645 -648.
AMA StyleGuoqing Liu, Min Sheng, Xijun Wang, Wanguo Jiao, Ying Li, Jiandong Li, Li Ying. Opportunistic Interference Alignment and Cancellation for the Uplink of Cellular Networks. IEEE Communications Letters. 2015; 19 (4):645-648.
Chicago/Turabian StyleGuoqing Liu; Min Sheng; Xijun Wang; Wanguo Jiao; Ying Li; Jiandong Li; Li Ying. 2015. "Opportunistic Interference Alignment and Cancellation for the Uplink of Cellular Networks." IEEE Communications Letters 19, no. 4: 645-648.
In this paper, we propose interference alignment (IA) schemes for downlink multiple-input-multiple-output heterogeneous networks (HetNets) with partial connectivity, which is induced by the path loss and the low transmission power of small cells. Specifically, we consider two partially connected scenarios of HetNets. In the first scenario, we focus on the partial connectivity among small cells, whereas in the second scenario, we further consider the partial connectivity between the macrocell and small cells. For the first scenario, we first propose a two-stage IA scheme by exploiting the heterogeneity and partial connectivity of HetNets. Then, the influence of the number of served macro users on system degrees of freedom (DoFs) is investigated. In particular, we derive the condition under which serving one macro user achieves more DoFs than serving multiple macro users and design an algorithm to find the optimal number of served macro users to maximize the system DoFs. Afterward, we study the second scenario and extend the two-stage IA to this scenario. The simulation results show that the proposed IA schemes can significantly improve the system sum rate. Moreover, by considering the partial connectivity between the macro cell and small cells, the system performance can be further improved.
Guoqing Liu; Min Sheng; Xijun Wang; Wanguo Jiao; Ying Li; Jiandong Li. Interference Alignment for Partially Connected Downlink MIMO Heterogeneous Networks. IEEE Transactions on Communications 2015, 63, 551 -564.
AMA StyleGuoqing Liu, Min Sheng, Xijun Wang, Wanguo Jiao, Ying Li, Jiandong Li. Interference Alignment for Partially Connected Downlink MIMO Heterogeneous Networks. IEEE Transactions on Communications. 2015; 63 (2):551-564.
Chicago/Turabian StyleGuoqing Liu; Min Sheng; Xijun Wang; Wanguo Jiao; Ying Li; Jiandong Li. 2015. "Interference Alignment for Partially Connected Downlink MIMO Heterogeneous Networks." IEEE Transactions on Communications 63, no. 2: 551-564.
In this paper, we propose a two-stage interference alignment (IA) scheme for the downlink of partially connected heterogeneity networks (HetNets), where the partial connectivity is induced by the path loss and the low transmission power of small cells. Particularly, in the first stage, the macro cell carries out conventional IA with a set of fully connected small cells. We derive the maximum number of small cells that can be accommodate into this stage. In the second stage, the beamforming matrices are designed for a set of small cells that are partially connected with each other and also partially connected with the set of fully connected small cells. In the above two-stage IA, one user is served by each base station (BS). Since the macro BS usually has more antennas than small cell BSs, we extend the two-stage IA to a scenario where multiple users are served by the macro BS. Moreover, we investigate the influence of the number of served macro users to the total number of data streams achieved by the system. The simulation results show that two-stage IA can significantly improve system sum rate.
Min Sheng; Guoqing Liu; Xijun Wang; Yan Zhang; Wanguo Jiao; Ying Li. Two-stage interference alignment for partially connected heterogeneous networks. 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC) 2014, 826 -831.
AMA StyleMin Sheng, Guoqing Liu, Xijun Wang, Yan Zhang, Wanguo Jiao, Ying Li. Two-stage interference alignment for partially connected heterogeneous networks. 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC). 2014; ():826-831.
Chicago/Turabian StyleMin Sheng; Guoqing Liu; Xijun Wang; Yan Zhang; Wanguo Jiao; Ying Li. 2014. "Two-stage interference alignment for partially connected heterogeneous networks." 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC) , no. : 826-831.