12,527 research outputs found

    Assigning and Scheduling Partially Overlapping Channels in Wireless Mesh Networks

    Get PDF
    The design and the management of Wireless Mesh Networks (WMNs) are currently associated with the most active research area within the current wireless networking paradigms. WMNs inherit features from existing wireless networking technologies such as WLANs, mobile ad hoc networks. Because WMNs are easy to deploy and with low power consumption, there is a phenomenal growing interest in seeing WMNs as the next wireless backhaul networks, and an alternative to the existing wired infrastructure. The earliest development of WMNs had begun with single-channel single-radio mesh networks. This technology then evolved towards multi-channel single-radio mesh networks, and then to multi-channel multi-radio mesh networks. WMNs operate in North America on IEEE 802.11 2.4 GHz spectrum, which provides up to 11 channels. Despite the availability of 11 channels, only 3 (1, 6, 11) orthogonal channels can be used concurrently. The efficiency of multi-channel multi-radio wireless mesh networks can be improved with the increase of the number of channels used concurrently and of multiple radios. In this study, we investigate how to design a scalable channel assignment and a scheduling algorithm, which both exploit partially overlapping channels in order to increase the throughput in comparison with the one that can be obtained only using three orthogonal channels. In order to accurately take into account the radio interferences, we use the physical interference model to estimate the interferences among wireless links. We then introduce the definition of transmission configurations, which are sets of links, which can transmit concurrently. These links can be assigned with channels of overlapping or orthogonal in nature. We then design a TDMA based scheduling allowing a transmission configuration to transmit concurrently in a time slot. Finally, we evaluate all our algorithms through extensive simulations. Our numerical experiments show that we can gain up to 25% for the throughput by appropriately managing all the available channels

    Characterization of multi-channel interference

    Get PDF
    Multi-channel communication protocols in wireless networks usually assume perfect orthogonality between wireless channels or consider only the use of interference-free channels. The first approach may overestimate the performance whereas the second approach may fail to utilize the spectrum efficiently. Therefore, a more realistic approach would be the careful use of interfering channels by controlling the interference at an acceptable level. We present a methodology to estimate the packet error rate (PER) due to inter-channel interference in a wireless network. The methodology experimentally characterizes the multi-channel interference and analytically estimates it based on the observations from the experiments. Furthermore, the analytical estimation is used in simulations to derive estimates of the capacity in larger networks. Simulation results show that the achievable network capacity, which is defined as the number of simultaneous transmissions, significantly increases with realistic interfering channels compared with the use of only orthogonal channels. When we consider the same number of channels, the achievable capacity with realistic interfering channels can be close to the capacity of idealistic orthogonal channels. This shows that overlapping channels which constitute a much smaller band, provides more efficient use of the spectrum. Finally, we explore the correctness of channel orthogonality and show why this assumption may fail in a practical setting

    A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

    Full text link
    The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.Comment: 10 pages, 5 figure

    Radio Co-location Aware Channel Assignments for Interference Mitigation in Wireless Mesh Networks

    Full text link
    Designing high performance channel assignment schemes to harness the potential of multi-radio multi-channel deployments in wireless mesh networks (WMNs) is an active research domain. A pragmatic channel assignment approach strives to maximize network capacity by restraining the endemic interference and mitigating its adverse impact on network performance. Interference prevalent in WMNs is multi-faceted, radio co-location interference (RCI) being a crucial aspect that is seldom addressed in research endeavors. In this effort, we propose a set of intelligent channel assignment algorithms, which focus primarily on alleviating the RCI. These graph theoretic schemes are structurally inspired by the spatio-statistical characteristics of interference. We present the theoretical design foundations for each of the proposed algorithms, and demonstrate their potential to significantly enhance network capacity in comparison to some well-known existing schemes. We also demonstrate the adverse impact of radio co- location interference on the network, and the efficacy of the proposed schemes in successfully mitigating it. The experimental results to validate the proposed theoretical notions were obtained by running an exhaustive set of ns-3 simulations in IEEE 802.11g/n environments.Comment: Accepted @ ICACCI-201

    2D Time-frequency interference modelling using stochastic geometry for performance evaluation in Low-Power Wide-Area Networks

    Full text link
    In wireless networks, interferences between trans- missions are modelled either in time or frequency domain. In this article, we jointly analyze interferences in the time- frequency domain using a stochastic geometry model assuming the total time-frequency resources to be a two-dimensional plane and transmissions from Internet of Things (IoT) devices time- frequency patterns on this plane. To evaluate the interference, we quantify the overlap between the information packets: provided that the overlap is not too strong, the packets are not necessarily lost due to capture effect. This flexible model can be used for multiple medium access scenarios and is especially adapted to the random time-frequency access schemes used in Low-Power Wide-Area Networks (LPWANs). By characterizing the outage probability and throughput, our approach permits to evaluate the performance of two representative LPWA technologies Sigfox{\textsuperscript \textregistered} and LoRaWA{\textsuperscript \textregistered}

    A Dynamic Clustering and Resource Allocation Algorithm for Downlink CoMP Systems with Multiple Antenna UEs

    Full text link
    Coordinated multi-point (CoMP) schemes have been widely studied in the recent years to tackle the inter-cell interference. In practice, latency and throughput constraints on the backhaul allow the organization of only small clusters of base stations (BSs) where joint processing (JP) can be implemented. In this work we focus on downlink CoMP-JP with multiple antenna user equipments (UEs) and propose a novel dynamic clustering algorithm. The additional degrees of freedom at the UE can be used to suppress the residual interference by using an interference rejection combiner (IRC) and allow a multistream transmission. In our proposal we first define a set of candidate clusters depending on long-term channel conditions. Then, in each time block, we develop a resource allocation scheme by jointly optimizing transmitter and receiver where: a) within each candidate cluster a weighted sum rate is estimated and then b) a set of clusters is scheduled in order to maximize the system weighted sum rate. Numerical results show that much higher rates are achieved when UEs are equipped with multiple antennas. Moreover, as this performance improvement is mainly due to the IRC, the gain achieved by the proposed approach with respect to the non-cooperative scheme decreases by increasing the number of UE antennas.Comment: 27 pages, 8 figure
    corecore