Searcharxiv⌕ Search

arXiv subjects

Choong Seon Hong

Publications and source records attributed to Choong Seon Hong.

At least 163 records · Page 9Linked to original sources

Reinforcement Learning Based Vehicle-cell Association Algorithm for Highly Mobile Millimeter Wave Communication

Vehicle-to-everything (V2X) communication is a growing area of communication with a variety of use cases. This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks. The aim is to maximize the time average rate per vehicular user (VUE) while ensuring a target minimum rate for all VUEs with low signaling overhead. We first formulate the user (vehicle) association problem as a discrete non-convex optimization problem. Then, by leveraging tools from machine learning, specifically distributed deep reinforcement learning (DDRL) and the asynchronous actor critic algorithm (A3C), we propose a low complexity algorithm that approximates the solution of the proposed optimization problem. The proposed DDRL-based algorithm endows every road side unit (RSU) with a local RL agent that selects a local action based on the observed input state. Actions of different RSUs are forwarded to a central entity, that computes a global reward which is then fed back to RSUs. It is shown that each independently trained RL performs the vehicle-RSU association action with low control overhead and less computational complexity compared to running an online complex algorithm to solve the non-convex optimization problem. Finally, simulation results show that the proposed solution achieves up to 15\% gains in terms of sum rate and 20\% reduction in VUE outages compared to several baseline designs.

cs.NI↗

Deep Learning with Persistent Homology for Orbital Angular Momentum (OAM) Decoding

Orbital angular momentum (OAM)-encoding has recently emerged as an effective approach for increasing the channel capacity of free-space optical communications. In this paper, OAM-based decoding is formulated as a supervised classification problem. To maintain lower error rate in presence of severe atmospheric turbulence, a new approach that combines effective machine learning tools from persistent homology and convolutional neural networks (CNNs) is proposed to decode the OAM modes. A Gaussian kernel with learnable parameters is proposed in order to connect persistent homology to CNN, allowing the system to extract and distinguish robust and unique topological features for the OAM modes. Simulation results show that the proposed approach achieves up to 20% gains in classification accuracy rate over state-of-the-art of method based on only CNNs. These results essentially show that geometric and topological features play a pivotal role in the OAM mode classification problem.

eess.SP↗

Radio Resource Allocation in 5G New Radio: A Neural Networks Based Approach)

The minimum frequency-time unit that can be allocated to User Equipments (UEs) in the fifth generation (5G) cellular networks is a Resource Block (RB). A RB is a channel composed of a set of OFDM subcarriers for a given time slot duration. 5G New Radio (NR) allows for a large number of block shapes ranging from 15 kHz to 480 kHz. In this paper, we address the problem of RBs allocation to UEs. The RBs are allocated at the beginning of each time slot based on the channel state of each UE. The problem is formulated based on the Generalized Proportional Fair (GPF) scheduling. Then, we model the problem as a 2-Dimension Hopfield Neural Networks (2D-HNN). Finally, in an attempt to solve the problem, the energy function of 2D-HNN is investigated. Simulation results show the efficiency of the proposed approach.

cs.NI↗

Ultra-Reliable Communication in 5G mmWave Networks: A Risk-Sensitive Approach

This letter investigates the problem of providing gigabit wireless access with reliable communication in 5G millimeter-Wave (mmWave) massive multiple-input multiple-output (MIMO) networks. In contrast to the classical network design based on average metrics, a distributed risk-sensitive reinforcement learning-based framework is proposed to jointly optimize the beamwidth and transmit power, while taking into account the sensitivity of mmWave links due to blockage. Numerical results show that our proposed algorithm achieves more than 9 Gbps of user throughput with a guaranteed probability of 90%, whereas the baselines guarantee less than 7.5 Gbps. More importantly, there exists a rate-reliability-network density tradeoff, in which as the user density increases from 16 to 96 per km2, the fraction of users that achieve 4 Gbps are reduced by 11.61% and 39.11% in the proposed and the baseline models, respectively.

cs.NI↗

Next-generation Wireless Solutions for the Smart Factory, Smart Vehicles, the Smart Grid and Smart Cities

5G wireless systems will extend mobile communication services beyond mobile telephony, mobile broadband, and massive machine-type communication into new application domains, namely the so-called vertical domains including the smart factory, smart vehicles, smart grid, smart city, etc. Supporting these vertical domains comes with demanding requirements: high-availability, high-reliability, low-latency, and in some cases, high-accuracy positioning. In this survey, we first identify the potential key performance requirements of 5G communication in support of automation in the vertical domains and highlight the 5G enabling technologies conceived for meeting these requirements. We then discuss the key challenges faced both by industry and academia which have to be addressed in order to support automation in the vertical domains. We also provide a survey of the related research dedicated to automation in the vertical domains. Finally, our vision of 6G wireless systems is discussed briefly.

eess.SP↗

Wireless Network Slicing: Generalized Kelly Mechanism Based Resource Allocation

Wireless network slicing (i.e., network virtualization) is one of the potential technologies for addressing the issue of rapidly growing demand in mobile data services related to 5G cellular networks. It logically decouples the current cellular networks into two entities; infrastructure providers (InPs) and mobile virtual network operators (MVNOs). The resources of base stations (e.g., resource blocks, transmission power, antennas) which are owned by the InP are shared to multiple MVNOs who need resources for their mobile users. Specifically, the physical resources of an InP are abstracted into multiple isolated network slices, which are then allocated to MVNO's mobile users. In this paper, two-level allocation problem in network slicing is examined, whilst enabling efficient resource utilization, inter-slice isolation (i.e., no interference amongst slices), and intra-slice isolation (i.e., no interference between users in the same slice). A generalized Kelly mechanism (GKM) is also designed, based on which the upper level of the resource allocation issue (i.e., between the InP and MVNOs) is addressed. The benefit of using such a resource bidding and allocation framework is that the seller (InP) does not need to know the true valuation of the bidders (MVNOs). For solving the lower level of resource allocation issue (i.e., between MVNOs and their mobile users), the optimal resource allocation is derived from each MVNO to its mobile users by using KKT conditions. Then, bandwidth resources are allocated to the users of MVNOs. Finally, the results of simulation are presented to verify the theoretical analysis of our proposed two-level resource allocation problem in wireless network slicing.

cs.NI↗

eMBB-URLLC Resource Slicing: A Risk-Sensitive Approach

Ultra Reliable Low Latency Communication (URLLC) is a 5G New Radio (NR) application that requires strict reliability and latency. URLLC traffic is usually scheduled on top of the ongoing enhanced Mobile Broadband (eMBB) transmissions (i.e., puncturing the current eMBB transmission) and cannot be queued due to its hard latency requirements. In this letter, we propose a risk-sensitive based formulation to allocate resources to the incoming URLLC traffic while minimizing the risk of the eMBB transmission (i.e., protecting the eMBB users with low data rate) and ensuring URLLC reliability. Specifically, the Conditional Value at Risk (CVaR) is introduced as a risk measure for eMBB transmission. Moreover, the reliability constraint of URLLC is formulated as a chance constraint and relaxed based on Markov's inequality. We decompose the formulated problem into two subproblems in order to transform it into a convex form and then alternatively solve them until convergence. Simulation results show that the proposed approach allocates resources to the incoming URLLC traffic efficiently while satisfying the reliability of both eMBB and URLLC.

cs.NI↗

Ruin Theory for Dynamic Spectrum Allocation in LTE-U Networks

LTE in the unlicensed band (LTE-U) is a promising solution to overcome the scarcity of the wireless spectrum. However, to reap the benefits of LTE-U, it is essential to maintain its effective coexistence with WiFi systems. Such a coexistence, hence, constitutes a major challenge for LTE-U deployment. In this paper, the problem of unlicensed spectrum sharing among WiFi and LTE-U system is studied. In particular, a fair time sharing model based on \emph{ruin theory} is proposed to share redundant spectral resources from the unlicensed band with LTE-U without jeopardizing the performance of the WiFi system. Fairness among both WiFi and LTE-U is maintained by applying the concept of the probability of ruin. In particular, the probability of ruin is used to perform efficient duty-cycle allocation in LTE-U, so as to provide fairness to the WiFi system and maintain certain WiFi performance. Simulation results show that the proposed ruin-based algorithm provides better fairness to the WiFi system as compared to equal duty-cycle sharing among WiFi and LTE-U.

cs.NI↗

Provenance-enabled Packet Path Tracing in the RPL-based Internet of Things

The interconnection of resource-constrained and globally accessible things with untrusted and unreliable Internet make them vulnerable to attacks including data forging, false data injection, and packet drop that affects applications with critical decision-making processes. For data trustworthiness, reliance on provenance is considered to be an effective mechanism that tracks both data acquisition and data transmission. However, provenance management for sensor networks introduces several challenges, such as low energy, bandwidth consumption, and efficient storage. This paper attempts to identify packet drop (either maliciously or due to network disruptions) and detect faulty or misbehaving nodes in the Routing Protocol for Low-Power and Lossy Networks (RPL) by following a bi-fold provenance-enabled packed path tracing (PPPT) approach. Firstly, a system-level ordered-provenance information encapsulates the data generating nodes and the forwarding nodes in the data packet. Secondly, to closely monitor the dropped packets, a node-level provenance in the form of the packet sequence number is enclosed as a routing entry in the routing table of each participating node. Lossless in nature, both approaches conserve the provenance size satisfying processing and storage requirements of IoT devices. Finally, we evaluate the efficacy of the proposed scheme with respect to provenance size, provenance generation time, and energy consumption.

cs.CR↗

Power Control for Harmonic Utility in Non-Orthogonal Multiple Access based Visible Light Communications

Visible light communication is a promising technique in future networks due to its advantages of high data rate and licensed-free spectrum. In addition, non-orthogonal multiple access (NOMA) is considered as a candidate of multiple access schemes in 5G networks and beyond. In this paper, we study the power control problem in NOMA-based visible light communication. An optimization problem is formulated, where the objective is the harmonic-rate utility function. The optimal solution is achieved optimally by equivalently transforming the underlying problem into a convex problem. Simulation result is provided to validate performance of the proposed approach.

cs.NI↗

Joint Communication, Computation, Caching, and Control in Big Data Multi-access Edge Computing

The concept of multi-access edge computing (MEC) has been recently introduced to supplement cloud computing by deploying MEC servers to the network edge so as to reduce the network delay and alleviate the load on cloud data centers. However, compared to a resourceful cloud, an MEC server has limited resources. When each MEC server operates independently, it cannot handle all of the computational and big data demands stemming from the users devices. Consequently, the MEC server cannot provide significant gains in overhead reduction due to data exchange between users devices and remote cloud. Therefore, joint computing, caching, communication, and control (4C) at the edge with MEC server collaboration is strongly needed for big data applications. In order to address these challenges, in this paper, the problem of joint 4C in big data MEC is formulated as an optimization problem whose goal is to maximize the bandwidth saving while minimizing delay, subject to the local computation capability of user devices, computation deadline, and MEC resource constraints. However, the formulated problem is shown to be non-convex. To make this problem convex, a proximal upper bound problem of the original formulated problem that guarantees descent to the original problem is proposed. To solve the proximal upper bound problem, a block successive upper bound minimization (BSUM) method is applied. Simulation results show that the proposed approach increases bandwidth-saving and minimizes delay while satisfying the computation deadlines.

cs.NI↗

Decentralized Computation Offloading and Resource Allocation in Heterogeneous Networks with Mobile Edge Computing

We consider a heterogeneous network with mobile edge computing, where a user can offload its computation to one among multiple servers. In particular, we minimize the system-wide computation overhead by jointly optimizing the individual computation decisions, transmit power of the users, and computation resource at the servers. The crux of the problem lies in the combinatorial nature of multi-user offloading decisions, the complexity of the optimization objective, and the existence of inter-cell interference. Then, we decompose the underlying problem into two subproblems: i) the offloading decision, which includes two phases of user association and subchannel assignment, and ii) joint resource allocation, which can be further decomposed into the problems of transmit power and computation resource allocation. To enable distributed computation offloading, we sequentially apply a many-to-one matching game for user association and a one-to-one matching game for subchannel assignment. Moreover, the transmit power of offloading users is found using a bisection method with approximate inter-cell interference, and the computation resources allocated to offloading users is achieved via the duality approach. The proposed algorithm is shown to converge and is stable. Finally, we provide simulations to validate the performance of the proposed algorithm as well as comparisons with the existing frameworks.

cs.NI↗

Ultra-Reliable and Low Latency Communication in mmWave-Enabled Massive MIMO Networks

Ultra-reliability and low-latency are two key components in 5G networks. In this letter, we investigate the problem of ultra-reliable and low-latency communication (URLLC) in millimeter wave (mmWave)-enabled massive multiple-input multiple-output (MIMO) networks. The problem is cast as a network utility maximization subject to probabilistic latency and reliability constraints. To solve this problem, we resort to the Lyapunov technique whereby a utility-delay control approach is proposed, which adapts to channel variations and queue dynamics. Numerical results demonstrate that our proposed approach ensures reliable communication with a guaranteed probability of 99.99%, and reduces latency by 28.41% and 77.11% as compared to baselines with and without probabilistic latency constraints, respectively.

cs.IT↗

The 5G Cellular Backhaul Management Dilemma: To Cache or to Serve

With the introduction of caching capabilities into small cell networks (SCNs), new backaul management mechanisms need to be developed to prevent the predicted files that are downloaded by the at the small base stations (SBSs) to be cached from jeopardizing the urgent requests that need to be served via the backhaul. Moreover, these mechanisms must account for the heterogeneity of the backhaul that will be encompassing both wireless backhaul links at various frequency bands and a wired backhaul component. In this paper, the heterogeneous backhaul management problem is formulated as a minority game in which each SBS has to define the number of predicted files to download, without affecting the required transmission rate of the current requests. For the formulated game, it is shown that a unique fair proper mixed Nash equilibrium (PMNE) exists. Self-organizing reinforcement learning algorithm is proposed and proved to converge to a unique Boltzmann-Gibbs equilibrium which approximates the desired PMNE. Simulation results show that the performance of the proposed approach can be close to that of the ideal optimal algorithm while it outperforms a centralized greedy approach in terms of the amount of data that is cached without jeopardizing the quality-of-service of current requests.

cs.IT↗

Reactive Power Compensation Game under Prospect-Theoretic Framing Effects

Reactive power compensation is an important challenge in current and future smart power systems. However, in the context of reactive power compensation, most existing studies assume that customers can assess their compensation value, i.e., Var unit, objectively. In this paper, customers are assumed to make decisions that pertain to reactive power coordination. In consequence, the way in which those customers evaluate the compensation value resulting from their individual decisions will impact the overall grid performance. In particular, a behavioral framework, based on the framing effect of prospect theory (PT), is developed to study the effect of both objective value and subjective evaluation in a reactive power compensation game. For example, such effect allows customers to optimize a subjective value of their utility which essentially frames the objective utility with respect to a reference point. This game enables customers to coordinate the use of their electrical devices to compensate reactive power. For the proposed game, both the objective case using expected utility theory (EUT) and the PT consideration are solved via a learning algorithm that converges to a mixed-strategy Nash equilibrium. In addition, several key properties of this game are derived analytically. Simulation results show that, under PT, customers are likely to make decisions that differ from those predicted by classical models. For instance, using an illustrative two-customer case, we show that a PT customer will increase the conservative strategy (achieving a high power factor) by 29% compared to a conventional customer. Similar insights are also observed for a case with three customers.

cs.GT↗

Smart Context-aware Rejuvenation of Engagement on Urban Ambient Augmented Things

The concern over global urbanization trend imposes smart-city as enabling information and communication technology (ICT) to improve urban governance. However, the light trance on better living space is stimulated by socioeconomic impact of escalated senior generation. Hence, ambient assisted living (AAL) emerges for the autonomous provisioning of pervasive things or objects from relevant perturbation for advanced scientific instrumentation. Meanwhile, citizens are observed in being transfixed by lively stimuli of monotonous urban events with the advent of virtual reality or augmented things. Thus, due to the involvement of situation-awareness or contextualization, engagement/participation information as a utility promises to improve urban experience. However, it is complex to grapple meaningful concepts due to personalization obstacles, such as citizen psychology, information gap, service-visualization. Moreover, recommended practices deficit adaptation to monochromatic choice, disparate impairments, mobility and annotation-richness in urban space. Hence, rejuvenation of engagement relates to monitoring and quantification of 'service consumption and graceful degradation' of experience. However, paramount challenges are imposed on this stipulation, such as, unobservability, independence and composite relationship of contexts. Therefore, a parametric Bayesian based model is envisioned to address observability and scalability of contexts and its conjugal relationship with engagement. Last but not the least, systematic framework is demonstrated, which pinpoints key goals of context-aware engagement from participants' opinions, usages and feed-backs.

cs.CY↗

Parametric Bayesian Rejuvenation in Ambient Assisted Living through Software-based Thematic 5G Management

Ameliorating elderly engagement is vital in rejuvenating independent living. However, recommended practices lack realization of personal traits despite socio -economic promise. The recent proliferation of IoT with the advent of smart-objects/things and personalized services pave the way for context-aware service management. Eventually, the major goal of this paper is to develop a context-aware model in predicting engagement of elderly care. Hence, key requirements are identified for elderly engagement, namely (a) discovery of contexts, which are relevant (b) scaling up (over time) of engagement. However, paramount challenges are imposed on this stipulation, such as, un-observability, independence and composite relationship of contexts. Therefore, a Topic-model based model is proposed to address scalability of contexts and its conjugal relationship with engagement. Eventually, systematic framework is demonstrated, which pinpoints key goals of context-aware services by participants' opinions, usage and feed-back.

cs.CY↗

Non-Parametric Bayesian Rejuvenation of Smart-City Participation through Context-aware Internet-of-Things (IoT) Management

Tweaking citizen participation is vital in promoting Smart City services. However, conventional practices deficit sufficient realization of personal traits despite socio-economic promise. The recent trend of IoT-enabled smart-objects/things and personalized services pave the way for context-aware services. Eventually, the aim of this paper is to develop a context-aware model in predicting participation of smart city service. Hence, major requirements are identified for citizen participation, namely (a) unwrapping of contexts, which are relevant, (b) scaling up (over time) of participation. However, paramount challenges are imposed on this stipulation, such as, un-observability, independence and composite relationship of contexts. Therefore, a Non-parametric Bayesian model is proposed to address scalability of contexts and its relationship with participation.

cs.CY↗