arXiv subjects

Joongheon Kim

Publications and source records attributed to Joongheon Kim.

117 records · Page 7Linked to original sources

arXiv2019

Blind Signal Classification Analysis and Impact on User Scheduling and Power Allocation in Nonorthogonal Multiple Access

For a massive number of devices, nonorthogonal multiple access (NOMA) has been recognized as a promising technology for improving the spectral efficiency compared to orthogonal multiple access (OMA). However, it is difficult for a base station (BS) to provide all of the information about NOMA signals via a high layer owing to signaling overhead concerns. This paper studies blind signal classification, which determines whether or not the received NOMA signal requires successive interference cancellation (SIC) without a priori signal information. In this paper, two types of blind signal classification errors are analyzed: 1) the signal is classified as one that does not require SIC on the SIC user side and 2) the signal is classified as one for which SIC is necessary on the non-SIC user side. In addition, we formulate the joint optimization problem for user scheduling and power allocation, which maximizes the sum-rate gain of NOMA over OMA with constraints on the maximum classification error probability and minimum data rate. The proposed algorithm iteratively finds solutions for user scheduling and power allocation. Simulation results show that the proposed scheme outperforms existing user scheduling methods.

cs.IT↗

arXiv2019

Network-based Analysis and Classification of Malware using Behavioral Artifacts Ordering

Using runtime execution artifacts to identify malware and its associated family is an established technique in the security domain. Many papers in the literature rely on explicit features derived from network, file system, or registry interaction. While effective, the use of these fine-granularity data points makes these techniques computationally expensive. Moreover, the signatures and heuristics are often circumvented by subsequent malware authors. In this work, we propose Chatter, a system that is concerned only with the order in which high-level system events take place. Individual events are mapped onto an alphabet and execution traces are captured via terse concatenations of those letters. Then, leveraging an analyst labeled corpus of malware, n-gram document classification techniques are applied to produce a classifier predicting malware family. This paper describes that technique and its proof-of-concept evaluation. In its prototype form, only network events are considered and eleven malware families are used. We show the technique achieves 83%-94% accuracy in isolation and makes non-trivial performance improvements when integrated with a baseline classifier of combined order features to reach an accuracy of up to 98.8%.

cs.CR↗

arXiv2018

Dynamic Power Allocation and User Scheduling for Power-Efficient and Low-Latency Communications

In this paper, we propose a joint dynamic power control and user pairing algorithm for power-efficient and low-latency hybrid multiple access systems. In a hybrid multiple access system, user pairing determines whether the transmitter should serve a certain user by orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA). The proposed optimization framework minimizes the long-term time-average transmit power expenditure while reducing the queueing delay and satisfying time-average data rate requirements. The proposed technique observes channel and queue state information and adjusts queue backlogs to avoid an excessive queueing delay by appropriate user pairing and power allocation. Further, user scheduling for determining the activation of a given user link as well as flexible use of resources are captured in the proposed algorithm. Data-intensive simulation results show that the proposed scheme guarantees an end-to-end delay smaller than 1 ms with high power-efficiency and high reliability, based on the short frame structure designed for ultra-reliable low-latency communications (URLLC).

eess.SP↗

arXiv2018

Wireless Video Caching and Dynamic Streaming under Differentiated Quality Requirements

This paper considers one-hop device-to-device (D2D)-assisted wireless caching networks that cache video files of varying quality levels, with the assumption that the base station can control the video quality but cache-enabled devices cannot. Two problems arise in such a caching network: file placement problem and node association problem. This paper suggests a method to cache videos of different qualities, and thus of varying file sizes, by maximizing the sum of video quality measures that users can enjoy. There exists an interesting trade-off between video quality and video diversity, i.e., the ability to provision diverse video files. By caching high-quality files, the cache-enabled devices can provide high-quality video, but cannot cache a variety of files. Conversely, when the device caches various files, it cannot provide a good quality for file-requesting users. In addition, when multiple devices cache the same file but their qualities are different, advanced node association is required for file delivery. This paper proposes a node association algorithm that maximizes time-averaged video quality for multiple users under a playback delay constraint. In this algorithm, we also consider request collision, the situation where several users request files from the same device at the same time, and we propose two ways to cope with the collision: scheduling of one user and non-orthogonal multiple access. Simulation results verify that the proposed caching method and the node association algorithm work reliably.

cs.NI↗

arXiv2015

Feasibility Study of Stochastic Streaming with 4K UHD Video Traces

This paper performs the feasibility study of stochastic video streaming algorithms with up-to-date 4K ultra-high-definition (UHD) video traces. In previous work, various stochastic video streaming algorithms were proposed which maximize time-average video streaming quality subject to queue stability based on the information of queue-backlog length. The performance improvements with the stochastic video streaming algorithms were verified with traditional MPEG test sequences; but there is no study how much the proposed stochastic algorithm is better when we consider up-to-date 4K UHD video traces. Therefore, this paper evaluates the stochastic streaming algorithms with 4K UHD video traces; and verifies that the stochastic algorithms perform better than queue-independent algorithms, as desired.

cs.NI↗

arXiv2014

Max-Weight Scheduling and Quality-Aware Streaming for Device-to-Device Video Delivery

We propose and analyze centralized and distributed algorithms for device-to-device video scheduling and streaming. The proposed algorithms address jointly the problems of device-to-device link scheduling and video quality adaptation in streaming. Our simulations show that the proposed algorithms significantly outperform conventional separated approaches that treat these two problems independently.

cs.NI↗

arXiv2013

The Sybil Attacks and Defenses: A Survey

In this paper we have a close look at the Sybil attack and advances in defending against it, with particular emphasis on the recent work. We identify three major veins of literature work to defend against the attack: using trusted certification, using resources testing, and using social networks. The first vein of literature considers defending against the attack using trusted certification, which is done by either centralized certification or distributed certification using cryptographic primitives that can replace the centralized certification entity. The second vein of literature considers defending against the attack by resources testing, which can by in the form of IP testing, network coordinates, recurring cost as by requiring clients to solve puzzles. The third and last vein of literature is by mitigating the attack combining social networks used as bootstrapping security and tools from random walk theory that have shown to be effective in defending against the attack under certain assumptions. Our survey and analyses of the different schemes in the three veins of literature show several shortcomings which form several interesting directions and research questions worthy of investigation.

cs.CR↗

arXiv2013

Quality-Aware Coding and Relaying for 60 GHz Real-Time Wireless Video Broadcasting

Wireless streaming of high-definition video is a promising application for 60 GHz links, since multi-Gigabit/s data rates are possible. In particular we consider a sports stadium broadcasting system where video signals from multiple cameras are transmitted to a central location. Due to the high pathloss of 60\,GHz radiation over the large distances encountered in this setting, the use of relays is required. This paper designs a quality-aware coding and relaying algorithm for maximization of the overall video quality. We consider the setting that the source can split its data stream into parallel streams, which can be transmitted via different relays to the destination. For this, we derive the related formulation and re-formulate it as convex programming, which can guarantee optimal solutions.

cs.NI↗

arXiv2013

Joint Scalable Coding and Routing for 60 GHz Real-Time Live HD Video Streaming Applications

Transmission of high-definition (HD) video is a promising application for 60 GHz wireless links, since very high transmission rates (up to several Gbit/s) are possible. In particular we consider a sports stadium broadcasting system where signals from multiple cameras are transmitted to a central location. Due to the high pathloss of 60 GHz radiation over the large distances encountered in this scenario, the use of relays might be required. The current paper analyzes the joint selection of the routes (relays) and the compression rates from the various sources for maximization of the overall video quality. We consider three different scenarios: (i) each source transmits only to one relay and the relay can receive only one data stream, and (ii) each source can transmit only to a single relay, but relays can aggregate streams from different sources and forward to the destination, and (iii) the source can split its data stream into parallel streams, which can be transmitted via different relays to the destination. For each scenario, we derive the mathematical formulations of the optimization problem and re-formulate them as convex mixed-integer programming, which can guarantee optimal solutions. Extensive simulations demonstrate that high-quality transmission is possible for at least ten cameras over distances of 300 m. Furthermore, optimization of the video quality gives results that can significantly outperform algorithms that maximize data rates.

cs.NI↗