• Title/Summary/Keyword: channel routing

Search Result 276, Processing Time 0.025 seconds

A Channel Flood Routing by the Analytical Diffusion Model

  • Yoon, Yong-Nam;Yoo, Chul-Sang
    • Korean Journal of Hydrosciences
    • /
    • v.1
    • /
    • pp.1-14
    • /
    • 1990
  • The analytical diffusion model is first formulated and its characteristics are critically reviewed. The flood events during the 1985-1986 flood seasons in the IHP Pyungchang Representative Basin are routed by this model and are compared with those routed by the kinematic wave model. The present model is proven to be an excellent means of taking the backwater effects due to lateral inflow or downstream river stage variations into consideration in channel routing of flood flows. It also requires much less effort and computing time at a desired station compared to any other reliable flood routing methods.

  • PDF

Channel Assignment, Link Scheduling, Routing, and Rate Control for Multi-Channel Wireless Mesh Networks with Directional Antennas

  • Roh, Hee-Tae;Lee, Jang-Won
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.884-891
    • /
    • 2016
  • The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

A Channel Flood Routing by Muskingum Method Incorporating Lateral Inflows (측방 유입수를 고려한 자연 하도의 Muskingum 홍수추적)

  • 강인주;윤용남
    • Water for future
    • /
    • v.23 no.3
    • /
    • pp.385-395
    • /
    • 1990
  • Three-parameter Muskingum flood routing model which incorporated the inflows alongside the river channel is applied for the Waegwan-Jeukpogyo reach of the Nakdong River using the flood data of 12 selected flood events experienced in this reach. The flood routing equations for three-parameter model were expressed as a system of finite difference equations and the routing constants were directly computed by matrix inversion method. Then, the three parameters, which consist of the storage constants(K), weighting fator(x), and lateral inflow parameter(α), were determined from the computed routing constants. The results of the present study showed that the model can predict with a fair accuracy the flood discharges at the downsteam end of the reach. The parameters K and x were seen as channel parameters which have close relations with the flood magnitude, whereas the lateral inflow parameter was shown to be strongly governed by the rainfall characteristics of the tributary watersheds contributing to the lateral inflows.

  • PDF

Load-Aware Channel Switching Algorithm for Multi-Channel Multi-Hop Wireless Network (멀티 채널 멀티 홉 무선 네트워크에서 부하 인지 채널 변경 기술)

  • Kang, Min-Su;Lee, Young-Suk;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.110-118
    • /
    • 2007
  • In multi-hop wireless network, multi-channel makes it possible to enhance network performance because it reduces channel interferences md contentions. Recently several schemes have been proposed in the literatures to use multi-channel. Especially, MCR(Multi channel routing protocol), which utilize hybrid interface assignment, is a prominent routing protocol. MCR uses simple way to change channel but efficiently reduce channel interferences. In this paper, we propose a load-aware channel selection algorithm called LCS that enhances the channel switching algerian used in MCR protocol. In LCS, channel of a node is assigned based on collected information about queue length of neighbors. Moreover this paper evaluates the performance of in by using simulation test and testbed demonstration. Test results show that the MCR with LCS outperforms the naive MCR.

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

Multi-Channel/Radio based CAC Mechanism for Wireless Ad-hoc Networks (무선 애드혹 통신망용 멀티 채널/라디오 기반 호접속 제어 메저니즘)

  • Ko, Sung-Won;Kang, Min-Su;Kim, Young-Han
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.396-404
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol which works in wireless Ad-hoc communication networks with multiple radios and multiple channels, and controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which makes full duplex transmission between wireless Ad-hoc nodes, and reduces the intra interference on a route. Also, a fixed channel only for reception at each node enables the measurement of the available bandwidth, which is used to control the call admission for QoS provision. The performance of MCQosR is verified by simulation.

Application of Channel Routing Model by Taylor-Galerkin Finite Element Method -Modeling of Flow in Flood- (테일러-갤러킨 유한요소법에 의한 하도추적 모형의 적용 -홍수시 하천 유량 모의-)

  • Lee, Hae-Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.1
    • /
    • pp.404-410
    • /
    • 2011
  • For the simulation of one-dimensional unsteady flow, the Taylor-Galerkin finite element method was adopted to the discretization of the Saint Venant equation. The model was applied to the backwater problem in a single channel and the flood routing in dendritic channel networks. The numerical solutions were compared with previously published results of finite difference and finite element methods and good agreement was observed. The model solves the continuity and the momentum equations in a sequential manner and this leads to easy implementation. Since the final system of matrix is tri-diagonal with a few additional entry due to channel junctions, the tri-diagonal matrix solution algorithm can be used with minor modification. So it is fast and economical in terms of memory for storing matrices.

Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks

  • Aung, Cherry Ye;Ali, G.G. Md. Nawaz;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5149-5173
    • /
    • 2016
  • Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

An Efficient Algorithm for Two-Layer Channel Routing (신호선 분할에 의한 2층 채널 배선 알고리즘)

  • Lee, Kee-Hee;Aum, Sung-Ho;Lim, Jae-Yun;Lim, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.4
    • /
    • pp.550-556
    • /
    • 1986
  • This paper proposes a two-layer channel routing algorithm using the division of signal nets in LSI/VLSI layout design. To solve the vertical constraint problem, the doglegging method is used. Although signal net division and the dogleg are used, the routing is accomplished within local channel density and the increase in vias is repressed by assining the vertical segments to the metal layer and the horizontal segments to the poly layer. The algorithm was implemented on a VAX 11/780 computer. The effectiveness of the proposed algorithm is proved by appling this algorithm to Deutch's difficult example.

  • PDF

Flow Routing in Prismatic Symmetrical Compound Channels by Applications of the Apparent Shear Force (ASF)

  • Chun, Moo-Kap;Jee, Hong-Kee
    • Korean Journal of Hydrosciences
    • /
    • v.8
    • /
    • pp.41-56
    • /
    • 1997
  • A new routing computer model for the symmetric compound channel called the ASRMCS(Apparent Shear Force Muskingum-Cunge Method in Symmetry) has been developed. The Muskingum-Cunge routing method is adapted. The Apparent Shear Force (ASF) between the deep main channel and the shallow floodplan flow is introduced while the flow is routed. The nonlinear parameter method is applied. The temporal and spatial increments are varied according to the flow rate. The adaptation of above schemes is tested against the routed hydrographs using the DAMBRK model. The results of general routing practice of Muskingum-Cunge Method(GPMC) are also compared with those of above two models. The results of the new model match remarkably well with those of DAMBRK. The routed hydrographs show a smooth variation from the inflow boundary condition without any distortions caused by the difference of cross-section shape. However, the results of GPMC, showing early rise and fall of routed hydrograph, have considerable differences from those of the ASFMCS and DAMBRK.

  • PDF