Securing wireless mesh networks with ticket-based authentication

Mobile Ad Hoc Networks (MANETs) pose challenges in terms of power control, due to their fixed transmission power, the mobility of nodes and a constantly changing topology. High levels of power are needed in wireless networks, particularly for routing. In order to address this problem, power aware routing protocols have been proposed, with the aim of maximising the lifetime of the network. This paper presents an enhancement to the Ad Hoc On Demand Distance Vector (AODV) protocol, by reducing transmission power, when a large number of other radios are within range. This protocol, called DP-AODV (Dynamic Power AODV) combines the hello packet mechanism and the power control mechanism in order to reduce interference between nodes and increase the throughput in the network, thus reducing the overall power consumption. A performance evaluation of this enhanced protocol is carried out in comparison with three standard routing protocols, Ad Hoc On Demand Distance Vector (AODV), Ad Hoc On Demand Multipath Distance Vector (AOMDV) and Dynamic Source Routing (DSR), using network simulator 2 (NS2). Keywords-MANET; Dynamic Power; Density; Mobility; Interference.

The nature of wireless transmission leads to vulnerabilities to many malicious activities, and communication in wireless mesh networks (WMNs) must be protected by proper security measures. This paper focuses on symmetric pair wise key establishment and presents a new matrix-based pair wise key establishment scheme for mesh clients. In WMNs, mesh routers are much more powerful than mesh clients, both in communication and computation. By taking advantage of this heterogeneity, our new scheme delegates energy-consuming operations to mesh routers when establishing pair wise keys for mesh clients. Additionally, neighbor mesh clients in our scheme can directly establish pair wise keys with significantly reduced communication and storage costs, due to the use of both pre and post deployment knowledge.

Wireless Mesh Network (WMN) is recently emerged network having robustness. It supports clients to communicate with different types of networks, Internet etc which provides a better service to next generation. It consists of mesh routers and mesh clients. These mesh routers are minimal mobile and mesh clients are totally mobile. The protocols of Ad hoc network are used in WMN. These protocols assume that every node is mobile. But as the mesh routers are minimal mobile or not mobile, the protocols brings overhead for the mesh routers. Our task is to relieve mesh routers using ad hoc network protocol from the overhead and define a better protocol which will fit in WMN efficiently. To do so, we've found that the existing architecture of WMN is needed to be changed slightly. We have proposed a new architecture for Wireless Mesh Network. In our proposal WMN is relieved from overhead being caused by using ad hoc network protocol. Our architecture use unicasting technique in lieu of broadcasting technique for route discovery as well as route maintenance. We will first describe the overview of WMN, its existing architecture. Later we will go to our proposed architecture.

The popularity and the constant improvement of wireless technologies, such as WiFi and WiMAX, have been increasing the usage and applicability of new networking schemes, including Wireless Mesh Networks (WMNs). WMNs are multi-hop wireless networks made by a collection of two types of nodes, mesh routers and mesh clients. Their self-organizing, self-configuring and self-healing proprieties, in conjunction with their low maintenance and implementation costs, make them especially appealing as a solution for Internet access and social networking. The characteristics of WMNs make them more susceptible to malicious attacks than traditional wired networks, namely the scarce bandwidth, the high level of interference, the shared transmission media and the limited physical security. Secure routing and forwarding schemes are a key component to guarantee secure communications in hostile environments. There are however issues that must be considered when developing secure routing and forwarding solutions, namely the overhead introduced by such approaches and the effectiveness of the prediction schemes used. This paper discusses the main solutions for routing security in WMNs and presents a thorough evaluation, comprising a novel way to characterize the effectiveness of such approaches. The evaluation is based on CONFIDANT, a secure routing protocol based on the DSR protocol. The study performed addresses both the issues aforementioned and provides insight on the trade-offs associated with the deployment of secure routing and forwarding mechanisms.

This paper proposes an efficient, secure and anonymous routing protocol based on Weil pairing for wireless mesh networks (WMNs). The proposed protocol considers symmetric and asymmetric links during wireless communication in WMNs. A WMN integrates several types of wireless devices, and induces the asymmetric links that result from different transmission ranges of wireless devices. Enhancing the security and privacy of WMNs has been an important research focus in recent years. Most research on this topic has focused on providing security and anonymity for routing and data in symmetric links. However, the asymmetric links in these protocols have not been addressed. This paper proposes a novel distributed routing protocol suitable for WMNs that include symmetric and asymmetric links. The proposed protocol guarantees security, anonymity and high reliability in WMNs. The proposed protocol generates routes that are shorter than those of previous studies. The proposed scheme protects the real identities of the source and intermediate users, which remain unknown even to the mesh router, while still providing node authentication. Using the proposed protocol, mesh clients anonymously discover a secure route to the mesh router. This protocol also ensures data transmission anonymity and enhances WMN coverage, in addition to assuring security and anonymity.

We have customized Ad hoc On demand Distance Vector (AODV) protocol and augmented security aspect in real time scenario using numeric step values called Trust assigned to finite number of neighbor nodes to evaluate network behavior, subsequently secure the network by barricading the network from malicious nodes in Blackhole and flooding attack modes. Experiments were carried out using a custom-made testbed built on wxPython that supports various characteristics of nodes like variable data rates, node positions and malicious behavior for testing and display results in a graphical format. The results have favored aforementioned proposal showing a 70% increase in throughput obtained from trust implemented experimentation as compared to standard one without the trust parameter. The overhead in trusted scenario encountered was minimal despite the end to end delay of packets being higher than the traditional AODV by 30 msec. Hence, we have concluded that our method of using trust has resulted in a secured reactive protocol with applications suited for wireless attack prone environment when applied to a network consisting of four nodes. Our work is also the first ever implementation of a trust model over an adhoc routing protocol in a real adhoc testbed.

One of the key challenges for routing protocols in wireless multi-hop networks is to deal with link failures, and to repair the routes in these situations. In the Ad-hoc On Demand Distance Vector (AODV) protocol, routes can either be repaired by re-establishing a new route from scratch starting from the source node (Source Repair), or they can be locally repaired by the node that detects the link break along the end-to-end path (Local Repair). In some situations Source Repair will lead to better performance, in other situations Local Repair will be the more appropriate choice. In this work, we explore a flexible, parameterised approach in deciding on which of these two route repair strategies to use in the event of a link break. We define a Local Repair Threshold parameter that determines how far along the end-to-end path that a link break needs to occur in order to initiate Local Repair, as opposed to Source Repair. Our simulation results show that the optimal choice of the Local Repair Threshold, in terms of Packet Delivery Ratio, depends on the network load. We show that a flexible, parameterised and adaptive approach to choosing the Local Repair Threshold, can improve the Packet Delivery Ratio by up to 37% (in absolute terms), compared to the approach employed by standard AODV. We also show a significant potential improvement of up to 18% over the route repair strategy employed by the Dynamic On demand MANET (DYMO) routing protocol, which is based on AODV.

An infrastructure wireless mesh network (WMN) is a hierarchical network consisting of mesh clients, mesh routers and gateways. Mesh routers constitute a wireless mesh backbone, to which mesh clients are connected as a star topology, and gateways are chosen among mesh routers providing Internet access. In this paper, the throughput capacity of infrastructure WMNs is studied. For such a network with Nc randomly distributed mesh clients, Nr regularly placed mesh routers and Ng gateways, assuming that each mesh router can transmit at W bits/s, the per-client throughput capacity has been derived as a function of Nc , Nr , Ng and W . The result illustrates that, in order to achieve high capacity performance, the number of mesh routers and the number of gateways must be properly chosen. It also reveals that an infrastructure WMN can achieve the same asymptotic throughput capacity as that of a hybrid ad hoc network by choosing only a small number of mesh routers as gateways. This property makes WMNs a very promising solution for future wireless networking.

With the rapid development of information technology and the increasing application of UAV in various fields, the security problems of unmanned aerial vehicle (UAV) communication network have become increasingly prominent. It has become an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. In this paper, an efficient Digital Signature algorithm based on the elliptic curve cryptosystem is applied to routing protocol, and an improved security method suitable for on-demand routing protocol is proposed. The UAV communication network was simulated through the NS2 simulation platform, and the execution efficiency and safety of the improved routing protocol were analyzed. In the simulation experiment, the routing protocols of ad-hoc on demand distance vector (AODV), security ad-hoc on demand distance vector (SAODV), and improved security ad-hoc on demand distance vector (ISAODV) are compared in terms of the performance indicators of packet delivery rate, throughput, and end-to-end delay under normal conditions and when attacked by malicious nodes. The simulation results show that the improved routing protocol can effectively improve the security of the UAV communication network.

Wireless Mesh Networks (WMNs) are gaining a lot of attention from researchers due to their advantages such as easy maintenance, low upfront cost and high robustness. Connectivity and stability directly affect the performance of WMNs. However, WMNs have some problems such as node placement problem, hidden terminal problem and so on. In our previous work, we implemented a simulation system to solve the node placement problem in WMNs considering Particle Swarm Optimization (PSO) and Distributed Genetic Algorithm (DGA), called WMN-PSODGA. In this paper, we compare chi-square and uniform distributions of mesh clients for different router replacement methods. The router replacement methods considered are Constriction Method (CM), Random Inertia Weight Method (RIWM), Linearly Decreasing Inertia Weight Method (LDIWM), Linearly Decreasing Vmax Method (LDVM) and Rational Decrement of Vmax Method (RDVM). The simulation results show that for chi-square distribution the mesh routers cover all mesh clients for all router replacement methods. In terms of load balancing, the method that achieves the best performance is RDVM. When using the uniform distribution, the mesh routers do not cover all mesh clients, but this distribution shows good load balancing for four router replacement methods, with RIWM showing the best performance. The only method that shows poor performance for this distribution is LDIWM. However, since not all mesh clients are covered when using uniform distribution, the best scenario is chi-square distribution of mesh clients with RDVM as a router replacement method.

Cognitive Radio (CR) technology constitutes a promising approach to increase the capacity of Wireless Mesh Networks (WMNs). Using this technology, Mesh Routers (MRs) and the attached Mesh Clients (MCs) are allowed to opportunis- tically transmit on the licensed band, but under the constraint not to interfere with the Primary Users (PUs) of the spectrum. Thus, the effective deployment of CR- WMNs require that each MR must be able to: sense the current spectrum, select an available PU-free channel and perform the spectrum handoff to a new channel in case of PU arrival on the current one. How to coordinate these actions in the optimal way which maximizes the performance of the CR-WMNs while minimizing the interference to the PUs constitutes an open research issue in CR systems. In this paper, we propose an adaptive spectrum scheduling and allocation scheme which allows a MR to identify the best schedule of (i) when to sense the current channel, (ii) when to transmit, (iii) when to perform a spectrum handoff. Due the large number of parameters involved, we propose Reinforcement Learning (RL) techniques to allow a MR to learn by itself the optimal balance between spectrum sensing-exploitation- exploration actions based on network feedbacks coming from the MCs. We perform extensive simulations which confirm the adaptivity and efficiency of our approach in terms of increased throughput when compared with non-learning based schemes for CR-WMNs.

In Wireless Mesh Networks (WMNs), Mesh Access Points (MAPs) forward the packets from their associated mobile stations (STAs) to other stations or to the portal through a wireless multi-hop backhaul. The wireless backhaul has limited bandwidth and may become the bottleneck of the WMN easily when network load is heavy. Inspired by the fact that transmission from MAPs with good backhaul condition consumes less backhaul network resource, we propose a Mobility-Aware ReAssociation (MARA) control scheme that makes better use of the network resource by prolonging mobile stations association period with good backhaul MAPs. In MARA, STAs adjust their scan intervals and make association decisions based on the estimated moving directions and the association cost of nearby MAPs. Our simulation results show that the proposed scheme achieves improved end-to-end performance consistently under different network scenarios.

This paper evaluates and compares mobile ad hoc network (MANET) routing protocols for wireless sensor network (WSN). It focuses and compares the performance analysis based on Quality of Service (QoS) factors on the throughput and delay between Ad Hoc on Demand Distance Vector (AODV) and Temporary Ordered Routing Algorithm (TORA) protocols for mesh network with a single source. Ad Hoc on Demand Distance Vector is a reactive protocol and Temporary Ordered Routing Algorithm is on-demand reactive protocol which is the hybrid protocol. Previous research did shown that AODV is better than TORA for a larger nodes that is more than 30 nodes an some says that TORA is better for smaller nodes environment. In wireless ad hoc network, the nodes must be able to interconnect each other to establish the link or connection from source to the destination. The results show that AODV outperformed TORA in the throughput but AODV had higher delay than TORA. After the analysis has been done, this paper shows that AODV outperforms TORA in the wireless sensor network only with a single source and destination which less than 30 nodes in a network.

Growing demand in wireless Mobile Adhoc Networks due to their immense potential and effectiveness in varied applications had motivated researchers to control and optimize various parameters for efficient routing in mobile environment. The rapidly changing environment of the network due to mobility of nodes results in unpredictable topology and thus introduces primary challenge to design better and an efficient routing protocol. The network in such case lacks fixed infrastructure and common head centric design. MANET routing schemes use flooding to propagate packets in the network resulting retransmissions, collisions, and congestions which significantly degrade the performance of the network. Using GPS, knowing the geographical position of the sensor nodes, the protocol performance can be improved while reducing the number of retransmissions. The proposed work is a future extension of efficient flooding based on selective neighbours where the surrounding region limiting the transmission range is divided into eight quadrants or zones with the source at the centre called zone based selective neighbours (ZBSN). Flooding based on selective four neighbours suffers from few selection of hoping or forwarding nodes when the node density is low and does not meet the selection criteria around the source or forwarder node and may miss the chance of approaching the destination or requires large number of hops. This neighbour selection scheme uses the modified approach of the Adhoc on Demand Distance Vector (AODV) protocol to reduce the flooding of Route request (RREQ) packets, control the network overall traffic, improves link stability and the residual energy reducing the overheads by 24%.

This paper proposes a new multi-population based global optimization algorithm called Parallel Three Parent Genetic Algorithm (P3PGA). The proposed approach is an extension of 3PGA approach. Performance of the proposed algorithm was evaluated on the eleven CEC-2014 benchmark functions. We compared the performance of proposed P3PGA algorithm with 16 other algorithms. It was observed that out of the 11 benchmarks functions P3PGA outperformed all other 16 approaches on 5 benchmark functions. Out of 5, for 2 functions the best performance of P3PGA was also equaled by few other approaches. For the other 3 functions the performance of P3PGA was unmatched by any of the other 16 algorithms. Further, this paper proposes a new P3PGA based optimal route evaluation approach for routing in Wireless Mesh Networks. The proposed approach was implemented in MATLAB and simulated for various WMN sizes and scenarios. We compared its performance with 8 other approaches namely, Ad-hoc On Demand Distance Vector (AODV) approach, Dynamic Source Routing (DSR), Genetic Algorithm (GA), Biogeography Based Optimization (BBO), Firefly Algorithm (FA), Ant Colony Optimization (ACO), BAT and Big Bang-Big Crunch (BB-BC) based optimal cost route evaluation approaches. The P3PGA based approach outperformed all other 8 approaches for the WMNs sized 1000 nodes and above.