2,202 research outputs found
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
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search
Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11),
each node should help to relay packets of neighboring nodes toward gateway
using multi-hop routing mechanisms. Wireless mesh networks usually intensively
deploy mesh nodes to deal with the problem of dead spot communication. However,
the higher density of nodes deployed, the higher radio interference occurred.
This causes significant degradation of system performance. In this paper, we
first convert network problems into geometry problems in graph theory, and then
solve the interference problem by geometric algorithms. We first define line
intersection in a graph to reflect radio interference problem in a wireless
mesh network. We then use plan sweep algorithm to find intersection lines, if
any; employ Voronoi diagram algorithm to delimit the regions among nodes; use
Delaunay Triangulation algorithm to reconstruct the graph in order to minimize
the interference among nodes. Finally, we use standard deviation to prune off
those longer links (higher interference links) to have a further enhancement.
The proposed hybrid solution is proved to be able to significantly reduce
interference in a wireless mesh network in O(n log n) time complexity.Comment: 24 Pages, JGraph-Hoc Journal 201
A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks
Copyright @ 2008 IEEEThis paper proposes a genetic algorithm (GA) based optimization approach to search a minimum-interference multicast tree which satis¯es the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented en- coding method is used and each chromosome is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. Crossover and mutation are well designed to adapt to the tree structure. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed GA based multicast algorithm achieves better performance in terms of both the total channel conflict and the tree cost than that of a well known algorithm
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing
This is the post-print version of the article - Copyright @ 2008 Springer-VerlagThis paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods
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
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods
Copyright @ 2010 Elsevier B.V. All rights reserved.In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
State-of-the-art of distributed channel assignment
Channel assignment for Wireless Mesh Networks (WMNs) attempts to increase the
network performance by decreasing the interference of simultaneous
transmissions. The reduction of interference is achieved by exploiting the
availability of fully or partially non-overlapping channels. Although it is
still a young research area, many different approaches have already been
developed. These approaches can be distinguished into centralized and
distributed. Centralized algorithms rely on a central entity, usually called
Channel Assignment Server (CAS), which calculates the channel assignment and
sends the result to the mesh routers. In distributed approaches, each mesh
router calculates its channel assignment decision based on local information.
Distributed approaches can react faster to topology changes due to node
failures or mobility and usually introduce less protocol overhead since
communication with the CAS is not necessary. As a result, distributed
approaches are more suitable once the network is operational and running.
Distributed approaches can further be classified into static and dynamic, in
regard to the modus of channel switching. In dynamic approaches, channels can
be switched on a per-packet basis, whereas in static approaches radios stay on
a specific channel for a longer period of time. Static assignments have been
more in focus, since the channel switching time for current Institute of
Electrical and Electronics Engineers (IEEE) 802.11 hardware is in the order of
milliseconds which is two orders higher than the packet transmission time.
Recently, surveys of channel assignment algorithms have been presented which
cover certain aspects of the research field. The survey in [1] introduces the
problem and presents a couple of distributed algorithms and [2] gives a broad
introduction to centralized and distributed approaches. The survey herein is
focused on distributed approaches for peer- to-peer network architectures.
This report describes the problem formulation for channel assignment in WMNs
and the fundamental concepts and challenges of this research area. We present
different distributed channel assignment algorithms and characterize them
according to a set of classification keys. Since channel assignment algorithms
may change the connectivity and therefore the network topology, they may have
a high impact on routing. Therefore, we present routing metrics that consider
channel diversity and adapt better to the multi- radio multi-channel scenario
than traditional routing metrics designed for single channel networks. The
presented algorithms are discussed and compared focusing on practical
evaluations in testbed and network environments. The implementation for real
networks is a hard and labor-intensive task because the researcher has to deal
with the complexity of the hardware, operating system, and wireless network
interface drivers. As a result, frameworks emerged in order to simplify the
implementation process. We describe these frameworks and the mechanisms used
to help researchers implementing their algorithms and show their limitations
and restrictions
- …