SearcharxivSearch

arXiv subjects

Dong Min Kim

Publications and source records attributed to Dong Min Kim.

At least 19 recordsLinked to original sources

MedMix: Specialization-Consistent Federated Sparse MoEs under Modality Heterogeneity

Federated multimodal medical AI faces modality heterogeneity at both the client and sample levels: clients may systematically lack access to specific modality types, while individual records within the same client may contain different partial modality subsets. Sparse Mixture-of-Experts (MoE) architectures are a promising remedy for modality-adaptive computation, but their use in federated learning is fragile under cross-client modality heterogeneity, where locally learned routing policies can diverge across clients and drive experts toward incompatible specializations. Different clients may assign the same observed modality configuration to different experts, or train similarly indexed experts on different missing-modality configurations, causing standard aggregation to misalign or overwrite the expert specialization that sparse MoEs are intended to learn. To address this challenge, we propose MedMix, a semantic-alignment framework for federated multimodal sparse MoEs that coordinates cross-client routing and expert specialization using modality context. At the client side, MedMix uses modality-context-aware routing to guide expert selection using each token's modality identity, position, and incompleteness context. Across clients, it uses consensus-guided routing alignment to construct server-side consensus anchors for shared modality patterns and align local routing distributions across clients. Complementing these routing mechanisms, client-adaptive expert aggregation leverages client-specific modality-pattern prototypes to match and aggregate functionally similar experts across clients. Experiments on real-world multimodal medical datasets show that MedMix achieves the best average F1 across diverse modality heterogeneity and modality incompleteness settings, with especially clear gains under severe heterogeneity.

cs.LG

SNAP: Low-Latency Test-Time Adaptation with Sparse Updates

Test-Time Adaptation (TTA) adjusts models using unlabeled test data to handle dynamic distribution shifts. However, existing methods rely on frequent adaptation and high computational cost, making them unsuitable for resource-constrained edge environments. To address this, we propose SNAP, a sparse TTA framework that reduces adaptation frequency and data usage while preserving accuracy. SNAP maintains competitive accuracy even when adapting based on only 1% of the incoming data stream, demonstrating its robustness under infrequent updates. Our method introduces two key components: (i) Class and Domain Representative Memory (CnDRM), which identifies and stores a small set of samples that are representative of both class and domain characteristics to support efficient adaptation with limited data; and (ii) Inference-only Batch-aware Memory Normalization (IoBMN), which dynamically adjusts normalization statistics at inference time by leveraging these representative samples, enabling efficient alignment to shifting target domains. Integrated with five state-of-the-art TTA algorithms, SNAP reduces latency by up to 93.12%, while keeping the accuracy drop below 3.3%, even across adaptation rates ranging from 1% to 50%. This demonstrates its strong potential for practical use on edge devices serving latency-sensitive applications. The source code is available at https://github.com/chahh9808/SNAP.

cs.LG

Multi-Channel Access Solutions for 5G New Radio

5G New Radio paves the way for introducing novel multi-service radio resource management solutions tailored for enhanced Mobile Broadband and Ultra-Reliable Low Latency Communication service classes. Multi-Channel Access is a family of such multi-service solutions that enable a user equipment to aggregate radio resources from multiple sources. The objective is multi-fold; throughput enhancement through access to a larger bandwidth, reliability improvement by increasing the diversity order and/or coordinated transmission/reception, as well as flexibility and load balancing improvement by decoupling the downlink and the uplink access points. This paper presents several multi-channel access solutions for 5G New Radio multi-service scenarios. In particular, throughput enhancement and latency reduction concepts like multi-connectivity, carrier aggregation, downlink-uplink decoupled access and coordinated multi-point connectivity are discussed. Moreover, novel design solutions exploiting these concepts are proposed. Numerical evaluation of the introduced solutions indicates significant performance gains over state-of-the-art schemes; for example, our proposed component carrier selection mechanism leads to a median throughput gain of up to 100% by means of an implicit load balance. Therefore, the proposed Multi-Channel Access solutions have the potential to be key multi-service enablers for 5G New Radio.

cs.NI

Joint Configuration of Transmission Direction and Altitude in UAV-based Two-Way Communication

When considering unidirectional communication for unmanned aerial vehicles (UAVs) as flying Base Stations (BSs), either uplink or downlink, the system is limited through the co-channel interference that takes place over line-of-sight (LoS) links. This paper considers two-way communication and takes advantage of the fact that the interference among the ground devices takes place through non-line-of-sight (NLoS) links. UAVs can be deployed at the high altitudes to have larger coverage, while the two-way communication allows to configure the transmission direction. Using these two levers, we show how the system throughput can be maximized for a given deployment of the ground devices.

cs.IT

Achieving Low Latency Two-Way Communication by Downlink and Uplink Decoupled Access

In many scenarios, low latency wireless communication assumes two-way connection, such that the node that receives information can swiftly send acknowledgment or other response. In this paper, we address the problem of low latency two-way communication and address it through proposal of a base station (BS) cooperation scheme. The scheme is based on downlink (DL) and uplink (UL) decoupled access (DUDA). To the best of our knowledge, this is the first time that the idea of decoupled access is used to reduce latency. We derive the analytical expression for the average latency and verify that the latency expression is valid with outage probability based on stochastic geometry analysis. Both analytical and simulation results show that, with DUDA, the latency can be reduced by approximately 30-60% compared to the traditional coupled access.

cs.IT

Wireless Access for Ultra-Reliable Low-Latency Communication (URLLC): Principles and Building Blocks

Ultra-reliable low latency communication (URLLC) is an important new feature brought by 5G, with a potential to support a vast set of applications that rely on mission-critical links. In this article, we first discuss the principles for supporting URLLC from the perspective of the traditional assumptions and models applied in communication/information theory. We then discuss how these principles are applied in various elements of the system design, such as use of various diversity sources, design of packets and access protocols. The important messages are that there is a need to optimize the transmission of signaling information, as well as a need for a lean use of various sources of diversity.

cs.IT

An Enhanced Access Reservation Protocol with a Partial Preamble Transmission Mechanism in NB-IoT Systems

In this letter, we propose an enhanced Access Reservation Protocol (ARP) with a partial preamble transmission (PPT) mechanism for the narrow band Internet of Things (NB-IoT) systems. The proposed ARP can enhance the ARP performance by mitigating the occurrence of preamble collisions, while being compatible with the conventional NB-IoT ARP. We provide an analytical model that captures the performance of the proposed ARP in terms of false alarm, mis-detection and collision probabilities. Moreover, we investigate a trade-off between the mis-detection and the collision probabilities, and optimize the proposed ARP according to the system loads. The results show that the proposed ARP outperforms the conventional NB-IoT ARP, in particular at heavier system loads.

cs.IT

Hybrid Precoding for Massive MIMO Systems in Cloud RAN Architecture with Capacity-Limited Fronthauls

Cloud RAN (C-RAN) is a promising enabler for distributed massive MIMO systems, yet is vulnerable to its fronthaul congestion. To cope with the limited fronthaul capacity, this paper proposes a hybrid analog-digital precoding design that adaptively adjusts fronthaul compression levels and the number of active radio-frequency (RF) chains out of the entire RF chains in a downlink distributed massive MIMO system based on C-RAN architecture. Following this structure, we propose an analog beamformer design in pursuit of maximizing multi-user sum average data rate (sum-rate). Each element of the analog beamformer is constructed based on a weighted sum of spatial channel covariance matrices, while the size of the analog beamformer, i.e. the number of active RF chains, is optimized so as to maximize the large-scale approximated sum-rate. With these analog beamformer and RF chain activation, a regularized zero- forcing (RZF) digital beamformer is jointly optimized based on the instantaneous effective channel information observed through the given analog beamformer. The effectiveness of the proposed hybrid precoding algorithm is validated by simulation, and its design criterion is clarified by analysis.

cs.IT

Data Aggregation and Packet Bundling of Uplink Small Packets for Monitoring Applications in LTE

In cellular massive Machine-Type Communications (MTC), a device can transmit directly to the base station (BS) or through an aggregator (intermediate node). While direct device-BS communication has recently been in the focus of 5G/3GPP research and standardization efforts, the use of aggregators remains a less explored topic. In this paper we analyze the deployment scenarios in which aggregators can perform cellular access on behalf of multiple MTC devices. We study the effect of packet bundling at the aggregator, which alleviates overhead and resource waste when sending small packets. The aggregators give rise to a tradeoff between access congestion and resource starvation and we show that packet bundling can minimize resource starvation, especially for smaller numbers of aggregators. Under the limitations of the considered model, we investigate the optimal settings of the network parameters, in terms of number of aggregators and packet-bundle size. Our results show that, in general, data aggregation can benefit the uplink massive MTC in LTE, by reducing the signalling overhead.

cs.IT

Revisiting Frequency Reuse towards Supporting Ultra-Reliable Ubiquitous-Rate Communication

One of the goals of 5G wireless systems stated by the NGMN alliance is to provide moderate rates (50+ Mbps) everywhere and with very high reliability. We term this service Ultra-Reliable Ubiquitous-Rate Communication (UR2C). This paper investigates the role of frequency reuse in supporting UR2C in the downlink. To this end, two frequency reuse schemes are considered: user-specific frequency reuse (FRu) and BS-specific frequency reuse (FRb). For a given unit frequency channel, FRu reduces the number of serving user equipments (UEs), whereas FRb directly decreases the number of interfering base stations (BSs). This increases the distance from the interfering BSs and the signal-to-interference ratio (SIR) attains ultra-reliability, e.g. 99% SIR coverage at a randomly picked UE. The ultra-reliability is, however, achieved at the cost of the reduced frequency allocation, which may degrade overall downlink rate. To fairly capture this reliability-rate tradeoff, we propose ubiquitous rate defined as the maximum downlink rate whose required SIR can be achieved with ultra-reliability. By using stochastic geometry, we derive closed-form ubiquitous rate as well as the optimal frequency reuse rules for UR2C.

cs.IT

On a User-Centric Base Station Cooperation Scheme for Reliable Communications

In this paper, we describe CoMP2flex, a user-centric base station (BS) cooperation scheme that provides improvements in reliability of both uplink (UL) and downlink (DL) communications of wireless cellular networks. CoMP2flex supports not only cooperation of two BSs with same direction of traffic but also cooperation of two BSs serving bidirectional traffic. The reliability performance of CoMP2flex is shown with numerical simulations and analytical expressions. We quantify and numerically validate the performance of the greedy BS pairing algorithm by comparing maximum weight matching methods, implemented as the Edmonds matching algorithm for weighted graphs.

cs.IT

Full Duplex Emulation via Spatial Separation of Half Duplex Nodes in a Planar Cellular Network

A Full Duplex Base Station (FD-BS) can be used to serve simultaneously two Half-Duplex (HD) Mobile Stations (MSs), one working in the uplink and one in the downlink, respectively. The same functionality can be realized by having two interconnected and spatially separated Half Duplex Base Stations (HD-BSs), which is a scheme termed \emph{CoMPflex} (CoMP for In-Band Wireless Full Duplex). A FD-BS can be seen as a special case of CoMPflex with separation distance zero. In this paper we study the performance of CoMPflex in a two-dimensional cellular scenario using stochastic geometry and compare it to the one achieved by FD-BSs. By deriving the Cumulative Distribution Functions, we show that CoMPflex brings BSs closer to the MSs they are serving, while increasing the distance between a MS and interfering MSs. Furthermore, the results show that CoMPflex brings benefits over FD-BS in terms of communication reliability. Following the trend of wireless network densification, CoMPflex can be regarded as a method with a great potential to effectively use the dense HD deployments.

cs.IT

Reliable Uplink Communication through Double Association in Wireless Heterogeneous Networks

We investigate methods for network association that improve the reliability of uplink transmissions in dense wireless heterogeneous networks. The stochastic geometry analysis shows that the double association, in which an uplink transmission is transmitted to a macro Base Station (BS) and small BS, significantly improves the probability of successful transmission.

cs.IT

A Tractable Model of the LTE Access Reservation Procedure for Machine-Type Communications

A canonical scenario in Machine-Type Communications (MTC) is the one featuring a large number of devices, each of them with sporadic traffic. Hence, the number of served devices in a single LTE cell is not determined by the available aggregate rate, but rather by the limitations of the LTE access reservation protocol. Specifically, the limited number of contention preambles and the limited amount of uplink grants per random access response are crucial to consider when dimensioning LTE networks for MTC. We propose a low-complexity model of LTE's access reservation protocol that encompasses these two limitations and allows us to evaluate the outage probability at click-speed. The model is based chiefly on closed-form expressions, except for the part with the feedback impact of retransmissions, which is determined by solving a fixed point equation. Our model overcomes the incompleteness of the existing models that are focusing solely on the preamble collisions. A comparison with the simulated LTE access reservation procedure that follows the 3GPP specifications, confirms that our model provides an accurate estimation of the system outage event and the number of supported MTC devices.

cs.IT

Assessment of LTE Wireless Access for Monitoring of Energy Distribution in the Smart Grid

While LTE is becoming widely rolled out for human-type services, it is also a promising solution for cost-efficient connectivity of the smart grid monitoring equipment. This is a type of machine-to-machine (M2M) traffic that consists mainly of sporadic uplink transmissions. In such a setting, the amount of traffic that can be served in a cell is not constrained by the data capacity, but rather by the signaling constraints in the random access channel and control channel. In this paper we explore these limitations using a detailed simulation of the LTE access reservation protocol (ARP). We find that 1) assigning more random access opportunities may actually worsen performance; and 2) the additional signaling that follows the ARP has very large impact on the capacity in terms of the number of supported devices; we observed a reduction in the capacity by almost a factor of 3. This suggests that a lightweight access method, with a reduced number of signaling messages, needs to be considered in standardization for M2M applications. Additionally we propose a tractable analytical model to calculate the outage that can be rapidly implemented and evaluated. The model accounts for the features of the random access, control channel and uplink and downlink data channels, as well as retransmissions.

cs.IT

CoMPflex: CoMP for In-Band Wireless Full Duplex

In this letter we consider emulation of a Full Duplex (FD) cellular base station (BS) by using two spatially separated and coordinated half duplex (HD) BSs. The proposed system is termed CoMPflex (CoMP for In-Band Wireless Full Duplex) and at a given instant it serves two HD mobile stations (MSs), one in the uplink and one in the downlink, respectively. We evaluate the performance of our scheme by using a geometric extension of the one-dimensional Wyner model, which takes into account the distances between the devices. The results show that CoMPflex leads to gains in terms of sum-rate and energy efficiency with respect to the ordinary FD, as well as with respect to a baseline scheme based on unidirectional traffic.

cs.NI

Exploiting Regional Differences: A Spatially Adaptive Random Access

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access (SARA) scheme in which the transmitters in the network utilize different transmit probabilities depending on the local situation. In our proposed scheme, the transmit probability is adaptively updated by the ratio of the received SINR and the target SINR. We investigate the performance of the spatially adaptive random access scheme. For the comparison, we derive an optimal transmit probability of ALOHA random access scheme in which all transmitters use the same transmit probability. We illustrate the performance of the spatially adaptive random access scheme through simulations. We show that the performance of the proposed scheme surpasses that of the optimal ALOHA random access scheme and is comparable with the CSMA/CA scheme.

cs.IT

Random Basketball Routing for ZigBee based Sensor Networks

Random basketball routing (BR) \cite {Hwang} is a simple protocol that integrates MAC and multihop routing in a cross-layer optimized manner. Due to its lightness and performance, BR would be quite suitable for sensor networks, where communication nodes are usually simple devices. In this paper, we describe how we implemented BR in a ZigBee-based (IEEE 802.15.4) sensor network. In \cite{Hwang}, it is verified that BR takes advantages of dynamic environments (in particular, node mobility), however, here we focus on how BR works under static situations. For implementation purposes, we add some features such as destination RSSI measuring and loop-free procedure, to the original BR. With implemented testbed, we compare the performance of BR with that of the simplified AODV with CSMA/CA. The result is that BR has merits in terms of number of hops to traverse the network. Considering the simple structure of BR and its possible energy-efficiency, we can conclude that BR can be a good candidate for sensor networks both under dynamic- and static environments.

cs.NI