• Title/Summary/Keyword: channel routing

Search Result 277, Processing Time 0.026 seconds

Multipath Routing Algorithm for Wireless Sensor Networks Using Dual Channel Routers (이중 채널 라우터를 사용하는 무선 센서네트워크를 위한 다중경로 라우팅 알고리즘)

  • Hah, Ki-Jong;Yoo, Seung-Sik;Lim, Sang-Min;Kim, Brian
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.833-839
    • /
    • 2007
  • In case of wireless sensor networks being applied to a target environment having continuous data transfer, high-speed data transmission and processing is necessary to meet increased bandwidth needs. This paper proposes a novel multipath routing algorithm to increase the bandwidth of continuous data stream for the wireless sensor network using dual channel routers. We evaluate performance of the proposed algorithm in the wireless sensor network using the dual channel touter based on ZigBee protocol. According to the experimental evaluation, the proposed algorithm showed outstanding performance enhancement with the bandwidth of 150kbps, which is about twice of existing single channel router.

MAC Aware Multi-Channel Routing Protocol for Multi-Interface Ad-Hoc Wireless Networks (다중-인터페이스 애드-혹 무선 네트워크를 위한 MAC 인식 다중-채널 라우팅 프로토콜)

  • Lim, Hunju;Joung, Sookyoung;Lee, Sungwha;Park, Inkap
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.249-258
    • /
    • 2013
  • In multi-hop ad hoc networks, multi-interface multi-channel architecture is being noticing as methodology to improve the effective bandwidth and end-to-end throughput, But since existing routing metrics designed for networks based on single-interface exactly can not reflects the nature of networks based on multi-interface multi-channel, we are not expected the effect of throughput improvement. there had been proposal of MCR that discover high throughput by using metrics such as channel diversity and interface switching cost. however, MCR have an problem that is degraded it's performance in congested networks, because it not reflects the impact of traffic load. in this paper, we propose MAMCR metric, which select high throughput paths under congested conditions by combination MCR with channel access time metric, and conform it's the effect of performance improvement by ns-2 simulation.

Simple Routing Control System for 10 Gb/s Data Transmission Using a Frequency Modulation Technique

  • Omoto, Daichi;Kishine, Keiji;Inaba, Hiromi;Tanaka, Tomoki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.3
    • /
    • pp.199-206
    • /
    • 2016
  • This paper describes a simple routing control system. We propose achieving high-speed data transmission without modifying the data frame configuration. To add a routing control signal, called the "labeling signal" in this paper, to the data frame, we use a frequency modulation technique on the transmitted frame. This means you need not change the data frame when you transmit additional signals. Using a prototype system comprising a field-programmable gate array and discrete elements, we investigate the system performance and devise a method to achieve high resolution. A three-channel routing control for a 10 Gb/s data frame was achieved, which confirms the advantages of the proposed system.

Design of Routing Protocols for WMN: Factors and Case Study

  • Gao, Hui;Lee, Hyung-ok;Kwag, Young-wan;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.799-801
    • /
    • 2012
  • Wireless Mesh Network (WMN) can be defined as a communication network consisting of radio nodes organized in a mesh topology, which has been attracting much attention due to its promising technology. This paper addressed the factors on how to design routing protocols for WMN. 2 examples of designing routing metric and routing algorithm are given for case study. With consideration of those factors such as wireless broadcast advantage (WBA)/channel assignment (CA) or intra-flow/inter-flow interference high throughput is achieved.

Deep Reinforcement Learning-based Distributed Routing Algorithm for Minimizing End-to-end Delay in MANET (MANET에서 종단간 통신지연 최소화를 위한 심층 강화학습 기반 분산 라우팅 알고리즘)

  • Choi, Yeong-Jun;Seo, Ju-Sung;Hong, Jun-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.9
    • /
    • pp.1267-1270
    • /
    • 2021
  • In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.

Channel Selection Technique Considering Energy Efficiency in Routing Algorithms of the Sensor Network (센서네트워크의 라우팅 프로토콜에서 에너지 효율을 고려한 채널 선택 기법)

  • Subedi, Sagun;Lee, Sang-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.5
    • /
    • pp.662-665
    • /
    • 2020
  • Energy Efficiency in any WSN (Wireless Sensor Network) is a critical issue to elongate the life of the batteries equipped in sensors. LEACH(Low Energy Adaptive Clustering Hierarchy) is one of the mostly used routing algorithms which reduce the amount of transmitted data and save the energy in the network. In this paper, a new technique to select channels in routing algorithms is suggested and compared with the LEACH, ALEACH and PEGASIS. This technique forms clusters depending upon the node density as the deployement of the nodes is random. As a result, the proposed algorithm presents the better performance of the energy efficiency than those of the current algorithms.

Behavior based Routing Misbehavior Detection in Wireless Sensor Networks

  • Terence, Sebastian;Purushothaman, Geethanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5354-5369
    • /
    • 2019
  • Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

Flood Routing on the River by Revised Muskingum-Cunge Method (하도에서의 홍수추적 -수정 Muskingum-Cunge 방법-)

  • 홍종운
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.21 no.1
    • /
    • pp.13-23
    • /
    • 1979
  • The predictien of a design flood hydrograph at a particular site on a river may be based on the derivation of a discharge or stage hydrograph at an upstream section, together with a method to route this hydrograph along the rest of the river. In order to limit this investigation to cases where the assumption like uniform rainfall may be reasonably valid, the derivation of unit hydrographs has been limited to catchment with an area less than 500 km2. Consequently, flood routing methods provide a useful tool for the analysis of flooding in all but the smaller catchment, particularly where the shape of the hydrograph as well as the peak value is required. The author, therefore, will introduce here a flood routing method on the open channel with a peak discharge of the catchment area concerned. The importance of being able to route floods accurately is also reflected in the large number of flood routing method which have been developed since the year 1900. There are the modified puls method, Steinberg method, Goodrich method, Ekdahl method, Tatum's mean continuously Equation, wisler-Brater method, Muskingum, chung, and Muskingum-cunge (M-C) method and so on. The author will try to introduce a flood routing method which is revised Muskingum-cunge method. In calculating flood routing by the M-C method, whole variable parameters on the river were assumed to almost uniform values from the upstream to the downstream. In the results, the controlled flood rates at the 40km downstream on the river is appeared to decrease 22m$^3$/sec or 12 percent of the peak flood 170m$^3$/sec.

  • PDF

An Efficient Ad Hoc Routing Method for Tactical Networks using Integrated Metrics and Traffic Characteristics (전술 네트워크 환경의 트래픽 특성을 고려한 통합 매트릭 기반 애드혹 라우팅 기법)

  • Roh, Bong-Soo;Hoh, Mi-Jeong;Hwang, Ki-Min;Park, Gui-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1676-1684
    • /
    • 2010
  • Tactical network environments are characterized by unreliable connectivity, communication links which has limited bandwidth compared to commercial networks and distributed architecture where users have high mobility. The best route should be selected based on the required traffic characteristics which can be a wireless channel environments and a status of nodes which are moving. Those characteristics are self aware and should be a routing decision factor in order to guarantee a reliable data transfer. In this paper we define the requirements of services and traffic characteristics on tactical network environments and suggest the new routing method "AODV-IMTC" based on selective routing metric to enable efficient data transfer in wireless ad hoc networks.

A New Global Routing Techniques for Gate Array (Gate Array의 Global Routing 기법)

  • Lee, Byeong-Ho;Jeong, Jeong-Hwa;Im, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.3
    • /
    • pp.60-67
    • /
    • 1985
  • A new glut bel routing technique for gate array is described in this paper. In former global routers the position of pins is considered to be in the center of the cell. So it is impossible to exactly estimate the number of signal lines passing through each channel. As a result, an overflow occurs and the overflow violates 100% wiring in detailed routing pro-cesses. Besides this, there are some problems in former global routers, for example, design time and cost, etc. This paper proposed a new algorithm in which pins ordering is considered to solve these problems. Using this algorithm, a global router is developed. Program experiments show the efficiency of the proposed algorithm.

  • PDF