• Title/Summary/Keyword: channel routing

Search Result 276, Processing Time 0.023 seconds

Multipath Routing for Load Balancing in Wireless Mesh Network

  • Gao, Hui;Kwag, Young-wan;Lee, Hyung-ok;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.548-550
    • /
    • 2013
  • Multipath routing is proposed to perform better load balancing and to provide high fault tolerance. In this paper common factors on multi-path routing for WMNs are discussed and joint multi-channel and multipath routing approaches for load balancing are introduced at the same time. The key issues on how to design an effective multi-path routing protocol with appropriate performance metrics for WMNs are also discussed through the case studies in the paper.

Hydraulic Flood Routing for Natural Channels (자연수로의 수리학적 홍수추적)

  • 박기호;조현경
    • Water for future
    • /
    • v.28 no.3
    • /
    • pp.113-122
    • /
    • 1995
  • A nonlinear wave routing model is suggested for the routing of floods in the natural open channel networks. For the optimization of parameter of the proposed routing model, parameter adjustment is executed through the proposed objective function. The model treats backwater effect form upstream and downstream ends. Solution of formulated model is made possible on computer by adopting a nonlinear finite-difference scheme for the numerical analysis based on a combination of Lax-Wendroff scheme and Burstein-Lapidus modification. Comparison of the results of the proposed model to those of actual hydrograph and dynamic wave routing model denotes that the proposed model is as accurate as actual runoff hydrograph and faster the computer time than the dynamic wave routing model.

  • PDF

Geographical Routing Scheme Considering Channel Condition in WSN (센서 네트워크에서 무선채널환경을 고려한 위치기반라우팅기법)

  • Sim, In-Bo;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.694-702
    • /
    • 2009
  • Geographical routing protocol, where nodes only need local information exchange to make routing decisions, is a very efficient routing scheme for wireless sensor networks in scalability. However, pure geographical routing does not take account of wireless link condition. If wireless link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose geographical routing scheme considering wireless link condition, where reliable data transmission is made and the consumed energy is minimized.

Improvement of OLSR Through MIMC's Decreased Overhead in MANET (모바일 애드 혹 네트워크 환경 하에서 멀티인터페이스 멀티채널의 오버헤드 감소를 통한 OLSR의 성능 개선)

  • Jang, Jae-young;Kim, Jung-ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.3
    • /
    • pp.55-70
    • /
    • 2016
  • The most critical research issue in MANET environment is on supporting reliable communication between various devices. Various Multi-Hop Routing Protocol studies have proceeded. However, some problems you might have found when you use the existing link state routing technique are that it increases Control Message Overhead and it is unstable when node moves in CR circumstance which has transformation of using channel and MIMC circumstance which uses a number of interfaces. This essay offers a technique which is based on On-Demand Hello and the other technique which used Broadcast Interface of optimization as a solution to decrease Control Message Overhead. Also it proposes Quick Route Restoration technique which is utilized by GPS and MPR Selection technique which consider mobility as a solution of stable communication when node moves. Those offered Routing Protocol and OPNET based simulator result will be expected to be an excellent comparison in related research fields.

A Study on Efficient Routing and Authentication Scheme in Ad-Hoc Environment (Ad-Hoc환경에서 효율적인 라우팅 및 인증 기술에 관한 연구)

  • Kang, Seo-Il;Lee, Im-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1121-1128
    • /
    • 2008
  • Ad-Hoc network is consisted with the device of wireless communication. Therefore, the organization of network is dynamic and the changing communication channel is essential. According this, the study of secure routing route and certification technique has to be needed. In we research, we suggest not only the secure routing scheme in Ad-Hoc circumstance but also the method that user can be serviced the type of network which is connected Ad-Hoc network and wireless lam. In case of the routing form of Ad-Hoc Network, although in preexist study, when the device of organization withdraws, routing is needed, in we research, we suggest the detour route that is used hop frequency. We can offer the service of ubiquitous that the certification of secure user and the creation of routing route in Ad-Hoc network.

  • PDF

Message Routing Method for Inter-Processor Communication of the ATM Switching System (ATM 교환기의 프로세서간통신을 위한 메시지 라우팅 방법)

  • Park, Hea-Sook;Moon, Sung-Jin;Park, Man-Sik;Song, Kwang-Suk;Lee, Hyeong-Ho
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.289-440
    • /
    • 1998
  • This paper describes an interconnection network structure which transports information among processors through a high speed ATM switch. To efficiently use the high speed ATM switch for the message-based multiprocessor, we implemented the cell router that performs multiplexing and demultiplexing of cells from/to processors. In this system, we use the expanded internal cell format including 3bytes for switch routing information. This interconnection network has 3 stage routing strategies: ATM switch routing using switch routing information, cell router routing using a virtual path identifier (VPI) and cell reassembly routing using a virtual channel indentifier (VCI). The interconnection network consists of the NxN folded switch and N cell routers with the M processor interface. Therefore, the maximum number of NxM processors can be interconnected for message communication. This interconnection network using the ATM switch makes a significant improvement in terms of message passing latency and scalability. Additionally, we evaluated the transmission overhead in this interconnection network using ATM switch.

  • PDF

Shared Channel Scheme and Routing Algorithms of Every - Other- Row - Connecting Bilayered ShuffleNet for WDM Optical Networks (격행 연결 이중층 셔플넷을 이용한 광 WDM 네트워크 채널공유방식과 라우팅 알고리즘)

  • Ji, Yun-Gyu
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.11
    • /
    • pp.804-809
    • /
    • 2001
  • In this paper, a shared channel scheme and routing algorithms are proposed to reduce the number of wavelength channels for the optical WDM multihop networks using the every-other-row-connecting bilayered ShuffleNet scheme. In the shared channel scheme proposed, 2P nodes share the common wavelength channel reducing the number of required channels compare to other ones. By assigning an effective address each node, packets can be routed to the destination nodes through the intermediate nodes.

  • PDF

Density Minimization for the Assignment of P-color Points (P-가지 색을 가진 점들의 할당에 대한 밀도 최소화)

  • Kim, Jae-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.8
    • /
    • pp.1981-1986
    • /
    • 2014
  • The problem studied in this paper is the channel routing problem to assign points with p colors on the upper row of the channel to points on the lower row in order to minimize its density. The case that the points on the upper row has an identical color or only two colors is studied in [1, 2]. This paper generalizes that to the points with p colors. First, we consider the problem to determine whether there is an assignment with density less than or equal to d, when an arbitrary d is given. We show that the problem is solved in O(p(n+m)log(n+m)) time. Using this result, we resolve the problem to fine an assignment with a minimum density.

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.