162 research outputs found
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
Green communication in energy renewable wireless mesh networks: routing, rate control, and power allocation
PublishedJournal Article© 2014 IEEE. The increasing demand for wireless services has led to a severe energy consumption problem with the rising of greenhouse gas emission. While the renewable energy can somehow alleviate this problem, the routing, flow rate, and power still have to be well investigated with the objective of minimizing energy consumption in multi-hop energy renewable wireless mesh networks (ER-WMNs). This paper formulates the problem of network-wide energy consumption minimization under the network throughput constraint as a mixed-integer nonlinear programming problem by jointly optimizing routing, rate control, and power allocation. Moreover, the min-max fairness model is applied to address the fairness issue because the uneven routing problem may incur the sharp reduction of network performance in multi-hop ER-WMNs. Due to the high computational complexity of the formulated mathematical programming problem, an energy-aware multi-path routing algorithm (EARA) is also proposed to deal with the joint control of routing, flow rate, and power allocation in practical multi-hop WMNs. To search the optimal routing, it applies a weighted Dijkstra's shortest path algorithm, where the weight is defined as a function of the power consumption and residual energy of a node. Extensive simulation results are presented to show the performance of the proposed schemes and the effects of energy replenishment rate and network throughput on the network lifetime
On the performance of STDMA Link Scheduling and Switched Beamforming Antennas in Wireless Mesh Networks
Projecte final de carrera realitzat en col.laboració amb King's College LondonWireless Mesh Networks (WMNs) aim to revolutionize Internet connectivity due to
its high throughput, cost-e ectiveness and ease deployment by providing last mile
connectivity and/or backhaul support to di erent cellular networks. In order not to
jeopardize their successful deployment, several key issues must be investigated and
overcome to fully realize its potential. For WMNs that utilize Spatial Reuse TDMA
as the medium access control, link scheduling still requires further enhancements.
The rst main contribution of this thesis is a fast randomized parallel link swap
based packing (RSP) algorithm for timeslot allocation in a spatial time division multiple
access (STDMA) wireless mesh network. The proposed randomized algorithm
extends several greedy scheduling algorithms that utilize the physical interference
model by applying a local search that leads to a substantial improvement in the
spatial timeslot reuse. Numerical simulations reveal that compared to previously
scheduling schemes the proposed randomized algorithm can achieve a performance
gain of up to 11%. A signi cant bene t of the proposed scheme is that the computations
can be parallelized and therefore can e ciently utilize commoditized and
emerging multi-core and/or multi-CPU processors.
Furthermore, the use of selectable multi-beam directional antennas in WMNs,
such as beam switched phase array antennas, can assist to signi cantly enhance
the overall reuse of timeslots by reducing interference levels across the network and
thereby increasing the spectral e ciency of the system. To perform though a switch
on the antenna beam it may require up to 0.25 ms in practical deployed networks,
while at the same time very frequent beam switchings can a ect frame acquisition
and overall reliability of the deployed mesh network.
The second key contribution of this thesis is a set of algorithms that minimize the
overall number of required beam switchings in the mesh network without penalizing
the spatial reuse of timeslots, i.e., keeping the same overall frame length in the
network. Numerical investigations reveal that the proposed set of algorithms can
reduce the number of beam switchings by almost 90% without a ecting the frame
length of the network
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
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
Joint link
Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2009.Thesis (Master's) -- Bilkent University, 2009.Includes bibliographical references leaves 63-67.In this thesis, we study the joint scheduling and routing problem in spatial
reuse Time Division Multiple Access (STDMA) based multi-channel/multiradio/multi-rate
wireless mesh networks (WMNs). The main objective of the
joint scheduling and routing problem addressed in thesis is to reduce the number
of required TDMA time slots to deliver all packets to their destinations. Since
the optimum solution to the problem is NP-hard, we propose a greedy iterative
solution methodology. The problem is formulated as an integer linear program
(ILP) under the physical interference model. We consider two versions of the
problem in order to investigate the factors affecting the capacity of WMNs. In
the first one, we perform scheduling and routing when the number of channels and
number of radios are varied for multi-rate WMNs where nodes are equipped with
omni-directional antennas. This analysis is done for both single-class (best-effort
traffic) and two-class (best-effort and delay sensitive classes) traffic models. We
then extend this analysis by adding the power control scheme which allows transmitters
to change the transmitting powers slot-by-slot. Finally, joint scheduling
and routing problem is extended for WMNs where nodes are equipped with multiple
sectored antennas. We show that the network performance is improved
with more radio resources, e.g., using multiple orthogonal channels, multiple radios
per node, transmit power control scheme, and directional antennas in terms
of delay and total dissipated energy. The network throughput when using 3
channels and 3 radios is increased by up to 67.2% compared to single channel
WMNs and the total dissipated energy is reduced by up to 45.5% with transmit
power control scheme. Finally, when directional antennas with 6 sectors are used
at both transmitters and receivers, the network throughput increases by up to
72.6% compared to omni-directional antenna case.Kaybal, FazlıM.S
Recommended from our members
Power aware routing algorithms (PARA) in wireless mesh networks for emergency management
Wireless Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency
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
- …