• Title/Summary/Keyword: ROUTE

Search Result 5,424, Processing Time 0.029 seconds

The Design of Secret Multi-Paths on MRNS(Mixed Radix Numbers System) Network for Secure Transmission (안전한 전송을 위한 MRNS(Mixed Radix Number System)네트워크에서의 비밀 다중 경로의 설계)

  • Kim, Seong-Yeol;Jeong, Il-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1534-1541
    • /
    • 1996
  • Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.

  • PDF

A Disaster Evacuation System Using Smart Devices for Indoor Crisis Management in BLE Environments (BLE 환경에서 실내 위기관리를 위한 스마트 장치 기반의 재난대피 시스템)

  • Jang, Minsoo;Jeong, Wooyong;Lim, Kyungshik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.5
    • /
    • pp.281-296
    • /
    • 2015
  • This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.

A Study on Developing Navigation for a Moving Destination Target

  • Jang, Eun-Gyeom;Lee, Won Joo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.65-72
    • /
    • 2016
  • Vehicle and marine navigation which are currently being commercialized provide route guidance service by specifying a fixed position as a destination. In the route guidance service of existing navigation, if the destination has to be changed in the middle, a new destination must be designated again to obtain the navigation service. However, if the destination can't be designated, it is difficult to clearly use it. In this paper, in order to overcome the difficulties of directions in the existing navigation, a new navigation specifying moving targets as the destination has been developed to get the directions. A proposed system is that a group is made and a group manager is appointed as a destination and then a user can get the route guidance based on location of the group manager. In the service way, relationship between the group manager and user is one-to-many and relationship between the user and group manager is one-to-one. The proposed technology is able to provide services that the user can easily find the moving targets such as the positioning surrogate drivers, tracking routes and location among travelers and finding children.

Bioavailabilities of Omeprazole Administered to Rats through Various Routes

  • Choi, Mi-Sook;Lee, Young-Hee;Shim, Chang-Koo
    • Archives of Pharmacal Research
    • /
    • v.18 no.3
    • /
    • pp.141-145
    • /
    • 1995
  • Omeprazole, a proton pump inhibitor, was given intravenously (iv), orally (po), intraperitoneally (ip), hepatoportalvenously (pv), and intrarectally (ir) to rats at a dose of 72mg/kg in order to investigate the bioavailability of the drug, The extent of bioavailabilities of omeprazole administered through pv, ip, po, and ir routes were 88.5, 79.4, 40,8, and 38.7%, respectively. Pharmacokinetic analysis in this study and literatures (Regardh et al., 1985 : Watanabe et al., 1994) implied significant dose-dependency in hepatic first-pass metabolism, clearance and distribution, and acidic degradation in gastric fluid. The high bioavailability from the pv administration (88.5%) means that only 11.5% of dose was extracted by the first-pass metabolism through the liver at this dose (72 mg/kg). The low bioavailability from the oral administration (40.8%) in spite of minor hepatic first-pass extraction indicates low transport of the drug from GI lumen to portal vein. From the literature (Pilbrant and Cederberg, 1985), acidic degradation in gastric fluid was considered to be the major cause of the low transport. Thus, enteric coating of oral preparations would enhance the oral bioavailability substantially. The bioavailability of the drug from the rectal route, in which acidic degradation and hepatic first-pass metabolism may not occur, was low (38.7%) but comparable to that from the oral route (40.8 %) indicating poor transport across the rectal membrane. In this case, addition of an appropriate absorption enhancer would improve the bioavailability. Rectal route seems to be an possible alternative to the conventional oral route for omeprazole administration.

  • PDF

Utilization of the Route Table for the Agent's Move in the Game Map (게임지도에서 에이젼트 이동을 위한 경로표 활용)

  • Shim, Dong-Hee;Kang, Hyuk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3164-3170
    • /
    • 2000
  • The use of the A' for the path search of the agent in the game map give the overhead of computing time in real time game processing. The other heuristic search algorithms do not guarantee the optical path. The route table of which the row is defined by current position, goal position, visiting position is presented in this paper. This route table is made in the game development phase and tilized in game playing. The visiting position which is contatined in the optimal path to the goal position from the current position can guarantee the optical path, and this mothod has no overhead on computing time. But the memory space is requred too much. This problem can also be solved using the data compression by skipping the duplicated route table.

  • PDF

A Study on Trusted Routing Scheme for Secure Path and Secure Data Transmission in MANET (MANET에서 보안 경로와 안전한 데이터 전송을 위한 신뢰 기반 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.2
    • /
    • pp.43-51
    • /
    • 2017
  • Recently, MANET has been used in many fields as the range of applications increases. However, the dynamic topology that MANET has makes it difficult to route and provides the cause of exposure to security vulnerabilities. Therefore, the security features that can be robust to many attacks must have been applied in the routing technique provided in the MANET. In this paper, we propose a secure routing method that secure route is established by reliability evaluation of nodes and secure data communication has applied through key exchange mechanism. The proposed technique used hierarchical structure for efficiency of reliability evaluation of nodes. The reliability of nodes is performed by trust management node and reliability of nodes managed periodically is broadcasted. And the key exchange for secure data transmission is dene without CA as the certificate issuing organization. This allows fast key exchange and the integrity of data transmission improved. The proposed technique improves the security of the data transmission because a secure route to the destination node is established by the reliability evaluation and the data transmission is performed after the key between the source node and the destination node is exchanged through the established route.

A Study on the Wireless Control System for the Shunting Route Indicator Applied with LTE-R technology (LTE-R 기술을 적용한 입환진로표시기 무선제어시스템 연구)

  • Suh, Ki-Bum;Im, Chul-Hoo;Lee, Kwang-Hee;Oa, Seong-Wook;Joeng, Wang-Kuk
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.1
    • /
    • pp.229-236
    • /
    • 2017
  • The railway has recently been expanded with the phase of the future transportation. Accordingly, using the new technologies such as smart devices and LTE-R, the needs for reducing operational costs and improving passenger services have emerged. To realize these needs, the government is pushing to build the dedicated wireless network for the railway systems. In this paper, the shunting route indicator was selected for this study because it has the best effect for the wireless system removed lots of wired cables. And the wireless shunting route indicator applied with LTE-R technology was developed to replace the current wired control system. The functional goal(the wireless control function applied LTE-R), the performance goal(less than 300ms for transferring the control information), and the reliability goal(over the 100,000 hours for MTBF) were set, and these goals were achieved and demonstrated through the test and validation.

Computing Methods of Node Traversal Time of ERS Algorithm to Reduce the Retransmission Rate in AODV Routing Protocol (AODV 라우팅 프로토콜에서 재전송률을 낮추기 위한 ERS 알고리즘의 노드순회시간 계산방법)

  • Sun Chang-Yoon;Kang Seung-Ho;Lim Hyeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.447-454
    • /
    • 2006
  • An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

A Study on Transportation Route of Chemicals using Quantitative Risk Assessment (정량적 위험성평가를 이용한 화학물질 운송경로에 관한 연구)

  • Byun, Yoon Sup
    • Journal of the Korean Institute of Gas
    • /
    • v.21 no.3
    • /
    • pp.46-52
    • /
    • 2017
  • During the transportation of chemicals, quantitative risk assessment for chemical leakage accidents caused by traffic accidents was carried out and the appropriateness of chemical transportation route was evaluated. The quantitative risk assessment method applied to the chemical leakage accidents that may occur in the chemical handling equipments installed in the workplace was presented and applied to the chemical transportation. By analyzing the number of traffic accidents in transportation vehicles, the probability of chemical leakage accidents during chemical transportation was predicted and applied to the quantitative risk assessment of chlorine gas leakage accidents that may occur when transporting liquified chlorine bombe using vehicles. As a result, the most appropriate route of transporting the liquefied chlorine bombe was suggested on the basis of risk.

ARARO: Aggregate Router-Assisted Route Optimization for Mobile Network Support

  • Rho, Kyung-Taeg;Jung, Soo-Mok
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.9-17
    • /
    • 2007
  • Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

  • PDF