MHMichael L. Honig

Michael L. Honig

*This is an algorithmically generated author record based on publicly available information.

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


Michael L. Honig has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Spectrum Rights in Outer Space

    by Randall Berry, Pedro Bustamante, Dongning Guo, Thomas Hazlett, Michael Honig, Ilia Murtazashvili, Scott Palo, Martin B. H. Weiss

    This article presents a comprehensive summary of the regulatory environment confronting low earth orbit, non-geostationary satellite orbit (LEO NGSO) communication satellites and critically evaluates analogies from terrestrial spectrum management as possibilities for LEO NGSO satellites. This analysis provides a framework for empirical analysis of the alternatives considered.


  • The Impact of Unlicensed Access on Small-Cell Resource Allocation

    by Cheng Chen, Randall A. Berry, Michael L. Honig, Vijay G. Subramanian

    Small-cells in licensed spectrum and unlicensed access via Wi-Fi are two commonly used options to reduce the demand for conventional macro-cellular networks and to provide expanded wireless services to low mobility users. The mix of these technologies depends on both the decisions made by wireless service providers (SPs) that seek to maximize revenue, and the allocation of licensed and unlicensed spectrum by regulators. In this paper, we study these interactions and consider heterogeneous cellular networks together with unlicensed access. Both a single monopoly SP and multiple competing SPs are investigated. The SPs split any available licensed spectrum into two separate bands for macro- and small-cells, which are then used to serve two types of users: mobile and fixed. Mobile users must be served by macro-cells only, whereas fixed users can be served by either macro- or small-cells, or alternatively by unlicensed access service. While the providers charge a (different) price per unit rate for licensed access services (macro- or small-cell), unlicensed access is free. We formulate a sequential game in which the users choose a service that yields the highest payoff, and the providers allocate bandwidth across macro-/small-cells. In general, the competition from unlicensed access results in inefficient (albeit unique) market equilibria, and in many cases all or some SPs allocate no resources to small-cell deployment. We conclude by showing how our framework can also be used to optimize the fraction of unlicensed spectrum when new bandwidth becomes available.


  • Open Access

    Licensed and Unlicensed Spectrum Allocation in Heterogeneous Networks

    by Zhiyi Zhou, Dongning Guo, Michael L. Honig

    In future networks, an operator may employ a wide range of access points using diverse radio access technologies (RATs) over multiple licensed and unlicensed frequency bands. This paper studies centralized user association and spectrum allocation across many access points in such a heterogeneous network (HetNet). Such centralized control is on a relatively slow timescale to allow information exchange and joint optimization over multiple cells. This is in contrast and complementary to fast timescale distributed scheduling. A queueing model is introduced to capture the lower spectral efficiency, reliability, and additional delays of data transmission over the unlicensed bands due to contention and/or listen-before-talk requirements. Two optimization-based spectrum allocation schemes are proposed along with efficient algorithms for computing the allocations. The proposed solutions are fully aware of traffic loads, network topology, as well as external interference levels in the unlicensed bands. Packet-level simulation results show that the proposed schemes significantly outperform orthogonal and full-frequency-reuse allocations under all traffic conditions.

  • Distributed uplink CoMP for small-cell networks

    by Shirish Nagaraj, M. R. Raghavendra, Chris Schmidt, Phil Rasky, Deepak Nayak, Xiaoyong Yu, Deepak Pengoria, Michael L. Honig

    Uplink Co-ordinated Multi-Point (UL CoMP) is an important technique to significantly improve user performance, especially in dense small-cell networks. In such networks it is important that co-operation be (a) scalable w.r.t. number of cells (b) adaptable to different inter-connect bandwidths. In this paper, we propose near-optimal distributed mechanisms to enable uplink co-operation. We develop protocols for distributed helper-cell SINR measurement as well as adaptation algorithms to manage limited interconnect bandwidth. We show that the performance of the proposed one-shot bandwidth control algorithm is close to the optimal iterative algorithm proposed in [1].


  • Multicarrier Beamforming With Limited Feedback: A Rate Distortion Approach

    by Mingguang Xu, Dongning Guo, Michael L. Honig

    This paper studies the optimal use of limited-rate feedback of channel state information (CSI) in the case of a wideband multicarrier channel with multiple transmit antennas and a single receive antenna. With full knowledge of the CSI, the receiver should compute the optimal beamforming vectors, jointly quantize them, and feed them back to the transmitter. The achievable forward data rate depends on the rate of the feedback link. The optimal tradeoff between the forward and feedback rates is characterized using rate distortion theory in the limit of infinite number of subcarriers with fixed amount of feedback per subcarrier. The distortion metric is the difference between the forward rate achieved with limited feedback and the capacity with perfect CSI at the transmitter. The rate distortion function gives the forward rate as a function of the feedback rate. Numerical results show that to achieve a target forward rate, the required feedback rate can be substantially reduced by joint quantization of the beamformers across subcarriers. A simple quantizer amenable to practical implementation is shown to approach the rate distortion bound with near-linear computational complexity.


  • Comparison of Analog and Digital Relay Methods with Network Coding for Wireless Multicast

    by M. Riemensberger, Y. E. Sagduyu, M. L. Honig, W. Utschick

    We study wireless multicasting from two sources to two destinations with the assistance of a single half-duplex relay. The objective is to evaluate the throughput and error performance of different analog and digital relay schemes with linear network coding at the relay. The analog relay node forwards either a scaled version of the received signal to the destinations, or alternatively, first filters the received signals to generate a linear Minimum Mean Squared Error (MMSE) estimate, which is subsequently forwarded. The digital relay scheme first detects the source transmissions, combines the packets with a network code, and forwards the resulting symbols to the destinations. For all schemes the destinations recover the source and relay signals by first applying linear MMSE filters, followed by decoding of the source bits. The performance of the schemes are compared in terms of normalized throughput (bits per channel use accounting for the delay due to the relay) and uncoded error probability, given a normalized power constraint. Both narrowband and wideband transmission schemes are considered. Our results show that the analog relay schemes outperform the digital network coding scheme with respect to both throughput and error probability because of error propagation through the relay. Numerical results are presented, which illustrate throughput-reliability trade-offs for all schemes considered.


  • Asymptotic Capacity of Multicarrier Transmission With Frequency-Selective Fading and Limited Feedback

    by Yakun Sun, Michael L. Honig

    We study the capacity of multicarrier transmission through a slow frequency-selective fading channel with limited feedback, which specifies channel state information. Our results are asymptotic in the number of subchannels . We first assume independent and identically distributed (i.i.d.) subchannel gains, and show that, for a large class of fading distributions, a uniform power distribution over an optimized subset of subchannels, or on-off power allocation, gives the same asymptotic growth in capacity as optimal water filling, e.g., with Rayleigh fading. Furthermore, the growth in data rate can be achieved with a feedback rate as . If the number of active subchannels is bounded, the capacity grows only as with the feedback rate of . We then consider correlated subchannels modeled as a Markov process, and study the savings in feedback. Assuming a fixed ratio of coherence bandwidth to the total bandwidth, the ratio between minimum feedback rates with correlated and i.i.d. subchannels converges to zero with , e.g., as for Rayleigh-fading subchannels satisfying a first-order autoregressive process. We also show that adaptive modulation, or rate control schemes, in which the rate on each subchannel is selected from a quantized set, achieves the same asymptotic growth rates in capacity and required feedback. Finally, our results are extended to cellular uplink and downlink channel models.


  • Performance of Scalable Feedback Schemes for Downlink OFDMA

    by Jieying Chen, Randall A. Berry, Michael L. Honig

    In a downlink Orthogonal Frequency Division Multiple Access (OFDMA) system, optimally allocating sub-channels to the users can require excessive feedback. We consider two limited feedback schemes to manage this overhead: a sequential scheme in which each user sends compressed feedback bits over consecutive time slots and a contention scheme in which users send their feedback using a random access protocol. In previous work we characterized the asymptotic performance of these schemes as the number of users and number of sub-channels scale with fixed load ρ. That analysis explicitly models the feedback overhead assuming a finite coherence time and fixed feedback rate per sub-channel. In this paper, we revisit this model, and first characterize the performance of both schemes as a function of ρ. We then study the performance of these schemes for a finite system via simulation. Finally we examine the relative performance of the two schemes as a function of the load, the available feedback rate, and additional overhead per transmission (e.g., due to synchronization).


  • Efficiency of Sequential Bandwidth and Power Auctions With Rate Utilities

    by Junjik Bae, Eyal Beigman, Randall Berry, Michael L. Honig, Rakesh Vohra

    We study a sequential second-price auction for allocating wireless resources between two non-cooperative users. This mechanism requires relatively little computation and information exchange among agents, but does not always achieve an efficient allocation. This is a continuation of previous work in which the worst-case efficiency is evaluated, assuming each user has full knowledge of the other user's utility function. Here we assume that the users are randomly placed within a region, and evaluate the associated efficiency via simulation. Sequential auctions for bandwidth (with fixed power) and for power (with fixed bandwidth) are considered, where each user utility is the achievable rate, and interference is treated as background noise. Our results show that the sequential auction typically achieves the efficient (utility-maximizing) allocation. We also relate observed improvements in the worst-case efficiency to constraints on the size of the marginal utilities associated with each resource.


  • Performance of Limited Feedback Schemes for Downlink OFDMA with Finite Coherence Time

    by Jieying Chen, Randall A. Berry, Michael L. Honig

    We consider the capacity of a downlink orthogonal frequency division multiple access (OFDMA) system with limited feedback rate RF per sub-channel and finite coherence time T. The feedback is used to relay channel state information (CSI) from K users to the base station. The order-optimal capacity growth with Rayleigh fading sub-channels is ominus(N log log K) as N and K increase with fixed ratio, where N is the number of sub-channels. However, to achieve this, previous work requires a feedback rate per subchannel that scales linearly with the system size. Here we explicitly include the feedback overhead when calculating the sum capacity, and study the tradeoff between feedback rate and sum capacity. We propose two limited feedback schemes, one based on sequential transmissions across users and the other based on random access, in which the each feedback bit requests the use of a sub-channel group containing multiple subchannels. With fixed RFT, the sum capacity for both schemes with optimized sub-channel groups increases as ominus(N). If RFT grows faster than log K, then both schemes can achieve the order- optimal capacity growth. We also show that when RFT is small, the random access scheme performs better than the sequential transmission scheme, whereas the reverse is true for large RFT.