• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.483-491
• /
• 2012

In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.67-73
• /
• 2012

A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.387-395
• /
• 2005

In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1059-1067
• /
• 2006

AODV(Ad-hoc On-demand Distance Vector) routing protocol was devised for use of mobile nodes in Ad-hoc network. When we use the AODV routing protocol in Ad-hoc networks with high mobility, disturbance of optimized route path and link break occur. In order to solve the shortcomings, this paper proposes a new routing protocol in which new routing control messages are added to the existing AODV. The proposed protocol minimizes link break and transmission delay while is able to secure the optimized route path constantly in changes of network topology The performance of the proposed routing protocol was evaluated by using us2 network simulator. The actual Ad-hoc network test bed provides us the most reliable experimental data for Ad-hoc networks. In order to support this experimental environment, the dissertation also developed an efficient embedded system on which AODV routing protocol, NAT, Netfilter can run and other event message can be verified without declining efficiency. The correct operation of AODV routing protocol has been verified in both the Ad-hoc network test bed in which the embedded system was used, and Ad-hoc networks linked with Ethernet backbone network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.79-88
• /
• 2002

Transcoding proxy strategy has been widely used as a means to reduce the delay in retrieving Web pages over wireless mobile data service networks. However, this strategy has the serious drawbacks of being a potential point of failure or a bottleneck of the service. We developed a distributed proxy server system in which multiple proxy servers are installed at geographically dispersed locations and share the workloads among them by serving mobile hosts only within assigned regions. A new handoff message protocol to enable handoffs between proxies as the mobile hosts move between regions is proposed. According to the proxy server handoff protocol, a client agent at the mobile horst requests a proxy server to start handoff processing by which two proxy servers synchronize distilled data belonging to a HTTP session that must be maintained across the handoff. Also, we introduce the architecture of the proxy server and the client agent that handles the proxy server handoff. Finally, we evaluate the proposed system through performance test.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.692-703
• /
• 2004

Communication induced checkpointing (CIC) is one of the checkpointing techniques to provide fault tolerance for distributed systems. Independent checkpoints that each distributed process produces without coordination are likely to be useless. Useless checkpoints, which cannot belong to any consistent global checkpoint sets, induce nondeterminant rollback. To prevent the useless checkpoints, CIC forces processes to take additional checkpoints at proper moment. The number of those forced checkpoints is the main source of failure-free overhead in CIC. In this paper, we present two new CIC protocols which satisfy 'No Z-Cycle (NZC)'property. The proposed protocols reduce the number of forced checkpoints compared to the existing protocols with the drawback of the increase in message delay. Our simulation results with the synthetic data show that the proposed protocols have lower failure-free overhead than the existing protocols. Additionally, we show that the classical 'index-based checkpointing' protocols are inefficient in constructing the consistent global cut in distributed executions.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.4
• /
• pp.28-34
• /
• 2010

In this paper, we proposes a emergency medical information system for predicting emergency situation by using the body's vital signs. Main research of existing emergency system has focused on body sensor networks. The problem of these studies have a delay of the emergency first aid since occurring of an emergency situation send a message of emergency situation to user. In the serious situation, patients of these problem can lead to death. To solve this problem, it need to the prediction of emergency situation for doing quickly the First Aid with identify signs of a pre-emergency situations until an emergency occurs. In this paper, the sensor network technology, the security technology, the internet information retrieval techniques, data mining technology, and medical information are studied for the convergence of medical information systems of the prediction of emergency situations.

• Smart Media Journal
• /
• v.6 no.3
• /
• pp.41-48
• /
• 2017

Event detection using social media has been widespread since social network services have been an active communication channel for connecting with others, diffusing news message. Especially, the real-time characteristic of social media has created the opportunity for supporting for real-time applications/systems. Social network such as Twitter is the potential data source to explore useful information by mining messages posted by the user community. This paper proposed a novel system for temporal event detection by analyzing social data. As a result, this information can be used by first responders, decision makers, or news agents to gain insight of the situation. The proposed approach takes advantages of deep learning methods that play core techniques on the main tasks including informative data identifying from a noisy environment and temporal event detection. The former is the responsibility of Convolutional Neural Network model trained from labeled Twitter data. The latter is for event detection supported by Recurrent Neural Network module. We demonstrated our approach and experimental results on the case study of earthquake situations. Our system is more adaptive than other systems used traditional methods since deep learning enables to extract the features of data without spending lots of time constructing feature by hand. This benefit makes our approach adaptive to extend to a new context of practice. Moreover, the proposed system promised to respond to acceptable delay within several minutes that will helpful mean for supporting news channel agents or belief plan in case of disaster events.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.95-102
• /
• 2012

The development of applications for vehicular ad hoc networks (VANETs) has very specific and clear goals such as providing intellectual safe transport systems. An emergency warning technic for public safety is one of the applications which requires an intelligent broadcast mechanism to transmit warning messages quickly and efficiently against the time restriction. The broadcast storm problem causing several packet collisions and extra delay has to be considered to design a broadcast protocol for VANETs, when multiple nodes attempt transmission simultaneously at the access control layer. In this paper, we propose an early intelligent alert broadcasting (EI-CAST) algorithm to resolve effectively the broadcast storm problem and meet time-critical requirement. The proposed algorithm uses not only the early alert technic on the basis of time to collision (TTC) but also the intelligent broadcasting technic on the basis of fuzzy logic, and the performance of the proposed algorithm was compared and evaluated through simulation with the existing broadcasting algorithms. It was demonstrated that the proposed algorithm shows a vehicle can receive the alert message before a collision and have no packet collision when the distance of alert region is less than 4 km.