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

Attacks and countermeasures on routing protocols in wireless networks

Routing in wireless networks is not an easy task as they are highly vulnerable to attacks. The main goal of this work is to study the routing performance and security aspects of wireless ad hoc and mesh networks. Most of the routing protocols use hop-count as the routing metric. Hop count metric may not be appropriate for routing in wireless networks as this does not account for the link qualities, advantages of multi-radio paradigm etc. There are several metrics designed for link quality based source routing protocols for multi-radio wireless ad hoc and mesh networks. For example Weighted Cumulative Expected Transmission Time (WCETT), Adjusted Expected Transfer Delay(AETD) etc. But these metrics do not consider the effect of individual link qualities on the total route quality and route selection. This lack of ability from WCETT or AETD would allow them to select suboptimal paths when actually an optimal path is available. In another point of view, this inability can create a routing disruption attack named as delay-variation attack (a variant of black hole attack). It can be launched by a couple of colluding attackers attracting packets at one point by showing very good link qualities and dropping packets at another point by decreasing the link quality. To select an optimal route and prevent the above mentioned attack, a new routing metric known as Variance Based Path Quality metric (VBPQ) is proposed. VBPQ metric provides a robust, reliable and secure edge to the routing mechanism. Another major contribution of this study is to provide a detection mechanism for wormhole attacks in wireless ad hoc networks operating on link quality based source routing protocols. There have been several detection techniques designed for hop count based routing protocols but not for link quality based source routing protocols. In this work, a data mining approach called Cross feature analysis is used in an algorithm to detect wormhole attacks

Improving Multicast Communications Over Wireless Mesh Networks

In wireless mesh networks (WMNs) the traditional approach to shortest path tree based multicasting is to cater for the needs of the poorest performingnode i.e. the maximum permitted multicast line rate is limited to the lowest line rate used by the individual Child nodes on a branch. In general, this meansfixing the line rate to its minimum value and fixing the transmit power to its maximum permitted value. This simplistic approach of applying a single multicast rate for all nodes in the multicast group results in a sub-optimal trade-off between the mean network throughput and coverage area that does not allow for high bandwidth multimedia applications to be supported. By relaxing this constraint and allowing multiple line rates to be used, the mean network throughput can be improved. This thesis presents two methods that aim to increase the mean network throughput through the use of multiple line rates by the forwarding nodes. This is achieved by identifying the Child nodes responsible for reducing the multicast group rate. The first method identifies specific locations for the placement of relay nodes which allows for higher multicast branch line rates to be used. The second method uses a power control algorithm to tune the transmit power to allow for higher multicast branch line rates. The use of power control also helps to reduce the interference caused to neighbouring nodes.Through extensive computer simulation it can be shown that these two methods can lead to a four-fold gain in the mean network throughput undertypical WMN operating conditions compared with the single line rate case

IETF standardization in the field of the Internet of Things (IoT): a survey

Smart embedded objects will become an important part of what is called the Internet of Things. However, the integration of embedded devices into the Internet introduces several challenges, since many of the existing Internet technologies and protocols were not designed for this class of devices. In the past few years, there have been many efforts to enable the extension of Internet technologies to constrained devices. Initially, this resulted in proprietary protocols and architectures. Later, the integration of constrained devices into the Internet was embraced by IETF, moving towards standardized IP-based protocols. In this paper, we will briefly review the history of integrating constrained devices into the Internet, followed by an extensive overview of IETF standardization work in the 6LoWPAN, ROLL and CoRE working groups. This is complemented with a broad overview of related research results that illustrate how this work can be extended or used to tackle other problems and with a discussion on open issues and challenges. As such the aim of this paper is twofold: apart from giving readers solid insights in IETF standardization work on the Internet of Things, it also aims to encourage readers to further explore the world of Internet-connected objects, pointing to future research opportunities

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

Research on Quality of Service Based Routing Protocols for Mobile Ad Hoc Networks

Quality of service (QoS) based routing protocols play a significant role in MANETs to maintain proper flow of data with efficient power consumption and without data loss. However, several network resource based technical challenges or issues are encountered in the design and implementation of QoS routing protocols that perform their routing function by considering the shortest route or the lowest cost. Furthermore, a secondary route is not reserved and alternative routes are not searched unless the established route is broken. The current structures of the state-of-the-art protocols for MANETs are not appropriate for today's high bandwidth and mobility requirements. Therefore, research on new routing protocols is needed, considering energy level, coverage, location, speed, movement, and link stability instead of only shortest path and lowest cost. This paper summarizes the main characteristics of QoS-based routing protocols to facilitate researchers to design and select QoS-based routing protocols. In this study, a wide range of protocols with their characteristics were classified according to QoS routing strategy, routing information update mechanism, interaction between network and MAC layer, QoS constraints, QoS guarantee type and number of discovered routes. In addition, the protocols were compared in terms of properties, design features, challenges and QoS metrics

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