Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

Multi-channel multi-interface Wireless Mesh Networks permit to spread the load across orthogonal channels to improve network capacity. Although broadcast is vital for many layer-3 protocols, proposals for taking advantage of multiple channels mostly focus on unicast transmissions. In this paper, we propose broadcast algorithms that fit any channel and interface assignment strategy. They guarantee that a broadcast packet is delivered with a minimum probability to all neighbors. Our simulations show that the proposed algorithms efficiently limit the overhead

Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

Proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.published_or_final_versio

Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

Proceedings of the IEEE Wireless Communications and Networking Conference, 2009, p. 2560-2564Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found. © 2009 IEEE.published_or_final_versio

High-Performance Broadcast and Multicast Protocols for Multi-Radio Multi-Channel Wireless Mesh Networks

Recently, wireless mesh networks (WMNs) have attracted much attention. A vast amount of unicast, multicast and broadcast protocols has been developed for WMNs or mobile ad hoc networks (MANETs). First of all, broadcast and multicast in wireless networks are fundamentally different from the way in which wired networks function due to the well-known wireless broadcast/multicast advantage. Moreover, most broadcast and multicast protocols in wireless networks assume a single-radio single-channel and single-rate network model, or a generalized physical model, which does not take into account the impact of interference. This dissertation focuses on high-performance broadcast and multicast protocols designed for multi-radio multi-channel (MRMC) WMNs. MRMC increases the capacity of the network from different aspects. Multi-radio allows mesh nodes to simultaneously send and receive through different radios to its neighbors. Multi-channel allows channels to be reused across the network, which expands the available spectrum and reduces the interference. Unlike MANETs, WMNs are assumed to be static or with minimal mobility. Therefore, the main design goal in WMNs is to achieve high throughput rather than to maintain connectivity. The capacity of WMNs is constrained by the interference caused by the neighbor nodes. One direct design objective is to minimize or reduce the interference in broadcast and multicast. This dissertation presents a set of broadcast and multicast protocols and mathematical formulations to achieve the design goal in MRMC WMNs. First, the broadcast problem is addressed with full consideration of both inter-node and intra-node interference to achieve efficient broadcast. The interference-aware broadcast protocol simultaneously achieves full reliability, minimum broadcast or multicast latency, minimum redundant transmissions, and high throughput. With an MRMC WMN model, new link and channel quality metrics are defined and are suitable for the design of broadcast and multicast protocols. Second, the minimum cost broadcast problem (MCBP), or minimum number of transmissions problem, is studied for MRMC WMNs. Minimum cost broadcast potentially allows more effective and efficient schedule algorithms to be designed. The proposed protocol with joint consideration of channel assignment reduces the interference to improve the throughput in the MCBP. Minimum cost broadcast in MRMC WMNs is very different from that in the single radio single channel scenario. The channel assignment in MRMC WMNs is used to assign multiple radios of every node to different channels. It determines the actual network connectivity since adjacent nodes have to be assigned to a common channel. Transmission on different channels makes different groups of neighboring nodes, and leads to different interference. Moreover, the selection of channels by the forward nodes impacts on the number of radios needed for broadcasting. Finally, the interference optimization multicast problem in WMNs with directional antennas is discussed. Directional transmissions can greatly reduce radio interference and increase spatial reuse. The interference with directional transmissions is defined for multicast algorithm design. Multicast routing found by the interference-aware algorithm tends to have fewer channel collisions. The research work presented in this dissertation concludes that (1) new and practical link and channel metrics are required for designing broadcast and multicast in MRMC WMNs; (2) a small number of radios is sufficient to significantly improve throughput of broadcast and multicast in WMNs; (3) the number of channels has more impact on almost all performance metrics, such as the throughput, the number of transmission, and interference, in WMNs

Intelligent spectrum management techniques for wireless cognitive radio networks

PhD ThesisThis thesis addresses many of the unique spectrum management chal- lenges in CR networks for the rst time. These challenges have a vital e ect on the network performance and are particularly di cult to solve due to the unique characteristics of CR networks. Speci cally, this thesis proposes and investigates three intelligent spectrum management tech- niques for CR networks. The issues investigated in this thesis have a fundamental impact on the establishment, functionality and security of CR networks. First, an intelligent primary receiver-aware message exchange protocol for CR ad hoc networks is proposed. It considers the problem of alleviat- ing the interference collision risk to primary user communication, explic- itly to protect primary receivers that are not detected during spectrum sensing. The proposed protocol achieves a higher measure of safeguard- ing. A practical scenario is considered where no global network topology is known and no common control channel is assumed to exist. Second, a novel CR broadcast protocol (CRBP) to reliably disseminate the broadcast messages to all or most of the possible CR nodes in the network is proposed. The CRBP formulates the broadcast problem as a bipartite-graph problem. Thus, CRBP achieves a signi cant successful delivery ratio by connecting di erent local topologies, which is a unique feature in CR ad hoc networks. Finally, a new defence strategy to defend against spectrum sensing data falsi cation attacks in CR networks is proposed. In order to identify malicious users, the proposed scheme performs multiple veri cations of sensory data with the assistance of trusted nodes.Higher Committee For Education Devel- opment in Iraq (HCED-Iraq

Improving broadcast performance in multi-radio multi-channel multi-rate wireless mesh networks.

This thesis addresses the problem of `efficient' broadcast in a multi-radio multi-channel multi-rate wireless mesh network (MR$^2$-MC WMN). In such a MR$^2$-MC WMN, nodes are equipped with multiple radio network interface cards, each tuned to an orthogonal channel, that can dynamically adjust transmission rate by choosing a modulation scheme appropriate for the channel conditions. We choose `broadcast latency', defined as the maximum delay between a packet's network-wide broadcast at the source and its eventual reception at all network nodes, as the `efficiency' metric of broadcast performance. The problem of constructing a broadcast forwarding structure having minimal broadcast latency is referred to as the `minimum-latency-broadcasting' (MLB) problem. While previous research for broadcast in single-radio single-rate wireless networks has highlighted the wireless medium's `\emph{wireless broadcast advantage}' (WBA); little is known regarding how the new features of MR$^2$-MC WMN may be exploited. We study in this thesis how the availability of multiple radio interfaces (tuned to orthogonal channels) at WMN nodes, and WMN's multi-rate transmission capability and WBA, might be exploited to improve the `broadcast latency' performance. We show the MLB problem for MR$^2$-MC WMN to be NP-hard, and resort to heuristics for its solution. We divide the overall problem into two sub-problems, which we address in two separate parts of this thesis. \emph{In the first part of this thesis}, the MLB problem is defined for the case of single-radio single-channel multi-rate WMNs where WMN nodes are equipped with a single radio tuned to a common channel. \emph{In the second part of this thesis}, the MLB problem is defined for MR$^2$-MC WMNs where WMN nodes are equipped with multiple radios tuned to multiple orthogonal channels. We demonstrate that broadcasting in multi-rate WMNs is significantly different to broadcasting in single-rate WMNs, and that broadcast performance in multi-rate WMNs can be significantly improved by exploiting the availability of multi-rate feature and multiple interfaces. We also present two alternative MLB broadcast frameworks and specific algorithms, centralized and distributed, for each framework that can exploit multiple interfaces at a WMN node, and the multi-rate feature and WBA of MR$^2$-MC WMN to return improved `broadcast latency' performance