• Title/Summary/Keyword: Grid routing

Search Result 106, Processing Time 0.033 seconds

Traffic Analysis of a Power Infrastructure Defense System Simulator According to Network Routing (네트워크 연결 경로에 따른 광역방어 시스템 시뮬레이터의 트래픽 분석)

  • Kim, Ki-Ho;Yi, Keon-Young
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.431-432
    • /
    • 2007
  • It is necessary for the stabilized operation of the power system even if a severe condition in system operation takes place. There is the need to develop the intelligent Power grid Monitoring System. In this system, the PMU(Phasor Measurement Unit) measures the synchrophasor and transmits it to the PIDS(Power Infrastructure Defense System). The IEEE PC37.118 protocol defines the message format to implement the communication both the PMU and the PIDS. In this paper, We measure and analyze the network traffic from simulated the PMU to simulated the PIDS according to network routing. And, We present the finest network routing in developing the intelligent Power grid Monitoring System.

  • PDF

A Solution for Void Grid in Routing Protocol Supporting Mobile Sink on Sensor Network (센서 네트워크에서 모바일 싱크를 지원하는 라우팅 프로토콜의 void grid를 해결하기 위한 방안)

  • Jo, Ji-Eun;Choe, Jong-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.306-309
    • /
    • 2007
  • 센서 네트워크에서 고려해야 하는 중요한 사항중 하나는 제한된 자원을 가진 센서 네트워크에서 주어진 에너지 소모를 최소화 하여서 네트워크 수명을 연장하는 것이다. 그러나 기존에 제안된 프로토콜은 유동성을 지닌 여러 개의 싱크가 존재할 경우에는 비효율 적인 문제가 발생하였으며 그러한 문제를 해결하기 위해서 여러 가지 프로토콜이 제안 되었다. 본 논문에서는 기존에 제안된 그리드 형태를 이용한 클러스터 기반의 라우팅 프로토콜인 CBPER(Cluster-based -Power-Efficient Routing)을 기반으로 이 프로토콜이 가지는 영구적인 그리드 형성시 발생할 수 있는 void grid 문제를 해결하고자 한다.

  • PDF

Performance Evaluation of DAR(Dynamic Adaptive Routing) and FSR(Flood Search Routing) Methods in a Common Channel Signaling Scheme (공통선 신호방식에서의 DAR(Dynamic Adaptive Routing)방식과 FSR(Flood Search Routing)방식의 성능평가)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.12
    • /
    • pp.1-8
    • /
    • 1994
  • In this paper, we hve compare the performance of DAR(Dynamic Adaptive Routing) with that of FSR(Flooding Search Routing) to select an adequate routing protocol in circuit-switched networs. As a performance factor, we have considered call setup time, which is the key factor of performance evaluation in circuit switched networks. We have evaluated the performance of two methods in grid topology circuit-switched networks using a commn channel signaling scheme, as application examples. As results, FSR method shows better performance than DAR method under light traffic load, when the number of links by which call has passed increases, but DAR method represents better performance than FSR method under heavy traffic load or large networks because of redundant packets.

  • PDF

Local Grid-based Multipath Routing Protocol for Mobile Sink in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 지원하기 위한 지역적 격자 기반 다중 경로 전송 방안)

  • Yang, Taehun;Kim, Sangdae;Cho, Hyunchong;Kim, Cheonyong;Kim, Sang-Ha
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1428-1436
    • /
    • 2016
  • A multipath routing in wireless sensor networks (WSNs) provides advantage such as reliability improvement and load balancing by transmitting data through divided paths. For these reasons, existing multipath routing protocols divide path appropriately or create independent paths efficiently. However, when the sink node moves to avoid hotspot problem or satisfy the requirement of the applications, the existing protocols have to reconstruct multipath or exploit foot-print chaining mechanism. As a result, the existing protocols will shorten the lifetime of a network due to excessive energy consumption, and lose the advantage of multipath routing due to the merging of paths. To solve this problem, we propose a multipath creation and maintenance scheme to support the mobile sink node. The proposed protocol can be used to construct local grid structure with restricted area and exploit grid structure for constructing the multipath. The grid structure can also be extended depending on the movement of the sink node. In addition, the multipath can be partially reconstructed to prevent merging paths. Simulation results show that the proposed protocol is superior to the existing protocols in terms of energy efficiency and packet delivery ratio.

A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks (무선 애드혹 네트워크를 위한 위치정보 기반 기울기 라우팅 알고리즘)

  • Bang, Min-Young;Lee, Bong-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.259-270
    • /
    • 2010
  • In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

A Secure Routing Scheme for Wireless Sensor Network with a Mobile Sink (이동 싱크를 가진 무선 센서 네트워크의 안전한 라우팅 기법)

  • Kim Taekvun;Kim Sangjin;Lee Ik-Seob;Yoo Dongyoung;Oh Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.2
    • /
    • pp.53-64
    • /
    • 2005
  • Previous secure routing protocols for wireless sensor networks assume that a sink is static. In many cases, however, a sink operated by man or vehicle is moving. A mobile sink creates a lot of technical problems such as reconfiguration of routing path exposure of sink location. and selection of secure access point node, which are not considered by many previous researches. In this paper, we propose a new secure routing scheme for solving such problems using hi-directional hash chain and delegation nodes of grid structure. This scheme provides a secure routing path and prevents attacker from recognizing the location of a mobile sink in sensor networks. This new method reduces the resource requirements compared to the cashed routing schemes. Simulation results also show that the system is secure and efficient enough.

Clustering Routing Algorithms In Wireless Sensor Networks: An Overview

  • Liu, Xuxun;Shi, Jinglun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1735-1755
    • /
    • 2012
  • Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

An Energy-Efficient Routing Protocol based on Static Grid in Wireless Sensor Networks (무선 센서 네트워크에서 정적 그리드 기반의 에너지 효율적 라우팅 프로토콜)

  • Choi, Jae-Min;Mun, Hyung-Jin;Jeong, Yoon-Su;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8A
    • /
    • pp.791-800
    • /
    • 2010
  • Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

Performance Analysis of Reliability Based On Call Blocking Probability And Link Failure Model in Grid Topology Circuit Switched Networks (격자 구조 회선 교환망에서의 호 차단 확률 및 Link Failure Model에 근거한 신뢰도 성능 분석)

  • 이상준;박찬열
    • Journal of the Korea Society of Computer and Information
    • /
    • v.1 no.1
    • /
    • pp.25-36
    • /
    • 1996
  • We have analyzed the reliability of failure models In grid topology circuit switched networks. These models are grid topology circuit_ switched networks. and each node transmits packets to object node using flooding search routing method. We hypothesized that the failure of each link Is Independent. We have analyzed for the performance estimation of failure models It using joint probability method to the reliability of a small grid topology circuit switched network. and compared analytic output with simulated output. Also. We have evaluated the reliability of networks using call blocking Probability occurred in circuit switched networks.

  • PDF