• Title/Summary/Keyword: channel routing

Search Result 274, Processing Time 0.031 seconds

A channel Routing System using CMOS Standard Cell Library (CMOS 표준 Cell Library를 이용하는 수평 트랙 배선 시스템)

  • 정태성;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.1
    • /
    • pp.68-74
    • /
    • 1985
  • In this Paper, we present a non-doglegging channel routing system for If layout using standard cells. This system produces a final two-layer wiring pattern in the horizontal track between two rows, each of which is a linear placement of standard cells of identical heights, satisfying the given net list specification. The layout of CMOS cell library Including nine primitive cells used in this paper is represented in CIF (Caltech Intermediate Form) using λ(Lambda) of 2 microns in Mead-Conway layout representation scheme. The cell dimension and 1/0 characteristics such as name, position and layer type of the pins are stored in Component Library to be used in the channel routing progranl, CROUT. 4 subprogram, NET-PLOT, was used to report a schemdtic layout result, and another subprogram, NETCIF was used to with a full-fledged final layout representation in GIF, A test run for realizing a dynamicmaster-slave D flip-flop with set/reset using primitive cells was shown to take 4 CPU seconds on VAX 11/780.

  • PDF

Channel Assignment and Routing using Traffic Profiles in Wireless Mesh Networks (무선 메쉬 네트워크에서 트래픽 프로파일을 고려하는 채널 할당 및 라우팅)

  • Park, Sook-Young;Lee, Sang-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.374-385
    • /
    • 2010
  • Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

A Study on the Optimization of Parameters for Muskingum Routing Method (Muskingum 홍수 추적방법의 매개변수 최적화에 관한 연구)

  • Cho, Hyeon-Kyeong
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.11 no.1
    • /
    • pp.27-34
    • /
    • 2008
  • This study presents techniques for the estimation of parameters in flood routing method of natural channel.. The Muskingum routing method is the most widely used method of hydrologic stream channel routing. In this paper, Genetic Algorithm and Fletcher-Powell method is applied to determine parameters(K and x) of the Muskingum routing method. The results of the approach shows that Genetic Algorithm method can be one of methods to determine parameters of the Muskingum routing method. Based on the analysis for estimated parameters and the comparison with the results from observed data, the applicability of Genetic Algorithm is verified.

  • PDF

Performance Evaluation of DAR(Dynamic Adaptive Routing) and FSR(Flood Search Routing) Methods in a Common Channel Signaling Scheme (공통선 신호방식에서의 DAR(Dynamic Adaptive Routing)방식과 FSR(Flood Search Routing)방식의 성능평가)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.12
    • /
    • pp.1-8
    • /
    • 1994
  • In this paper, we hve compare the performance of DAR(Dynamic Adaptive Routing) with that of FSR(Flooding Search Routing) to select an adequate routing protocol in circuit-switched networs. As a performance factor, we have considered call setup time, which is the key factor of performance evaluation in circuit switched networks. We have evaluated the performance of two methods in grid topology circuit-switched networks using a commn channel signaling scheme, as application examples. As results, FSR method shows better performance than DAR method under light traffic load, when the number of links by which call has passed increases, but DAR method represents better performance than FSR method under heavy traffic load or large networks because of redundant packets.

  • PDF

Channel Routing Model for Streamflow Forecasting (유출예측을 위한 하도추적 모형)

  • 지홍기;박기호
    • Water for future
    • /
    • v.27 no.1
    • /
    • pp.141-150
    • /
    • 1994
  • The purpose of this study is develope the algorithm of channel routing model which can be used for flood forecasting. In routing model, the hydrulic technique of the implicit scheme in the dynamic equation is chosen to route the unsteady varied flow. The channel routing model is connected with conceptual watershed model which is able to compute the flood hydrograph from each subbasin. The comparative study shows that the conceptual model can simulate the watershed runoff accurately. As a result of investigating the channel routing model, the optimal weighting factor $\theta$ which fixes two points between time line is selected. And also, the optimal error tolerance which satisfies computing time and converge of solution is chosen.

  • PDF

Multi-Channel Allocation Scheme for Multi-Hop Transmission in Ad-hoc Cognitive Radio Networks (애드혹 인지 무선네트워크에서 멀티 홉 전송을 위한 멀티채널할당기법)

  • Kwon, Young-Min;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.35-41
    • /
    • 2017
  • To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

Cross-Layer Resource Allocation in Multi-interface Multi-channel Wireless Multi-hop Networks

  • Feng, Wei;Feng, Suili;Zhang, Yongzhong;Xia, Xiaowei
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.960-967
    • /
    • 2014
  • In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

Virtual Path Routing Optimization in ATM Network (ATM 망의 가상경로 루팅 최적화)

  • 박구현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.1
    • /
    • pp.35-54
    • /
    • 1995
  • Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.

  • PDF

Wireless Ad-hoc Networks Using Cooperative Diversity-based Routing in Fading Channel

  • Kim, Nam-Soo;An, Beong-Ku;Kim, Do-Hyeon;Lee, Ye-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.69-75
    • /
    • 2008
  • We propose new routing scheme, Cooperative Diversity-based Routing (CDR)which utilize the cooperative space diversity for power saving and for performance enhancement of wireless ad-hoc networks. The end-to-end performance of the proposed routing, CDR, is analyzed based on the Haenggi's link model. The improved performance is compared with Multi-hop Relay Routing (MRR) by analytical methods. When the required outage probability is $1{\times}10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 21.5 dB in average, by using our proposed CDR compared to MRR.

Multiple Constraint Routing Protocol for Frequency Diversity Multi-channel Mesh Networks using Interference-based Channel Allocation

  • Torregoza, John Paul;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1632-1644
    • /
    • 2007
  • Wireless Mesh Networks aim to attain large connectivity with minimum performance degradation, as network size is increase. As such, scalability is one of the main characteristics of Wireless Mesh Networks that differentiates it from other wireless networks. This characteristic creates the need for bandwidth efficiency strategies to ensure that network performance does not degrade as the size of the network increase. Several researches have been done to realize mesh networks. However, the researches conducted were mostly focused on a per TCP/IP layer basis. Also, the studies on bandwidth efficiency and bandwidth improvement are usually dealt with as separate issues. This paper aims to simultaneously study bandwidth efficiency and improvement. Aside from optimizing the bandwidth given a fixed capacity, the capacity is also increased using results of physical layer studies. In this paper, the capacity is improved by using the concept of non-overlapping channels for wireless communication. A channel allocation scheme is conceptualized to choose the transmission channel that would optimize the network performance parameters with consideration of chosen Quality of Service (QoS) parameters. Network utility maximization is used to optimize the bandwidth after channel selection. Furthermore, a routing scheme is proposed using the results of the network utilization method and the channel allocation scheme to find the optimal path that would maximize the network gain.

  • PDF