• Title/Summary/Keyword: Grid routing

Search Result 106, Processing Time 0.034 seconds

Dynamic Routing and Spectrum Allocation with Traffic Differentiation to Reduce Fragmentation in Multifiber Elastic Optical Networks

  • ZOUNEME, Boris Stephane;ADEPO, Joel;DIEDIE, Herve Gokou;OUMTANAGA, Souleymane
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.1-10
    • /
    • 2021
  • In recent decades, the heterogeneous and dynamic behavior of Internet traffic has placed new demands on the adaptive resource allocation of the optical network infrastructure. However, the advent of multifiber elastic optical networks has led to a higher degree of spectrum fragmentation than conventional flexible grid networks due to the dynamic and random establishment and removal of optical connections. In this paper, we propose heuristic routing and dynamic slot allocation algorithms to minimize spectrum fragmentation and reduce the probability of blocking future connection requests by considering the power consumption in elastic multifiber elastic optical networks.

Transient Multipath routing protocol for low power and lossy networks

  • Lodhi, Muhammad Ali;Rehman, Abdul;Khan, Meer Muhammad;Asfand-e-yar, Muhammad;Hussain, Faisal Bashir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2002-2019
    • /
    • 2017
  • RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

An Efficient Addressing Scheme Using (x, y) Coordinates in Environments of Smart Grid (스마트 그리드 환경에서 (x, y) 좌표값을 이용한 효율적인 주소 할당 방법)

  • Cho, Yang-Hyun;Lim, Song-Bin;Kim, Gyung-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.61-69
    • /
    • 2012
  • Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

An Efficient Routing Path Search Technique in Power Line Communication (효율적인 전력선통신 라우팅 경로 탐색 기법)

  • Seo, Chung-Ki;Kim, Jun-Ha;Jung, Joonhong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.9
    • /
    • pp.1216-1223
    • /
    • 2018
  • As field of application of AMI, AMR uses the power line as the primary means of communication. PLC has a big merit without installation of the new network for communication in a field using the power line which is the existing equipment. However, there is a serious obstacle in commercialization for the instability by noise and communication environment. Therefore, the technical method for maintaining the communication state which overcome such demerit and was stabilized is required essentially. PLC routing technology is applied with the alternative plan now. The routing technology currently managed by field includes many problems by applying the algorithm of an elementary level. PLC routing path search problem can be modeled with the problem of searching for optimal solution as similar to such as optimal routing problem and TSP(Travelling salesman problem). In this paper, in order to search for a PLC routing path efficiently and to choose the optimal path, GA(Genetic Algorithm) was applied. Although PLC was similar in optimal solution search as compared with typical GA, it also has a difference point by the characteristic of communication, and presented the new methodology over this. Moreover, the validity of application technology was verified by showing the experimental result to which GA is applied and analyzing as compared with the existing algorithm.

Error Analysis of Muskingum-Cunge Flood Routing Method (Muskingum-Cunge 홍수추적 방법의 오차해석)

  • Kim, Dae-Geun;Seo, Il-Won
    • Journal of Korea Water Resources Association
    • /
    • v.36 no.5
    • /
    • pp.751-760
    • /
    • 2003
  • Error analysis of finite difference equation on the Muskingum-Cunge flood routing method with free time and space weighting factor was carried out. The error analysis shows that the numerical solution of the Muskingum-Cunge method becomes diverged with time when the sum of time weighting factor and space weighting factor is greater than 1.0. Numerical diffusion increases when the sum of time weighting factor and space weighting factor decreases. Numerical diffusion and numerical oscillation increase when the grid resolution is coarse. Numerical experiments and field applications show that the Muskingum-Cunge method with free space weighting factor is more effective for simulating the flood routing with great peak diminution than conventional Muskingum-Cunge method with fixed space weighting factor, 0.5.

A Short Path Data Routing Protocol for Wireless Sensor Network (단거리 데이터 전달 무선 센서네트워크 라우팅 기법)

  • Ahn, Kwang-Seon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.395-402
    • /
    • 2007
  • Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.

Development of GRld-eased Soil MOsture Routing Model (GRISMORM) Applied to Bocheongchun Watershed (격자기반의 토양수분추적표형 개발 : 보청천 유역 사례연구)

  • 김성준;채효석
    • Spatial Information Research
    • /
    • v.7 no.1
    • /
    • pp.39-48
    • /
    • 1999
  • A GRId-based Soil MOsture Routing Model(GRISMORM) which predicts temporal variation and spatial distribution of water balance on a daily time step for each grid element of the watershed was developed. The model was programmed by C-language which aims for high flexibility to any kind of GIS softwares. The model uses ASCII-formatted map data supported by the irregular gridded map of the GRASS(Geographic Resources Analysis Support System)-GIS and generates daily or monthly spatial distribution map of water balance components within the watershed. The model was applied to Ipyunggyo watershed(75.6$km^2$) ; the part of Bocheongchun watershed. Predicted streamflows resulting from two years(95 and 96) daily data were compared with those observed at the watershed outlet. The results of temporal variation and spatial distribution of soil moisture are also presented by using GRASS.

  • PDF

An Energy-Efficient Routing Protocol for Mobile Sinks in Sensor Network (센서 네트워크에서 모바일 싱크를 위한 에너지 효율적인 라우팅 프로토콜)

  • Cho, Ji-Eun;Choe, Jong-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.482-486
    • /
    • 2008
  • When we design a sensor nodes, a energy-consumption of sensor nodes centers on design concerns to prolong lifetime of sensor network. In recent year, many researches have attempted to study this issue. One of that is TTDD(Two-Tier Data Dissemination approach) proposed to support a sensor network which includes several mobile sensor nodes. But it gives rise to a problem which increasing control packet for the formation and maintenance a grid structure. Therefore, we proposed a Energy-Efficient Routing Protocol used a permanent grid structure for reducing control packets in a sensor network.