• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.885-894
• /
• 2012

Currently, Demand of data traffic has rapidly increased by popular of smart device. It is very difficult to accommodate demand of data traffic by limited resource of base station (BS). To solve this problem, method has proposed that the Device-to-Device (D2D) reduce frequency overload of the BS and all of the user equipment (UE) inside the BS and neighbor BS don't allow communicating directly to BS. However, in LTE-Advance system cellular link and sharing radio resources of D2D link, the strong interference of the cellular network is still high. So we need to eliminate or mitigate the interference. In this paper, we use the transmission power control method and Soft Frequency Reuse (SFR) resource allocation method to mitigate the interference of the cellular link and D2D link. Simulation results show that the proposed scheme has high performance in terms of Signal to Noise Ratio (SINR) and system average throughput.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.121-131
• /
• 2014

Traffic speed is an important measure in transportation. It can be employed for various purposes, including traffic congestion detection, travel time estimation, and road design. Consequently, accurate speed prediction is essential in the development of intelligent transportation systems. In this paper, we present an analysis and speed prediction of a certain road section in Busan, South Korea. In previous works, only historical data of the target link are used for prediction. Here, we extract features from real traffic data by considering the neighboring links. After obtaining the candidate features, linear regression, model tree, and k-nearest neighbor (k-NN) are employed for both feature selection and speed prediction. The experiment results show that k-NN outperforms model tree and linear regression for the given dataset. Compared to the other predictors, k-NN significantly reduces the error measures that we use, including mean absolute percentage error (MAPE) and root mean square error (RMSE).

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.1
• /
• pp.79-85
• /
• 2017

Vehicular ad-hoc networks (VANETs) cause link disconnection problems due to the rapid speed and the frequent moving direction change of vehicles. Link disconnection in vehicle-to-vehicle communication is an important issue that must be solved because it decreases the reliability of packet forwarding. From the characteristics of VANETs, greedy forwarding protocols using the position information based on the inter-vehicle distance have gained attention. However, greedy forwarding protocols do not perform well in the urban environment where the direction of the vehicle changes greatly. It is because greedy forwarding protocols select the neighbor vehicle that is closest to the destination vehicle as the next transmission vehicle. In this paper, we propose a greedy anycast forwarding (GAF) protocol to improve the reliability of the inter-vehicle communication. The proposed GAF protocol combines the greedy forwarding scheme and the anycast forwarding method. Simulation results show that the GAF protocol can provide a better packet delivery rate than existing greedy forwarding protocols.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.637-644
• /
• 2020

VANET (Vehicular Ad Hoc Networks) is a network between vehicles and between vehicles and infrastructure. VANET-specific characteristics such as high mobility, movement limitation, and signal interference by obstacles make it difficult to provide stable VANET services. To solve this problem, this paper proposes a vehicle type-based priority clustering method that improves the existing bus-based clustering. The proposed algorithm constructs a cluster by evaluating the priority, link quality, and connectivity based on the vehicle type, expected communication lifetime, and link degree of neighbor nodes. It tries to simplify the process of selecting a cluster head and increase cluster coverage by utilizing a predetermined priority based on the type of vehicle. The proposed algorithm is expected to become the basis for activating various services by contributing to providing stable services in a connected car environment.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.256-262
• /
• 2009

In this paper, we propose a mechanism for increasing the handover performance of the IEEE 802.11 link layer. The mechanism reduces the number of scanning channels by referencing an AP map based on GPS. Also, by monitoring the SNRs of the mobile node and neighbor APs, it enables the handover to maintain a higher SNR than a given threshold. The experimental results establish that it has a disconnection ratio of 6.7% and an average SNR of 16.8 dB. It is 4.1% lower disconnection ratio and 26% higher SNR than the mechanism used by MadWifi.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.16 no.3
• /
• pp.1-11
• /
• 2013

This study developed the algorithm of location-based service for supplying the efficient tourism service to traveller using mobile device and applied it to the Jeonju HANOK village. First, the location service was advanced using algorithm coupling with GPS error range and travel speed in single line, and with GPS location and nearest neighbor method to line in multiple one. Also this study developed a program using DuraMap-Xr spatial engine for establishing topology to Node and Link in line automatically. And the foundation was prepared for improving travel convenience by programming location-based service technology to single and multiple lines based on Blackpoint-Xr mobile application engine.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1135-1144
• /
• 2003

In this paper, we proposed a semi-soft handoff mechanism to provide link mobility in IEEE 802.11 wireless LAN environment. Buffers and routing tables in APs and portals are provided in order to reroute frames, which have not been received during handoff time and have been buffered in an old AP, to a new AP after handoff is performed. For the re -routing operation, the MAC routing table should be updated by exchanging information of a mobile terminal between neighbor APs. With our proposed scheme. a wireless LAN node can perform semi soft handoff while changing its attached AP and provide mobile IP and/or real time service like voice over IP. Also, we have done simulation for evaluation of the performance of the proposed scheme. We show that our semi soft handoff mechanism can be applied for real-time service with no frame loss in mobile environment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.2
• /
• pp.131-140
• /
• 1998

MAI(Multi-Access Interference) and fast channel variation due to the fading environment are the major problems in the mobile CDMA communication systems. Recently, interest has been increasing in applying the Adaptive Linear MMSE Detector to MAI cancellation in the CDMA reverse link. In this paper, we propose a modified Adaptive Linear MMSE Detector structure which can be used in Long-duration code CDMA system in the presence of independent Rayleigh fading. We use independent multiple tap-weight vector structure to cope with the variation of spreading sequence pattern between neighbor symbols because of the Long-duration code. In this case, more exact channel parameter estimation is required. To solve this problem, we use coherent CDMA structure which can track the channel parameters like amplitude and phase by employing the low power pilot channel in the CDMA reverse link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1075-1082
• /
• 2008

A greedy forwarding algorithm is one of the most suitable solutions for routing in vehicular ad-hoc networks. Compared to conventional routing protocols for mobile ad-hoc networks, greedy forwarding based routing protocols maintain only local information of neighbors instead of per-destination routing entries, and thus they show better performance in highly-mobile vehicular ad-hoc networks. With greedy forwarding, each node learns its geographical position and periodically broadcasts a beacon message including its position information. Based on the position information, each node selects a neighbor node located closest to the destination node as the next forwarder. One of the most serious problems in greedy forwarding is the lost link problem due to the mobility of nodes. In this paper, we propose a new algorithm to reduce the lost link problem. The proposed algorithm aims to find an efficient and stable routing path by taking account of the position of neighbors and the last beacon reception time. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.588-591
• /
• 2004

This paper describes a new approach to Internet host mobility. We argue that local mobility, the performance of existing mobile host protocol can be significantly improved. It proposes Fast Moving Detection scheme that based on neighbor AP channel information and moving detection table. And, it composes Local Area Clustering Path (LACP) domain that collected in AP's channel information and MN interface information. It stored the roaming table to include channel information and moving detection. Those which use the proposal scheme will need to put LACP information into the beacon or probe frame. Each AP uses scheme to inform available channel information to MN. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.