• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.336-339
• /
• 2011

In the RTLS(Real Time Location Based System), in case of existing a number of moving target, extremely complecated data flow is can be occurred. In the network where single gateway exists, various data which was collected from sensor node is transmitted along the simple route as time goes by. In case of multi-gateway configuration, the collected data is transmitted through diverse routes rather than simple route. This kind of data causes jams on nodes and this brings down the performance of the network. Different from existing studies, in this thesis, MAC (Media Access Control) protocol which minimizes data collision between nodes and guarantees QoS(Quality of Service) is suggested, in order to communicate efficiently in multi-gateway underwater sensor network environment. In the suggested protocol, source node which wants to transmit data makes a channel reservation to a number of destination node using a RTS packet. Source node reserves a channel without collision, by scheduling CTS response time using expected delay information from neighbor nodes. Once the reservation is made, source node transmit data packet without collision. This protocol analyzes/estimates the performance compared to a method provided from existing studies via simulation. As a results of the analysis, it was comfirmed that the suggested method has better performance, such as efficiency and delay.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.167-179
• /
• 2005

In hierarchical Mobile IPv4 Networks the highest FA(Foreign Agent) may experience serious congestion and delay since the highest FA plays a role of CoA(Care of Address) for all mobile nodes in the domain, In this paper, we propose mechanism called 'HRFA(Hierarchical Root Foreign Agent)', which distributes the load imposed on the highest FA. In the proposed HRFA scheme, multiple HRFAs are selected to provide the similar service that is provided by the highest FA. According to which entity determines HRFAs, HRFA scheme is categorized into 'Active' and 'Passive' approaches. HRFA scheme is further categorized into 'All MN(Mobile Node)s' and 'New MNs' approaches, depending on which mobile nodes are assigned to a newly elected HRFA. Through a course of simulations, we investigate the performance of 4 possible combinations of HRFA schemes. We also compare the performance of the proposed HRFA schemes with the LMSP(Local Multicast Service Provider) scheme, which is a scheme to distribute the load of FA for multicast service in hierarchical wireless network domain. The simulation results show that the Passive & New MN approach performs best with respect to both the overhead and the load balancing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.9-16
• /
• 2005

A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.

• Journal of the Society of Disaster Information
• /
• v.15 no.4
• /
• pp.548-559
• /
• 2019

Purpose: Analysis method of V2I data driven motorway service area usage behavior to cope with manpower survey. Method: Segmentation of traveling state group and boundary using the distribution characteristics of traveling speed data of individual vehicles. Result: As a result of the verification, the use rate of resting places in lunchtime surged, and the boundary between the distribution status of the traffic speed data was clearly or unclear. Conclusion: The effect of the cost reduction is big because it can cope with the use of rest area survey by manpower and there is no limit in the time and space range of investigation. The dynamic utilization rate of each time sequence, such as a service area/drowsiness shelter/simple service area, with a V2I system, can be calculated. Identify illegal parking on highway section. Identify the unexpected situation in the road section. Identify the real-time service area utilization rate and congestion information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.603-612
• /
• 2010

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous VoD system researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose greedy precedent frame transmission technique, GPFT, for guarantee of constant QoS. In GPFT, Streaming VoD server prefetches precedent frames and transmits the frame greedily by increasing the frame transmission rate while the available network bandwidth is high. The GPFT uses the prefetched precedent frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed GPFT could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.116-126
• /
• 2016

In this study, lane-wise traffic flow characteristics were analysed on uninterrupted flow using a new notion of "lane-wise travel speed reversal (LTSR)" which is defined as a phenomena that travel speed in the median lane is lower than other lanes. Mathematical formulation was also proposed to calculate the strength of LTSR. The experiment road site is Seoul Outer Ring Expressway (Jayuro-IC~Jangsoo-IC), and travel trajectories for each four lane were collected for weekdays (Mon. through Fri.) during morning peak. Comparing lane-wise travel speeds for entire test road section, no LTSR was observed, meaning that the travel speed in the median lane is the fastest, followed by 2nd, 3rd, and 4th lane as in order. Howerver, the result of microscopic analysis using 100-meter discrete road section based data shows that LTSR occurs many times. Especially the strength of LTSR is higher in congestion area and freeway merge and diverge segment. It is expected that these results could be used as a fundamental data when establishing lane-by-lane traffic operation strategy and developing lane-wise traffic information collection and dissemination technology.

• Journal of the Society of Disaster Information
• /
• v.16 no.3
• /
• pp.550-557
• /
• 2020

Purpose: Greenhouse gases are one of the major causes of global warming, a global disaster. In this study, the priority that affects when calculating the GHG emissions in the road sector is accurately calculated based on the speed of individual vehicles from the existing section average speed. I have the purpose of finding a possible factor. Method: A comparative analysis is conducted between the conventional method of the general passage section, the rest area section, the entrance section, and the confluence section of the highway and the speed-based emission calculation method of individual vehicles. Result: As a result of analyzing a total of 6 sections of the Gyeongbu Expressway, it was found that the standard deviation of the speed and the congestion of the sections had a great influence. Conclusion: When comparing the existing GHG emission calculation method with the speed-based emission calculation method of individual vehicles, it is clear that the speed-based method of individual vehicles is more precise. However, since it is difficult to apply it all over the country, this study compares the existing method with the speed-based method of individual vehicles and presents factors that have a significant difference.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.121-129
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets may occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics, however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay tome. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution. So, the arriving packets may be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. The continually increasing delay due to network overload causes buffer underflow at the receiver. To solve it, the transmitter is required to speed up instantaneously. Too much increase of transmission-rate may cause network congestion. At that time, the transmitter drops the current packet when informed excessive delay from the receiver.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.17-30
• /
• 2002

Incident duration prediction is one of the most important steps of the overall incident management process. An accurate and reliable estimate of the incident duration can be the main difference between an effective incident management operation and an unacceptable one since, without the knowledge of such time durations, traffic impact can not be estimated or calculated. This research presents several multiple linear regression models for incident duration prediction using data consisting of 384 incident cases. The main source of various incident cases was the Traffic Incident Reports filled out by the Motorist Assistant Units of the Korea Highway Corporation. The models were proposed separately according to the time of day(daytime vs. nighttime) and the fatality/injury incurred (fatality/injury vs. property damage only). Two models using an integrated dataset, one with an intercept and the other without it, were also calibrated and proposed for the generality of model application. Some findings are as follows ; ?Variables such as vehicle turnover, load spills, the number of heavy vehicles involved and the number of blocked lanes were found to significantly affect incident duration times. ?Models, however, tend to overestimate the duration times when a dummy variable, load spill, is used. It was simply because several of load spill incidents had excessively long clearance times. The precision was improved when load spills were further categorized into "small spills" and "large spills" based on the size of vehicles involved. ?Variables such as the number of vehicles involved and the number of blocked lanes found not significant when a regression model was calibrated with an intercept. whereas excluding the intercept from the model structure signifies those variables in a statistical sense.