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

A Stable Routing Protocol to Support ITS Services in VANET Networks

科研費報告書収録論文(課題番号:17500030/研究代表者:加藤寧/インターネットと高親和性を有する次世代低軌道衛星ネットワークに関する基盤研究

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

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Evaluation of the Effects of Predicted Associativity on the Reliability and Performance of Mobile Ad Hoc Networks

Routing in Mobile Ad Hoc Networks (MANETs) presents unique challenges not encountered in conventional networks. Predicted Associativity Routing (PAR) is a protocol designed to address reliability in MANETs. Using associativity information, PAR calculates the expected lifetime of neighboring links. Nodes use this expected lifetime, and their neighbor\u27s connectivity to determine a residual lifetime. The routes are selected from those with the longest residual lifetimes. In this way, PAR attempts to improve the reliability of discovered routes. PAR is compared to AODV using a variety of reliability and performance metrics. Despite its focus on reliability, PAR does not provide more reliable routes. Rather, AODV produces routes which last as much as three times longer than PAR. However, PAR delivers more data and has greater throughput. Both protocols are affected most by the node density of the networks. Node density accounts for 48.62% of the variation in route lifetime in AODV, and 70.66% of the variation in PAR. As node density increases from 25 to 75 nodes route lifetimes are halved, while throughput increases drastically with the increased routing overhead. Furthermore, PAR increases end-to-end delay, while AODV displays better efficiency

Connectivity-Aware Routing in Vehicular Ad Hoc Networks

Vehicular ad hoc networks (VANETs) is a promising emerging technology that enables a wide range of appealing applications in road safety, traffic management, and passengers and driver comfort. The deployment of VANETs to enable vehicular Internet-based services and mobile data offloading is also envisioned to be a promising solution for the great demand of mobile Internet access. However, developing reliable and efficient routing protocols is one of the key challenges in VANETs due to the high vehicle mobility and frequent network topology changes. In this thesis, we highlight the routing challenges in VANETs with a focus on position-based routing (PBR), as a well-recognized routing paradigm in the vehicular environment. As the current PBR protocols do not support VANET users with connectivity information, our goal is to design an efficient routing protocol for VANETs that dynamically finds long life paths, with reduced delivery delay, and supports vehicles with instant information about connectivity to the infrastructure. The focus of this thesis will be on predicting vehicular mobility to estimate inter-vehicle link duration in order to support routing protocols with proactive connectivity information for a better routing performance. Via three stages to meet our goal, we propose three novel routing protocols to estimate both broad and comprehensive connectivities in VANETs: iCAR, iCAR-II, and D-CAR. iCAR supports VANET users with instant broad connectivity information to surrounding road intersections, iCAR-II uses cellular network channels for comprehensive connectivity awareness to Roadside Units (RSUs), and finally D-CAR supports users with instant comprehensive connectivity information without the assistance of other networks. Detailed analysis and simulation based evaluations of our proposed protocols demonstrate the validity of using VANETs for Internet-based services and mobile data offloading in addition to the significant improvement of VANETs performance in terms of packet delivery ratio and end-to-end delay