• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.491-498
• /
• 2010

Wi-Fi based vehicle-to-infrastructure (V2I) communication is an emerging solution to improve the safety, traffic efficiency, and comfort of passengers. However, due to the high mobility of vehicles and the limited coverage of Wi-Fi APs, the V2I system may suffer from frequent handoffs although roadside APs can support cost effective Internet connectivity. Such problem of V2I systems can be overcome with Mobile AP (MAP) platform. The MAPs yield longer service duration by moving along with vehicles, yet they provide a lower link capacities than the roadside APs. In this paper, we propose a new association control mechanism that effectively determines whether the vehicle will select a fixed roadside-AP or a nearby MAP in mobile vehicular network environments. We consider both the achievable link bandwidth and available connection duration as a selection criterion and provide their run-time estimation method. Extensive simulation using real traces show significant performance improvements.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.807-816
• /
• 2015

The Internet of Things (IoT) has recently been showered with much attention worldwide. Various kinds of devices, communicating with each other in the IoT, demand multiple communication technologies to coexist. In this environment, mobile devices may utilize the vertical handover between different wireless radio interfaces such as Wi-Fi and Bluetooth, for efficient data transfer. In this paper, an IoT broker is implemented to support the vertical handover, which can also support and manage heterogeneous devices and communication interfaces. The handover is activated based on RSSI, Link Quality values, and real time traffic. The experimental results show that the proposed handover system substantially improves QoS in Bluetooth and reduces power consumption in mobile devices as compared with a system using only Wi-Fi.

• Journal of Korean Society of Transportation
• /
• v.29 no.6
• /
• pp.107-116
• /
• 2011

In this paper, we implement an algorithm of transit signal priority control that not only maximizes service quality and efficiency of bus, but also minimizes the control delay of passenger cars using UTIS currently being deployed and operated in Seoul national capital area. For this purpose, we propose an algorithm that coordinates the strength of TSP by estimating bus demand. Typically, the higher the strength of TSP is on main street, the bigger the control delay is on the cross street. Motivated by this practical difficulty, we proposes an algorithm that coordinates TSP's strength by checking the degree of saturation of cross street. Also, we verify the possibility of field implementation via simulation analysis using CORSIM RTE based HILS (Hardware In the Loop Simulation). The result shows that travel time of bus improves about 10 percent without increasing control delay of passenger cars by TSP. We expect the result of this research to contribute to increasing the overall transit ridership in this country.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.12
• /
• pp.6060-6070
• /
• 2012

Real-Time Enterprise (RTE)'s key requirement is that it should respond and adapt fast to the change of the firms' internal and external situations including the change of market and customers' needs. Recently, the big data processing technology to support the speedy change of the firms is spotlighted. Under the circumstances that wire and wireless communication networks are evolving with an accelerated rate, it is especially critical to provide a strong security monitoring function and stable services through a real-time processing of massive communication data traffic. By applying the big data processing technology based on a cloud computing architecture, this paper solves the managerial problems of telecommunication service providers and discusses how to operate the network management system effectively.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.303-308
• /
• 2005

Generally, the overloaded server problem and the rapidly increased network traffic problem are happened in a center concentrated multimedia digital content service. Recently, a study about the CDN which is a digital content transmission technology to solve these problems are performed actively. In this study, we proposed the SDCDS which improved a process latency time and a security performance on a digital content delivery and management. The goal of the SDCDS is the digital content security and the improvement of the processing time. For that, we have to design the security and the caching method considering the architecture characteristics of the CDN. In the SDCDS, the public key encryption method is designed by considering the architecture characteristics of CDN. And we improved the processing latency time by improved the caching method which uses the grouped caching method on the encrypted DC and the general DC. And in the experiment, we veryfy the performance of the proposed system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.17-23
• /
• 2000

Wireless link has high bit error rate compared with wired link and many users share this limited bandwidth. So it needs more powerful error control code and efficient media access control(MAC) to provide multimedia service reliably. In this paper we proposed efficient MAC frame format based on TDMA using mini-slot for request access. The number of mini-slots is variable based on the result of collision in the previous frame. This dynamic allocation of request mini-slots helps resolve the contention situation quickly and avoids the waste of bandwidth that may occur when there are several unneeded request mini-slots. The simulation results are also presented in terms of channel utilization, call blocking probability and cell transmission delay for mixed traffic environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.29-38
• /
• 2001

Recently, as Internet and its services grow rapidly, IETF(Internet Engineering Task Force) introduced a new switching mechanism, MPLS(Multi-Protocol Label Switching), to solve the problem of the scalability in Internet backbone. In this paper, we implemented the LSR loaded with VC-merging function, which causes LSR's management cost to be significantly reduced. We propose a new VC-merge function which supports differentiated services. In case of network congestion in the output buffer of each core LSR, appling link polices to the output modules of the LSR using the EPD algorithm can prevent the buffer from being overflowed. Simulation was performed for Diffserv by using multiple traffic models and investigated the impact of VC-merge method compared to non VC-merge method. The proposed switch is modeled in VHDL and fabricated using the SAMSUNG $0.5{\mu}m$ SOG process.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.19-27
• /
• 1999

This paper propose a contention resolution policy featuring dynamic change of the threshold for the occupancy of the input buffer for an input buffering ATM switching architecture and its hardware implementation strategy. The strategy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The threshold is changed dynamically every time slot based both the arrived of cells and the cell service resulting from the contention resolution. The performance on the cell loss of the proposed policy is performed and compared with the conventional policy under the diverse traffic conditions through both the analysis based ont the Markov chain and the simulation.