Haneul Ko

A Fair Listen-Before-Talk Algorithm for Coexistence of LTE-U and WLAN

Recently, there has been an increasing interest in operating long-term evolution (LTE) in unlicensed bands (i.e., LTE-U). However, since LTE and wireless local area networks (WLANs) are designed to operate in different bands, they have no coexistence mechanism, which leads to significant performance degradation. In particular, since LTE does not sense channel vacancy prior to transmissions, the LTE interference severely affects the WLAN operation. To address this problem, we propose a fair listen-before-talk (F-LBT) algorithm for coexistence of LTE-U and WLAN in unlicensed bands. F-LBT jointly considers the total system throughput and the fairness between LTE-U and WLAN and then allocates an appropriate idle period for WLAN. Evaluation results demonstrate that F-LBT can improve the total system throughput while providing the fairness between LTE-U and WLAN.

Mobility-Aware Call Admission Control Algorithm With Handoff Queue in Mobile Hotspots

In this paper, we propose a mobility-aware call admission control (MA-CAC) algorithm with a handoff queue (HQ) in mobile hotspots, where different admission control policies are employed, depending on the vehicle mobility. Specifically, when a vehicle is static, a handoff priority scheme with guard channels is studied to protect vehicular handoff users because handoff users may get on the vehicle. In addition, an HQ is examined during stopping to further accept handoff users. On the other hand, for a moving vehicle, no guard channels for handoff users are allocated to maximize channel utilization. By means of Markov chains, we evaluate MA-CAC with an HQ in terms of new-call blocking probability (NCBP), handoff-call dropping probability (HCDP), handoff-call waiting time in the HQ, and channel utilization. Analytical and simulation results demonstrate that MA-CAC with an HQ can lower both the HCDP and the NCBP while maintaining high channel utilization.

Efficiency Analysis of WiFi Offloading Techniques

WiFi offloading is a promising technique for addressing the mobile data explosion problem. In this paper, we consider two types of WiFi offloading techniques: 1) opportunistic WiFi offloading, where data offloading is conducted only when a mobile node opportunistically meets WiFi access points (APs); and 2) delayed WiFi offloading, where data transfer is delayed with the expectation of future AP contacts. We developed analytical models on WiFi offloading efficiency, which is defined as the ratio of the amount of offloaded data to the total amount of data. Extensive simulation results are given to validate the analytical models and to demonstrate the effects of the average cellular residence time, the delay bound, the variability of the WiFi residence time, the WiFi data rate, and the average session duration on WiFi offloading efficiency.

Timer-Based Push Scheme for Online Social Networking Services in Wireless Networks

Nowadays, online social networking services in wireless networks are very popular. In this paper, we propose a timer-based push scheme (TPS) where a number of articles posted during a pre-defined time interval are pushed to users and thus the number of push operations and articles to be pulled can be reduced. We develop an analytical model for TPS and derive the optimal timer minimizing the total cost. Simulation results are given to show the effectiveness of TPS over the existing push N scheme and to validate the analytical results.

Timer-Based Bloom Filter Aggregation for Reducing Signaling Overhead in Distributed Mobility Management

Distributed mobility management (DMM) is a promising technology to address the mobile data traffic explosion problem. Since the location information of mobile nodes (MNs) are distributed in several mobility agents (MAs), DMM requires an additional mechanism to share the location information of MNs between MAs. In the literature, multicast or distributed hash table (DHT)-based sharing methods have been suggested; however they incur significant signaling overhead owing to unnecessary location information updates under frequent handovers. To reduce the signaling overhead, we propose a timer-based Bloom filter aggregation (TBFA) scheme for distributing the location information. In the TBFA scheme, the location information of MNs is maintained by Bloom filters at each MA. Also, since the propagation of the whole Bloom filter for every MN movement leads to high signaling overhead, each MA only propagates changed indexes in the Bloom filter when a pre-defined timer expires. To verify the performance of the TBFA scheme, we develop analytical models on the signaling overhead and the latency and devise an algorithm to select an appropriate timer value. Extensive simulation results are given to show the accuracy of analytical models and effectiveness of the TBFA scheme over the existing DMM scheme.

A proactive content pushing scheme for provider mobility support in information centric networks

Information-centric network (ICN) opens a new networking paradigm optimized for contents-oriented services by exploiting in-network caching and mitigating redundant transmissions. When such an ICN is deployed in mobile environments (i.e., the content provider or consumer is a mobile node), an appropriate mobility support protocol needs to be developed. Since the content consumer mobility can be tactically handled through the content consumer driven nature of ICN, the content provider mobility is investigated in this work. Specifically, we propose a proactive content pushing (PCP) scheme, in which the content provider proactively sends a set of contents that are expected to be requested in the near future to proximity ICN routers. Consequently, the PCP scheme can reduce the service disruption time owing to the content provider mobility.

An SIP-Based Location Management Framework in Opportunistic WiFi Networks

In this paper, we propose a novel session-initiation-protocol-based location management framework in opportunistic WiFi networks. In the proposed framework, a mobile terminal needs to update its attachment to the network only when it connects to a new WiFi access point to reduce its location update traffic. In addition, to find out the exact point of attachment, a timer-based session setup procedure is introduced, which can intelligently reduce the session setup latency by looking for a user in either WiFi or cellular systems. We develop analytical models for the location update cost and the session setup latency and investigate the optimization of the timer under the realistic WiFi hotspot residence time model.

An Efficient Delta Synchronization Algorithm for Mobile Cloud Storage Applications

In cloud storage applications where the data is shared by multiple mobile users, it is essential to provide the consistency among mobile users by means of appropriate synchronization algorithms. In particular, if the data is frequently updated and the number of mobile users sharing the data is large, the synchronization traffic can be significant. Moreover, the excessive synchronization traffic in mobile networks is more important in terms of radio resource utilization and energy consumption. In this paper, we propose an efficient delta synchronization (EDS) algorithm that aggregates the updated data to reduce the synchronization traffic and synchronizes the aggregated one periodically to satisfy the consistency. To find out the optimal policy for the aggregation and the periodical synchronization, an optimization problem is formulated as a Markov decision process (MDP) and a value iteration algorithm is presented for computing the stationary deterministic policy. Numerical results demonstrate that EDS can choose the optimal action that strikes a balance between the reduction of the synchronization traffic and the satisfaction of the consistency.

Optimal placement of service function in service function chaining

In service function chaining (SFC), an ordered list of service functions (SFs) is specified for network services, and those SFs should be placed in appropriate service nodes (SNs) to satisfy the given service latency requirement. In this paper, we formulate an integer non-linear programming (INLP) problem for the optimal placement of SFs when the latency requirement for network services and network conditions (e.g., link latency and SN capacity) are given. Evaluation results show that the optimal placement can achieve lower latency than conventional schemes.

Optimized and distributed data packet forwarding in LTE/LTE-A networks

Recently, a data packet forwarding scheme between evolved node Bs (eNBs) in long-term evolution (LTE)/LTE-advanced (LTE-A) networks has been proposed to reduce the signaling overhead and delay incurred in the data path switching scheme. However, the conventional data packet forwarding scheme suffers from the increased delay when the length of the data packet forwarding chain is inappropriately long. To attain the optimal handover performance in LTE/LTE-A networks, we propose an optimized and distributed data packet forwarding scheme where an optimal length of the forwarding chain is obtained by a Markov decision process (MDP). Numerical results demonstrate that the proposed scheme achieves the optimal and adaptive performance in diverse network environments.