Route Discovery Process Research Articles

FLOODING ATTACK AWARE SECURE AODV

Providing security in a Mobile Ad hoc Network (MANET) is a challenging task due to its inherent nature. Flooding is a type of Denial of Service (DoS) attack in MANET. Intentional flooding may lead to disturbances in the networking operation. This kind of attack consumes battery power, storage space and bandwidth. Flooding the excessive number of packets may degrade the performance of the network. This study considers hello flooding attack. As the hello packets are continuously flooded by the malicious node, the neighbor node is not able to process other packets. The functioning of the legitimate node is diverted and destroys the networking operation. Absence of hello packet during the periodical hello interval may lead to wrong assumption that the neighbor node has moved away. So one of the intermediate neighbor nodes sends Route Error (RERR) message and the source node reinitiates the route discovery process. In a random fashion the hello interval values are changed and convey this information to other nodes in the network in a secured manner. This study identifies and prevents the flooding attack. This methodology considers the performance parameters such as packet delivery ratio, delay and throughput. This algorithm is implemented in Secure AODV and tested in ad hoc environment. The result of the proposed algorithm decreases the control overhead by 2%.

Optimized Quality of Service for Real-Time Wireless Sensor Networks Using a Partitioning Multipath Routing Approach

Multimedia sensor networks for real-time applications have strict constraints on delay, packet loss, and energy consumption requirements. For example, video streaming in a disaster-management scenario requires careful handling to ensure that the end-to-end delay is within the acceptable range and the video is received properly without any distortion. The failure to transmit a video stream effectively occurs for many reasons, including sensor function limitations, excessive power consumption, and a lack of routing reliability. We propose a novel mathematical model for quality of service (QoS) route determination that enables a sensor to determine the optimal path for minimising resource use while satisfying the required QoS constraints. The proposed mathematical model uses the Lagrangian relaxation mixed integer programming technique to define critical parameters and appropriate objective functions for controlling the adaptive QoS constrained route discovery process. Performance trade-offs between QoS requirements and energy efficiency were simulated using the LINGO mathematical programming language. The proposed approach significantly improves the network lifetime, while reducing energy consumption and decreasing average end-to-end delays within the sensor network via optimised resource sharing in intermediate nodes compared with existing routing algorithms.

ASROP : AD HOC Secure Routing Protocol

Mobile ad hoc networks (MANETs) are a new concept of wireless communications for mobile devices, which offer communications over a shared wireless channel without any pre -existing infrastructure. Their wireless nature and self-organizing capabilities are some of MANET's biggest advantages, as well as their biggest security restrictions. Forming end -to-end secure paths in such MANETs is more challenging than in conventional wireless cellular/wired networks due to the lack of central authorities. An atta cker can easily disrupt the routing process by injecting false control messages, changing the paths of packets or simply by blocking the packets of other nodes. In this paper, we propose a novel efficient secure routing protocol, named ASRoP, to effectivel y secure the routing discovery process in ad hoc networks. ASRoP provides powerful security extensions to the reactive AODV protocol, based on Diffie -Hellman (DH) algorithms and our modified secure remote password protocol. The simulation results show the efficiency of the proposed ASRoP protocol, and its cost towards both the users and the network. ASRoP promises to offer a real opportunity to prevent attacks related to lack of authentication without degrading routing performance.

Cross-Layer Design for Reducing the Energy Consumption based on Mobility Parameter in DSR for Mobile Ad-Hoc Network

Problem statement: The main idea is to design an energy efficient algorithm for reducing the amount of overhearing based on RSS value in a Mobile Ad-hoc Network (MANET). Approach: A cross layer framework is designed by combining the physical, MAC and network layer. RSS value is taken from the physical layer and it is used for finding the Mobility Parameter (MP). MP value determines the level of overhearing and rebroadcast probability. The energy conservation is achieved by integrating the 802.11 PSM with DSR. In 802.11 PSM, all the nodes are in low power sleep state, but the disadvantage here is unconditional overhearing. So, a conditional overhearing mechanism is proposed based on mobility parameter to reduce the energy consumption. This mechanism reduces energy consumption but at the same time, the node mobility results in more stale routes in route cache of DSR over a period of time. This occurs due to the lack of route cache updation. In the proposed design, RSS value determines whether to select the link or not prior to the route discovery process. Results: Simulation results are compared for Packet Delivery Ratio (PDR) and energy consumption. MP based conditional overhearing shows a 3.2% PDR improvement. It achieves a 20% power saving, if the pause time crosses 300 sec. For the packet injection rate of 2 packets/sec, under no mobility condition, it utilizes 50 joules lesser energy consumption compared to Random Cast. Conclusion: The NS-2 simulation results reveal that the proposed work is energy efficient by reducing the amount of overhearing and also it eliminates the stale routes compared to the classical methods.

A counter measure to Black hole attack on AODVbased Mobile Ad-Hoc Networks

Security is a major threat and essential requirement for mobile Ad Hoc network. Due to its inherent characteristics, it has many consequent challenges, which needs to be taken care of. In this paper we analyse the black hole attack in MANET using AODV as its routing protocol. Black hole is a type of routing attack where a malicious node impersonates a destination node by sending deceived route reply packet to a source node that initiates a route discovery process. By doing this, the malicious node can deprive the traffic from the source node. We propose a solution that makes a modification in existing AODV routing protocol

A Cluster Based Enhancement to AODV for Inter-Vehicular Communication in VANET

Vehicular Ad-hoc Networks (VANET) are a special kind of Mobile Ad-hoc network (MANET), in which vehicles on the road forms the nodes of the networks. Now a days, VANETs find several applications as an Intelligent Transportation System(ITS). Dynamic network architectures and node movement characteristics differentiates VANETs from other kinds of ad hoc networks. The dynamic change in topology shortens the effective time of routing. Hence routing in VANETs is complicated. Ad-hoc On-Demand Distance Vector (AODV) routing protocol is the most commonly used topology based routing protocol for VANET. During the route discovery process AODV broadcasts route request message (RREQ). It creates many unused routes between a source and a destination node. This paper aims at improving the performance of AODV by enhancing the existing protocol by creating stable clusters and performing routing by Cluster Heads and Gateway nodes.

Dynamic Route Shortening and Route Repairing Mechanism for Mobile Ad Hoc Networks

Problem statement: Ad hoc Networks are wireless networks without any fixed infrastructure. The network topology changes frequently and unpredictably due to the random movement of the nodes. The Ad Hoc on Demand Distant Vector Routing (AODV) protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with less hop count become available, the network topology is not able to adapt until the route break occurs. Hence in the route shortening scheme is some redundant nodes in the active route is replaced with a node that is not on the active route. When there is any link failure between any two nodes, the alternative route with optimum route to be constructed and not sending RRER message to the source node to initiate the route discovery process again. Approach: This study proposes a new routing protocol called, Dynamic Route Shortening and Repairing Mechanism (DRSR). The route shortening is incorporated with route repairing mechanism, to improve the performance of the AODV. The route shortening scheme works by replacing some redundant nodes in the active route, with a node that is not on the active route. If there is a link failure between the two nodes, the route repairing mechanism repairs the route, by using the nodes that are close enough to the route to overhear the message. Whenever the links go down, the DRSR replaces the failed links with the optimum route that is adjacent to the main route and not sending and RRER message to the source node to initiate the route discovery process again. The alternative route construction process could be initiated at any time, not just when a route has failed. The dynamically constructed alternative route’s information is passed on to the upstream nodes, which then determine by themselves when to direct their packets to the ‘‘optimal’’ alternative route. Results: Our protocol performs better than the original (AODV), in terms of the packet delivery rate, average hops and packet loss. Conclusion: Our proposed routing protocol constructs the alternative route with the optimal route in the Dynamic Route Shortening scheme when there is a link failure between any two nodes.

Multipath Routing Protocol using Cross-layer based QoS Metrics for IEEE 802. 11e WLAN

To achieve Quality of Service (QoS) support for multimedia traffic, IEEE 802.11e specifies Hybrid Coordination Function (HCF) Controlled Channel Access (HCCA) technique. When it is applied in multi-hop networks, the performance results, however, reveal that there is significant degradation of throughput with high delay at high load conditions. This is due to the fact that routing is responsible for the successful packet delivery and QoS Support. In a single path routing protocol, although multiple paths are discovered by the source during the process of discovering a route, the path with the shortest delay is chosen as the best path while discarding the rest. An increased efficiency can be achieved in terms of QoS metrics, balancing the load and tolerance to faults by the use of multipath routing. Apart from using multipath routing, cross-layer based approach is also necessary for the enhancement of QoS in IEEE 802.11e networks. This paper proposes a multipath routing protocol using cross-layer based metrics for improving the QoS of multimedia traffic in IEEE 802.11e networks. Initially a combined cost metric is formed based on traffic contention time, average transmission delay and signal fading values. The path with minimum combined cost is chosen as the primary path from the multiple disjoint paths discovered. In case of failed data transmission, the traffic is re-routed through an alternate path with next minimum cost. Simulated Performance evaluation substantiates the reliability of the proposed protocol in achieving higher delivery ratio and throughput and reducing the delay. General Terms Average Transmission Delay, Multipath Route Discovery Process, Signal Fading Value, Traffic Contention Time.

Secure Cloud Communication for Effective Cost Management System Through MSBE

In Cloud Computing Architecture, Brokers are responsible to provide services to the end users. An Effective Cost Management System (ECMS) which works over Secure Cloud Communication Paradigm (SCCP) helps in finding a communication link with overall minimum cost of links. We propose an improved Broker Cloud Communication Paradigm (BCCP) with integration of security issues. Two algorithms are included, first is Secure Optimized Route Cost Finder (S-ORCF) to find optimum route between broker and cloud on the behalf of cost factor and second is Secure Optimized Route Management (S-ORM) to maintain optimum route. These algorithms proposed with cryptographic integrity of the secure route discovery process in efficient routing approaches between broker and cloud. There is lack in Dynamic Source Routing Approach to verify whether any intermediate node has been deleted, inserted or modified with no valid authentication. We use symmetric cryptographic primitives, which is made possible due to multisource broadcast encryption scheme. This paper outlines the use of secure route discovery protocol (SRDP)that employs such a security paradigm in cloud computing.

Realization of Fault Tolerant Routing Protocol for Zigbee

Problem statement: Increased use of handheld devices and sensor devices pose problems in existing routing protocols. The performance of the existing routing protocols deteriorates very much on these dense scenarios. Control overheads are very important parameter in deciding the performance of routing protocols, which are introduced during route discovery and maintenance process. Denser the network, higher is the control overhead in establishing and maintaining the communication path between end systems. This study aims at implementing an improved fault tolerant routing algorithm that minimizes the routing overhead for ad hoc networks using Zigbee. Approach: We propose a routing protocol which minimizes the routing overhead by exploiting the network density. The number of nodes involved in handling the control packets is minimized in the proposed protocol by selecting few of the neighbors of each node based on the received signal strength. The link breaks are maintained locally, thus by reducing the number of control overheads in the network. Results: The performance of the proposed protocol is tested using OMNet++ simulator. The implementation using Zigbee nodes indicate that the control overhead is reduced up to 80% in dense environments and 60% in heterogeneous and sparse thereby saving energy in the sensor nodes. Conclusion: The proposed protocol increases the energy conservation and hence the nodes life time and networks’ lifetime.

IMPROVING ROUTE DISCOVERY USING STABLE CONNECTED DOMINATING SET IN MANETS

A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network performance from an energy efficient point of view. In this paper, we propose a distributed algorithm for energy efficient stable MPR based CDS construction to extend the lifetime of ad hoc wireless networks by considering energy and velocity of nodes. We have also implemented route discovery protocol to make use of the CDS nodes to relay route request messages. The simulation results show that our algorithm increases the lifetime up to 25% than previous works and 60% reduction in the route request messages during route discovery process.

A Probabilistic Approach To Reduce The Route Establishment Overhead In AODV Algorithm For Manet

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment process

Improving Route Discovery Using Stable Connected Dominating Set in MANETS

A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network performance from an energy efficient point of view. In this paper, we propose a distributed algorithm for energy efficient stable MPR based CDS construction to extend the lifetime of ad hoc wireless networks by considering energy and velocity of nodes. We have also implemented route discovery protocol to make use of the CDS nodes to relay route request messages. The simulation results show that our algorithm increases the lifetime up to 25% than previous works and 60% reduction in the route request messages during route discovery process.

IMPROVING ROUTE DISCOVERY USING STABLE CONNECTED DOMINATING SET IN MANETS

A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network performance from an energy efficient point of view. In this paper, we propose a distributed algorithm for energy efficient stable MPR based CDS construction to extend the lifetime of ad hoc wireless networks by considering energy and velocity of nodes. We have also implemented route discovery protocol to make use of the CDS nodes to relay route request messages. The simulation results show that our algorithm increases the lifetime up to 25% than previous works and 60% reduction in the route request messages during route discovery process.

An Efficient Location based Reactive Multi-Path Routing Protocol for Manet

A mobile ad hoc network consists of wireless nodes that move frequently. Movement of nodes results in a change in routes, requiring some mechanism for determining new routes. In this paper we propose an approach to utilize location information to improve performance of routing protocols for ad hoc networks. We propose a node-disjoint location based multipath routing protocol (Location-BMP) for mobile ad hoc networks to reduce the number of broadcast multi-path route discoveries and the average hop count per path from the source to the destination. During route discovery process, the intermediate nodes include their location information along with the distance in the Route-Request (MP-RREQ) packet. The destination node selects a set of node disjoint paths from the MP-RREQ packet received and sends a Route-Reply (MPRREP) packet on each of the node-disjoint paths.

Formal security analysis of Ariadne secure routing protocol using model checking

A Mobile Ad Hoc Network (MANET) is a self-configuring network of mobile terminals, connected by wireless links. In such environments, delivering communication guarantees has hardly been achieved by any protocol in its entirety. In this work, we model the secure on-demand routing protocol Ariadne, in order to verify one of its powerful security properties by model checking. We use the SPIN model checker to identify a sequence of possible events leading to a new attack, where two compromised nodes collaborate to remove all intermediate nodes from the route discovery process. To the best of our knowledge, the new attack can not be thwarted by any detection and prevention mechanism known to date.

Impact of Malicious Nodes under Different Route Refresh Intervals in Ad Hoc Network

Problem statement: Ad hoc networks are formed dynamically by group of mobile devices co operating with each other. Intermediate nodes be tween source and destination act as routers so that source node can communicate with the destination node even if it is out radio range and thus eliminating the necessity of infrastructure. Co ope ration of nodes is a very important feature for the successful deployment of Ad hoc networks. The inter mediate nodes should not only be involved in the route discovery process but also should be involved in the re transmission of packets as an intermedia te between source and destination. Approach: Since nodes have to be co operative for successful deployment of Ad hoc networks, the security mechanisms cannot afforded to be stringent which enables malicious nodes to successfully attack the network. The capability of optimized link state routing protocol has been studied extensively for d ifferent types of ad hoc networks and has been proved to behave somewhere in between pro active and reactive routing protocols. Results: In this study we investigate the impact of malicious nodes on the Optimized Link State Routing (OLSR) protocol under different hello intervals which affe cts the route discovery process and subsequently investigate the degradation of Quality Of Service ( QOS). Conclusion: It is observed that the throughput deteriorates when the network is attacke d by malicious nodes which selectively retransmit data to some of the destinations. The performance d egradation increases as the hello interval time is set beyond 4 sec. Higher hello interval decreases the c ontrol packet overheads. It is observed that even with higher hello intervals the network performance is much better than an attack by small group of malicious nodes.

Two Phase Admission Control for QoS Mobile Ad Hoc Networks

In this paper a novel and effective two phase admission control (TPAC) for QoS mobile ad hoc networks is proposed that satisfies the real-time traffic requirements in mobile ad hoc networks. With a limited amount of extra overhead, TPAC can avoid network congestions by a simple and precise admission control which blocks most of the overloading flow-requests in the route discovery process. When compared with previous QoS routing schemes such as QoS-aware routing protocol and CACP protocols, it is shown from system simulations that the proposed scheme can increase the system throughput and reduce both the dropping rate and the end-to-end delay. Therefore, TPAC is surely an effective QoS-guarantee protocol to provide for real-time traffic.

Routing protocol for wireless ad hoc quantum communication network based on quantum teleportation

A concept of wireless ad hoc quantum communication network is proposed and a routing protocol is designed for wireless quantum communicaiton network with complex structure. The routing protocol is on-demand and the routing metric is based on the number of entangled particle pairs. The node that wants to send information carried by quantum state can initiate a route request and establishment procedure. The destination node chooses path by the routing metric and sends route reply message along the selected path. During the information transmission, if the quantum channel or the wirless channel between any neighbors in the selected path is broken, a route discovery process is reinitiated to set up a new route. Nodes in the selected path use a both-end approximation algorithm to establish a quantum channel. After the quantum channel is established, the quantum state is transferred by quantum teleportation and the information transfer between any two nodes in wireless ad hoc quantum communication network is finished.

Condensation-Based Routing in Mobile Ad-Hoc Networks

The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.