Ad-hoc Routing Protocols Research Articles

Security Mandated Analytics based Route Processing with Digital Signature [SMARPDS] - Pseudonymous Mobile Ad Hoc Routing Protocol

There are a lot of speculations going on about the interests for privacy in mobile network. Many research works have been proposed in the aspect and these works concentrate more on the anonymity part and there are quite a few implementations of these research works on some applications. Ad hoc routing protocols must have provision for both anonymity providing nature and restriction of information collection from unauthorized nodes. Till recent times, there are a number of ad hoc routing protocols that have been introduced. But, they have lack security features or authentication features or in some cases both. The lack of proper security features leads to a state of vulnerability which at any given point, will act as a threat element. In this paper, we propose Security Mandated Analytics based Route Processing with Digital Signature protocol [SMARPDS]. It is an anonymous and authentication providing routing protocol in Mobile Ad hoc network. In addition, routes are discovered based on analytics done on the node and its present location in the network. SMARPDS provides authentication during the route discovery and transmission process by employing digital signatures on node front and also on packets front.

An Enhanced Cross-Layer Approach Based on Fuzzy-Logic for Securing Wireless Ad-Hoc Networks from Black Hole Attacks

Black holes attack in wireless ad-hoc networks can obstruct network functions, e.g.; successful packets delivery ratio to destinations. Current conventional detection mechanisms are based on single layer information, lack of appropriate performance metrics, and/or the adequate accuracy. In this paper, a new cross-layer Intrusion Detection System (IDS) is proposed, in order to mitigate the black hole attack in wireless ad-hoc networks. The proposed work modifies ad-hoc routing protocol for black hole attacks detection through extracting information from different OSI layers, and use these information as inputs into the fuzzy logic system, in which the algorithm precisely detects existing malicious nodes. Using NS2 simulation tool, a comprehensive simulation is conducted in order to compare our proposed approach performance with a recent cross layer-based approach for black hole intrusion detection. Simulation results reveal that our proposed system has a tremendous accuracy in detecting black holes with an acceptable additional overhead. Our proposed IDS outperforms studied IDS in terms of successful packet delivery ratio (PDR).

PERFECT STRATAGEM FOR QUERY PROCESSING IN WSN

In a WSN, huge amount of data is generated by sensor nodes continuously. Data generated by nodes make a large distributed database. Information requirements for various applications can only be satisfied if the data available in the network is extracted to a suitable location and processed efficiently. However, query based systems are popular in database type environment. Wireless Sensor Networks find usage in a wide range of applications. It is possible due to various mechanisms such as adhoc routing protocols, in network data aggregation and signal processing etc. Performance of the network can be improved by tweaking these features. In order to evaluate performance of a network objectively a number of metrics have been defined. Some important ones are: lifetime, coverage, cost and ease of deployment, response time, temporal accuracy, security and effective sample rate. In this paper various metrics for WSN evaluation have been discussed. Many of these metrics are interrelated. Generally, performance in one metric may have to be decreased to achieve increase in some other metric.

Efficient way of implementing the random and GM (Gauss-Markov) mobility model in MANET

In Mobile Adhoc Network (MANET) nodes are communicating each other with the help of routing protocol. In Adhoc networks, a node having high mobility, with that node’s moving randomly from node to node. For observing the movement mobility, we are studying different forms of mobility. These models can deploy the mobility of the network condition, including the various parameters such as the size of the network, traffic models of data, throughput and the PDR (Packet Delivery Ratio) are used as performance Parameters. We are investigating the RWP (Random Waypoint) and GM (Gauss-Markov) mobility model to express efficiency of Adhoc routing protocol by using the OMNET++ simulator .The result of the simulator shows that the mobility has more influence upon MANET protocol with the increasing node density. Here, we evaluated RWP and GM mobility model with AODV protocol. The study of these models illustrates dissimilar outcomes related inputs with the increasing performance of the pause time rises among the speed and number of nodes.

Simulation Analysis of Routing Protocols in Hybrid wireless network

A wireless hybrid network; integration of wireless ad hoc network and wireless infrastructure network is recognized as superior option for next generation wireless networks. Such network focuses to support of continuous transmission with strong Quality of Service (QoS). In hybrid networks, the way to guarantee quality of service (QoS) remains a hot problem, where it is observed that due to the direct adoption of QoS based reservation resource routing for MANET, hybrid networks inherit problems of resource reservation and invalid racing conditions. The article presents the working of two AdHoc routing protocols (DSDV and AODV+) in hybrid systems in relation with different network complexities. It is observed that both protocols performed indistinguishably to the extent of the throughput. For jitter, PLR and PDR, the AODV+ performed superior to DSDV; except for the intricacy situation of system, while DSDV performed ineffectively.

Performance Analysis of Cluster-Based Multi-Hop Underlay CRNs Using Max-Link-Selection Protocol

In this paper, we study the performance of a cluster-based multihop underlay cognitive radio network using an ad-hoc routing protocol (called max-link-selection protocol) with decode-and-forward relays over Rayleigh fading channels. Both peak-power and peak-interference constraints are considered in the system. At first, the end-to-end exact and asymptotic outage probabilities of the considered system are derived. By using the derived asymptotic outage, an approximate expression for the optimum number of hops that minimize the outage probability is derived for fixed-rate and fixed-distance between the source and destination nodes. Later, the exact and asymptotic expressions are derived for end-to-end symbol-error-rate (SER) and ergodic-rate of the considered system. Numerical results are presented to validate the derived analytical expressions. It is shown by analysis that with increasing number of relaying hops between the source and destination, the SER performance improves but the ergodic-rate declines.

T-AODV Heuristic based Trust implementation in Ad-hoc Routing Protocol for Wireless Sensor Networks

T-AODV Heuristic based Trust implementation in Ad-hoc Routing Protocol for Wireless Sensor Networks

Novel routing protocol scheme for real-time applications in mobile Ad Hoc networks

In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.

New Modified AODV for MANET

Mobile Communication is a wireless connection between two nodes which is having limited bandwidth and high rate of data disconnnection. So there is a requirement of new MANET routing protocol having low rate message overhead. Hence it is necessary to enhancement the performance of MANET. The reduction of routing overhead decreases the usage of bandwidth of the network. The increase of bandwidth will increase the throught and decrease the latency of the nodes of the network. This Paper proposes the new Routing Protocol which will increase the throughput,reliability and decrease the latency of the network. 1. Introduction:The mobile adhoc network[1] does not have any fixed infrastructure and base station of the network and thats why the name is used.There are many applications for ad-hoc networks like conferencing, emergency services, personal area networks, embedded computing, and sensor dust. A MANET is a network that allows direct communication of two nodes, when radio propagation conditions exist between two nodes. If there is no direct connection between the source and the sink nodes, multi-hop routing is used. In multi-hop routing, a packet is forwarded from one node to another, until it reaches the destination. A routing protocol is necessary in adhoc networks; this routing protocol has to adapt quickly to the frequent changes in the adhoc network topology. Ad-hoc routing protocols are classified into three categories. The first category is Table-driven (Proactive) routing protocols such as DSDV [2], CGSR [3], GSR [4], FSR [5], and OLSR [6]. The second category is on-demand (Reactive) routing protocols such as AODV [7], DSR [8], ABR [9], SSA [10], and TORA [11]. The third category is Hybrid (Reactive and proactive) routing protocols such as ZRP [12] and ZHLS [13].

Cooperative Watchdog in Wireless Ad-Hoc Networks

For fault-tolerant wireless ad-hoc networks, detection and notification of failure of intermediate wireless nodes are critical. Until now, various failure detection and notification methods for recovery such as timeout and watchdog have been proposed for stop failure and Byzantine failure restricted to different data message transmissions. In order to avoid desperate cases such that correctly working wireless intermediate nodes are inappropriately taken away from the wireless multihop transmission routes due to malicious failure notification, this paper proposes a novel cooperative watchdog method. Here, not only the previous-hop intermediate wireless nodes as in the conventional watchdog method but also another neighbor wireless node observe transmissions of both data messages and control messages such as failure notification to detect failure of an intermediate wireless node. This paper also proposes an ad-hoc routing protocol to determine both a sequence of intermediate wireless nodes and additional observing wireless nodes for the cooperative watchdog.

Trusted and Secured Routing Protocol for Vehicular Ad-Hoc Networks

Objectives: To establish a trust based secured routing protocol to accurately distinguish malicious nodes that are dropping the important information and modifying the routes. Efforts are made to identify malicious nodes such as route modifiers and packet droppers. Methods/Statistical Analysis: Vehicular Ad-hoc NETworks (VANETs) is a modern technology which help a vehicle and a driver in several ways. The main characteristics of VANETs are nodes i.e. vehicles with relatively high mobility and constantly changing topology. In case of data communication in VANETs, a source node must depend on the intermediate nodes to send its data packets to the destination node on multi-hop routes. VANETs can give better performance if all its nodes work properly with full cooperation during the communication. In VANETs, a node can generate and broadcast important and essential messages to other nodes in the network for safety reason. However, the generated message by a vehicle may not be reliable every time. In this paper we have proposed a trusted and secured routing protocol that evaluates the trust of a vehicle and also checks the message reliability. The proposed protocol is named as Trusted Vehicular Ad-hoc On-demand Distance Vector (TVAODV) routing protocol which is the modification of Ad-hoc On-demand Distance Vector routing protocol. Since VANETs are mostly attacked by the malicious nodes; therefore better security solution is needed to stop such attacks. The proposed protocol introduces a trust model to establish a malicious node free route for source node to send its data packets to the destination node on multi-hop routes. Findings: The TVAODV protocol is simulated in Network Simulator (NS2) to check the performance and accuracy and also compared to AODV routing protocol. It is found that TVAODV is comparatively better in performance when VANET is in high mobility and versatile topology. The performance of the proposed protocol is evaluated using performance measurement metrics: average end-to-end delay, throughput, routing load and packet delivery ratio. The proposed protocol performance is evaluated in the presence of malicious (route modifiers and packet droppers) vehicles and the results shows that the proposed protocol is achieved better accuracy and it shows better performance compared to AODV routing protocol. Application/Improvements: The proposed protocol may be useful in the process of developing a better traffic management and transportation system. In this paper we have proposed a TVAODV routing protocol which includes trust model to evaluate the trust of vehicles as well as to establish a malicious free route.

A Survey on Routing Protocols and QoS in Mobile Ad Hoc Networks (MANETs)

Objective: MANET is a collection of wireless mobile devices, mobility and scalable network. These key details are behind the fame of MANETs. A good survey is done on QoS and routing protocols. This study presents merits and demerits of some of the QoS routing protocols. Also, a thorough investigation has been carried out on the current problems and feature trials that are in the field of MANETs. Findings: Every routing protocol must provide Quality of Service (QoS): With intent to improve bandwidth, delay, jitter, and energy consumption. The purpose of any ad-hoc network routing protocol is to meet these challenges. Therefore, it becomes an essential parameter for MANETs to develop a proficient routing and QoS procedures. Some QoS routing-protocols are proposed newly by various characteristics. A similar survey is done on QoS and routing protocols. It has been observed that Maximizing accuracy, Minimizing overhead, Maintaining route, Reserving resources, reducing power utilization, reliability are unsolved issues. Applications: The designing of these routing protocols is an interesting task because of mobility, the dynamic behavior of the Mobile Ad-hoc Networks. This study is helpful for designing new routing protocols with improved QoS in MANETs.

A Derivation of Ad Hoc Routing Protocol from AODV using Communication Reliability

A Derivation of Ad Hoc Routing Protocol from AODV using Communication Reliability

Study Based on Mobile Ad Hoc Routing Protocols in Control System

Study Based on Mobile Ad Hoc Routing Protocols in Control System

Comparative Study for Performance Analysis of Routing Protocols in Mobility and Non-Mobility Scenarios

A Mobile Ad-hoc Network (MANET) has a collection of numbers of wireless nodes which is each device in MANET having ability to free to move in any direction so that it is useful in all applications. In MANET nodes change position quite frequently, this means that we have need routing protocols that quickly adapts to topology changes. An ad-hoc network is self-organising and distributive in manner. The MANET is works as router so that linked with the other nearest devices. A mobile ad hoc network (MANET) is a wireless network follows the multiple hop routing instead of static network infra to provide network connectivity. Each device in a MANET is free to move independently in all direction freewaysand will therefore nodes change position in large networks all routing protocols. The routing protocols are needed for conveying information in Ad-hoc network there are various performance parameters to compare the Ad-hoc routing protocols. My area of interest in this paper to analyze the different performance parameters Recent research has focused on simulation studies with mobility and non- mobility scenarios to investigate and improve routing protocols. we have simulate the all three routing protocols in mobility as well as non-mobility scenario with nodes up to 300 also plot the graphs throughput, Delay, PDR, Dropping Ratio, and average energy consumption by using Network Simulator version 2.34. ).

T2AR: trust-aware ad-hoc routing protocol for MANET.

Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design.

Modelling and Simulating Access Control in Wireless Ad-Hoc Networks

There has been a great increase in the use of wireless networks over the years; Mobile Ad hoc Network is an example of such wireless network. It functions without any central administration and the network is made up of a collection of nodes within a radio frequency. Security in mobile network has been an area of great research over the years mainly because most ad hoc protocols do not provide the basic security framework and services. This paper aims at simulating access control in wireless ad-hoc networks. The objectives are to ensure that the network is not vulnerable and should also devoid of any form of malicious attack that could prevent authorized access. Two metrics (packet delivery ratio and traffic overhead) were used to measure the effectiveness and efficiency of the networks. Through a detailed simulation study, we show that the protocol is efficient and allows a trade-off between security and performance. This research focuses on designing an access control mechanism that was incorporated within ad-hoc routing protocols with the aim of adding an extra layer of security against threats in the network. The three stage-process for access control was implemented with NS-2 v 35. The nodes in the simulation were created dynamically, the movement between nodes was generated randomly and the connections between the nodes were done using Constant Bit Rate (CBR) connection which was aimed at enabling the network to mimic a real life scenario. Through different experiments and simulations done, it was observed that the access control model works and also provides a higher level of security for ad-hoc networks even when under security threats and attacks.

A reliable, delay bounded and less complex communication protocol for multicluster FANETs

Recently, Flying Ad-hoc Networks (FANETs), enabling ad-hoc networking between Unmanned Aerial Vehicles (UAVs) is gaining importance in several military and civilian applications. The sensitivity of the applications requires adaptive; efficient; delay bounded and scalable communication network among UAVs for data transmission. Due to communication protocol complexity; rigidity; cost of commercial-off-the-shelf (COT) components; limited radio bandwidth; high mobility and computational resources; maintaining the desired level of Quality of Service (QoS) becomes a daunting task. For the first time in this research we propose multicluster FANETs for efficient network management; the proposed scheme considerably reduces communication cost and optimizes network performance as well as exploit low power; less complex and low cost IEEE 802.15.4 (MAC) protocol for intercluster and intracluster communication. In this research both beacon enabled mode and beaconless modes have been investigated with Guaranteed Time Slots (GTS) and virtual Time Division Multiple Access (TDMA) respectively. The methodology plays a key role towards reserving bandwidth for latency critical applications; eliminate collisions and medium access delays. Moreover analysis ad-hoc routing protocols including two proactive (OLSR, DSDV) and one reactive (AODV) is also presented. The results shows that the proposed scheme guarantees high packet delivery ratios while maintaining acceptable levels of latency requirements comparable with more complex and dedicatedly designed protocols in literature.

Network coding for hop-by-hop communication enhancement in multi-hop networks

In our recent study, we introduced the PlayNCool protocol that increases the throughput of the wireless networks by enabling a helper node to strengthen the communication link between two neighboring nodes and using random linear network coding. This paper focuses on design and implementation advantages of the PlayNCool protocol in a real environment of wireless mesh networks. We provide a detailed protocol to implement PlayNCool that is independent from the other protocols in the current computer network stack. PlayNCool performance is evaluated using NS–3 simulations and real-life measurements using Aalborg University’s Raspberry Pi test-bed. Our results show that selecting the best policy to activate the helper node is a key to guarantee the performance of PlayNCool protocol. We also study the effect of neighbor nodes in the performance of PlayNCool. Using a helper in presence of active neighbors is useful even if the channel from helper to destination is not better than the channel between sender and destination. PlayNCool increases the gain of end-to-end communication by two-fold or more while maintaining compatibility to standard wireless ad-hoc routing protocols.

Comparative Study of Ad-hoc Routing Protocol for Oil and Gas Pipelines Surveillance System

Comparative Study of Ad-hoc Routing Protocol for Oil and Gas Pipelines Surveillance System