• Title/Summary/Keyword: Minimum Interference

Search Result 375, Processing Time 0.027 seconds

A Minimum Interference Channel Assignment Algorithm for Performance Improvement of Large-Scale Wireless Mesh Networks (대규모 무선 메쉬 네트워크의 성능 향상을 위한 최소 간섭 채널 할당 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.964-972
    • /
    • 2009
  • Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

A Comparative Studies of Channel Shortening Techniques for OFDM System (OFDM시스템을 위한 채널 shortening기법들의 비교)

  • Kim, Jae-kwon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.262-266
    • /
    • 2013
  • In OFDM system, cyclic prefix (CP) is used to eliminate the inersymbol interference that is caused by the channel dispersion. However, a long CP reduces the data transmission rate. An alternative to a logn CP is the a time domain channel shortening filter at the receiver that shortens the effective channel, thus a short CP is used in spite of a long channel impulse response. In the paper, we compare a various channel shortening techniques; minimum shortened signal to noise ratio (MSSNR), minimum interblock interference (min-IBI), and minimum ISI (min-ISI).

Analysis of Radio Interference through Ducting for 2.5 GHz WiMAX Service

  • Son, Ho-Kyung;Kim, Jong-Ho;Kim, Che-Young
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.1
    • /
    • pp.94-100
    • /
    • 2012
  • Radio interference has been occurring in mobile communication services on the southern seashore in Korea. Monitoring the radio interference signal revealed that the main reason for the radio interference was a radio ducting signal coming from the seaside of Japan. In this paper, we have analyzed the effect of interference on WiMAX service using a 2.5 GHz frequency band between Korea and Japan. We focus on the interference scenario from base station to base station and we use the Minimum Coupling Loss (MCL) method for interference analysis and the Advanced Propagation Model (APM) for calculating the propagation loss in ducts. The propagation model is also compared with experimental measurement data. We confirm that the interfering signal strength depends on the antenna height and this result can be applied to deployment planning for each system with an interference impact acceptable to both parties.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Linear versus Non-linear Interference Cancellation

  • Buehrer, R.Michael;Nicoloso, Steven P.;Gollamudi, Sridhar
    • Journal of Communications and Networks
    • /
    • v.1 no.2
    • /
    • pp.118-133
    • /
    • 1999
  • In this paper we compare linear and non-linear inter-ference cancellation for systems employing code division multi-ple access (CDMA) techniques. Specifically, we examine linear and non-linear parallel interference cancellation(also called multi-stage cancellation) in relationship to other multiuser detection al-gorithms. We show the explicit relationship between parallel inter-ference cancellation and the decorrelator (or direct matrix inver-sion). This comparison gives insight into the performance of paral-lel interference cancellation (PIC) and leads to vetter approaches. We also show that non-linear PIC approaches with explicit chan-nel setimation can provide performance improvement over linear PIC, especially when using soft non-linear symbol estimates. The application of interference cancellation to non-linear modulation techniques is also presented along with a discussion on minimum mean-squared error(MMSE) symbol estimation techniques. These are shown to further improve the performance of parallel cancella-tion.

  • PDF

Performance Enhancement Technique in Visible Light Communication System for Smart Building (스마트 빌딩을 위한 가시광 통신 시스템의 성능 향상 기법)

  • Seo, Sung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.5
    • /
    • pp.39-43
    • /
    • 2020
  • In this paper, we propose the multi-channel interference cancellation algorithm for visible light communication (VLC) in smart building. The VLC system is communication technology using visible rays that come out in Light Emitting Diode (LED) device. It has energy curtailment effect and possible to use in ubiquitous network service applications. When a large number of users communicate indoors, the performance can be reduced due to channel interference. To remove interference, at the first, the minimum mean square error (MMSE) scheme as interference cancellation methods used, and then the successive interference cancellation (SIC) is applied to obtain additional diversity gain and improve interference cancellation performance. Indoor VLC channel model is employed. The performance is evaluated in terms of bit error rate (BER). From the simulation results, it is confirmed that the proposed scheme has better BER performance compared to the previous systems. As a result, the proposed interference cancellation improves the signal quality of VLC systems by effectively removing the channel noise. The results of the paper can be applied to VLC for smart building and general communication systems.

Interference Analysis between DTV System and IEEE 802.11n WLAN (DTV시스템과 IEEE 802.11n WLAN의 간섭분석)

  • Choi, Jae-Hyuck;Kim, Eun-Cheol;Yang, Jae-Soo;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.104-107
    • /
    • 2009
  • In this paper, we analyze the effect of interference between DTV system and IEEE 802.11n. We set DTV as a victim receiver and IEEE 802.11n as an interfering system. When they exist in the same area, they can make an interference effect. Therefore, we calculate a minimum coupling loss (MCL) and compare the resulting value with a path loss for determining whether there exists a potential interference or not. The minimum separation distance is determined when the path loss is larger than the MCL.

  • PDF

A Survey of Interference Cancellation for TDMA System (TDMA 시스템에서의 간섭제거기법 연구)

  • 최영철;임용곤;박종원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.753-756
    • /
    • 2001
  • Automatic Identification System(ALS) employed SOTDMA for the multiple access method. In SOTDMA systems, slot reuse may result in discrimination or garbling. Especially Gaussian Minimum Shift Keying(GMSK) Co-Channel Interference(CCI) resulted from the slot reuse in the Aloha zone degrades the system performance such as capacity In this paper we introduce some useful techniques to cancel the CCI and discuss the methodology which is applicable to AIS-SOTDMA

  • PDF

Interference Analysis for Synthetic Aperture Radar Calibration Sites with Triangular Trihedral Corner Reflectors

  • Shin, Jae-Min;Ra, Sung-Woong
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.2
    • /
    • pp.253-259
    • /
    • 2016
  • The typical method for performing an absolute radiometric calibration of a Synthetic Aperture Radar (SAR) System is to analyze its response, without interference, to a target with a known Radar Cross Section (RCS). To minimize interference, an error-free calibration site for a Corner Reflector (CR) is required on a wide and flat plain or on an area without disturbance sources (such as ground objects). However, in reality, due to expense and lack of availability for long periods, it is difficult to identify such a site. An alternative solution is the use of a Triangular Trihedral Corner Reflector (TTCR) site, with a surrounding protection wall consisting of berms and a hollow. It is possible in this scenario, to create the minimum criteria for an effectively error-free site involving a conventional object-tip reflection applied to all beams. Sidelobe interference by the berm is considered to be the major disturbance factor. Total interference, including an object-tip reflection and a sidelobe interference, is analyzed experimentally with SAR images. The results provide a new guideline for the minimum criteria of TTCR site design that require, at least, the removal of all ground objects within the fifth sidelobe.

A Signal Detection of Minimum Variance Algorithm on Linear Constraints

  • Kwan Hyeong Lee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.8-13
    • /
    • 2023
  • We propose a method for removing interference and noise to estimate target information. In wireless channels, information signals are subject to interference and noise, making it is difficult to accurately estimate the desired signal. To estimate the desired information signal, it is essential to remove the noise and interference from the received signal, extracting only the desired signal. If the received signal noise and interference are not removed, the estimated information signal will have a large error in distance and direction, and the exact location of the target cannot be estimated. This study aims to accurately estimate the desired target in space. The objective is to achieve more presice target estimation than existing methods and enhance target resolution.An estimation method is proposed to improve the accuracy of target estimation. The proposed target estimation method obtains optimal weights using linear constraints and the minimum variance method. Through simulation, the performance of the proposed method and the existing method is analyzed. The proposed method successfully estimated all four targets, while the existing method only estimated two targets. The results show that the proposed method has better resolutiopn and superior estimation capability than the existing method.