• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.69-76
• /
• 2009

The construction of Internet IP-based Network is composed of router and switch models in a variety of companies. The construction by various models causes the complexity of the management and control as different types of CLI is used by different company to filter out abnormal traffics like worm, virus, and DDoS. To improve this situation, IETF is working on enacting XML based configuration standards from NETCONF working group, but currently few commands processing at the level of operation layer on NETCONF are only standardized and it's hard for unified control operation process between different make of system as different company has different XML command to filter out abnormal traffics. This thesis proposes ways to prevent abnormal attacks and increase efficiency of network by re-routing the abnormal traffics coming thru unified control for different make of systems into Sinkhole router and designing a control system to efficiently prevent various attacks after checking the possibility of including abnormal traffics from unified control operation.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.889-894
• /
• 2004

Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

• International Journal of Advanced Culture Technology
• /
• v.5 no.1
• /
• pp.58-63
• /
• 2017

Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.259-261
• /
• 2016

Cable is very essential material for ship operation as connecting element for whole electrical facilities of ship. The material cost and installation man-hour increment caused by re-installation is unavoidable if cable route has some problem. The purpose of this study is to suggest methods to implement the cable visualization functionality for verifying whether cable route is accurate or not in design phase. This functionality is conducted by representing color of 3D model for strong visibility by refer to textual cable routing information. The electrical engineer can provide cable route information more accurate and on time for cable installation department. As a result, the material cost and installation man-hour reduce due to decreasing ratio of re-installation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• Journal of Korean Society of Transportation
• /
• v.29 no.5
• /
• pp.121-138
• /
• 2011

More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.637-646
• /
• 2012

Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.63-71
• /
• 2013

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other member nodes do because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exist problems that the cluster header has short average lifetime, and a new cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases the problem of re-electing the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header any more because the remaining energy level goes low, it sends a beacon message to neighbor member nodes, then the second header will serve as the cluster header.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.39-51
• /
• 1998

In this paper, we propose signaling procedures amon network elements for a connection rerouting method which can reduce inter-switch handoff processing delay reduces the delay in the connection re-routing by reserving VPI/VCIs for possible inter-switch handoff calls in advance. Additionally, we mathematically analyze the signaling procedures and then suggest solutions to the relations with cluser size, network topoloty, handoff-request rete and handoff delay. With simulation, the solutions are validated. From numerical examples, we concluded taht handoff delay, one of the handoff QoSs, can be satisfied by adjusting the cluster size and network topology according to the handoff -request rate of service area. With our proposed signaling and analytic methods, we concluded that the connection rerouting method using cluster-sectoring effectively reduces the delay of inter-switch handoff processing than dynamic connection rerouting method. Our solutions are useful in guaranteeing the requested handoff delay (especially, inter-switch handoff delay) when the connection rerouting method is applied to ATM-based wireless/wired integrated network.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.414-416
• /
• 1999

무선 ATM은 무선 멀티미디어 서비스를 종단간 ATM 기술로 제공하는 전송방식으로 최근에 그 요구가 급증하여 단말기의 개발과 보급이 폭증하고 있다. 이에 따라 사용자 및 전송용량의 증가로 인하여 셀의 크기가 작아지게 되고 더 많은 핸드오프가 발생하게 되는데, 좀 더 빠르고 망 자원을 보다 효율적으로 이용하도록 하기 위한 기법들에 대한 연구가 증대되고 있다. 본 논문에서는 보다 빠른 핸드오프를 위하여 사용되어지는 여러 가지 routing 방법들 중 단말기가 접속된 기지국이 바뀔 경우 VC(Victual Connection)를 재설정하는 방식인 Path Extension과 Path Rerouting을 사용하여 LAN 환경에서 해당 MSC에 속한 BS의 개수에 따라 어떠한 VC path length와 receive latencies를 나타내는지 비교하여 핸드오프 지연이 보다 적은 기법을 제안한다.