624 research outputs found
Secure Routing in Wireless Mesh Networks
Wireless mesh networks (WMNs) have emerged as a promising concept to meet the
challenges in next-generation networks such as providing flexible, adaptive,
and reconfigurable architecture while offering cost-effective solutions to the
service providers. Unlike traditional Wi-Fi networks, with each access point
(AP) connected to the wired network, in WMNs only a subset of the APs are
required to be connected to the wired network. The APs that are connected to
the wired network are called the Internet gateways (IGWs), while the APs that
do not have wired connections are called the mesh routers (MRs). The MRs are
connected to the IGWs using multi-hop communication. The IGWs provide access to
conventional clients and interconnect ad hoc, sensor, cellular, and other
networks to the Internet. However, most of the existing routing protocols for
WMNs are extensions of protocols originally designed for mobile ad hoc networks
(MANETs) and thus they perform sub-optimally. Moreover, most routing protocols
for WMNs are designed without security issues in mind, where the nodes are all
assumed to be honest. In practical deployment scenarios, this assumption does
not hold. This chapter provides a comprehensive overview of security issues in
WMNs and then particularly focuses on secure routing in these networks. First,
it identifies security vulnerabilities in the medium access control (MAC) and
the network layers. Various possibilities of compromising data confidentiality,
data integrity, replay attacks and offline cryptanalysis are also discussed.
Then various types of attacks in the MAC and the network layers are discussed.
After enumerating the various types of attacks on the MAC and the network
layer, the chapter briefly discusses on some of the preventive mechanisms for
these attacks.Comment: 44 pages, 17 figures, 5 table
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
Review of multicast QoS routing protocols for mobile ad hoc networks
A Mobile Ad hoc NETwork (MANET) is consisting of a
collection of wireless mobile nodes, which form a temporary
network without relying on any existing infrastructure or
centralized administration. Since the bandwidth of MANETs is
limited and shared between the participating nodes in the
network, it is important to efficiently utilize the network
bandwidth. Multicasting can minimize the link bandwidth
consumption and reduce the communication cost by sending the
same data to multiple participants. Multicast service is critical for
applications that need collaboration of team of users.
Multicasting in MANETs becomes a hot research area due to the
increasing popularity of group communication applications such
as video conferencing and interactive television. Recently,
multimedia and group-oriented computing gains more popularity
for users of ad hoc networks. So, effective Quality of Service
(QoS) multicasting protocol plays significant role in MANETs.
In this paper, we are presenting an overview of set of the most
recent QoS multicast routing protocols that have been proposed
in order to provide the researchers with a clear view of what has
been done in this field
The New Multipoint Relays Selection in OLSR using Particle Swarm Optimization
The standard optimized link state routing (OLSR) introduces an interesting concept, the multipoint relays (MPRs), to mitigate message overhead during the flooding process. This paper propose a new algorithm for MPRs selection to enhance the performance of OLSR using particle swarm optimization sigmoid increasing inertia weight (PSOSIIW). The sigmoid increasing inertia weight has significance improve the particle swarm optimization (PSO) in terms of simplicity and quick convergence towards optimum solution. The new fitness function of PSOSIIW, packet delay of each node and degree of willingness are introduced to support MPRs selection in OLSR. The throughput, packet loss and end-to-end delay of the proposed method are examined using network simulator 2 (ns2). Overall results indicate that OLSR-PSOSIIW has shown good performance compared to the standard OLSR and OLSR-PSO, particularly for the throughput and end-to-end delay. Generally the proposed OLSR-PSOSIIW shows advantage of using PSO for optimizing routing paths in the MPRs selection algorithm
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
Quality of service on ad-hoc wireless networks
Over the last years, Mobile Ad-hoc Networks (MANETs) have captured the attention of the research community. The flexibility and cost savings they provide, due to the fact that no infrastructure is needed to deploy a MANET, is one of the most attractive possibilities of this technology. However, along with the flexibility, lots of problems arise due to the bad quality of transmission media, the scarcity of resources, etc. Since real-time communications will be common in MANETs, there has been an increasing motivation on the introduction of Quality of Service (QoS) in such networks. However, many characteristics of MANETs make QoS provisioning a difficult problem.In order to avoid congestion, a reservation mechanism that works together with a Connection Admission Control (CAC) seems to be a reasonable solution. However, most of the QoS approaches found in literature for MANETs do not use reservations. One reason for that, is the difficulty on determining the available bandwidth at a node. This is needed to decide whether there are enough resources to accommodate a new connection.This thesis proposes a simple, yet effective, method for nodes in a CSMA-based MANET to compute their available bandwidth in a distributed way. Based on this value, a QoS reservation mechanism called BRAWN (Bandwidth Reservation over Ad-hoc Networks) is introduced for multirate MANETs, allowing bandwidth allocation on a per flow basis. By multirate we refer to those networks where wireless nodes are able to dynamically switch among several link rates. This allows nodes to select the highest possible transmission rate for exchanging data, independently for each neighbor.The BRAWN mechanism not only guarantees certain QoS levels, but also naturally distributes the traffic more evenly among network nodes (i.e. load balancing). It works completely on the network layer, so that no modifications on lower layers are required, although some information about the network congestion state could also be taken into account if provided by the MAC (Medium Access Control) layer. The thesis analyzes the applicability of the proposed reservation mechanism over both proactive and reactive routing protocols, and extensions to such protocols are proposed whenever needed in order to improve their performance on multirate networks. On mobile scenarios, BRAWN also achieves high QoS provisioning levels by letting the nodes to periodically refresh QoS reservations. This extension of the protocol for mobile nodes is referred as BRAWN-R (BRAWN with Refreshments).Summarizing, the outstanding features of the reservation mechanism proposed by this thesis are: (i) Multirate, i.e. it allows wireless nodes to choose among different transmission rates, in order to accommodate to different channel conditions. (ii) Targeted to CSMA-based wireless MAC protocols, e.g. 802.11. (iii) Reservation based, allowing the network nodes to pro-actively protect ongoing QoS flows, and applying an effective CAC. (iv) Adaptive to topology changes introduced by the mobility of the nodes, re-routing QoS flows to more efficient paths. (v) Feasible and simple to implement over existing MANET routing protocols (as it is shown by the prototype presented at the end of the study).Postprint (published version
- …