• Title/Summary/Keyword: channel assignment

Search Result 227, Processing Time 0.025 seconds

Minimum Crosstalk Layer Assignment for Three Layers Gridded Channel Routing (삼층 그리드 채널 배선을 위한 최소 혼신 배선 층 할당 방법)

  • Jhang, Kyoung-Son
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2143-2151
    • /
    • 1997
  • As inter-wire spacing on a VLSI chip becomes smaller with the evolution of VLSI fabrication technology, coupling capacitance between adjacent wires is increasing rapidly over ground capacitance. Therefore, it becomes necessary to take into account the crosstalk caused mainly by coupling capacitance during the layout design of VLSI systems. This paper deals with layer assignment problem to minimize crosstalk in three layers gridded channel routing. The problem is formulated in 0/1 integer linear programming style. Upper bound for cost function is estimated for the fast termination. Experiment shows the effectiveness of our approach to minimize crosstalk.

  • PDF

Heuristic Algorithms for Constructing Interference-Free and Delay-Constrained Multicast Trees for Wireless Mesh Networks

  • Yang, Wen-Lin;Kao, Chi-Chou;Tung, Cheng-Huang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.269-286
    • /
    • 2011
  • In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

Channel Allocation Using Mobile Station Network in Reproduction Stage (이동통신망에서 재생산 단계를 적용한 채널할당)

  • Heo, Seo-Jung;Son, Dong-Cheol;Kim, Chang-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.5
    • /
    • pp.577-582
    • /
    • 2012
  • If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

Variable RCH Channel Assignment Scheme in HiperLAN/2 System (HiperLAN/2 시스템에서 가변적인 RCH 채널 할당방안)

  • Jang, soon-gun;Jang, jae-hwan;Lim, seog-ku
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.83-87
    • /
    • 2009
  • The MAC protocol of HiperLAN/2 is based on TDMA/TDD. Mobile terminal acquires a data transmission opportunity as successfulness in channel competition through RCH (Random CHannel) phase. Therefore, AP (Access Point) be able to dynamically assign optimum RCH at next frame according to the number of success and collision. In this paper, we suggest scheme that fluctuate RCH (Random CHannel) number as fixed value considering success and collision for improvement of performance in HiperLAN/2. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed in view of throughput and access delay.

  • PDF

Performance Analysis of Paging Channel in CDMA Cellular Network (CDMA Cellular Network에서 페이징 채널의 성능 분석)

  • 곽민곤;이규영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1868-1875
    • /
    • 1999
  • The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discussed the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message, etc. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. The results shown are based on a specific system call model based on the operating system of cell cite. This serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

  • PDF

Design of Advanced Metering Infrastructure Network Based on Multi-Channel Cluster (다중채널 클러스터 기반의 AMI 네트워크 설계)

  • Choi, Seok-Jun;Shim, Byoung-Sup;Chae, Soo-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.3
    • /
    • pp.207-215
    • /
    • 2013
  • This paper is channel assignment and scheduling techniques for efficient wireless AMI network. In AMI system, the multi-channel cluster network to be proposed defines the communication channel between NC (Network Coordinator) and CDA (Clustered Data Aggregator) as the network channel. CDA and OMD(Out Meter display) and communication channel between SMD(Smart Meter Device) are defined as the group channel. AMI network of the multi-channel cluster based in which the network channel and group channel is mixed increases the administration efficiency through the physical/logical consumer channel clustering. The reliability of inspection data through the channel use distinguished between the adjacent cluster is enhanced. In addition, the fast aggregation of data is possible and the size of a metering network is increased through the channel allocation of the multichannel cluster based.

Design of a low loss NxN waveguide grating router composed of multimode interference couplers and arrayed waveguide grating (다중모드 간섭결합기와 광도파로열로 구성된 저손실 NxN광도파로 격자 파장 라우터의 설계)

  • 문성욱;정영철
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.34D no.7
    • /
    • pp.79-87
    • /
    • 1997
  • Untill now, the most well-known cofiguration for waveguide grating router(WGR) is composed of radiative star couplers and arrayed waveguide grating(AWG), which usually suffer form the rdiation loss of around 3dB or more. Therefore, te improved design of WGRs is needed to reduce the loss. In ths paper, we propose a novel WGR composed of multimode interference couplers which have good unifiormity, fabrication tolerance, and very low excess loss, and suggest the efficient algorithm to find the proper path length differences of AWG for given channel spacing and channel assignment to each output prot. The simulated spectral responses of the proposed WGR using the finite difference beam propagation method (BPM) show that the excess loss is less than 0.3dB and the crosstalk less than -25dB in case of 4x4 WGR, and the excess loss less than 0.4dB and the crosstalk less than -25dB in case of 8x8 WGR for all the channel wavelengths.

  • PDF

Packet scheduling algorithm of increasing of fairness according to traffic characteristics in HSDPA (고속무선통신에서 트래픽 특성에 따른 공평성 증대를 위한 패킷 스케줄링 알고리즘)

  • Lee, Seung-Hwan;Lee, Myung-Sub
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.11
    • /
    • pp.1667-1676
    • /
    • 2010
  • In this paper, we propose a packet scheduling algorithm that assigns different number of HS-PDSCH(High Speed Primary Downlink Shared Channel) to the service user according to the received signal to interference ratio of CPICH(Common Pilot Channel) and to the traffic characteristics. Assigned channel number is determined by the signal to interference ratio level from CPICH. The highest signal to interference ratio user gets the number of channels based on the signal to interference ratio table and the remained channels are assigned to the other level users. Therefore the proposed scheme can provide the similar maximum service throughput and higher fairness than existing scheduling algorithm. Simulation results show that our algorithm can provide the similar maximum service throughput and higher fairness than MAX C/I algorithm and can also support the higher service throughput than proportional fairness scheme.

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.

A Study on Multi-Channel Multi-Interface MAC Protocols for Mesh Networks (Mesh Networks을 위한 다중채널 다중인터페이스 MAC 프로토콜에 관한 연구)

  • Kim, Young-Beom
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.7
    • /
    • pp.1465-1470
    • /
    • 2011
  • In this paper, we propose a new MAC protocol, namely DM-MMAC (Doze Mode Multi-Channel MAC) for ad hoe wireless networks which can utilize multiple channels effectively, thereby enhancing the network throughput considerably. Basically, the IEEE 802.11 specification allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a single channel with the fatal drawback, so called multi-channel hidden terminal problem in multi-channel environments. In this vein, several multi-channel MAC protocols have been proposed, but most of them demonstrate the performance problem that its throughput drastically decreases as the number of mobile hosts residing in a given network increases with small number of available channels. In this work, we tried to improve the performance of multi-channel MAC protocols in terms of network throughput as well as power saving effects by simplifying the channel assignment and channel capturing procedures and reducing the possibility of collisions between mobile hosts.