• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.15-25
• /
• 2008

This paper is to develop a network reorganization method to consider the constraints which are turn restrictions, U-turns, and P-turns in two way traffic network for Intelligent Transport System(ITS). Several kinds of traffic constraints can be represented in reorganized network using virtual nodes and arc values. The evolution program is also developed to search the multiple shortest paths in this reorganized traffic network within limited time.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.246-252
• /
• 2010

A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-phase approach.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.591-595
• /
• 2010

In this paper, a method that dynamically adapts the traffic flow of automated guided vehicles (AGVs) used in automated container terminals to the changing operational condition is presented. In a container terminal, the AGVs are vulnerable to traffic congestion because a large number of AGVs operate in a limited area. In addition, dynamically changing operational condition requires the traffic flow of AGVs to be continuously adjusted to keep up with the change. The proposed method utilizes a genetic algorithm to optimize the traffic flow. Exploiting the dynamic nature of the problem an approach that reuses the results of the previous search is tried to speed up the convergence of the genetic algorithm. The results of simulation experiments show the efficiency of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1123-1140
• /
• 2019

Many Internet of Things (IoT) applications involving bursty traffic have emerged recently with event detection. A power management scheme qualified for uplink bursty traffic (PM-UBT) is proposed by distinguishing between bursty and general uplink traffic patterns in the IEEE 802.11 standard to balance energy consumption and uplink latency, especially for stations with limited power and constrained buffer size. The proposed PM-UBT allows a station to transmit an uplink bursty frame immediately regardless of the state. Only when the sleep timer expires can the station send uplink general traffic and receive all downlink frames from the access point. The optimization problem (OP) for PM-UBT is power consumption minimization under a constrained buffer size at the station. This OP can be solved effectively by the bisection method, which demonstrates a performance similar to that of exhaustive search but with less computational complexity. Simulation results show that when the frame arrival rate in a station is between 5 and 100 frame/second, PM-UBT can save approximately 5 mW to 30 mW of power compared with an existing power management scheme. Therefore, the proposed power management strategy can be used efficiently for delay-intolerant uplink traffic in event-driven IoT applications, such as health status monitoring and environmental surveillance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.79-85
• /
• 2006

Generally, it is essential that high-speed routers, switches, and network security appliances should have an efficient packet classification scheme in order to achieve the high-speed packet forwarding capability. For the multi-gigabit packet-processing network equipment the high-speed content search hardware such as TCAM and search engine is recently used to support the content-based packet inspection. During the packet classification process, hundreds and thousands of rules are applied to provide the network security policies regarding traffic screening, traffic monitoring, and traffic shaping. In addition, these rules could be dynamically changed during operations of systems if anomaly traffic patterns would vary. Particularly, in the high-speed network, an efficient algorithm that updates and reorganizes the packet classification rules is critical so as not to degrade the performance of the network device. In this paper, we have proposed an efficient update algorithm using a partial-ordering that can relocate the dynamically changing rules at the TCAM. Experimental results should that our algorithm does not need to relocate existing rules feature until 70$\%$ of TCAM utilization.

• Korean Security Journal
• /
• no.14
• /
• pp.109-123
• /
• 2007

Traffic terror is one of the terror types subject on transportation means. However, unlike the aircraft or ship, there is no case of negotiating with passengers as hostage but to unconditionally attack that the human casualty would be much greater. In act, the terror on subway or bus would have much bigger damage than the terror on aircraft or ship. Because of such fact, there is a need for full preparation thereto, however, there is no preparation of advance preventive measure, particularly, when comparing to the cases involving aircraft. In addition, the passengers who use railway and others in the position of citizens do not have any defense mechanism against any terror activity to make the problem even more serious. Therefore, in order to prevent traffic terror, the first thing is to implement the identity confirmation of passengers, followed by the through search of cargos of the passengers, supplement the capability against the terror by the security team members, strengthen the responsive capability of citizens, thorough check on facilities, expansion of social security network and others. All terrors are within the reach of our neighborhood at the time when we neglect it, and the most secured and safe way to prevent the terror is to check and prepare at all times beginning from our familiar facilities or means.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.744-751
• /
• 2012

Air Traffic Management(ATM) is to control air traffic flow quickly and safely. For efficient ATM, the ability which calculate optimal route using filight plan and filght information is required. Especially for the time-sensitive air cargo, it is essential. In this paper, therefore, we present a dynamic route search algorithm which calculate optimal route dynamically. The conventional method using Dijkstra algorithm has a problem that recalculate the entire route when some airways are closed. However, the proposed algorithm recalculates only affected waypoints, so it finds optimal route quickly and accurately. Comparisons with the conventional method and the proposed algorithm show that the proposed algorithm provides better.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.63-68
• /
• 2004

In this paper, we propose a method about the extraction of vehicle and tracking trajectory for moving vehicle tracking system in road. This system applied to the monitoring system of the traffic flow for ATMS(advanced traffic management system) of ITS(intelligent transport system). Also, this system can solve the problem of maintenance of loop sensor. And we detected vehicle using differential image analysis. Because of the road environment changes by real time. Therefore, the method to use background image is not suitable. And we used Kalman filter and innovation value and variable search area for vehicle tracking system. Previous method using fixed search area is sensitive to the moving trajectory and the speed of vehicle. Simulation results show that proposed method increases the possibility of traffic measurement more than fixed area traffic measurement system.