arXiv subjects

Sang-Woon Jeon

Publications and source records attributed to Sang-Woon Jeon.

At least 19 recordsLinked to original sources

arXiv2024

3D UAV Trajectory Planning for IoT Data Collection via Matrix-Based Evolutionary Computation

UAVs are increasingly becoming vital tools in various wireless communication applications including internet of things (IoT) and sensor networks, thanks to their rapid and agile non-terrestrial mobility. Despite recent research, planning three-dimensional (3D) UAV trajectories over a continuous temporal-spatial domain remains challenging due to the need to solve computationally intensive optimization problems. In this paper, we study UAV-assisted IoT data collection aimed at minimizing total energy consumption while accounting for the UAV's physical capabilities, the heterogeneous data demands of IoT nodes, and 3D terrain. We propose a matrix-based differential evolution with constraint handling (MDE-CH), a computation-efficient evolutionary algorithm designed to address non-convex constrained optimization problems with several different types of constraints. Numerical evaluations demonstrate that the proposed MDE-CH algorithm provides a continuous 3D temporal-spatial UAV trajectory capable of efficiently minimizing energy consumption under various practical constraints and outperforms the conventional fly-hover-fly model for both two-dimensional (2D) and 3D trajectory planning.

cs.NE↗

arXiv2024

Optimal Batch Allocation for Wireless Federated Learning

Federated learning aims to construct a global model that fits the dataset distributed across local devices without direct access to private data, leveraging communication between a server and the local devices. In the context of a practical communication scheme, we study the completion time required to achieve a target performance. Specifically, we analyze the number of iterations required for federated learning to reach a specific optimality gap from a minimum global loss. Subsequently, we characterize the time required for each iteration under two fundamental multiple access schemes: time-division multiple access (TDMA) and random access (RA). We propose a step-wise batch allocation, demonstrated to be optimal for TDMA-based federated learning systems. Additionally, we show that the non-zero batch gap between devices provided by the proposed step-wise batch allocation significantly reduces the completion time for RA-based learning systems. Numerical evaluations validate these analytical results through real-data experiments, highlighting the remarkable potential for substantial completion time reduction.

cs.LG↗

arXiv2024

Hybrid Online-Offline Learning for Task Offloading in Mobile Edge Computing Systems

We consider a multi-user multi-server mobile edge computing (MEC) system, in which users arrive on a network randomly over time and generate computation tasks, which will be computed either locally on their own computing devices or be offloaded to one of the MEC servers. Under such a dynamic network environment, we propose a novel task offloading policy based on hybrid online-offline learning, which can efficiently reduce the overall computation delay and energy consumption only with information available at nearest MEC servers from each user. We provide a practical signaling and learning framework that can train deep neural networks for both online and offline learning and can adjust its offloading policy based on the queuing status of each MEC server and network dynamics. Numerical results demonstrate that the proposed scheme significantly reduces the average computation delay for a broad class of network environments compared to the conventional offloading methods. It is further shown that the proposed hybrid online-offline learning framework can be extended to a general cost function reflecting both delay and energy-dependent metrics.

eess.SP↗

arXiv2023

Rate-Splitting Multiple Access for 6G Networks: Ten Promising Scenarios and Applications

In the upcoming 6G era, multiple access (MA) will play an essential role in achieving high throughput performances required in a wide range of wireless applications. Since MA and interference management are closely related issues, the conventional MA techniques are limited in that they cannot provide near-optimal performance in universal interference regimes. Recently, rate-splitting multiple access (RSMA) has been gaining much attention. RSMA splits an individual message into two parts: a common part, decodable by every user, and a private part, decodable only by the intended user. Each user first decodes the common message and then decodes its private message by applying successive interference cancellation (SIC). By doing so, RSMA not only embraces the existing MA techniques as special cases but also provides significant performance gains by efficiently mitigating inter-user interference in a broad range of interference regimes. In this article, we first present the theoretical foundation of RSMA. Subsequently, we put forth four key benefits of RSMA: spectral efficiency, robustness, scalability, and flexibility. Upon this, we describe how RSMA can enable ten promising scenarios and applications along with future research directions to pave the way for 6G.

cs.IT↗

arXiv2023

CEC: Crowdsourcing-based Evolutionary Computation for Distributed Optimization

Crowdsourcing is an emerging computing paradigm that takes advantage of the intelligence of a crowd to solve complex problems effectively. Besides collecting and processing data, it is also a great demand for the crowd to conduct optimization. Inspired by this, this paper intends to introduce crowdsourcing into evolutionary computation (EC) to propose a crowdsourcing-based evolutionary computation (CEC) paradigm for distributed optimization. EC is helpful for optimization tasks of crowdsourcing and in turn, crowdsourcing can break the spatial limitation of EC for large-scale distributed optimization. Therefore, this paper firstly introduces the paradigm of crowdsourcing-based distributed optimization. Then, CEC is elaborated. CEC performs optimization based on a server and a group of workers, in which the server dispatches a large task to workers. Workers search for promising solutions through EC optimizers and cooperate with connected neighbors. To eliminate uncertainties brought by the heterogeneity of worker behaviors and devices, the server adopts the competitive ranking and uncertainty detection strategy to guide the cooperation of workers. To illustrate the satisfactory performance of CEC, a crowdsourcing-based swarm optimizer is implemented as an example for extensive experiments. Comparison results on benchmark functions and a distributed clustering optimization problem demonstrate the potential applications of CEC.

cs.NE↗

arXiv2023

Reconfigurable Intelligent Surface Aided Hybrid Beamforming: Optimal Placement and Beamforming Design

We consider reconfigurable intelligent surface (RIS) aided sixth-generation (6G) terahertz (THz) communications for indoor environment in which a base station (BS) wishes to send independent messages to its serving users with the help of multiple RISs. For indoor environment, various obstacles such as pillars, walls, and other objects can result in no line-of-sight signal path between the BS and a user, which can significantly degrade performance. To overcome such limitation of indoor THz communication, we firstly optimize the placement of RISs to maximize the coverage area. Under the optimized RIS placement, we propose 3D hybrid beamforming at the BS and phase adjustment at RISs, which are jointly performed at the BS and RISs via codebook-based 3D beam scanning with low complexity. Numerical simulations demonstrate that the proposed scheme significantly improves the average sum rate compared to the cases of no RIS and randomly deployed RISs. It is further shown that the proposed codebook-based 3D beam scanning efficiently aligns analog beams between BS--user links or BS--RIS--user links and, as a consequence, achieves the average sum rate close to that of coherent beam alignment requiring global channel state information.

cs.IT↗

arXiv2022

Integer Forcing Interference Management for the MIMO Interference Channel

A new interference management scheme based on integer forcing (IF) receivers is studied for the two-user multiple-input and multiple-output (MIMO) interference channel. The proposed scheme employs a message splitting method that divides each data stream into common and private sub-streams, in which the private stream is recovered by the dedicated receiver only while the common stream is required to be recovered by both receivers. Specifically, to enable IF sum decoding at the receiver side, all streams are encoded using the same lattice code. Additionally, the number of common and private streams of each user is carefully determined by considering the number of antennas at transmitters and receivers, the channel matrices, and the effective signal-to-noise ratio (SNR) at each receiver to maximize the achievable rate. Furthermore, we consider various assumptions of channel state information at the transmitter side (CSIT) and propose low-complexity linear transmit beamforming suitable for each CSIT assumption. The achievable sum rate and rate region are analytically derived and extensively evaluated by simulation for various environments, demonstrating that the proposed interference management scheme strictly outperforms the previous benchmark schemes in a wide range of channel parameters due to the gain from IF sum decoding.

cs.IT↗

arXiv2022

Hybrid Neural Coded Modulation: Design and Training Methods

We propose a hybrid coded modulation scheme which composes of inner and outer codes. The outer-code can be any standard binary linear code with efficient soft decoding capability (e.g. low-density parity-check (LDPC) codes). The inner code is designed using a deep neural network (DNN) which takes the channel coded bits and outputs modulated symbols. For training the DNN, we propose to use a loss function that is inspired by the generalized mutual information. The resulting constellations are shown to outperform the conventional quadrature amplitude modulation (QAM) based coding scheme for modulation order 16 and 64 with 5G standard LDPC codes.

cs.IT↗

arXiv2021

Dynamic Multichannel Access via Multi-agent Reinforcement Learning: Throughput and Fairness Guarantees

We consider a multichannel random access system in which each user accesses a single channel at each time slot to communicate with an access point (AP). Users arrive to the system at random and be activated for a certain period of time slots and then disappear from the system. Under such dynamic network environment, we propose a distributed multichannel access protocol based on multi-agent reinforcement learning (RL) to improve both throughput and fairness between active users. Unlike the previous approaches adjusting channel access probabilities at each time slot, the proposed RL algorithm deterministically selects a set of channel access policies for several consecutive time slots. To effectively reduce the complexity of the proposed RL algorithm, we adopt a branching dueling Q-network architecture and propose an efficient training methodology for producing proper Q-values over time-varying user sets. We perform extensive simulations on realistic traffic environments and demonstrate that the proposed online learning improves both throughput and fairness compared to the conventional RL approaches and centralized scheduling policies.

eess.SP↗

arXiv2020

Online Estimation and Adaptation for Random Access with Successive Interference Cancellation

This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot, owing to the SIC technique, the AP is able to decode them through SIC resolve procedures (SRPs), which may occupy multiple consequent slots. While such an SRP could potentially improve the system throughput, how to fully exploit this capability in practical systems is still questionable. In particular, the number of active users contending for the channel varies over time which complicates the algorithm design. By fully exploiting the potential of SIC, the proposed algorithm is designed to maximize the system throughput and minimize the access delay. For this purpose, an online estimation is introduced to estimate the number of active users in real-time and controls their transmissions accordingly. It is shown that the throughput of the proposed algorithm can reach up to 0.693 packets/slot under practical assumptions, which is the first result achieving the throughput limit proved by Yu-Giannakis. It is further shown that the system throughput of 0.559 packets/slot (80.6$\%$ of the throughput limit) is still achievable when the SIC capability is restricted by two.

cs.IT↗

arXiv2018

How to Cache in Mobile Hybrid IoT Networks?

Content-centric mobile hybrid Internet-of-Things (IoT) networks consisting of mobile devices and static femto access points (FAPs) are studied, where each device moves according to the random walk mobility model and requests a content object from the library independently at random according to a Zipf popularity distribution. Instead of allowing access to content objects at macro base stations via costly backhaul providing connection to the core network, we consider a more practical scenario where mobile devices and static FAPs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile devices or static FAPs. Under a general multihop-based content delivery protocol, we analyze the order-optimal throughput--delay trade-off by presenting a new cache allocation strategy. In particular, under a given caching strategy, we first characterize a throughput--delay trade-off in terms of scaling laws along with the general content delivery multihop routing protocol. Then, the order-optimal throughput--delay trade-off is characterized by presenting the order-optimal cache allocation strategy, which jointly finds the replication sets at mobile devices and static FAPs via a novel variable decoupling approach. In our mobile IoT network, an interesting observation is that highly popular content objects are mainly served by mobile devices while the rest of content objects are served by static FAPs. We perform numerical evaluation to validate our analytical results. We also show that the order-optimal strategy strictly outperforms a baseline approach, where the replication sets at mobile devices and static FAPs are optimized separately.

cs.IT↗

arXiv2018

Cooperative Strategies for {UAV}-Enabled Small Cell Networks Sharing Unlicensed Spectrum

In this paper, we study an aerial drone base station (DBS) assisted cellular network that consists of a single ground macro base station (MBS), multiple DBSs, and multiple ground terminals (GT). We assume that the MBS transmits to the DBSs and the GTs in the licensed band while the DBSs use a separate unlicensed band (e.g. Wi-Fi) to transmit to the GTs. For the utilization of the DBSs, we propose a cooperative decode--forward (DF) protocol in which multiple DBSs assist the terminals simultaneously while maintaining a predetermined interference level on the coexisting unlicensed band users. For our network setup, we formulate a joint optimization problem for minimizing the aggregate gap between the target rates and the throughputs of terminals by optimizing over the 3D positions of the DBSs and the resources (power, time, bandwidth) of the network. To solve the optimization problem, we propose an efficient nested structured algorithm based on particle swarm optimization and convex optimization methods. Extensive numerical evaluations of the proposed algorithm is performed considering various aspects to demonstrate the performance of our algorithm and the gain for utilizing DBSs.

cs.IT↗

arXiv2016

Degrees of Freedom of Full-Duplex Cellular Networks with Reconfigurable Antennas at Base Station

Full-duplex (FD) cellular networks are considered in which a FD base station (BS) simultaneously supports a set of half-duplex (HD) downlink (DL) users and a set of HD uplink (UL) users. The transmitter and the receiver of the BS are equipped with reconfigurable antennas, each of which can choose its transmit or receive mode from several preset modes. Under the no self-interference assumption arisen from FD operation at the BS, the sum degrees of freedom (DoF) of FD cellular networks is investigated for both no channel state information at the transmit side (CSIT) and partial CSIT. In particular, the sum DoF is completely characterized for no CSIT model and an achievable sum DoF is established for the partial CSIT model, which improves the sum DoF of the conventional HD cellular networks. For both no CSIT and partial CSIT models, the results show that the FD BS with reconfigurable antennas can double the sum DoF even in the presence of user-to-user interference as both the numbers of DL and UL users and preset modes increase. It is further demonstrated that such DoF improvement indeed yields the sum rate improvement at the finite and operational signal-to-noise ratio regime.

cs.IT↗

arXiv2016

The Feasibility of Interference Alignment for Reverse TDD Systems in MIMO Cellular Networks

The feasibility conditions of interference alignment (IA) are analyzed for reverse TDD systems, i.e., one cell operates as downlink (DL) but the other cell operates as uplink (UL). Under general multiple-input and multiple-output (MIMO) antenna configurations, a necessary condition and a sufficient condition for one-shot linear IA are established, i.e., linear IA without symbol or time extension. In several example networks, optimal sum degrees of freedom (DoF) is characterized by the derived necessary condition and sufficient condition. For symmetric DoF within each cell, a sufficient condition is established in a more compact expression, which yields the necessary and sufficient condition for a class of symmetric DoF. An iterative construction of transmit and received beamforming vectors is further proposed, which provides a specific beamforming design satisfying one-shot IA. Simulation results demonstrate that the proposed IA not only achieve lager DoF but also significantly improve the sum rate in the practical signal-to-noise ratio (SNR) regime.

cs.IT↗

arXiv2016

Fundamental Limits of Spectrum Sharing Full-Duplex Multicell Networks

This paper studies the degrees of freedom of full-duplex multicell networks that share the spectrum among multiple cells in a non-orthogonal setting. In the considered network, we assume that {\em full-duplex} base stations with multiple transmit and receive antennas communicate with multiple single-antenna mobile users. By spectrum sharing among multiple cells and (simultaneously) enabling full-duplex radio, the network can utilize the spectrum more flexibly, but, at the same time, the network is subject to multiple sources of interference compared to a network with separately dedicated bands for distinct cells and uplink--downlink traffic. Consequently, to take advantage of the additional freedom in utilizing the spectrum, interference management is a crucial ingredient. In this work, we propose a novel strategy based on interference alignment which takes into account inter-cell interference and intra-cell interference caused by spectrum sharing and full-duplex to establish a general achievability result on the sum degrees of freedom of the considered network. Paired with an upper bound on the sum degrees of freedom, which is tight under certain conditions, we demonstrate how spectrum sharing and full-duplex can significantly improve the throughput over conventional cellular networks, especially for a network with large number of users and/or cells.

cs.IT↗

arXiv2015

Wireless Multihop Device-to-Device Caching Networks

We consider a wireless device-to-device (D2D) network where $n$ nodes are uniformly distributed at random over the network area. We let each node with storage capacity $M$ cache files from a library of size $m \geq M$. Each node in the network requests a file from the library independently at random, according to a popularity distribution, and is served by other nodes having the requested file in their local cache via (possibly) multihop transmissions. Under the classical "protocol model" of wireless networks, we characterize the optimal per-node capacity scaling law for a broad class of heavy-tailed popularity distributions including Zipf distributions with exponent less than one. In the parameter regimes of interest, we show that a decentralized random caching strategy with uniform probability over the library yields the optimal per-node capacity scaling of $Θ(\sqrt{M/m})$, which is constant with $n$, thus yielding throughput scalability with the network size. Furthermore, the multihop capacity scaling can be significantly better than for the case of single-hop caching networks, for which the per-node capacity is $Θ(M/m)$. The multihop capacity scaling law can be further improved for a Zipf distribution with exponent larger than some threshold $> 1$, by using a decentralized random caching uniformly across a subset of most popular files in the library. Namely, ignoring a subset of less popular files (i.e., effectively reducing the size of the library) can significantly improve the throughput scaling while guaranteeing that all nodes will be served with high probability as $n$ increases.

cs.IT↗

arXiv2015

Elastic Routing in Wireless Ad Hoc Networks With Directional Antennas

Throughput scaling laws of an ad hoc network equipping directional antennas at each node are analyzed. More specifically, this paper considers a general framework in which the beam width of each node can scale at an arbitrary rate relative to the number of nodes. We introduce an elastic routing protocol, which enables to increase per-hop distance elastically according to the beam width, while maintaining an average signal-to-interference-and-noise ratio at each receiver as a constant. We then identify fundamental operating regimes characterized according to the beam width scaling and analyze throughput scaling laws for each of the regimes. The elastic routing is shown to achieve a much better throughput scaling law than that of the conventional nearest-neighbor multihop for all operating regimes. The gain comes from the fact that more source--destination pairs can be simultaneously activated as the beam width becomes narrower, which eventually leads to a linear throughput scaling law. In addition, our framework is applied to a hybrid network consisting of both wireless ad hoc nodes and infrastructure nodes. As a result, in the hybrid network, we analyze a further improved throughput scaling law and identify the operating regime where the use of directional antennas is beneficial.

cs.IT↗

arXiv2015

Degrees of Freedom of Full-Duplex Multiantenna Cellular Networks

We study the degrees of freedom (DoF) of cellular networks in which a full duplex (FD) base station (BS) equipped with multiple transmit and receive antennas communicates with multiple mobile users. We consider two different scenarios. In the first scenario, we study the case when half duplex (HD) users, partitioned to either the uplink (UL) set or the downlink (DL) set, simultaneously communicate with the FD BS. In the second scenario, we study the case when FD users simultaneously communicate UL and DL data with the FD BS. Unlike conventional HD only systems, inter-user interference (within the cell) may severely limit the DoF, and must be carefully taken into account. With the goal of providing theoretical guidelines for designing such FD systems, we completely characterize the sum DoF of each of the two different FD cellular networks by developing an achievable scheme and obtaining a matching upper bound. The key idea of the proposed scheme is to carefully allocate UL and DL information streams using interference alignment and beamforming techniques. By comparing the DoFs of the considered FD systems with those of the conventional HD systems, we establish the DoF gain by enabling FD operation in various configurations. As a consequence of the result, we show that the DoF can approach the two-fold gain over the HD systems when the number of users becomes large enough as compared to the number of antennas at the BS.

cs.IT↗