ML-based Network Pruning for Routing Data Overhead Reduction in Wireless Sensor Networks

Routing in Wireless Sensor Networks (WSNs) is one of the tasks that heavily impact network lifetime: current routing protocols, such as Ad-hoc On-demand Distance Vector (AODV), generate excessive and rather unnecessary overhead for route discovery, which in turn contributes to deplete the limited power resources of sensors. In this work, we propose a novel machine learning-based approach to perform network pruning during route discovery aiming at reducing data overhead. Our approach assumes that sensor nodes are aware of their locations and have processing capabilities to run lightweight machine learning algorithms. We perform extensive simulations considering WSNs consisting of different amounts of nodes. Results show that our proposed approach can reduce data overhead by 50% to 65%, depending on the amount of nodes and pruning aggressiveness

Protector Control PC-AODV-BH in The Ad Hoc Networks

In this paper we deal with the protector control that which we used to secure AODV routing protocol in Ad Hoc networks. The considered system can be vulnerable to several attacks because of mobility and absence of infrastructure. While the disturbance is assumed to be of the black hole type, we purpose a control named "PC-AODV-BH" in order to neutralize the effects of malicious nodes. Such a protocol is obtained by coupling hash functions, digital signatures and fidelity concept. An implementation under NS2 simulator will be given to compare our proposed approach with SAODV protocol, basing on three performance metrics and taking into account the number of black hole malicious nodesComment: submit 15 pages, 19 figures, 1 table, Journal Indexing team, AIRCC 201

Structured Peer-to-Peer Overlay Deployment on MANET: A Survey

There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems

Design and Performance Analysis of an Aeronautical Routing Protocol with Ground Station Updates

Aeronautical routing protocol (AeroRP) is a position-based routing protocol developed for highly dynamic airborne networks. It works in conjunction with the aeronautical network protocol (AeroNP). AeroRP is a multi-modal protocol that operates in different modes depending on the mission requirements. Ground station (GS) update mode is an AeroRP mode in which the GS sends geolocation or topology updates to improve routing accuracy. The main contribution of this thesis is to develop and implement the GS updates in AeroRP and analyse its performance in the various modes and compare them against canonical MANET routing protocols such as DSDV, OLSR, AODV, and DSR. The simulation analysis shows that AeroRP outperforms the traditional MANET protocols in various scenarios

A Balanced Battery Usage Routing Protocol to Maximize Network Lifetime of MANET Based on AODV

International audienceEnergy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. Failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes, sparse network connectivity and a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the network. In this paper, we are designing and evaluating a novel energy aware routing protocol called a balanced battery usage routing protocol (BBU) which uses residual energy, hop count and energy threshold as a cost metric to maximize network life time and distribute energy consumption of Mobile Ad hoc Network (MANET) based on Ad hoc on-demand Distance Vector (AODV).The new protocol is simulated using Network Simulator-2.34 and comparisons are made to analyze its performance based on network lifetime, delivery ratio, normalized routing overhead, standard deviation of residual energy of all Nodes and average end to end delay for different network scenarios. The results show that the new energy aware algorithm makes the network active for longer interval of time once it is established and fairly distribute energy consumption across nodes on the network

SNR-Based OLSR Routing Protocol for Wireless Mesh Networks

Wireless Mesh Networks (WMNs) consist of a collection of mobile and fixed nodes that form a network. Nodes are capable of communicating with each other either with infrastructure, or infrastructureless, or in a hybrid mode. The major advantages of WMNs over the other wireless networks are the low-cost, self organization, self configuration, last mile internet solution, scalability, and reliability. These advantages have attracted the researcher over the last five years. WMNs technology is gaining an increased attention from the Institute of Electrical and Electronics Engineers (IEEE) community. This led the IEEE organization to emerge a special working group (IEEE 802.11s) in charge of the issues deriving from a completely wireless distribution system used to interconnect different Basic Service Sets (BSSs) through secure and performing links. In a multi-hop networks, like WMN, one of the main factors that influences the performance is the routing protocol. Generally speaking, routing protocols can be classified based-on the routing metric to 1) hop count-based routing protocols, like Adhoc on demand distance vector (AODV) where the optimum path is defined as the path that goes through the minimum number of nodes, 2) the link quality-based routing protocols, like OLSR where some metrics such as the bandwidth and the packet error rate are considered to define the optimum path to the destination. In this work the performances of a three commonly used routing protocols are compared. The main goal of this stag is to study the influence of different routing protocols in WMNs. The comparison is conducted with two scenarios of networks; a high mobility network and a low mobility network. (Open network) OPNET 11.5 modeler is used to build the WMNs. The performance of the network and the routing protocols has been studied in means of network throughput, End-to-End delay, routing protocol overhead and the mobility. The obtained results show that the Optimized link state routing protocol (OLSR) has the highestthroughput overDSR andAODVrouting protocols in WMNs. The unpredictable behavior of the wireless medium in WMNs environment demands the need for a routing protocol that is aware of the link conditions. Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. In the second stage of this work a new routing technique for WMNs based-on Signal to noise ratio (SNR) as a new metric for OLSR routing protocol, is developed. The new metric has been implemented on the OLSR routing protocol module using OPNET simulator. The modified OLSR routing protocol is implemented in the comparison scenarios. The obtained results show that, when SNR is used as a routing metric in the OLSR routing protocol, the OLSR is getting the significantly higher network throughput over the DSR and AODV routing protocols. In the same time, the modified OLSR implemented with the SNR metric is showing a high improvement over the OLSR with the traditional hop-count metric. This thesis also studies the affect of different amounts of mobility in WMNs performance. VI

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