Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Computational complexity (3)
- Heterogeneous networks (3)
- Approximation bounds (2)
- Nash equilibrium (2)
- Wireless networks (2)
-
- ADMM algorithm (1)
- Access point selection (1)
- Alternating direction method of multipliers (ADMM) (1)
- Base station association (1)
- Base station clustering (1)
- Base station selection (1)
- Base stations selection/clustering (1)
- Beamforming (1)
- Block coordinate descent (1)
- Block successive upper-bound minimization (1)
- Cardinality constrained quadratic program (1)
- Chance constraints (1)
- Convergence (1)
- Convex optimization (1)
- Cross-layer optimization (1)
- Gaussian interference channel (1)
- Heterogenous network (1)
- Interference channel (1)
- Interfering broadcast channel (1)
- Iterative water-filling algorithm (1)
- LASSO (1)
- Limited backhaul (1)
- MAC channel (1)
- MIMO (1)
- MISO wiretap channel (1)
Articles 1 - 11 of 11
Full-Text Articles in Systems Engineering
Outage Constrained Robust Secure Transmission For Miso Wiretap Channels, Shuai Ma, Mingyi Hong, Engin Song, Xiangfeng Wang, Dechun Sun
Outage Constrained Robust Secure Transmission For Miso Wiretap Channels, Shuai Ma, Mingyi Hong, Engin Song, Xiangfeng Wang, Dechun Sun
Mingyi Hong
In this paper, we consider the robust secure beam-former design for multiple-input-single-output wiretap channels. Assuming that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power and the secrecy rate outage probability constraint. The outage probability constraint requires that the secrecy rate exceed certain thresholds with high probability. Therefore, including such constraint in the design naturally ensures the desired robustness. Unfortunately, the presence of the probabilistic constraints makes the problem nonconvex and, hence, difficult to solve. In this paper, we investigate the outage probability constrained secrecy rate maximization problem …
Base Station Activation And Linear Transceiver Design For Optimal Resource Management In Heterogeneous Networks, Wei-Cheng Liao, Mingyi Hong, Ya-Feng Liu, Zhi-Quan Luo
Base Station Activation And Linear Transceiver Design For Optimal Resource Management In Heterogeneous Networks, Wei-Cheng Liao, Mingyi Hong, Ya-Feng Liu, Zhi-Quan Luo
Mingyi Hong
In a densely deployed heterogeneous network (HetNet), the number of pico/micro base stations (BS) can be comparable with the number of the users. To reduce the operational overhead of the HetNet, proper identification of the set of serving BSs becomes an important design issue. In this work, we show that by jointly optimizing the transceivers and determining the active set of BSs, high system resource utilization can be achieved with only a small number of BSs. In particular, we provide formulations and efficient algorithms for such joint optimization problem, under the following two common design criteria: i) minimization of the …
Min Flow Rate Maximization For Software Defined Radio Access Networks, Wei-Cheng Liao, Mingyi Hong, Hamid Farmanbar, Xu Li, Zhi-Quan Luo, Hang Zhang
Min Flow Rate Maximization For Software Defined Radio Access Networks, Wei-Cheng Liao, Mingyi Hong, Hamid Farmanbar, Xu Li, Zhi-Quan Luo, Hang Zhang
Mingyi Hong
We consider a cloud-based heterogeneous network of base stations (BSs) connected via a backhaul network of routers and wired/wireless links with limited capacity. The optimal provision of such networks requires proper resource allocation across the radio access links in conjunction with appropriate traffic engineering within the backhaul network. In this paper, we propose an efficient algorithm for joint resource allocation across the wireless links and flow control over the entire network. The proposed algorithm, which maximizes the min-rate among all the transmitted commodities, is based on a decomposition approach that leverages both the alternating direction method of multipliers (ADMM) and …
Joint User Grouping And Linear Virtual Beamforming: Complexity, Algorithms And Approximation Bounds, Mingyi Hong, Zi Xu, Meisam Razaviyayn, Zhi-Quan Luo
Joint User Grouping And Linear Virtual Beamforming: Complexity, Algorithms And Approximation Bounds, Mingyi Hong, Zi Xu, Meisam Razaviyayn, Zhi-Quan Luo
Mingyi Hong
In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting a subset of nodes from potentially a large number of candidates to form a virtual multi-antenna system, while at the same time designing their joint linear transmission strategies. We focus on two specific application scenarios: 1) multiple single antenna transmitters cooperatively transmit to a receiver; 2) a single transmitter transmits to a receiver with the help of a number of cooperative relays. We …
Joint Access Point Selection And Power Allocation For Uplink Wireless Networks, Mingyi Hong, Alfredo Garcia, Jorge Barrera, Stephen G. Wilson
Joint Access Point Selection And Power Allocation For Uplink Wireless Networks, Mingyi Hong, Alfredo Garcia, Jorge Barrera, Stephen G. Wilson
Mingyi Hong
We consider the distributed uplink resource allocation problem in a multi-carrier wireless network with multiple access points (APs). Each mobile user can optimize its own transmission rate by selecting a suitable AP and by controlling its transmit power. Our objective is to devise suitable algorithms by which mobile users can jointly perform these tasks in a distributed manner. Our approach relies on a game theoretic formulation of the joint power control and AP selection problem. In the proposed game, each user is a player with an associated strategy containing a discrete variable (the AP selection decision) and a continuous vector …
Distributed Linear Precoder Optimization And Base Station Selection For An Uplink Heterogeneous Network, Mingyi Hong, Zhi-Quan Luo
Distributed Linear Precoder Optimization And Base Station Selection For An Uplink Heterogeneous Network, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a network is to jointly optimize users' linear procoders as well as their BS associations. In this paper, we first show that this joint optimization problem is NP-hard and thus is difficult to solve to global optimality. To find a locally optimal solution, we formulate the problem as a noncooperative game in which the users and the BSs both act as players. We introduce a set …
Joint Base Station Clustering And Beamformer Design For Partial Coordinated Transmission In Heterogeneous Networks, Mingyi Hong, Ruoyu Sun, Hadi Baligh, Zhi-Quan Luo
Joint Base Station Clustering And Beamformer Design For Partial Coordinated Transmission In Heterogeneous Networks, Mingyi Hong, Ruoyu Sun, Hadi Baligh, Zhi-Quan Luo
Mingyi Hong
We consider the interference management problem in a multicell MIMO heterogeneous network. Within each cell there is a large number of distributed micro/pico base stations (BSs) that can be potentially coordinated for joint transmission. To reduce coordination overhead, we consider user-centric BS clustering so that each user is served by only a small number of (potentially overlapping) BSs. Thus, given the channel state information, our objective is to jointly design the BS clustering and the linear beamformers for all BSs in the network. In this paper, we formulate this problem from a {sparse optimization} perspective, and propose an efficient algorithm …
A Unified Convergence Analysis Of Block Successive Minimization Methods For Nonsmooth Optimization, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
A Unified Convergence Analysis Of Block Successive Minimization Methods For Nonsmooth Optimization, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
The block coordinate descent (BCD) method is widely used for minimizing a continuous function f of several block variables. At each iteration of this method, a single block of variables is optimized, while the remaining variables are held fixed. To ensure the convergence of the BCD method, the subproblem of each block variable needs to be solved to its unique global optimal. Unfortunately, this requirement is often too restrictive for many practical scenarios. In this paper, we study an alternative inexact BCD approach which updates the variable blocks by successively minimizing a sequence of approximations of f which are either …
Linear Transceiver Design For A Mimo Interfering Broadcast Channel Achieving Max–Min Fairness, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Linear Transceiver Design For A Mimo Interfering Broadcast Channel Achieving Max–Min Fairness, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel (IBC). In this paper we show that when the number of antennas is at least two at each of the transmitters and the receivers, the min rate maximization problem is NP-hard in the number of users. Moreover, we develop a low-complexity algorithm for this problem by iteratively solving a sequence of convex subproblems. We theoretically establish the global convergence of the proposed algorithm to the set of stationary points, which may be suboptimal due to the non-convexity of the original minimum …
Mechanism Design For Base Station Association And Resource Allocation In Downlink Ofdma Network, Mingyi Hong, Alfredo Garcia
Mechanism Design For Base Station Association And Resource Allocation In Downlink Ofdma Network, Mingyi Hong, Alfredo Garcia
Mingyi Hong
We consider a resource management problem in a multi-cell downlink OFDMA network whereby the goal is to find the optimal combination of (i) assignment of users to base stations and (ii) resource allocation strategies at each base station. Efficient resource management protocols must rely on users truthfully reporting privately held information such as downlink channel states. However, individual users can manipulate the resulting resource allocation (by misreporting their private information) if by doing so they can improve their payoff. Therefore, it is of interest to design efficient resource management protocols that are strategy-proof, i.e. it is in the users' best …
Averaged Iterative Water-Filling Algorithm: Robustness And Convergence, Mingyi Hong, Alfredo Garcia
Averaged Iterative Water-Filling Algorithm: Robustness And Convergence, Mingyi Hong, Alfredo Garcia
Mingyi Hong
The convergence properties of the iterative water-filling (IWF) based algorithms have been derived in the ideal situation where the transmitters in the network are able to obtain the exact value of the interference plus noise (IPN) experienced at the corresponding receivers in each iteration of the algorithm. However, these algorithms are not robust because they diverge when there is time-varying estimation error of the IPN, a situation that arises in real communication system. In this correspondence, we propose an algorithm that possesses convergence guarantees in the presence of various forms of such time-varying error. Moreover, we also show by simulation …