• Title/Summary/Keyword: route table

Search Result 100, Processing Time 0.029 seconds

Trust Based Authentication and Key Establishment for Secure Routing in WMN

  • Akilarasu, G.;Shalinie, S. Mercy
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4661-4676
    • /
    • 2014
  • In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

A Study on Ships Optimal Speed, Deadweight and Their Economy (On the Operations of Common Bulk Carriers Under the Various Managerial Circumstances of Shipping Companies) (상선의 최적속력 및 적화중량톤과 경제성에 관한 연구 ( 일반살적화물선에 있어서 해운운영상의 여건변동을 중심으로 ))

  • 양시권
    • Journal of the Korean Institute of Navigation
    • /
    • v.7 no.2
    • /
    • pp.65-113
    • /
    • 1983
  • A lot of studies of ship's economy are on the traditional fields such asreducing propulsion resistance, raising cargo handling rates and lessening building consts, but there are few researches on the merchant ship's economy concerning their deadweights and speeds according to shipping companies managerial cercumstances. Contrary to the contemporary trend that "the bigger, the better, if the cargo handling rate could increased sufficiently to hold down port time to that rate of smmaler vessels", this paper demonstrates the existence of certain limits in ship's size and speed according to the coditions of the freight rates, voyage distances, cargo handing rates, prices of fuel oil, interst rates etc. Fom the curves of criteria contour for various ship's deadweights and speeds which are depicted from the gird search method, one can get the costs and the yearly profit rates under the conditiions of large volume with long term contracts for the transportation of bulk cargoes. In estimating ship's transportation economy, the auther takes the position that the profit rate method is properer than the cost method, and introduces the calculation table of the voyage profit rate index. The use of the criteria contours will be of help to ship owners in determining the size and speed of the ship which will be built or purchased and serve in a certain trade route.

  • PDF

A study on improving the evaluation of motorway functions using Trip Length Frequency Distribution(TLFD) (통행거리빈도분포를 활용한 고속도로 기능 평가 개선 연구)

  • Kwon, Ceholwoo;Yoon, Byoungjo
    • Journal of Urban Science
    • /
    • v.11 no.2
    • /
    • pp.9-17
    • /
    • 2022
  • The purpose of this study is to develop an index for evaluating the function of a new motorway using the travel distance frequency distribution (TLFD) calculated using the vehicle travel route big data, and to overcome the limitations of the evaluation through the existing traffic volume. The mobility evaluation index of motorways was developed by applying it to the TLFD data table in 2019. The smaller the value of the mobility evaluation index of the link is calculated, the more it is a link with mainly short-distance travel, and the higher the value of the mobility evaluation index, the more it means a link with mainly long-distance travel. The accessibility evaluation index was calculated through the result of the mobility evaluation index of all motorways developed, and all motorways were grouped into three groups using K-means clustering. Group A was found to exist inside a large city and consisted of motorways with many short-distance traffic, Group B was investigated as acting as an arterial between groups, and Group C was classified as a motorway consisting mainly of long-distance traffic connecting large cities and large cities. This study is significant in developing a new motorway function evaluation index that can overcome the limitations of motorway function evaluation through the existing traffic volume. It is expected that this study can be a reasonable comprehensive indicator in the operation and planning process of motorways.

Dynamic Single Path Routing Mechanism for Reliability and Energy-Efficiency in a Multi Hop Sensor Network (다중 홉 센서 네트워크에서 신뢰성과 에너지 효율성을 고려한 동적 단일경로 설정기법)

  • Choi, Seong-Yong;Kim, Jin-Su;Jung, Kyung-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.9
    • /
    • pp.31-40
    • /
    • 2009
  • What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

A routing Algorithm by Broadcasting a Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 브로드캐스팅 라우팅 알고리즘)

  • Jung Sang-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.459-468
    • /
    • 2006
  • Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

Dynamic traffic assignment based on arrival time-based OD flows (도착시간 기준 기종점표를 이용한 동적통행배정)

  • Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.143-155
    • /
    • 2009
  • A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

Supraclavicular Brachial Plexus block with Arm-Hyperabduction (상지(上肢) 외전위(外轉位)에서 시행(施行)한 쇄골상(鎖骨上) 상완신경총차단(上腕神經叢遮斷))

  • Lim, Keoun;Lim, Hwa-Taek;Kim, Dong-Keoun;Park, Wook;Kim, Sung-Yell;Oh, Hung-Kun
    • The Korean Journal of Pain
    • /
    • v.1 no.2
    • /
    • pp.214-222
    • /
    • 1988
  • With the arm in hyperabduction, we have carried out 525 procedures of supraclavicular brachial plexus block from Aug. 1976 to June 1980, whereas block with the arm in adduction has been customarily performed by other authors. The anesthetic procedure is as follows: 1) The patient lies in the dorsal recumbent position without a pillow under his head or shoulder. His arm is hyperabducted more than a 90 degree angle from his side, and his head is turned to the side opposite from that to be blocked. 2) An "X" is marked at a point 1 cm above the mid clavicle, immediately lateral to the edge of the anterior scalene muscle, and on the palpable portion of the subclavian artery. The area is aseptically prepared and draped. 3) A 22 gauge 3.5cm needle attached to a syringe filled with 2% lidocaine (7~8mg/kg of body weight) and epineprine(1 : 200,000) is inserted caudally toward the second portion of the artery where it crosses the first rib and parallel with the lateral border of the muscle until a paresthesia is obtained. 4) Paresthesia is usually elicited while inserting the needle tip about 1~2 em in depth. If so, the local anesthetic solution is injected after careful aspiration. 5) If no paresthesia is elicited, the needle is withdrawn and redirected in an attempt to elicit paresthesia. 6) If, after several attempts, no paresthesia is obtained, the local anesthetic solution is injected into the perivascular sheath after confirming that the artery is not punctured. 7) Immediately after starting surgery, Valium is injected for sedation by the intravenous route in almost all cases. The age distribution of the cases was from 11 to 80 years. Sex distribution was 476 males and 49 females (Table 1). Operative procedures consisted of 103 open reductions, 114 skin grafts combined with spinal anesthesia in 14, 87 debridements, 75 repairs, i.e. tendon (41), nerve(32), and artery (2), 58 corrections of abnormalities, 27 amputations above the elbow (5), below the elbow (3) and fingers (17), 20 primary closures, 18 incisions and curettages, 2 replantations of cut fingers. respectively (Table 2). Paresthesia was obtained in all cases. Onset of analgesia occured within 5 minutes, starting in the deltoid region in almost all cases. Complete anesthesia of the entire arm appeared within 10 minutes but was delayed 15 to 20 minutes in 5 cases and failed in one case. Thus, our success rate was nearly 100%. The duration of anesthesia after a single injection ranged from $3\frac{1}{2}$ to $4\frac{1}{2}$, hours in 94% of the cases. The operative time ranged from 0.5 to 4 hours in 92.4% of the cases(Table 3). Repeat blocks were carried out in 33 cases when operative times which were more than 4 hours in 22 cases and the others were completed within 4 hours (Table 4). Two patients of the 33 cases, who received microvasular surgery were injected twice with 2% lidocaine 20 ml for a total of $13\frac{1}{2}$ hours. The 157 patients who received surgery on the forearms or hands had pneumatic tourniquets (250 torrs) applied without tourniquet pain. There was no pneumothorax, hematoma or phrenic nerve paralysis in any of the unilateral and 27 bilateral blocks, but there was hoarseness in two, Horner's syndrome in 11 and shivering in 7 cases. No general seizures or other side effects were observed. By 20ml of 60% urcgratin study, we confirm ed the position of the needle tip to be in a safer position when the arm is in hyperabduction than when it is in adduction. And also that the humoral head caused some obstraction of the distal flow of the dye, indicating that less local anesthetic solution would be needed for satisfactory anesthesia. (Fig. 3,4).

  • PDF

A Risk Assessment of Vibrio parahaemolyticus for Consumption of Shucked Raw Oyster in Korea

  • Lee, Jong-Kyung;Yoon, Ki-Sun;Lee, Hyang;Kim, Hyun-Jung
    • Journal of Food Hygiene and Safety
    • /
    • v.33 no.4
    • /
    • pp.248-254
    • /
    • 2018
  • To assess the risk of V. parahaemolyticus infection caused by consumption of raw oysters in Korea, contamination levels during the retail-to-table route of oysters was modeled to predict V. parahaemolyticus growth based on temperature and time. The consumed amount data of the KNHANES and the standard recipe of RDA were applied. A consumption scenario for exposure assessment was developed and combined with a Beta-Poisson dose-response model. The estimated probability of illness from consumption of pathogenic V. parahaemolyticus in raw oysters during three separate months (April, October, and November) was $5.71{\times}10^{-5}$ (within the 5th and 95th percentile ranges of $2.71{\times}10^{-8}$ to $1.03{\times}10^{-4}$). The results of the quantitative microbial-risk assessment indicated that the major factors affecting the probability of illness were the initial contamination level at the retailer, the consumed amount, the prevalence of pathogenic strains [tdh or trh genes], and exposure temperature and time.

A Secure and Efficient Method for Detecting Malicious Nodes in MANET (MANET에서 악의적인 노드의 안전하고 효율적인 검출 방안)

  • Lee KangSeok;Choi JongOh;Ji JongBok;Song JooSeok
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.617-622
    • /
    • 2005
  • Lately, the MANET research has focused on providing routing services with security and previous schemes have been proposed for detecting malicious nodes in a MANET. However, they still include some problems which malicious nodes cannot be found when they falsely report other nodes as malicious. Accordingly, we propose a novel and efficient scheme for detecting malicious nodes using report messages and a report table which is consisted of node ID both for suspecting and reporting when the malicious nodes behave normally during the route discovery, but the other hand they drop and modify packets, or falsely report other nodes as malicious during the data transmission. Our proposed scheme is applicable to not only DSR but aiso AODV. And we provide some simulation results of our proposed scheme by comparing general AODV with our proposed scheme. Simulation results show that our Proposed scheme outperforms general AODV in terms of average packet loss ratio and packet delivery ratio.

Self-Adaptive Location Checking Mechanism in Mobile Ad-hoc Networks (모바일 애드혹 네트워크에서 자가 적응형 위치 검증 기법)

  • Youn, Joo-Sang;Kim, Young-Hyun;Pack, Sang-Heon
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.281-290
    • /
    • 2010
  • In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.