arXiv subjects

S. H. Song

Publications and source records attributed to S. H. Song.

35 records · Page 2Linked to original sources

arXiv2020

A Low-Complexity Algorithmic Framework for Large-Scale IRS-Assisted Wireless Systems

Intelligent reflecting surfaces (IRSs) are revolutionary enablers for next-generation wireless communication networks, with the ability to customize the radio propagation environment. To fully exploit the potential of IRS-assisted wireless systems, reflective elements have to be jointly optimized with conventional communication techniques. However, the resulting optimization problems pose significant algorithmic challenges, mainly due to the large-scale non-convex constraints induced by the passive hardware implementations. In this paper, we propose a low-complexity algorithmic framework incorporating alternating optimization and gradient-based methods for large-scale IRS-assisted wireless systems. The proposed algorithm provably converges to a stationary point of the optimization problem. Extensive simulation results demonstrate that the proposed framework provides significant speedups compared with existing algorithms, while achieving a comparable or better performance.

cs.IT↗

arXiv2019

Client-Edge-Cloud Hierarchical Federated Learning

Federated Learning is a collaborative machine learning framework to train a deep learning model without accessing clients' private data. Previous works assume one central parameter server either at the cloud or at the edge. The cloud server can access more data but with excessive communication overhead and long latency, while the edge server enjoys more efficient communications with the clients. To combine their advantages, we propose a client-edge-cloud hierarchical Federated Learning system, supported with a HierFAVG algorithm that allows multiple edge servers to perform partial model aggregation. In this way, the model can be trained faster and better communication-computation trade-offs can be achieved. Convergence analysis is provided for HierFAVG and the effects of key parameters are also investigated, which lead to qualitative design guidelines. Empirical experiments verify the analysis and demonstrate the benefits of this hierarchical architecture in different data distribution scenarios. Particularly, it is shown that by introducing the intermediate edge servers, the model training time and the energy consumption of the end devices can be simultaneously reduced compared to cloud-based Federated Learning.

cs.NI↗

arXiv2019

Connectivity-Aware UAV Path Planning with Aerial Coverage Maps

Cellular networks are promising to support effective wireless communications for unmanned aerial vehicles (UAVs), which will help to enable various long-range UAV applications. However, these networks are optimized for terrestrial users, and thus do not guarantee seamless aerial coverage. In this paper, we propose to overcome this difficulty by exploiting controllable mobility of UAVs, and investigate connectivity-aware UAV path planning. To explicitly impose communication requirements on UAV path planning, we introduce two new metrics to quantify the cellular connectivity quality of a UAV path. Moreover, aerial coverage maps are used to provide accurate locations of scattered coverage holes in the complicated propagation environment. We formulate the UAV path planning problem as finding the shortest path subject to connectivity constraints. Based on graph search methods, a novel connectivity-aware path planning algorithm with low complexity is proposed. The effectiveness and superiority of our proposed algorithm are demonstrated using the aerial coverage map of an urban section in Virginia, which is built by ray tracing. Simulation results also illustrate a tradeoff between the path length and connectivity quality of UAVs.

cs.NI↗

arXiv2018

Exploiting Mobility in Cache-Assisted D2D Networks: Performance Analysis and Optimization

Caching popular content at mobile devices, accompanied by device-to-device (D2D) communications, is one promising technology for effective mobile content delivery. User mobility is an important factor when investigating such networks, which unfortunately was largely ignored in most previous works. Preliminary studies have been carried out, but the effect of mobility on the caching performance has not been fully understood. In this paper, by explicitly considering users' contact and inter-contact durations via an alternating renewal process, we first investigate the effect of mobility with a given cache placement. A tractable expression of the data offloading ratio, i.e., the proportion of requested data that can be delivered via D2D links, is derived, which is proved to be increasing with the user moving speed. The analytical results are then used to develop an effective mobility-aware caching strategy to maximize the data offloading ratio. Simulation results are provided to confirm the accuracy of the analytical results and also validate the effect of user mobility. Performance gains of the proposed mobility-aware caching strategy are demonstrated with both stochastic models and real-life data sets. It is observed that the information of the contact durations is critical to design cache placement, especially when they are relatively short or comparable to the inter-contact durations.

cs.IT↗

arXiv2017

Mobility-Aware Caching in D2D Networks

Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize the data offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations (BSs). Given the NP-hard caching placement problem, we first propose an optimal dynamic programming (DP) algorithm to obtain a performance benchmark, but with much lower complexity than exhaustive search. We will then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as 1/2. Simulation results with real-life data-sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.

cs.IT↗

arXiv2017

Mobility Increases the Data Offloading Ratio in D2D Caching Networks

Caching at mobile devices, accompanied by device-to-device (D2D) communications, is one promising technique to accommodate the exponentially increasing mobile data traffic. While most previous works ignored user mobility, there are some recent works taking it into account. However, the duration of user contact times has been ignored, making it difficult to explicitly characterize the effect of mobility. In this paper, we adopt the alternating renewal process to model the duration of both the contact and inter-contact times, and investigate how the caching performance is affected by mobility. The data offloading ratio, i.e., the proportion of requested data that can be delivered via D2D links, is taken as the performance metric. We first approximate the distribution of the communication time for a given user by beta distribution through moment matching. With this approximation, an accurate expression of the data offloading ratio is derived. For the homogeneous case where the average contact and inter-contact times of different user pairs are identical, we prove that the data offloading ratio increases with the user moving speed, assuming that the transmission rate remains the same. Simulation results are provided to show the accuracy of the approximate result, and also validate the effect of user mobility.

cs.IT↗

arXiv2017

Stochastic Joint Radio and Computational Resource Management for Multi-User Mobile-Edge Computing Systems

Mobile-edge computing (MEC) has recently emerged as a prominent technology to liberate mobile devices from computationally intensive workloads, by offloading them to the proximate MEC server. To make offloading effective, the radio and computational resources need to be dynamically managed, to cope with the time-varying computation demands and wireless fading channels. In this paper, we develop an online joint radio and computational resource management algorithm for multi-user MEC systems, with the objective as minimizing the long-term average weighted sum power consumption of the mobile devices and the MEC server, subject to a task buffer stability constraint. Specifically, at each time slot, the optimal CPU-cycle frequencies of the mobile devices are obtained in closed forms, and the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method; while for the MEC server, both the optimal frequencies of the CPU cores and the optimal MEC server scheduling decision are derived in closed forms. Besides, a delay-improved mechanism is proposed to reduce the execution delay. Rigorous performance analysis is conducted for the proposed algorithm and its delay-improved version, indicating that the weighted sum power consumption and execution delay obey an $\left[O\left(1\slash V\right),O\left(V\right)\right]$ tradeoff with $V$ as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters.

cs.IT↗

arXiv2016

Developing and Assessing MATLAB Exercises for Active Concept Learning

New technologies, such as MOOCs, provide innovative methods to tackle new challenges in teaching and learning, such as globalization and changing contemporary culture and to remove the limits of conventional classrooms. However, they also bring challenges in course delivery and assessment, due to factors such as less direct student-instructor interaction. These challenges are especially severe in engineering education, which relies heavily on experiential learning, such as computer simulations and laboratory exercises, to assist students in understanding concepts. As a result, effective design of experiential learning components is extremely critical for engineering MOOCs. In this paper, we will share our experience gained through developing and offering a MOOC on communication systems, with special focus on the development and assessment of MATLAB exercises for active concept learning. Our approach introduced students to concepts using learning components commonly provided by many MOOC platforms (e.g., online lectures and quizzes), and augmented the student experience with MATLAB based computer simulations and exercises to enable more concrete and detailed understanding of the material. We describe here a systematic approach to MATLAB problem design and assessment, based on our experience with the MATLAB server provided by MathWorks and integrated with the edX MOOC platform. We discuss the effectiveness of the instructional methods as evaluated through students' learning performance. We analyze the impact of the course design tools from both the instructor and the student perspective.

cs.CY↗

arXiv2016

Power-Delay Tradeoff in Multi-User Mobile-Edge Computing Systems

Mobile-edge computing (MEC) has recently emerged as a promising paradigm to liberate mobile devices from increasingly intensive computation workloads, as well as to improve the quality of computation experience. In this paper, we investigate the tradeoff between two critical but conflicting objectives in multi-user MEC systems, namely, the power consumption of mobile devices and the execution delay of computation tasks. A power consumption minimization problem with task buffer stability constraints is formulated to investigate the tradeoff, and an online algorithm that decides the local execution and computation offloading policy is developed based on Lyapunov optimization. Specifically, at each time slot, the optimal frequencies of the local CPUs are obtained in closed forms, while the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method. Performance analysis is conducted for the proposed algorithm, which indicates that the power consumption and execution delay obeys an [O (1/V); O (V)] tradeoff with V as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters to the system performance.

cs.IT↗

arXiv2016

Optimal QoS-Aware Channel Assignment in D2D Communications with Partial CSI

In this paper, we propose effective channel assignment algorithms for network utility maximization in a cellular network with underlaying device-to-device (D2D) communications. A major innovation is the consideration of partial channel state information (CSI), i.e., the base station (BS) is assumed to be able to acquire `partial' instantaneous CSI of the cellular and D2D links, as well as, the interference links. In contrast to existing works, multiple D2D links are allowed to share the same channel, and the quality of service (QoS) requirements for both the cellular and D2D links are enforced. We first develop an optimal channel assignment algorithm based on dynamic programming (DP), which enjoys a much lower complexity compared to exhaustive search and will serve as a performance benchmark. To further reduce complexity, we propose a cluster-based sub-optimal channel assignment algorithm. New closed-form expressions for the expected weighted sum-rate and the successful transmission probabilities are also derived. Simulation results verify the effectiveness of the proposed algorithms. Moreover, by comparing different partial CSI scenarios, we observe that the CSI of the D2D communication links and the interference links from the D2D transmitters to the BS significantly affects the network performance, while the CSI of the interference links from the BS to the D2D receivers only has a negligible impact.

cs.IT↗

arXiv2016

QoS-Aware Joint Mode Selection and Channel Assignment for D2D Communications

Underlaying device-to-device (D2D) communications to a cellular network is considered as a key technique to improve spectral efficiency in 5G networks. For such D2D systems, mode selection and resource allocation have been widely utilized for managing interference. However, previous works allowed at most one D2D link to access the same channel, while mode selection and resource allocation are typically separately designed. In this paper, we jointly optimize the mode selection and channel assignment in a cellular network with underlaying D2D communications, where multiple D2D links may share the same channel. Meanwhile, the QoS requirements for both cellular and D2D links are guaranteed, in terms of Signal-to-Interference-plus-Noise Ratio (SINR). We first propose an optimal dynamic programming (DP) algorithm, which provides a much lower computation complexity compared to exhaustive search and serves as the performance bench mark. A bipartite graph based greedy algorithm is then proposed to achieve a polynomial time complexity. Simulation results will demonstrate the advantage of allowing each channel to be accessed by multiple D2D links in dense D2D networks, as well as, the effectiveness of the proposed algorithms.

cs.IT↗

arXiv2016

Cache Size Allocation in Backhaul Limited Wireless Networks

Caching popular content at base stations is a powerful supplement to existing limited backhaul links for accommodating the exponentially increasing mobile data traffic. Given the limited cache budget, we investigate the cache size allocation problem in cellular networks to maximize the user success probability (USP), taking wireless channel statistics, backhaul capacities and file popularity distributions into consideration. The USP is defined as the probability that one user can successfully download its requested file either from the local cache or via the backhaul link. We first consider a single-cell scenario and derive a closed-form expression for the USP, which helps reveal the impacts of various parameters, such as the file popularity distribution. More specifically, for a highly concentrated file popularity distribution, the required cache size is independent of the total number of files, while for a less concentrated file popularity distribution, the required cache size is in linear relation to the total number of files. Furthermore, we study the multi-cell scenario, and provide a bisection search algorithm to find the optimal cache size allocation. The optimal cache size allocation is verified by simulations, and it is shown to play a more significant role when the file popularity distribution is less concentrated.

cs.IT↗

arXiv2012

Cooperative Cognitive Networks: Optimal, Distributed and Low-Complexity Algorithms

This paper considers the cooperation between a cognitive system and a primary system where multiple cognitive base stations (CBSs) relay the primary user's (PU) signals in exchange for more opportunity to transmit their own signals. The CBSs use amplify-and-forward (AF) relaying and coordinated beamforming to relay the primary signals and transmit their own signals. The objective is to minimize the overall transmit power of the CBSs given the rate requirements of the PU and the cognitive users (CUs). We show that the relaying matrices have unit rank and perform two functions: Matched filter receive beamforming and transmit beamforming. We then develop two efficient algorithms to find the optimal solution. The first one has linear convergence rate and is suitable for distributed implementation, while the second one enjoys superlinear convergence but requires centralized processing. Further, we derive the beamforming vectors for the linear conventional zero-forcing (CZF) and prior zero-forcing (PZF) schemes, which provide much simpler solutions. Simulation results demonstrate the improvement in terms of outage performance due to the cooperation between the primary and cognitive systems.

cs.IT↗

arXiv1999

Phase diagram of the integer quantum Hall effect in p-type Germanium

We experimentally study the phase diagram of the integer quantized Hall effect, as a function of density and magnetic field. We used a two dimensional hole system confined in a Ge/SiGe quantum well, where all energy levels are resolved, because the Zeeman splitting is comparable to the cyclotron energy. At low fields and close to the quantum Hall liquid-to-insulator transition, we observe the floating up of the lowest energy level, but NO FLOATING of any higher levels, rather a merging of these levels into the insulating state. For a given filling factor, only direct transitions between the insulating phase and higher quantum Hall liquids are observed as a function of density. Finally, we observe a peak in the critical resistivity around filling factor one.

cond-mat.mes-hall↗

arXiv1998

Semicircle: An exact relation in the Integer and Fractional Quantum Hall Effect

We present experimental results on the quantized Hall insulator in two dimensions. This insulator, with vanishing conductivities, is characterized by the quantization (within experimental accuracy) of the Hall resistance in units of the quantum unit of resistance, h/e^2. The measurements were performed in a two dimensional hole system, confined in a Ge/SiGe quantum well, when the magnetic field is increased above the nu=1 quantum Hall state. This quantization leads to a nearly perfect semi-circle relation for the diagonal and Hall conductivities. Similar results are obtained with a higher mobility n-type modulation doped GaAs/AlGaAs sample, when the magnetic field is increased above the nu=1/3 fractional quantum Hall state.

cond-mat.mes-hall↗

arXiv1998

The Quantized Hall Insulator: A New Insulator in Two-Dimensions

Quite generally, an insulator is theoretically defined by a vanishing conductivity tensor at the absolute zero of temperature. In classical insulators, such as band insulators, vanishing conductivities lead to diverging resistivities. In other insulators, in particular when a high magnetic field (B) is added, it is possible that while the magneto-resistance diverges, the Hall resistance remains finite, which is known as a Hall insulator. In this letter we demonstrate experimentally the existence of another, more exotic, insulator. This insulator, which terminates the quantum Hall effect series in a two-dimensional electron system, is characterized by a Hall resistance which is approximately quantized in the quantum unit of resistance h/e^2. This insulator is termed a quantized Hall insulator. In addition we show that for the same sample, the insulating state preceding the QHE series, at low-B, is of the HI kind.

cond-mat.mes-hall↗

arXiv1997

Symmetry in the insulator - quantum Hall - insulator transitions observed in a Ge/SiGe quantum well

We examine the magnetic field driven insulator-quantum Hall-insulator transitions of the two dimensional hole gas in a Ge/SiGe quantum well. We observe direct transitions between low and high magnetic field insulators and the $ν=1$ quantum Hall state. With increasing magnetic field, the transitions from insulating to quantum Hall and quantum Hall to insulating are very similar with respect to their transport properties. We address the temperature dependence around the transitions and show that the characteristic energy scale for the high field transition is larger.

cond-mat.mes-hall↗