• Title/Summary/Keyword: Intersection area routing

Search Result 5, Processing Time 0.021 seconds

A Cluster-based Routing Protocol with Energy Consumption Balance in Distributed Wireless Sensor Networks (분산 무선센서 네트워크의 클러스터-기반 에너지 소비 균형 라우팅 프로토콜)

  • Kim, Tae-Hyo;Ju, Yeon-Jeong;Oh, Ho-Suck;Kim, Min-Kyu;Jung, Yong-Bae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.155-161
    • /
    • 2014
  • In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

A Combination Method of Trajectory Data using Correlated Direction of Collected GPS Data (수집한 GPS데이터의 상호방향성을 이용한 경로데이터 조합방법)

  • Koo, Kwang Min;Park, Heemin
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.8
    • /
    • pp.1636-1645
    • /
    • 2016
  • In navigation systems that use collected trajectory for routing, the number and diversity of trajectory data are crucial despite the infeasible limitation which is that all routes should be collected in person. This paper suggests an algorithm combining trajectories only by collected GPS data and generating new routes for solving this problem. Using distance between two trajectories, the algorithm estimates road intersection, in which it also predicts the correlated direction of them with geographical coordinates and makes a decision to combine them by the correlated direction. With combined and generated trajectory data, this combination way allows trajectory-based navigation to guide more and better routes. In our study, this solution has been introduced. However, the ways in which correlated direction is decided and post-process works have been revised to use the sequential pattern of triangles' area GPS information between two trajectories makes in road intersection and intersection among sets comprised of GPS points. This, as a result, reduces unnecessary combinations resulting redundant outputs and enhances the accuracy of estimating correlated direction than before.

A Lighting Control System of Underground Parking Lot Based on Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크 기반 지하주차장 조명제어시스템)

  • Son, Byung-Rak;Kim, Jung-Gyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.125-135
    • /
    • 2010
  • Recently, the problem of global warming has issued seriously, so Green IT(Information Technology) using RFID/USN is concerned in order to solve environmental problems. In this paper, we implemented that public area like an underground parking lot could reduce unnecessary energy consumption used by lighting control system based on Ubiquitous Sensor Networks. The lighting control system for underground parking lot is comprised of intersection nodes for watching cars enter and leave, and light node for controlling light. It applies the routing protocol based on hierarchical cluster, hierarchical addressing method, and probability filtering method for the specific place like an underground parking lot. The result after experiments shows that the lighting control system could decrease electrical energy consumption to around 61.7%.

A study on the quick graphical method of flood routing (홍수추적 속산도식해법에 대한 소고)

  • 박정근
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.18 no.1
    • /
    • pp.4079-4086
    • /
    • 1976
  • In many reservoir projects, economic considerations will necessitate a design utilizing surcharge. Determination of the most economical combination of surcharge and spillway capacity for a given spillway crest level will require flood routing studies and economic studies of the dam-reservoir-spillway combinations. Many methods of actual flood routing have been devised, each of them with its advantages and disadvantages. Some of these methods are listed below: (1) Arithmetical trial-and-error method. (2) Modified Puls' method (3) Cheng's graphical method (4) Horton's arithmetical method (5) Ekadahl's arithmetical method (6) Digital computer programming. For the purpose of preliminary design and cost estimating of dams and spillways, it is often required to estimate, for a given design flood and spillway crest level. the approximate values of two among the three characteristics of the spillway spillway length, maximum discharge and surcharge depth at maximum discharge, when one of these quantities is given. As is well known, the outflow hydrograph for an ungated overflow spillway assumes the form of a wave-shaped curve with a minimum point for Q=o At zero time and a maximum point for Q=Qmax at its intersection with the falling leg of the inflow hydrograph (see Fig. 4) The shaded area between the inflow and outflow hydrographs represents at the approximate scale the temporary retention Vt. In line with the remarks, draw by free hand the assumed outflow hydrograph with its maximum point for the given Qmax (see Fig. 4) and by planimetration find Vt. From the reservoir capacity curve (Fig. 3) find Vs for the given spillway crest level and make V=Vs+Vt. From the above curve find surcharge water elevation for V and surcharge depth Hmax over spillway crest. From the discharge formula compute {{{{L= { Q} over { { CH}^{3/2 } } }}}} The methed provides a means for a quick and fairly accurate estimation of spillway capacity.

  • PDF