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

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

A Socio-inspired CALM Approach to Channel Assignment Performance Prediction and WMN Capacity Estimation

A significant amount of research literature is dedicated to interference mitigation in Wireless Mesh Networks (WMNs), with a special emphasis on designing channel allocation (CA) schemes which alleviate the impact of interference on WMN performance. But having countless CA schemes at one's disposal makes the task of choosing a suitable CA for a given WMN extremely tedious and time consuming. In this work, we propose a new interference estimation and CA performance prediction algorithm called CALM, which is inspired by social theory. We borrow the sociological idea of a "sui generis" social reality, and apply it to WMNs with significant success. To achieve this, we devise a novel Sociological Idea Borrowing Mechanism that facilitates easy operationalization of sociological concepts in other domains. Further, we formulate a heuristic Mixed Integer Programming (MIP) model called NETCAP which makes use of link quality estimates generated by CALM to offer a reliable framework for network capacity prediction. We demonstrate the efficacy of CALM by evaluating its theoretical estimates against experimental data obtained through exhaustive simulations on ns-3 802.11g environment, for a comprehensive CA test-set of forty CA schemes. We compare CALM with three existing interference estimation metrics, and demonstrate that it is consistently more reliable. CALM boasts of accuracy of over 90% in performance testing, and in stress testing too it achieves an accuracy of 88%, while the accuracy of other metrics drops to under 75%. It reduces errors in CA performance prediction by as much as 75% when compared to other metrics. Finally, we validate the expected network capacity estimates generated by NETCAP, and show that they are quite accurate, deviating by as low as 6.4% on an average when compared to experimentally recorded results in performance testing

Security and Privacy Issues in Wireless Mesh Networks: A Survey

This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio

Real-Time and Energy-Efficient Routing for Industrial Wireless Sensor-Actuator Networks

With the emergence of industrial standards such as WirelessHART, process industries are adopting Wireless Sensor-Actuator Networks (WSANs) that enable sensors and actuators to communicate through low-power wireless mesh networks. Industrial monitoring and control applications require real-time communication among sensors, controllers and actuators within end-to-end deadlines. Deadline misses may lead to production inefficiency, equipment destruction to irreparable financial and environmental impacts. Moreover, due to the large geographic area and harsh conditions of many industrial plants, it is labor-intensive or dan- gerous to change batteries of field devices. It is therefore important to achieve long network lifetime with battery-powered devices. This dissertation tackles these challenges and make a series of contributions. (1) We present a new end-to-end delay analysis for feedback control loops whose transmissions are scheduled based on the Earliest Deadline First policy. (2) We propose a new real-time routing algorithm that increases the real-time capacity of WSANs by exploiting the insights of the delay analysis. (3) We develop an energy-efficient routing algorithm to improve the network lifetime while maintaining path diversity for reliable communication. (4) Finally, we design a distributed game-theoretic algorithm to allocate sensing applications with near-optimal quality of sensing

A Joint Radio and Channel Assignment (JRCA) scheme for 802.11-based wireless mesh networks

Wireless mesh network (WMN) is a promising technology for broadband Internet access due to its low cost, ease of deployment, increased coverage, and robustness. Equipping each mesh router with multiple radios can greatly improve the capacity of WMNs since the radios at each node can simultaneously transmit data on orthogonal channels. Channel assignment is an important problem in multi-radio multi-channel WMNs where the goal is to assign a channel to each radio so that the resulting network topology is connected and the network capacity is maximized. Various channel assignment schemes have been proposed in literature. These schemes assume the number of radios at each node is given, but how this number is determined is not specified. In this work, we propose a joint radio and channel assignment (JRCA) algorithm that determines the number of radios required at each node based on the traffic demand and produces the channel assignment for each radio to minimize the interference among the links operating on the same channel. Thus our algorithm can produce a network configuration that meets the customer demand and maximize the network capacity. We conduct simulations to compare JRCA with a scheme where each node is equipped with the same number of radios and channel assignment is done by the MCCA algorithm. Our results show that, compared with the other schemes, JRCA can achieve higher throughput with fewer radios at the network nodes

A two-stage game theoretical approach for interference mitigation in Body-to-Body Networks

International audienceIn this paper, we identify and exploit opportunities for cooperation between a group of mobile Wireless Body Area Networks (WBANs), forming a Body-to-Body Network (BBN), through inter-body interference detection and subsequent mitigation. Thus, we consider a dynamic system composed of several BBNs and we analyze the joint mutual and cross-technology interference problem due to the utilization of a limited number of channels by different transmission technologies (i.e., ZigBee and WiFi) sharing the same radio spectrum. To this end, we propose a game theoretical approach to address the problem of Socially-aware Interference Mitigation (SIM) in BBNs, where WBANs are " social " and interact with each other. Our approach considers a two-stage channel allocation scheme: a BBN-stage for inter-WBANs' communications and a WBAN-stage for intra-WBAN communications. We demonstrate that the proposed BBN-stage and WBAN-stage games admit exact potential functions, and we develop a Best-Response (BR-SIM) algorithm that converges to Nash equilibrium points. A second algorithm, named Sub-Optimal Randomized Trials (SORT-SIM), is then proposed and compared to BR-SIM in terms of efficiency and computation time. We further compare the BR-SIM and SORT-SIM algorithms to two power control algorithms in terms of signal-to-interference ratio and aggregate interference, and show that they outperform the power control schemes in several cases. Numerical results, obtained in several realistic mobile scenarios, show that the proposed schemes are indeed efficient in optimizing the channel allocation in medium-to-large-scale BBNs

A Survey on the Communication Protocols and Security in Cognitive Radio Networks

A cognitive radio (CR) is a radio that can change its transmission parameters based on the perceived availability of the spectrum bands in its operating environment. CRs support dynamic spectrum access and can facilitate a secondary unlicensed user to efficiently utilize the available underutilized spectrum allocated to the primary licensed users. A cognitive radio network (CRN) is composed of both the secondary users with CR-enabled radios and the primary users whose radios need not be CR-enabled. Most of the active research conducted in the area of CRNs has been so far focused on spectrum sensing, allocation and sharing. There is no comprehensive review paper available on the strategies for medium access control (MAC), routing and transport layer protocols, and the appropriate representative solutions for CRNs. In this paper, we provide an exhaustive analysis of the various techniques/mechanisms that have been proposed in the literature for communication protocols (at the MAC, routing and transport layers), in the context of a CRN, as well as discuss in detail several security attacks that could be launched on CRNs and the countermeasure solutions that have been proposed to avoid or mitigate them. This paper would serve as a good comprehensive review and analysis of the strategies for MAC, routing and transport protocols and security issues for CRNs as well as would lay a strong foundation for someone to further delve onto any particular aspect in greater depth