• Title/Summary/Keyword: P2P Routing

Search Result 96, Processing Time 0.023 seconds

Studies on the Derivation of the Instantaneous Unit Hydrograph for Small Watersheds of Main River Systems in Korea (한국주요빙계의 소유역에 대한 순간단위권 유도에 관한 연구 (I))

  • 이순혁
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.19 no.1
    • /
    • pp.4296-4311
    • /
    • 1977
  • This study was conducted to derive an Instantaneous Unit Hydrograph for the accurate and reliable unitgraph which can be used to the estimation and control of flood for the development of agricultural water resources and rational design of hydraulic structures. Eight small watersheds were selected as studying basins from Han, Geum, Nakdong, Yeongsan and Inchon River systems which may be considered as a main river systems in Korea. The area of small watersheds are within the range of 85 to 470$\textrm{km}^2$. It is to derive an accurate Instantaneous Unit Hydrograph under the condition of having a short duration of heavy rain and uniform rainfall intensity with the basic and reliable data of rainfall records, pluviographs, records of river stages and of the main river systems mentioned above. Investigation was carried out for the relations between measurable unitgraph and watershed characteristics such as watershed area, A, river length L, and centroid distance of the watershed area, Lca. Especially, this study laid emphasis on the derivation and application of Instantaneous Unit Hydrograph (IUH) by applying Nash's conceptual model and by using an electronic computer. I U H by Nash's conceptual model and I U H by flood routing which can be applied to the ungaged small watersheds were derived and compared with each other to the observed unitgraph. 1 U H for each small watersheds can be solved by using an electronic computer. The results summarized for these studies are as follows; 1. Distribution of uniform rainfall intensity appears in the analysis for the temporal rainfall pattern of selected heavy rainfall event. 2. Mean value of recession constants, Kl, is 0.931 in all watersheds observed. 3. Time to peak discharge, Tp, occurs at the position of 0.02 Tb, base length of hlrdrograph with an indication of lower value than that in larger watersheds. 4. Peak discharge, Qp, in relation to the watershed area, A, and effective rainfall, R, is found to be {{{{ { Q}_{ p} = { 0.895} over { { A}^{0.145 } } }}}} AR having high significance of correlation coefficient, 0.927, between peak discharge, Qp, and effective rainfall, R. Design chart for the peak discharge (refer to Fig. 15) with watershed area and effective rainfall was established by the author. 5. The mean slopes of main streams within the range of 1.46 meters per kilometer to 13.6 meter per kilometer. These indicate higher slopes in the small watersheds than those in larger watersheds. Lengths of main streams are within the range of 9.4 kilometer to 41.75 kilometer, which can be regarded as a short distance. It is remarkable thing that the time of flood concentration was more rapid in the small watersheds than that in the other larger watersheds. 6. Length of main stream, L, in relation to the watershed area, A, is found to be L=2.044A0.48 having a high significance of correlation coefficient, 0.968. 7. Watershed lag, Lg, in hrs in relation to the watershed area, A, and length of main stream, L, was derived as Lg=3.228 A0.904 L-1.293 with a high significance. On the other hand, It was found that watershed lag, Lg, could also be expressed as {{{{Lg=0.247 { ( { LLca} over { SQRT { S} } )}^{ 0.604} }}}} in connection with the product of main stream length and the centroid length of the basin of the watershed area, LLca which could be expressed as a measure of the shape and the size of the watershed with the slopes except watershed area, A. But the latter showed a lower correlation than that of the former in the significance test. Therefore, it can be concluded that watershed lag, Lg, is more closely related with the such watersheds characteristics as watershed area and length of main stream in the small watersheds. Empirical formula for the peak discharge per unit area, qp, ㎥/sec/$\textrm{km}^2$, was derived as qp=10-0.389-0.0424Lg with a high significance, r=0.91. This indicates that the peak discharge per unit area of the unitgraph is in inverse proportion to the watershed lag time. 8. The base length of the unitgraph, Tb, in connection with the watershed lag, Lg, was extra.essed as {{{{ { T}_{ b} =1.14+0.564( { Lg} over {24 } )}}}} which has defined with a high significance. 9. For the derivation of IUH by applying linear conceptual model, the storage constant, K, with the length of main stream, L, and slopes, S, was adopted as {{{{K=0.1197( {L } over { SQRT {S } } )}}}} with a highly significant correlation coefficient, 0.90. Gamma function argument, N, derived with such watershed characteristics as watershed area, A, river length, L, centroid distance of the basin of the watershed area, Lca, and slopes, S, was found to be N=49.2 A1.481L-2.202 Lca-1.297 S-0.112 with a high significance having the F value, 4.83, through analysis of variance. 10. According to the linear conceptual model, Formular established in relation to the time distribution, Peak discharge and time to peak discharge for instantaneous Unit Hydrograph when unit effective rainfall of unitgraph and dimension of watershed area are applied as 10mm, and $\textrm{km}^2$ respectively are as follows; Time distribution of IUH {{{{u(0, t)= { 2.78A} over {K GAMMA (N) } { e}^{-t/k } { (t.K)}^{N-1 } }}}} (㎥/sec) Peak discharge of IUH {{{{ {u(0, t) }_{max } = { 2.78A} over {K GAMMA (N) } { e}^{-(N-1) } { (N-1)}^{N-1 } }}}} (㎥/sec) Time to peak discharge of IUH tp=(N-1)K (hrs) 11. Through mathematical analysis in the recession curve of Hydrograph, It was confirmed that empirical formula of Gamma function argument, N, had connection with recession constant, Kl, peak discharge, QP, and time to peak discharge, tp, as {{{{{ K'} over { { t}_{ p} } = { 1} over {N-1 } - { ln { t} over { { t}_{p } } } over {ln { Q} over { { Q}_{p } } } }}}} where {{{{K'= { 1} over { { lnK}_{1 } } }}}} 12. Linking the two, empirical formulars for storage constant, K, and Gamma function argument, N, into closer relations with each other, derivation of unit hydrograph for the ungaged small watersheds can be established by having formulars for the time distribution and peak discharge of IUH as follows. Time distribution of IUH u(0, t)=23.2 A L-1S1/2 F(N, K, t) (㎥/sec) where {{{{F(N, K, t)= { { e}^{-t/k } { (t/K)}^{N-1 } } over { GAMMA (N) } }}}} Peak discharge of IUH) u(0, t)max=23.2 A L-1S1/2 F(N) (㎥/sec) where {{{{F(N)= { { e}^{-(N-1) } { (N-1)}^{N-1 } } over { GAMMA (N) } }}}} 13. The base length of the Time-Area Diagram for the IUH was given by {{{{C=0.778 { ( { LLca} over { SQRT { S} } )}^{0.423 } }}}} with correlation coefficient, 0.85, which has an indication of the relations to the length of main stream, L, centroid distance of the basin of the watershed area, Lca, and slopes, S. 14. Relative errors in the peak discharge of the IUH by using linear conceptual model and IUH by routing showed to be 2.5 and 16.9 percent respectively to the peak of observed unitgraph. Therefore, it confirmed that the accuracy of IUH using linear conceptual model was approaching more closely to the observed unitgraph than that of the flood routing in the small watersheds.

  • PDF

A Study on Implementation of Multiple-Valued Arithmetic Processor using Current Mode CMOS (전류모드 CMOS에 의한 다치 연산기 구현에 관한 연구)

  • Seong, Hyeon-Kyeong;Yoon, Kwang-Sub
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.8
    • /
    • pp.35-45
    • /
    • 1999
  • In this paper, the addition and the multiplicative algorithm of two polynomials over finite field $GF(p^m)$ are presented. The 4-valued arithmetic processor of the serial input-parallel output modular structure on $GF(4^3)$ to be performed the presented algorithm is implemented by current mode CMOS. This 4-valued arithmetic processor using current mode CMOS is implemented one addition/multiplication selection circuit and three operation circuits; mod(4) multiplicative operation circuit, MOD operation circuit made by two mod(4) addition operation circuits, and primitive irreducible polynomial operation circuit to be performing same operation as mod(4) multiplicative operation circuit. These operation circuits are simulated under $2{\mu}m$ CMOS standard technology, $15{\mu}A$ unit current, and 3.3V VDD voltage using PSpice. The simulation results have shown the satisfying current characteristics. The presented 4-valued arithmetic processor using current mode CMOS is simple and regular for wire routing and possesses the property of modularity. Also, it is expansible for the addition and the multiplication of two polynomials on finite field increasing the degree m and suitable for VLSI implementation.

  • PDF

Wireless Mesh Network based on Routing Algorithm for guaranteing QoS between End-to-End in VANET (차량 통신 네트워크에서 End-to-End간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘)

  • Ryu, Min-Woo;Yoon, Jae-Seok;Lee, Sang-Shin;Won, Kwang-Ho;Cho, Kuk-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2011.05a
    • /
    • pp.428-432
    • /
    • 2011
  • 차량 통신 네트워크(VANET, Vehicle Ad hoc NETwork)는 ITS(Intelligent Transport System)의 발전과 함께 운전자의 안전 및 교통 정보, 긴급 메시지 등과 같은 서비스를 실시간으로 가능하게 할 수 있는 차세대 네트워크 기술이다. 이러한 차량 통신 네트워크는 현재 IEEE P1609에서 정의하고 있으며, WAVE(Wireless Access Vehicular Environment)로 알려져 있다. WAVE는 차량에 설치된 OBU(Onboard Unit)와 주변시설에 설치된 RSU(Road Side Unit)을 통하여 통신하며, 차량 간 통신을 지원하는 V2V(Vehicle to Vehicle)와 차량과 주변시설과의 통신을 지원하는 V2I(Vehicle to Infrastructure)로 나뉘어져 있다. 하지만 WAVE에서 정의하고 있는 네트워크 서비스(IEEE P1609.4)는 OBU와 RSU 간의 네트워크 서비스에 초점을 맞추고 있기 때문에 전체 네트워크의 QoS를 보장하기에는 미흡한 상태이다. 따라서 본 논문에서는 차량 통신 네트워크에서 End-to-End 간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘을 제안한다. 제안하는 알고리즘은 무선 메쉬 네트워크 노드의 호스트 라우터 기능을 통하여 차량 노드와 이기종 간의 네트워크 서비스를 가능하게 하며, 무선 메쉬 네트워크의 다중 채널을 이용하여 데이터의 중요도에 따른 차등 서비스를 지원한다. ns-2를 이용한 시뮬레이션 결과 제안하는 알고리즘이 QoS를 보장함으로써 차량 통신 네트워크의 성능을 향상시킬 수 있음을 입증하였다.

  • PDF

Design and Evaluation of a Weighted Intrusion Detection Method for VANETs (VANETs을 위한 가중치 기반 침입탐지 방법의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.181-188
    • /
    • 2011
  • With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.

A Minimum Expected Length Insertion Algorithm and Grouping Local Search for the Heterogeneous Probabilistic Traveling Salesman Problem (이종 확률적 외판원 문제를 위한 최소 평균거리 삽입 및 집단적 지역 탐색 알고리듬)

  • Kim, Seung-Mo;Choi, Ki-Seok
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.114-122
    • /
    • 2010
  • The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

Prediction of a research vessel manoeuvring using numerical PMM and free running tests

  • Tiwari, Kunal;Hariharan, K.;Rameesha, T.V.;Krishnankutty, P.
    • Ocean Systems Engineering
    • /
    • v.10 no.3
    • /
    • pp.333-357
    • /
    • 2020
  • International Maritime Organisation (IMO) regulations insist on reduced emission of CO2, noxious and other environmentally dangerous gases from ship, which are usually let out while burning fossil fuel for running its propulsive machinery. Contrallability of ship during sailing has a direct implication on its course keeping and changing ability, and tries to have an optimised routing. Bad coursekeeping ability of a ship may lead to frequent use of rudder and resulting changes in the ship's drift angle. Consequently, it increases vessels resistance and also may lead to longer path for its journey due to zigzag movements. These adverse effects on the ship journey obviously lead to the increase in fuel consumption and higher emission. Hence, IMO has made it mandatory to evaluate the manoeuvring qualities of a ship at the designed stage itself. In this paper a numerical horizontal planar motion mechanism is simulated in CFD environment and from the force history, the hydrodynamic derivatives appearing in the manoeuvring equation of motion of a ship are estimated. These derivatives along with propeller thrust and rudder effects are used to simulate different standard manoeuvres of the vessel and check its parameters against the IMO requirements. The present study also simulates these manoeuvres by using numerical free running model for the same ship. The results obtained from both these studies are presented and discussed here.

Analysis of Magnetic Dipole Moment for a 300-W Solar-Cell Array

  • Shin, Goo-Hwan;Kim, Dong-Guk;Kwon, Se-Jin;Lee, Hu-Seung
    • Journal of Astronomy and Space Sciences
    • /
    • v.36 no.3
    • /
    • pp.181-186
    • /
    • 2019
  • The attitude information of spacecraft can be obtained by the sensors attached to it using a star tracker, three-axis magnetometer, three-axis gyroscope, and a global positioning signal receiver. By using these sensors, the spacecraft can be maneuvered by actuators that generate torques. In particular, electromagnetic-torque bars can be used for attitude control and as a momentum-canceling instrument. The spacecraft momentum can be created by the current through the electrical circuits and coils. Thus, the current around the electromagnetic-torque bars is a critical factor for precisely controlling the spacecraft. In connection with these concerns, a solar-cell array can be considered to prevent generation of a magnetic dipole moment because the solar-cell array can introduce a large amount of current through the electrical wires. The maximum value of a magnetic dipole moment that cannot affect precise control is $0.25A{\cdot}m^2$, which takes into account the current that flows through the reaction-wheel assembly and the magnetic-torque current. In this study, we designed a 300-W solar cell array and presented an optimal wire-routing method to minimize the magnetic dipole moment for space applications. We verified our proposed method by simulation.

Approach towards qualification of TCP/IP network components of PFBR

  • Aditya Gour;Tom Mathews;R.P. Behera
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.3975-3984
    • /
    • 2022
  • Distributed control system architecture is adopted for I&C systems of Prototype Fast Breeder Reactor, where the geographically distributed control systems are connected to centralized servers & display stations via switched Ethernet networks. TCP/IP communication plays a significant role in the successful operations of this architecture. The communication tasks at control nodes are taken care by TCP/IP offload modules; local area switched network is realized using layer-2/3 switches, which are finally connected to network interfaces of centralized servers & display stations. Safety, security, reliability, and fault tolerance of control systems used for safety-related applications of nuclear power plants is ensured by indigenous design and qualification as per guidelines laid down by regulatory authorities. In the case of commercially available components, appropriate suitability analysis is required for getting the operation clearances from regulatory authorities. This paper details the proposed approach for the suitability analysis of TCP/IP communication nodes, including control systems at the field, network switches, and servers/display stations. Development of test platform using commercially available tools and diagnostics software engineered for control nodes/display stations are described. Each TCP link behavior with impaired packets and multiple traffic loads is described, followed by benchmarking of the network switch's routing characteristics and security features.

An Improved CBRP using Secondary Header in Ad-Hoc network (Ad-Hoc 네트워크에서 보조헤더를 이용한 개선된 클러스터 기반의 라우팅 프로토콜)

  • Hur, Tai-Sung
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.31-38
    • /
    • 2008
  • Ad-Hoc network is a network architecture which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, many new algorithms have been studied recently. This study proposes the secondary header approach to the cluster based routing protocol (CBRP). The primary header becomes abnormal status so that the primary header can not participate in the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. This improves the routing interruption problem that occurs when a header is moving out from a cluster or in the abnormal status. The performances of proposed algorithm ACBRP(Advanced Cluster Based Routing Protocol) are compared with CBRP. The cost of the primary header reelection of ACBRP is simulated. And results are presented in order to show the effectiveness of the algorithm.

  • PDF

Implementation of Multiple-Valued Adder and Multiplier Using Current-Mode CMOS (전류모드 CMOS에 의한 다치 가산기 및 승산기의 구현)

  • Seong, Hyeon-Kyeong
    • The KIPS Transactions:PartA
    • /
    • v.11A no.2
    • /
    • pp.115-122
    • /
    • 2004
  • In this paper, the multiple-valued adders and multipliers are implemented by current-mode CMOS. First, we implement the 3-valued T-gate and the 4-valued T-gate using current-mode CMOS which have an effective availability of integrated circuit design. Second we implement the circuits to be realized 2-variable 3-valued addition table and multiplication table over finite fields $GF(3^2)$, and 2-variable 4-valued addition table and multiplication table over finite fields $GF(4^2)$ with the multiple-valued T-gates. Finally, these operation circuits are simulated under $1.5\mutextrm{m}$ CMOS standard technology, $15\mutextrm{A}$ unit current, and 3.3V VDD voltage Spice. The simulation results have shown the satisfying current characteristics. The 3-valued adder and multiplier, and the 4-valued adder and multiplier implemented by current-mode CMOS is simple and regular for wire routing and possesses the property of modularity with cell array. Also, since it is expansible for the addition and multiplication of two polynomials in the finite field with very large m, it is suitable for VLSI implementation.