M.Z. Win

Massachusetts Institute of Technology, Cambridge, Massachusetts, United States

Are you M.Z. Win?

Claim your profile

Publications (403)411.53 Total impact

  • IEEE Transactions on Signal Processing 12/2016; · 2.79 Impact Factor
  • Source
    [Show description] [Hide description]
    DESCRIPTION: Resource including power and bandwidth allocation strategies for wireless cooperative localization networks
  • [Show abstract] [Hide abstract]
    ABSTRACT: Massive MIMO is, in general, severely affected by pilot contamination. As opposed to traditional detectors, we propose a group-blind detector that takes into account the presence of pilot contamination. While sticking to the traditional structure of the training phase, where orthogonal pilot sequences are reused, we use the excess antennas at each base station to partially remove interference during the uplink data transmission phase. We analytically derive the asymptotic SINR achievable with group-blind detection, and confirm our findings by simulations. We show, in particular, that in an interference-limited scenario with one dominant interfering cell, the SINR can be doubled compared to non-group-blind detection.
  • Wenhan Dai · Yuan Shen · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Network navigation is an emerging paradigm that enables high-accuracy location awareness in GPS-challenged environments. Two important operations of network navigation, location inference and power control, interrelate with each other, thus motivating the design of joint inference and control algorithms. In this paper, we develop efficient network navigation algorithms with optimized energy allocation. In particular, we first determine the confidence region for lzocation inference based on Fisher information analysis, and then design robust energy allocation strategies that minimize the position errors of the agents within the confidence region. Based on these strategies, both centralized and distributed energy-efficient network navigation algorithms are developed. Simulation results show that the proposed algorithms significantly reduce the position errors compared to the algorithms with uniform or non-robust power control.
    IEEE Journal on Selected Areas in Communications 07/2015; 33(7):1-1. DOI:10.1109/JSAC.2015.2430271 · 3.45 Impact Factor
  • Youngmin Jeong · Hyundong Shin · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: The H-transforms are integral transforms that involve Fox's H-functions as kernels. A large variety of integral transforms can be put into particular forms of the H-transform since H-functions subsume most of the known special functions including Meijer's G-functions. In this paper, we embody the H-transform theory into a unifying framework for modeling and analysis in wireless communication. First, we systematize the use of elementary identities and properties of the H-transform by introducing operations on parameter sequences of H-functions. We then put forth H-fading and degree-2 irregular H-fading to model radio propagation under composite, specular, and/or inhomogeneous conditions. The H-fading describes composite effects of multipath fading and shadowing as a single H-variate, including most of typical models such as Rayleigh, Nakagami-m, Weibull, α-μ, N∗ Nakagami-m, (generalized) K-fading, and Weibull/gamma fading as its special cases. As a new class of H-variates (called the degree-ζ irregular H-variate), the degree-2 irregular H-fading characterizes specular and/or inhomogeneous radio propagation in which the multipath component consists of a strong specularly reflected or line-of-sight (LOS) wave as well as unequal-power or correlated in-phase and quadrature scattered waves. This fading includes a variety of typical models such as Rician, Nakagami-q, κ-μ, η-μ, Rician/LOS gamma, and κ-μ/LOS gamma fading as its special cases. Finally, we develop a unifying H-transform analysis for the amount of fading, error probability, channel capacity, and error exponent in wireless communication using the new systematic language of transcendental H-functions. By virtue of two essential operations - called Mellin and convolution operations - involved in the Mellin transform and Mellin convolution of two H-functions, the H-transforms for these performance measures culminate in H-functions. Using the algebraic asymptotic expansions of the H-transform, we further analyze the error probability and capacity at high and low signal-to-noise ratios in a unified fashion.
    IEEE Transactions on Information Theory 07/2015; 61(7):1-1. DOI:10.1109/TIT.2015.2433264 · 2.33 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless localization has a great importance in a variety of areas including commercial, service, and military positioning and tracking systems. In harsh indoor environments, it is hard to localize an agent with high accuracy due to non-line-of-sight (NLOS) radio blockage or insufficient information from anchors. Therefore, NLOS identification and mitigation are highlighted as an effective way to improve the localization accuracy. In this paper, we develop a robust and efficient algorithm to enhance the accuracy for (ultrawide bandwidth) time-of-arrival localization through identifying and mitigating NLOS signals with relevance vector machine (RVM) techniques. We also propose a new localization algorithm, called the two-step iterative (TSI) algorithm, which converges fast with a finite number of iterations. To enhance the localization accuracy as well as expand the coverage of a localizable area, we continue to exploit the benefits of RVM in both classification and regression for cooperative localization by extending the TSI algorithm to a centralized cooperation case. For self-localization setting, we then develop a distributed cooperative algorithm based on variational Bayesian inference to simplify message representations on factor graphs and reduce communication overheads between agents. In particular, we build a refined version of Gaussian variational message passing to reduce the computational complexity while maintaining the localization accuracy. Finally, we introduce the notion of a stochastic localization network to verify proposed cooperative localization algorithms.
    IEEE Journal on Selected Areas in Communications 07/2015; 33(7):1-1. DOI:10.1109/JSAC.2015.2430191 · 3.45 Impact Factor
  • Source
    Alberto Rabbachin · Andrea Conti · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless secrecy is essential for communication confidentiality, health privacy, public safety, information superiority, and economic advantage in the modern information society. Contemporary security systems are based on cryptographic primitives and can be complemented by techniques that exploit the intrinsic properties of a wireless environment. This paper develops a foundation for design and analysis of wireless networks with secrecy provided by intrinsic properties such as node spatial distribution, wireless propagation medium, and aggregate network interference. We further propose strategies that mitigate eavesdropping capabilities, and we quantify their benefits in terms of network secrecy metrics. This research provides insights into the essence of wireless network intrinsic secrecy and offers a new perspective on the role of network interference in communication confidentiality.
  • Wenhan Dai · Yuan Shen · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Device-to-device (D2D) communication in cellular networks is a promising concept that permits cooperation among mobile devices not only to increase data throughput but also to enhance localization services. In those networks, the allocation of transmitting power plays a critical role in determining network lifetime and localization accuracy. Meanwhile, it is a challenging task for implementation in cooperative D2D networks, since each device has only imperfect estimates of local network parameters in distributed settings. In this paper, we establish an optimization framework for robust power allocation in cooperative wireless network localization, and develop distributed power allocation strategies. In particular, we decompose the power allocation problem into infrastructure and cooperation phases, show the sparsity property of the optimal power allocation, and develop efficient power allocation strategies. Simulation results show that these strategies can achieve significant performance improvement in localization accuracy compared to the uniform strategies.
    IEEE Journal on Selected Areas in Communications 06/2015; 33(1):28-40. DOI:10.1109/JSAC.2014.2369631 · 3.45 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we develop a cooperative IMU/radio-location-based navigation system, where each node tracks the location not only based on its own measurements, but also via collaboration with neighbor nodes. The key problem is to design a nonlinear filter to fuse IMU and radiolocation information. We apply the Rao-Blackwellization method by using a particle filter and parallel Kalman filters for the estimation of orientation and other states (i.e., position, velocity, etc.), respectively. The proposed method significantly outperforms the extended Kalman filter (EKF) in the set of simulations here.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Communications in the ether are highly susceptible to eavesdropping due to the broadcast nature of the wireless medium. To improve communication confidentiality in wireless environments, research efforts have been made to complement cryptography with physical layer security. A recent view of the role of interference, especially in multi-tier wireless networks, suggested that interference engineering can increase the level of communication confidentiality. The design of interference engineering strategies (IESs) requires a thorough characterization of concurrent effects of wireless emissions on legitimate and eavesdropping receivers. This article advocates IESs for achieving a new level of communication confidentiality in multi-tier wireless networks (namely multi-tier network secrecy) with different degrees of coordination among the tiers. Insights on how IES benefits wireless network secrecy are provided, guiding the design of such strategies for a new level of communication confidentiality.
    IEEE Communications Magazine 06/2015; 53(6):28-32. DOI:10.1109/MCOM.2015.7120013 · 4.01 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Location awareness is becoming essential for emerging wireless applications where most network activities require the location information of network nodes, e.g., routing between nodes in ad-hoc sensor networks, positioning vehicles on the road, or tracking targets in underwater acoustic sensor networks. In particular, cooperation among nodes is highly beneficial for the localization accuracy and coverage in harsh environments. In this paper, we study least square (LS) cooperative localization in the presence of arbitrary non-line-of-sight (NLOS) ranging bias. To develop the network position error bound (PEB), we first derive the Fisher information matrix (FIM) for a general NLOS bias model and show that a Gaussian bias due to NLOS effects is the worst case that produces the extremal FIM, whereas a constant bias or equivalently full line-of-sight is the best situation leading to the largest FIM in a sense of Löwner partial ordering. We then analyze the asymptotic performance, such as uniform convergence, consistency, and efficiency, of LS cooperative localization to quantify the deviations of localization accuracy for LS, squared-range LS, and squared-range weighted LS solutions from the fundamental limit (i.e., Cramér–Rao lower bound) due to their practical tractability. We also propose a simple distributed algorithm for LS cooperative localization by integrating squared-range relaxation into Gaussian variational message passing on the localization network. To account for stochastic natures of node locations and populations, we further characterize the network PEB for Gilbert's disk localization network, where anchors and/or agents are randomly distributed in the network according to point processes.
    IEEE Transactions on Vehicular Technology 04/2015; 64(4):1-1. DOI:10.1109/TVT.2015.2398874 · 1.98 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Sensor radar networks enable important new applications based on accurate localization. They rely on the quality of range measurements, which serve as observations for inferring a target location. In harsh propagation environments (e.g., indoors), such observations can be nonrepresentative of the target due to noise, multipath, clutter, and non-line-of-sight conditions leading to target misdetection, false-alarm events, and inaccurate localization. These conditions can be mitigated by selecting and processing a subset of representative observations. We introduce blind techniques for the selection of representative observations gathered by sensor radars operating in harsh environments. A methodology for the design and analysis of sensor radar networks is developed, taking into account the aforementioned impairments and observation selection. Results are obtained for noncoherent ultra-wideband sensor radars in a typical indoor environment (with obstructions, multipath, and clutter) to enable a clear understanding of how observation selection improves the localization accuracy.
    IEEE Transactions on Vehicular Technology 04/2015; 64(4):1388-1400. DOI:10.1109/TVT.2015.2397312 · 1.98 Impact Factor
  • Source
    Kaiqing Zhang · Hong Hu · Wenhan Dai · Yuan Shen · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Increasing sources of sensor measurements and prior knowledge have become available for indoor localization on smartphones. How to effectively utilize these sources for enhancing localization accuracy is an important yet challenging problem. In this paper, we present an area state-aided localization algorithm that exploits various sources of information. Specifically, we introduce the concept of area state to indicate the area where the user is on an indoor map. The position of the user is then estimated using inertial measurement unit (IMU) measurements with the aid of area states. The area states are in turn updated based on the position estimates. To avoid accumulated errors of IMU measurements, our algorithm uses WiFi received signal strength indicator (RSSI) to indicate the vicinity of the user to the routers. The experiment results show that our system can achieve satisfactory localization accuracy in a typical indoor environment.
  • Source
    Liangzhong Ruan · Vincent K. N. Lau · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: In contrast to its wired counterpart, wireless communication is highly susceptible to eavesdropping due to the broadcast nature of the wireless propagation medium. Recent works have proposed the use of interference to reduce eavesdropping capabilities in wireless wiretap networks. However, the concurrent effect of interference on both eavesdropping receivers (ERs) and legitimate receivers (LRs) has not been thoroughly investigated, and carefully engineering the network interference is required to harness the full potential of interference for wireless secrecy. This two part paper addresses this issue by proposing a generalized interference alignment (GIA) technique, which jointly designs the transceivers at the legitimate partners to impede the ERs without interfering with LRs. In Part I, we have established a theoretical framework for the GIA technique. In Part II, we will first propose an efficient GIA algorithm that is applicable to large-scale networks and then evaluate the performance of this algorithm in stochastic wireless wiretap network via both analysis and simulation. These results reveal insights into when and how GIA contributes to wireless secrecy.
    IEEE Transactions on Signal Processing 03/2015; DOI:10.1109/TSP.2015.2474295 · 2.79 Impact Factor
  • Source
    Liangzhong Ruan · Vincent K. N. Lau · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Interference alignment (IA) has attracted enormous research interest as it achieves optimal capacity scaling with respect to signal to noise ratio on interference networks. IA has also recently emerged as an effective tool in engineering interference for secrecy protection on wireless wiretap networks. However, despite the numerous works dedicated to IA, two of its fundamental issues, i.e., feasibility conditions and transceiver design, are not completely addressed in the literature. In this two part paper, a generalised interference alignment (GIA) technique is proposed to enhance the IA's capability in secrecy protection. A theoretical framework is established to analyze the two fundamental issues of GIA in Part I and then the performance of GIA in large-scale stochastic networks is characterized to illustrate how GIA benefits secrecy protection in Part II. The theoretical framework for GIA adopts methodologies from algebraic geometry, determines the necessary and sufficient feasibility conditions of GIA, and generates a set of algorithms that can solve the GIA problem. This framework sets up a foundation for the development and implementation of GIA.
    IEEE Transactions on Signal Processing 03/2015; DOI:10.1109/TSP.2015.2474301 · 2.79 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wideband ranging is essential for numerous emerging applications that rely on accurate location awareness. The quality of range information, which depends on network intrinsic properties and signal processing techniques, affects the localization accuracy. A popular class of ranging techniques is based on energy detection owing to its low-complexity implementation. This paper establishes a tractable model for the range information as a function of wireless environment, signal features, and energy detection techniques. Such a model serves as a cornerstone for the design and analysis of wideband ranging systems. Based on the proposed model, we develop practical soft-decision and hard-decision algorithms. A case study for ranging and localization systems operating in a wireless environment is presented. Sample-level simulations validate our theoretical results.
    IEEE Journal of Selected Topics in Signal Processing 02/2015; 9(2):216-228. DOI:10.1109/JSTSP.2014.2370934 · 2.37 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Achieving secrecy in cognitive wireless networks is challenging due to the broadcast nature of the propagation medium. This article introduces the concept of cognitive network secrecy for coexisting primary and secondary networks sharing the same radio resources. We present a framework for the design and analysis of cognitive networks with secrecy that accounts for their intrinsic properties such as node spatial distribution, wireless propagation medium, and aggregate network interference. While interference is usually considered deleterious for communications, we envision that mutual interference between primary and secondary networks can be beneficial for cognitive network secrecy. To this end, we put forth interference engineering strategies and quantify their benefits for cognitive network secrecy. Our analysis reveals the innate connection between cognitive network secrecy and intrinsic properties of the networks, opening the way to a new paradigm of cognitive network secrecy with interference engineering.
    IEEE Network 10/2014; 28(5):86-90. DOI:10.1109/MNET.2014.6915445 · 2.54 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Novel non-coherent impulse communications receivers are proposed to alleviate excessive noise collection in clustered multipath channels. To this aim, a stop-and-go strategy based on energy detection in the autocorrelation receiver or in the energy detection receiver is employed. This strategy enables the selective collection of useful signal portions only, allowing the integration interval to be kept large without noise penalty. To implement this strategy, a blind method is employed, using model order selection based on information theoretic criteria, which optimizes the performance of the proposed receiver and does not require the estimation of channel parameters. The bit error probability of the proposed stop-and-go receivers is evaluated, and our results highlight the considerable performance gain at the expense of a small increase in complexity.
    IEEE Transactions on Wireless Communications 09/2014; 13(9):4821-4835. DOI:10.1109/TWC.2014.2335196 · 2.50 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the problem of localizing two devices using signals of opportunity from beacons with known positions. Beacons and devices have asynchronous local clocks or oscillators with unknown clock skews and offsets. We model clock skews as random, and analyze the biases introduced by clock asynchronism in the received signals. By deriving the equivalent Fisher information matrix for the modified Bayesian Cramér-Rao lower bound (CRLB) of device position and velocity estimation, we quantify the errors caused by clock asynchronism. We propose an algorithm based on differential time-difference-of-arrival (DTDOA) and frequency-difference-of-arrival (FDOA) that mitigates the effects of clock asynchronism to estimate the device positions and velocities. Simulation results suggest that our proposed algorithm is robust and approaches the CRLB when clock skews have small standard deviations.
    IEEE Transactions on Wireless Communications 07/2014; 13(7):3636-3649. DOI:10.1109/TWC.2014.2314096 · 2.50 Impact Factor
  • We nhan Dai · Yuan Shen · Moe Z. Win ·
    [Show abstract] [Hide abstract]
    ABSTRACT: Accurate position information enables numerous location-based applications. Wireless network localization is a promising localization technique that permits cooperation among mobile objects to enhance localization services. The allocation of transmitting power for such networks plays a critical role since it determines network lifetime, throughput, as well as the localization accuracy. In this paper, we establish an optimization framework for power allocation in cooperative localization networks. We first show that the optimal solution for the power allocation problem can be obtained by semi-definite programs (SDPs). For implementation in cooperative localization networks, we develop efficient and distributed power allocation strategies via relaxation of the original problem. In particular, we decompose the power allocation problem into infrastructure and cooperation parts. We transform the former into SDPs and derive upper bounds for the localization accuracy of the latter. These bounds enable us to develop efficient distributed strategies. Simulation results show that these strategies can achieve significant performance improvement compared to the unoptimized strategies in terms of localization accuracy.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014

Publication Stats

20k Citations
411.53 Total Impact Points


  • 2003-2015
    • Massachusetts Institute of Technology
      • Laboratory for Information and Decision Systems
      Cambridge, Massachusetts, United States
    • Broadcom Corporation
      Irvine, California, United States
  • 2009-2011
    • The Chinese University of Hong Kong
      • Department of Information Engineering
      Hong Kong, Hong Kong
  • 2008-2011
    • Kyung Hee University
      • Electronics and Radio Engineering Division
      Sŏul, Seoul, South Korea
    • University of Ferrara
      • Department of Engineering
      Ferrare, Emilia-Romagna, Italy
  • 2001-2009
    • University of Bologna
      • "Guglielmo Marconi" Department of Electrical, Electronic and Information Engineering DEI
      Bologna, Emilia-Romagna, Italy
    • University of Rome Tor Vergata
      • Dipartimento di Ingegneria Elettronica
      Roma, Latium, Italy
  • 2007
    • University of Oulu
      • Centre for Wireless Communications (CWC)
      Uleoborg, Oulu, Finland
    • Aristotle University of Thessaloniki
      Saloníki, Central Macedonia, Greece
  • 2006
    • University of Florence
      Florens, Tuscany, Italy
  • 2004-2006
    • Mitsubishi Electric Research Laboratories
      Cambridge, Massachusetts, United States
  • 2002-2006
    • University of Alberta
      • Department of Electrical and Computer Engineering
      Edmonton, Alberta, Canada
    • The American University of Rome
      Roma, Latium, Italy
  • 2004-2005
    • University of Texas at Dallas
      • Department of Electrical Engineering
      Richardson, Texas, United States
  • 1998-2005
    • AT&T Labs
      Austin, Texas, United States
  • 2000-2004
    • Indian Institute of Technology Delhi
      • Department of Electrical Engineering
      New Delhi, NCT, India
  • 1997-2003
    • University of Southern California
      • Department of Electrical Engineering
      Los Angeles, California, United States
  • 2001-2002
    • Indian Institute of Technology Ropar
      • Department of Electrical Engineering
      Rūpar, Punjab, India
  • 1991-1995
    • California Institute of Technology
      • Jet Propulsion Laboratory
      Pasadena, California, United States