Towards sensitive link quality prediction in ad hoc routing protocol based on grey theory

Mobile Ad hoc Networks (MANET) are structure less, autonomous wireless networks with mobile nodes that dynamically establish data transmission connections. Due to dynamic topological change, MANET routes are unbalanced and break repeatedly. Hence, providing efficient and reliable data delivery with effective utilization of network resources is a challenging issue to be considered in MANET. This paper proposes an instant-runoff Ranked Decision Forests Probit Regression-based Connectionist Multilayer Deep Neural Network (IRDFPR-CMDNN) for efficient data transmission and higher data delivery with a minimum end-to-end delay. This IRDFPR-CMDNN method performs route identification, data delivery, and route maintenance with more than three layers. Then the mobile nodes are sent to the input layer of the Connectionist Multilayer Deep Neural Network. In hidden layer 1, the Instant-runoff Ranked Decision Forests algorithm is applied for classifying the mobile nodes depending on the residual energy and load capacity. With selected mobile nodes, the Probit Regression is applied for finding the nearest neighboring nodes in the second hidden layer based on the link quality and received signal strength for route path establishment. Then multiple paths for routing are established from source to destination node and start to perform the data transmission. If link failure occurs during the data transmission, another alternative route with better link quality is selected for routing. In this way, energy-efficient data transmission is performed from source to destination with a higher data delivery rate and minimal time consumption. Experimental evaluation is carried out on energy consumption, packet delivery ratio, packet drop rate, throughput, and end-to-end delay with varying numbers of mobile nodes and data packets. Simulation results show that the IRDFPR-CMDNN technique effectively enhances data delivery, throughput and minimizes energy consumption, packet loss rate, delay with respect to conventional methods.

Mobile ad hoc networks (MANETs) are consists of mobile devices connected wirelessly. Mobile nodes in MANET are applicable of routing functionality, where messages are forwarded in a multi-hop fashion. In such a communication scheme a routing protocol play an important role in the network performances. The wireless connectivity and node mobility in MANET networks contributes in rapid topological changes, which brings the need for a channel aware routing protocol. To overcome this problem, many channel aware routing metrics are proposed in the literature, however these routing metrics are either utilizing the shared bandwidth to measure the link quality, or they implies less awareness to the link quality. This paper proposed a SNR-based routing metric for Dynamic Sequence Distance Vector (DSDV) routing protocol. This paper starts by investigate and compare the performance among common routing protocols in MANET. Secondly a cross layer approach is proposed for the new routing metric. Simulation scenarios are used for the work of the paper. The new metrics is implemented in one of the MANET common routing protocols DSDV module in MONET++. The results show that SNR-based DSVD improves the performance of the MANET in terms of throughput and delay.

Macromobility support for mobile ad hoc networks using IPv6 and the OLSR routing protocol

Ad Hoc Routing with Distributed Ordered Sequences

Background:AMobileAdHocNetwork (MANET) consistsofmany independentnodes that operate over awireless topology with numerous Quality of Service (QoS) requirements. So, a robust routing protocol that also provides QoS parameters to its different range of applications is needed. Various network parameters like node density, node mobility, field size etc. also effects the QoS parameters of MANETs. Methods: The traditional reactive routing protocols do not have any backup route in case of a node failure and hence are not effective for MANETs. Ad Hoc on Demand Distance Vector Backup Routing (AODV BR) protocol performs better than traditional routing protocols but is not effective when the backup route fails. So, to counter this problem, the authors had proposed AODV nth BR that keeps on providing backup routes when multiple nodes fail and hence successfully transfers the data to the destination. The nodes for backup routing are selected based on their distance from the failed node and energy efficiency. Results: In this paper, the performance of AODV nth BR has been compared with AODV, DSR and AODV BR protocol under varying node density (nodes 20, 60,100) and node mobility conditions (5m/s, 20m/s, 50m/s). The values for Packet Delivery Fraction (PDF) for 60 nodes at speed 20m/s in case of AODV nth BR protocol after 6000 rounds is 0.3054. Comparatively, value of AODV BR is 0.2664, AODV is 0.1936 and DSR is 0.1056. QoS performance is measured in terms of end to end delay, packet delivery fraction and lifetime of devices and it has been shown through simulated results that AODV nth BR protocol gives better output than traditional routing protocols. Conclusion: From the simulated results explained in detail in the paper, it has been observed that route after link breakage is found to be best with AODV nth BR protocol and this can be clearly seen in the QoS parameters obtained.Keywords: AODV BR, AODV nth BR, MANETs, Node Density, Node Mobility

Recent advances in wireless networking technologies have made it possible to construct a mobile ad hoc network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, they are much more vulnerable to malicious attacks than a conventional wired network. In MANET, routing plays an important role in providing connectivity for mobile nodes who are not within the same radio range. Existing routing protocols in MANET assume a trusted and reliable environment. However, in hostile environment mobile nodes are susceptible to various types of routing attacks. This paper identifies a new routing attack, called node isolation attack, against optimized link state routing (OLSR) protocol, one of the four standard routing protocols for MANETs. We analyze in detail and demonstrate the impact of this attack in order to show the necessity for a countermeasure to guard against the attack. As a first step to defend against the attack, we present a simple technique to detect the attack and identify the source of the attack

Mobile ad hoc network (MANET) is a collection of several wireless devices or mobile users that can communicate among themselves over wireless links in a peer to peer basis and thereby creating a dynamic, arbitrary graph. But some adverse characteristics of MANET like dynamic topology, limited bandwidth, link failure and energy constraints, imposes new demands on routing protocol. This paper aims to study the performance evaluation and comparison of three prominent routing protocols: Destination Sequence Distance Vector (DSDV), Ad-hoc On demand Distance Vector (AODV) and Optimized Link State Routing (OLSR), in a real life scenario. In a given scenario, students investigate the historical site in which number of packets being sends and number of nodes in the network affects the communication reliability. Extensive simulations are made to evaluate the performance of these protocols using various performance differential metrics like packet delivery ratio, total energy consumption and throughput using NS-3.29. In the end it is seen that in most simulation results, proactive routing protocols (DSDV, OLSR) performed significantly better than reactive routing protocols.

In mobile ad hoc networks (MANETs), the frequent changes of network topology due to node mobility increases the cost of maintaining deterministic routing. As one state-less routing protocol, opportunistic routing utilizes the nature of broadcast and does not have to maintain deterministic routes. However, broadcast may cause interference to some nodes and affect the transmission quality between nodes. Thus, how to adapt opportunistic routing to the dynamic environment and avoid unreliable transmissions are two important issues to solve. In this paper, we propose an opportunistic routing protocol based on link quality and local topology (OR-LqT) in MANETs. In the protocol, we measure link qualities by considering both interference and nodes' mobility to find the candidate set, and select a next forwarding node by prioritizing the neighbor nodes based on their locations, local topology and moving adaptivity. The proposed OR-LqT can avoid the number of unreliable transmissions and the number of dead-ends. The performance results show that compared to the conventional routing protocols, such as AODV, $\mathbf{PRR}^{\ast}\mathbf{d}$ and GPSR, the OR-LqT decreases the number of dead-ends by more than 33.5%, packet drop ratio by more than 21%, average delay by more than 22% and overhead by more than 21%.

Mobile Ad hoc Network (MANET) is a one that has decentralized, self-organized and self-configurable network. All mobile nodes are moving arbitrarily. It consists of mobile wireless nodes that communicate themselves without any well defined infrastructure and also do not required any interference of third party base station. MANET’s routing protocols are classified in three categories. Proactive, Reactive and Hybrid Routing Protocols are three routing Protocols. But we basically Focus on only one of each routing protocol by varying by Data Dropped and Retransmission. In this paper we analysis performance of routing protocol by using mobility models vector mobility and random way point. We are focusing performance comparison on routing protocols on Optimized Link State Routing (OLSR) is proactive routing protocol also known as table driven protocol, (AODV)Ad Hoc on Demand Distance Vector is Reactive Routing Protocol and also establish a connection on demand and third one is Gathering-based Routing Protocol (GRP) which is hybrid routing protocol. In this paper we have compare two mobility models with above three protocols. In simulation results AODV shows best results by using OPNET 14.5 simulators. We can also compare its performance by using 50 nodes and show its outcome with the help of comparison table.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Mobile ad hoc networks (MANETs) are becoming more popular to wireless communications due to wide acceptance of mobile devices. In this paper, attempt has been made to evaluate the performance of proactive routing protocols through MATLAB. Simulations is carried over Optimized Link State Routing (OLSR), Destination-Sequenced Distance-Vector (DSDV) and Wireless Routing Protocol (WRP) routing protocols. We evaluate the Throughput, Packet Delivery Ratio (PDR), MAC collision, and Error Rate for said protocols.The evaluation results show that OLSR has the best performance than other protocols. Keywords: OLSR, DSDV, WRP, Proactive protocols, MANET’s

Mobile ad hoc networks (MANET) are wireless mobile nodes that communicate without any predefined infrastructure. MANET routing protocol acting an important role to get these types of communication. The two routing protocols which are DSR and AODV have been studied in specified form. Most of the attacks on MANETs are routing protocol attacks. The sinkhole attack is a type of routing protocol attack which is further affecting the network by attempting to draw all network traffic to malicious nodes which broadcasts fake shortest path routing data and information. This research paper is based on the sinkhole attack which basically gets all the present resources in the standard structure which is few mobile ad hoc networks. We have also look over the complicated view on the signature-based Algorithm to prevent illegal data packet tampering on the mobile ad hoc network. These security attacks has to be observed in detail and the solutions to avoid them and the methods to overcome these attacks in mobile ad hoc network has to be devised and formulated. Basically, this paper discussed about the Sinkhole attack in the field of routing protocols, named as AODV and DSR. Keywords: AODV, DSR, ZRP, MANET, RREQ, RREP, PDR Cite this Article Mayank Satya Prakash Sharma, Ranjeet Singh Tomar, Prashant Shrivastava, Nikhil Mittal. Performance of Network Node in Presence of Sinkhole Attack in MANET . Journal of Telecommunication, Switching Systems and Networks. 2018; 5(1): 6–13p.

Real-time and accurate link quality prediction is essential for wireless sensor networks. In order to improve the agility of link quality prediction, physical layer parameters such as signal-to-noise ratio (SNR) were used directly to evaluate the link quality so as to avoid taking a long time to compute packet reception ratio. However, existing link quality prediction mechanisms often ignore the temporal correlation of physical layer parameter sequences when predicting these parameters. In response to this problem, this paper proposes RNN-SNR, a more effective link quality prediction mechanism utilizing the short-term memory characteristics of recurrent neural network. This mechanism is able to mine the internal relationship of SNR sequences more accurately, so it could reduce the prediction error effectively. Compared with the similar mechanism, RNN-SNR has higher prediction accuracy under different link qualities. Especially under moderate links, the prediction error is reduced by 21.43%.

Mobile Ad hoc Network (MANET) is the kind of ad hoc networks that dynamically form a temporary network by connecting the mobile nodes without any support of central administration and wires. This work coins the difficulties of delivering the data packets to the MANET circumstance in a reliable fashion and in good timely manner, which reside to be a highly dynamic in nature. In MANET, there are several routing algorithms, which consume topology information to make routing decisions at each node. Practical routing protocols must handle intermittent connectivity and the absence of end-to-end connections. An Efficient Position-Based Opportunistic Routing (EPOR) protocol is proposed and it will be able to take the advantage of stateless property, which uses two terms (1) geographic routing (2) broadcast nature of wireless medium. When the packet transmission starts, neighbor nodes have chance to overhear the transmission of messages, and it will act as a forwarding candidate. Thus, the node which was overheard the transmission information will forward the packets by enhancing the informations. The apt forwarder will identify the falsely relay node within a limited amount of time. The proposed algorithm removes the drawbacks of the existing GPSR and AOMDV. The additional latency occurred by the local route recovery has maximum being reduced and the duplicate relaying due to packet reroute can also be decreased. The proposed scheme of Virtual Destination-based Void Handling (VDVH) combined with EPOR protocol in a communication hole. The EPOR result demonstrates that can able to succeed the greater performance even under high mobility of nodes with considerable overhead and the new VDVH scheme also works well. This paper focuses on various performance evaluation metrics such as latency, throughput for the EPOR routing protocols and experimentally compared the performance of three routing protocols using NS-2 simulator.

<p>Mobile Ad Hoc Network (MANET) consists of a group of mobile or wireless nodes that are placed randomly and dynamically that causes the continual change between nodes. A mobility model attempts to mimic the movement of real mobile nodes that change the speed and direction with time. The mobility model that accurately represents the characteristics of the mobile nodes in an ad hoc network is the key to examine whether a given protocol. The aim of this paper is to compare the performance of four different mobility models (i.e. Random Waypoint, Random Direction, Random walk, and Steady-State Random Waypoint) in MANET. These models were configured with Optimized Link State Routing (OLSR) protocol under three QoS (Quality of Service) <a title="Learn more about Metrics" href="https://www.sciencedirect.com/topics/engineering/metrics">metrics</a> such as the Packet Delivery Ratio (PDR), Throughput, End-to-End delay. The simulation results show the effectiveness of Steady-State Random Waypoint Mobility Models and encourage further investigations to extend it in order to guarantee other QoS requirements.</p>