Haige Xiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Haige Xiang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Jianjun Wu
School of Electronics, Peking University, Beijing, China
3 shared publications - An Liu
Zhejiang University
1 shared publication Chen Chen
State Key Laboratory of Advanced Optical Communication Systems and Networks, Peking University, Beijing 100871, China
1 shared publication- Chen Chen
Peking University
1 shared publication - Chengmei Li
State Key Laboratory of Advanced Optical Communication Systems and Networks, Peking University, Beijing 100871, China
1 shared publication - Guozhen Xu
The State Key Laboratory of Advanced Optical Communication Systems and Networks, Peking University, Beijing 100871, China
1 shared publication
Latest Publications
- Open Access
- 12 March 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-11
Outage-Constrained Beamforming for Two-Tier Massive MIMO Downlink with Pilot Reuse
Massive multiple-input multiple-output (MIMO) systems and small cell networks are both regarded as promising candidates to meet the exponential growth of mobile data traffic for the next generation (5G) wireless communications. Hence, a new kind of multitier networks which combine massive MIMO macro cells with a secondary tier of small cells is proposed to resolve the contradiction of large network coverage and high data rate. In such multitier networks, it is inevitable to allocate nonorthogonal uplink pilot sequences to user equipment (UE) due to the large number of users. We propose a pilot reuse scheme by exploiting the unique architecture of this networks and analyse the special mixed channel state information (CSI) yielded by the pilot reuse scheme. Based on the mixed CSI, we formulate a downlink transmit beamforming problem of minimizing the total power consumption while satisfying the quality of service (QoS) requirements with outage constraints. After decomposing the original problem into simpler subproblems, we provide an efficient algorithm to combine these subproblems and solve them iteratively for generating the beamforming vectors. Monte Carlo simulations show that the average power consumption of the proposed pilot reuse scheme and its associated beamforming algorithm is close to that of the perfect CSI case.
- 12 March 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-11
Open AccessOutage-Constrained Beamforming for Two-Tier Massive MIMO Downlink with Pilot Reuse
Massive multiple-input multiple-output (MIMO) systems and small cell networks are both regarded as promising candidates to meet the exponential growth of mobile data traffic for the next generation (5G) wireless communications. Hence, a new kind of multitier networks which combine massive MIMO macro cells with a secondary tier of small cells is proposed to resolve the contradiction of large network coverage and high data rate. In such multitier networks, it is inevitable to allocate nonorthogonal uplink pilot sequences to user equipment (UE) due to the large number of users. We propose a pilot reuse scheme by exploiting the unique architecture of this networks and analyse the special mixed channel state information (CSI) yielded by the pilot reuse scheme. Based on the mixed CSI, we formulate a downlink transmit beamforming problem of minimizing the total power consumption while satisfying the quality of service (QoS) requirements with outage constraints. After decomposing the original problem into simpler subproblems, we provide an efficient algorithm to combine these subproblems and solve them iteratively for generating the beamforming vectors. Monte Carlo simulations show that the average power consumption of the proposed pilot reuse scheme and its associated beamforming algorithm is close to that of the perfect CSI case.
- Open Access
- 1 March 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-10
Distributed Joint Cluster Formation and Resource Allocation Scheme for Cooperative Data Collection in Virtual MIMO-Based M2M Networks
An efficient data collection scheme plays an important role for the real-time intelligent monitoring in many machine-to-machine (M2M) networks. In this paper, a distributed joint cluster formation and resource allocation scheme for data collection in cluster-based M2M networks is proposed. Specifically, in order to utilize the advantages of cooperation, we first propose a hierarchical transmission model which contains two communication phases. In the first phase, the intracluster information sharing is carried out by all the nodes within the same cluster. Then these nodes transmit the total information to the BS cooperatively with virtual-MIMO (VMIMO) protocol in the second phase. To grasp the properties and advantages of this cooperative transmission strategy, the theoretical analysis results are provided. The key issue in this system is to form the clusters and allocate resources efficiently. Since the optimization problem on this issue is an NP-hard problem, a feasible joint scheme for the cluster formation and resource allocation is proposed in this paper, which is carried out via coalition formation game with a distributed algorithm. This scheme can reduce the complexity while keeping an attractive performance. Simulation results show the properties of the proposed scheme and its advantages when comparing with the noncooperative scheme for the data collection in a practical scenario.
- 1 March 2015
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2015, 1-10
Open AccessDistributed Joint Cluster Formation and Resource Allocation Scheme for Cooperative Data Collection in Virtual MIMO-Based M2M Networks
An efficient data collection scheme plays an important role for the real-time intelligent monitoring in many machine-to-machine (M2M) networks. In this paper, a distributed joint cluster formation and resource allocation scheme for data collection in cluster-based M2M networks is proposed. Specifically, in order to utilize the advantages of cooperation, we first propose a hierarchical transmission model which contains two communication phases. In the first phase, the intracluster information sharing is carried out by all the nodes within the same cluster. Then these nodes transmit the total information to the BS cooperatively with virtual-MIMO (VMIMO) protocol in the second phase. To grasp the properties and advantages of this cooperative transmission strategy, the theoretical analysis results are provided. The key issue in this system is to form the clusters and allocate resources efficiently. Since the optimization problem on this issue is an NP-hard problem, a feasible joint scheme for the cluster formation and resource allocation is proposed in this paper, which is carried out via coalition formation game with a distributed algorithm. This scheme can reduce the complexity while keeping an attractive performance. Simulation results show the properties of the proposed scheme and its advantages when comparing with the noncooperative scheme for the data collection in a practical scenario.
- Open Access
- 1 December 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (12)
Channel Estimation for Relay-Based M2M Two-Way Communications Using Expectation-Maximization
The growing popularity of machine-to-machine (M2M) communications in wireless networks is driving the need to update the corresponding receiver technology based on the characteristics of M2M. In this paper, an expectation-maximization-based maximum likelihood cascaded channel estimation method is developed for relay-based M2M two-way communications. As the closed-form solution of maximum likelihood channel estimation does not exist, and the superimposed signal structure at the receiver is conducive to the expectation-maximization application, the expectation-maximization algorithm is utilized to provide the maximum likelihood solution in the presence of unobserved data through stable iterations. Even in the absence of the training sequence, the cascaded channel estimates are obtained through the expectation-maximization iterations. The Bayesian Cramér-Rao lower bounds are derived under random parameters for the channel estimation, and the simulation demonstrates the validity of the proposed studies.
- 1 December 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (12)
Open AccessChannel Estimation for Relay-Based M2M Two-Way Communications Using Expectation-Maximization
The growing popularity of machine-to-machine (M2M) communications in wireless networks is driving the need to update the corresponding receiver technology based on the characteristics of M2M. In this paper, an expectation-maximization-based maximum likelihood cascaded channel estimation method is developed for relay-based M2M two-way communications. As the closed-form solution of maximum likelihood channel estimation does not exist, and the superimposed signal structure at the receiver is conducive to the expectation-maximization application, the expectation-maximization algorithm is utilized to provide the maximum likelihood solution in the presence of unobserved data through stable iterations. Even in the absence of the training sequence, the cascaded channel estimates are obtained through the expectation-maximization iterations. The Bayesian Cramér-Rao lower bounds are derived under random parameters for the channel estimation, and the simulation demonstrates the validity of the proposed studies.
- Open Access
- 1 December 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (12)
Joint Access Control and Subchannel Allocation Scheme for Femtocell-Based M2M Network Using a Truthful Mechanism
A joint access control and subchannel allocation (JACSA) scheme is proposed in this paper for femtocell-based machine-to-machine (M2M) network to provide better communication services. As short-range and cost-beneficial eNodeBs, femtocells can improve indoor coverage and data transmission, and can further be used for M2M communication. There are two challenges for femtocell network, access control and truth-telling. Femtocell machine-type communication devices (FMD) select femtocell access points (FAPs) according to the reported channel capacities, while the true values are private information of each femtocell. Therefore, selfish FAPs have incentive to report larger capacities to win greater opportunity to be selected. To solve the aforementioned two problems, a JACSA scheme based on the Arrow-d'Aspremont-Gerard-Varet (AGV) is proposed both in open access and hybrid access scenarios, and formula derivations are given. We prove that, compared with the optimal subchannel allocation (OSA) scheme, JACSA scheme has the feature of achieving near optimal performances with much lower computational complexity. Furthermore, we compare the allocation results for open access and hybrid access in the proposed JACSA scheme. Finally, simulations are performed, and the results verify the availability of our proposed scheme.
- 1 December 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (12)
Open AccessJoint Access Control and Subchannel Allocation Scheme for Femtocell-Based M2M Network Using a Truthful Mechanism
A joint access control and subchannel allocation (JACSA) scheme is proposed in this paper for femtocell-based machine-to-machine (M2M) network to provide better communication services. As short-range and cost-beneficial eNodeBs, femtocells can improve indoor coverage and data transmission, and can further be used for M2M communication. There are two challenges for femtocell network, access control and truth-telling. Femtocell machine-type communication devices (FMD) select femtocell access points (FAPs) according to the reported channel capacities, while the true values are private information of each femtocell. Therefore, selfish FAPs have incentive to report larger capacities to win greater opportunity to be selected. To solve the aforementioned two problems, a JACSA scheme based on the Arrow-d'Aspremont-Gerard-Varet (AGV) is proposed both in open access and hybrid access scenarios, and formula derivations are given. We prove that, compared with the optimal subchannel allocation (OSA) scheme, JACSA scheme has the feature of achieving near optimal performances with much lower computational complexity. Furthermore, we compare the allocation results for open access and hybrid access in the proposed JACSA scheme. Finally, simulations are performed, and the results verify the availability of our proposed scheme.
- Open Access
- 1 November 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (11)
Secure Beamforming via Amplify-and-Forward Relays in Machine-to-Machine Communications
We consider the collaborative use of amplify-and-forward relays to form a beamforming system and provide physical layer security for a wireless machine-to-machine (M2M) communication network. We investigate two objectives: (i) the achievable secrecy rate maximization subject to the relay power constraint and (ii) the relay transmit power minimization under a secrecy rate constraint. For the first objective, we propose a secrecy rate maximization (SRM) beamforming scheme. The secrecy rate maximization problem can be formed into a two-level optimization problem and we solve it using semidefinite relaxation (SDR) techniques. To reduce the complexity of the SRM beamforming scheme, a virtual eavesdropper-based SRM (VE-SRM) beamforming scheme is proposed, in which we hypothesize a virtual eavesdropper instead of all eavesdroppers and maximize the secrecy rate according to the virtual eavesdropper. In addition, for the second objective, we design a relay power minimization (RPM) beamforming scheme, in which an iterative algorithm combining the SDR technology and the gradient-based method is devised by studying the convexity of the RPM problem. By relaxing the constraints of the RPM beamforming scheme, we propose a virtual eavesdropper-based RPM (VERPM) beamforming scheme, which reduces the multivariate RPM problem to a problem of a single variable, and thus an analytical solution is obtained. Our proposed beamforming designs can work well even if the number of eavesdroppers is larger than that of relays, while the existing schemes, for example, the null-space beamforming schemes, cannot work under this condition. Simulation results are presented to demonstrate the significance of performance improvements with the SRM and RPM beamforming schemes. It is also shown that the virtual eavesdropper approaches significantly reduce the complexity with acceptable performance degradation.
- 1 November 2013
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 9 (11)
Open AccessSecure Beamforming via Amplify-and-Forward Relays in Machine-to-Machine Communications
We consider the collaborative use of amplify-and-forward relays to form a beamforming system and provide physical layer security for a wireless machine-to-machine (M2M) communication network. We investigate two objectives: (i) the achievable secrecy rate maximization subject to the relay power constraint and (ii) the relay transmit power minimization under a secrecy rate constraint. For the first objective, we propose a secrecy rate maximization (SRM) beamforming scheme. The secrecy rate maximization problem can be formed into a two-level optimization problem and we solve it using semidefinite relaxation (SDR) techniques. To reduce the complexity of the SRM beamforming scheme, a virtual eavesdropper-based SRM (VE-SRM) beamforming scheme is proposed, in which we hypothesize a virtual eavesdropper instead of all eavesdroppers and maximize the secrecy rate according to the virtual eavesdropper. In addition, for the second objective, we design a relay power minimization (RPM) beamforming scheme, in which an iterative algorithm combining the SDR technology and the gradient-based method is devised by studying the convexity of the RPM problem. By relaxing the constraints of the RPM beamforming scheme, we propose a virtual eavesdropper-based RPM (VERPM) beamforming scheme, which reduces the multivariate RPM problem to a problem of a single variable, and thus an analytical solution is obtained. Our proposed beamforming designs can work well even if the number of eavesdroppers is larger than that of relays, while the existing schemes, for example, the null-space beamforming schemes, cannot work under this condition. Simulation results are presented to demonstrate the significance of performance improvements with the SRM and RPM beamforming schemes. It is also shown that the virtual eavesdropper approaches significantly reduce the complexity with acceptable performance degradation.