• 한국정보통신학회논문지
• /
• 제11권4호
• /
• pp.833-839
• /
• 2007

지속적인 데이터 전송이 필요한 센서네트워크의 경우 센서 노드가 증가할수록 네트워크의 요구 대역폭도 증가하게 되어 상대적으로 고속의 데이터 처리 및 전송이 필요하다. 본 논문에서는 이중채널 라우터를 사용하는 센서 네트워크에서 연속적인 데이터 스트림의 전송 속도를 최대화하기 위하여 여러 센서 노드로부터 싱크노드로의 다중경로를 설정하는 라우팅 알고리즘을 개발하고 제안하였다. 또한, 지그비 통신 모듈을 사용하는 이중채널 라우터에서 제안한 다중경로 알고리즘의 성능을 분석하였다. 실험을 통해 실제 통신 속도를 측정한 결과, 일반적인 단일 채널 라우터의 전송 성능의 2배에 가까운 150kbps 이상의 전송률을 안정적으로 얻을 수 있음을 확인하였다.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.249-258
• /
• 2013

다중-홉 애드 혹 네트워크(multi-hop ad hoc networks)에서 실효 대역폭과 단-대-단 처리량을 높이기 위한 방법으로 다중-인터페이스 다중-채널 구조가 주목을 받고 있다. 그러나 단일 인터페이스 기반 네트워크를 위해서 설계된 기존의 라우팅 메트릭들은 다중-인터페이스 다중-채널 기반 네트워크의 특성을 정확히 반영할 수 없으므로, 처리량 개선의 효과를 기대할 수 없다. 따라서 채널 다양성, 인터페이스 전환 비용과 같은 메트릭들을 사용하여 높은 처리량을 갖는 경로를 발견하는 MCR이 제안되었다. 하지만 MCR은 트래픽 부하의 영향을 반영하지 않기 때문에 혼잡한 네트워크에서 성능이 저하되는 문제점이 있다. 본 논문에서는 MCR에 채널 접근 시간 메트릭을 결합하여 혼잡한 조건에서도 높은 처리량을 갖는 경로를 선택하는 MAMCR 메트릭을 제안하고, ns-2 시뮬레이션을 통해 성능 개선 효과를 확인한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• 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.

• 한국정보통신학회논문지
• /
• 제25권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.

• 한국정보통신학회논문지
• /
• 제24권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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.

• 한국농공학회지
• /
• 제21권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.

• 한국통신학회논문지
• /
• 제35권11B호
• /
• pp.1676-1684
• /
• 2010

전술 네트워크 환경은 분산된 구조 하에 노드의 이동성이 보장되는 망 구조를 지향하며, 상용 통신망에 비해 상대적으로 열악한 무선 채널 환경의 특성이 고려되어야 한다. 이러한 환경에서 신뢰성 있는 데이터 전송을 위해서는 경로 결정 시 다양한 무선 채널 환경 요소 및 기동 노드의 상태를 자체적으로 인지하여, 전송 트래픽의 QoS(Quality of Service) 요구조건에 적합한 최적 경로 선정이 이루어져야 한다. 본 논문에서는 전술 네트워크 환경의 서비스 요구 조건 및 트래픽 특성을 정의하고, 이를 기반으로 라우팅 메트릭(Routing Metric)의 선별적인 선을 통해 최적경로를 산출함으로써 효율적 데이터 전송이 가능한 AODV-IMTC(Integrated Metrics and Traffic Characteristics)를 제안한다.

• 대한전자공학회논문지
• /
• 제22권3호
• /
• pp.60-67
• /
• 1985

본 논문에서는 VLSI layout CAD에 있어서의 새로운 그로발 라우팅(global routing) 기법을 제안하고 이에 관하여 논하였다. 종래의 그로발 라우터에서는 핀의 위치를 모두 셀의 중앙에 두었기 때문에 신호선의 채널 사용량을 정확히 산출할 수 없었다. 그 결과 디테일드 라우팅 (detailed routing)시 배선량 overflow가 발생하여 100% 결선을 저해하는 많은 요인을 내포하고 있었다. 본 논문에서는 이러한 문제점을 모두 보완하기 위하여 핀순서를 고려한 새로운 방법의 그로발 라우팅 알고리즘을 제안하였다. 이 알고리즘을 사용하여 그로발 라우터를 실현하고, 계산기상의 실험 결과를 통하여 제안한 알고리즘의 유용성을 보였다.