Dynamic Source Routing Research Articles

AN EVALUATION OF IMPROVED CLUSTER-BASED ROUTING PROTOCOL IN ADHOC WIRELESS NETWORK

In this paper we presents a performance comparison of Dynamic Source Routing (DSR), Ad hoc On Demand Vector (AODV), Cluster Based Routing Protocol (CBRP) and Improved Cluster Based Routing Protocol (i-CBRP) routing protocols which builds upon a cluster based wireless network infrastructure. This evaluation is necessary due to unique enhancement made to traditional CBRP by way of implementing congestion control scheme as part of the structure establishing i-CBRP. First, we introduce the network infrastructure on which the routing protocols are to send packets. We simulates Mobile Ad-Hoc Network (MANET) network infrastructure using NS2 network simulator. DSR, AODV, CBRP and i-CBRP routing protocols are implemented to generate various simulation results. The results shows that i-CBRP performs better in terms of average packet delay, throughput, volume of traffic controls and average packet delivery ratio when compared with CBRP, while DSR performs better in terms of total volume of control traffic. AODV is the overall best in terms of average packet delay. Key words: Node Density, Evaluation, MANET, Cluster, Routing

An IOT-enabled System for Marine Data Aquisition and Cartography

Current satellite communication remains very expensive and impractical for most small to mid-sized vessels, and at the same time marine wireless networking is lack of network coverage. To solve this problem, this paper proposes a novel IOT (Internet of Things) enabled system for marine data acquisition and cartography based on Ship Ad-hoc Networks (SANET’s). Ships are equipped with Very High Frequency (VHF) radios and several sensors such as sea depth, temperature, wind speed and direction, etc. The collected sensory data is sent to 5G edge clouds incorporated at sink/base station nodes on shore, and ultimately aggregated at a central cloud on the internet to produce up to date cartography. The routing protocols deployed are DSDV (Destination-Sequenced Distance Vector), AODV (Ad hoc On-Demand Distance Vector), AOMDV (Ad hoc On-Demand Multipath Distance Vector) and DSR (Dynamic Source Routing) protocols, which are very popular in Mobile Ad-hoc Networks (MANET’s) and compatible with multi hop routing environments and scalability towards increased traffic and mobility. Simulation results verify the feasibility and efficiency of the proposed system that has packet delivery rates of up to 80% at shore base stations.

Enhanced AODV Protocol for Detection and Prevention of Blackhole Attack in Mobile Ad Hoc Network

Mobile Ad-hoc Network (MANET) is a kind of wireless network that has the most challenging network infrastructure. It is formed using the mobile nodes without any centralized administration from the security perspective and is a self-configuring fastest emerging wireless technology, each node on the MANET will act like a router which forwards the packets. Dynamic nature of this network makes routing protocols to play a prominent role in setting up efficient route among a pair of nodes. Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (ADOV) is a reactive MANET routing protocols. Most of the attacks on MANETs are routing protocol attacks. Attacks on routing protocols, especially internal attacks will cause the damage to MANETs. Sinkhole and black hole attacks are a type of internal attack which is affected by attempting to draw all network traffic to malicious nodes that fake routing update and degrade the performance of the network. The black hole nodes should be detected from the network as early as possible via detection mechanism and should also guarantee the higher detection rate and less cross-over error rate. In this paper, we studied the characteristics of black hole attack and how it will affect the performance of the distance vector routing on demand routing protocol such as (ADOV) protocol, which recognizes the presence of black hole node from packet flow information between nodes and isolates it from the network via applying AODV protocol that one of popular routing protocol. We have evaluated the performance of the system using widely used simulator NS2, results prove the effectiveness of our prevention and detection method.

Mobile Ad Hoc Network Energy Cost Algorithm Based on Artificial Bee Colony

A mobile ad hoc network (MANET) is a collection of mobile nodes that dynamically form a temporary network without using any existing network infrastructure. MANET selects a path with minimal number of intermediate nodes to reach the destination node. As the distance between each node increases, the quantity of transmission power increases. The power level of nodes affects the simplicity with which a route is constituted between a couple of nodes. This study utilizes the swarm intelligence technique through the artificial bee colony (ABC) algorithm to optimize the energy consumption in a dynamic source routing (DSR) protocol in MANET. The proposed algorithm is called bee DSR (BEEDSR). The ABC algorithm is used to identify the optimal path from the source to the destination to overcome energy problems. The performance of the BEEDSR algorithm is compared with DSR and bee-inspired protocols (BeeIP). The comparison was conducted based on average energy consumption, average throughput, average end-to-end delay, routing overhead, and packet delivery ratio performance metrics, varying the node speed and packet size. The BEEDSR algorithm is superior in performance than other protocols in terms of energy conservation and delay degradation relating to node speed and packet size.

A Proposed Fuzzy Stability Model to Improve Multi-Hop Routing Protocol

Today’s wide spread use of mobile devices such as: mobile phones, tablets, laptops and many others had driven the wireless Mobile Network growth especially the Mobile Ad hoc Networks commonly referred to as MANETs. Since the routing process is regarded as the core of communication and is associated with the network performance metrics, then its improvement will be revealed in the whole network performance improvement. Due to users’ mobility, limited battery power, and limited transmission ranges, the current routing protocols should consider the stability of routes. Hence, the lack of resources of MANETs may result in imprecise routing decisions. In this paper, the proposed fuzzy model is used to handle imprecision of routing decisions by Fuzzy stability model for Dynamic Source Routing (FSDSR). Regarding the number of hops per route, cache size, end-to-end delay and route discovery time, the results showed that FSDSR has outperformed the state of art protocol Dynamic Source Routing protocol (DSR).

Cooperative Routing In Mobile Ad Hoc Networks Using Fuzzy Logic

Mobile ad hoc network (MANET), needs an unconditional cooperation among the nodes to communicate. Presence of malicious or selfish nodes in the routing path will affect the routing performance. In this paper, fuzzy logic based trust-AODV is proposed, which is an enhancement to the existing ad hoc on demand distance vector (AODV) protocol. The algorithm uses decision factors such as packet forwarding trust (PFT), energy level (EL), and time of availability (ToA) to decide the dynamic changing behaviour of a mobile node. Further, the decision factors are incorporated into Fuzzy logic model to calculate the Final Trust value of a mobile node which is used to establish a cooperative routing path. The simulated results are compared with AODV, dynamic source routing (DSR), TDSR and ad hoc on-demand trusted-path distance vector (AOTDV) algorithms with respect to routing parameters such as packet delivery ratio, average delay, routing packet overhead, and Energy consumption. The simulation results indicate that the proposed routing algorithm improves the routing performance.

A novel approach to improve quality of service in MANET using cache update scheme for on-demand protocol

The route cache scheme used by on-demand routing protocol is significant in MANET. This paper presents, new cache update algorithm which determine broken link information to all neighbour's that can cache the route in routing table using distributed cache update algorithm in first stage. Then new time-to-live (TTL) field is attached with every cache entry to remove when it is expired at second stage. The proposed cache updated scheme not only maintains cache structure but also stores the information required for cache update. The proposed cache update scheme has been experimentally evaluated using network simulation (NS2). The analysis shows improved performance of updated dynamic source routing (UDSR) protocol up to 60% to 70% in terms of QoS parameters like packet delivery ratio, delay, routing overhead, drop rate compared to conventional dynamic source routing (DSR) protocol and 30% to 40% improvement compared to method presented in literature.

An optimal spectrum-efficient routing protocol for multi-hop 802.11s networks

Routing in multi-hop wireless networks is a vital aspect to sustain acceptable performance. Standard routing schemes, such as ad-hoc on-demand vector routing (AODV) and dynamic source routing (DSR), use the number of hops from source to destination as the routing metric without paying attention to the physical layer properties of the wireless links. This paper, however, presents a new routing protocol for finding the path with maximum end-to-end spectral efficiency in real-world IEEE 802.11s networks. In contrast to previous work, our protocol fully considers the physical layer characteristics of the wireless channel, the interaction between network layer route computation and medium access control (MAC) contention resolution, in addition to all necessary information gathering and exchange performed by the wireless nodes. Furthermore, we provide a full NS-2 simulation comparison between spectrum-efficient routing and standard routing protocols using various performance metrics such as end-to-end data rate, delay, packet loss and overhead time.

Secure Route Discovery for Dynamic Source Routing in Manets

Abstract Mobile ad hoc networks (MANETs) are collections of wireless mobile devices with restricted broadcast range and resources and no fixed infrastructure. Communication is achieved by communicating data along suitable routes that are dynamically discovered and maintained through association between the nodes. Discovery of such routes is a major task both from good organization and security points of view. Recently a security model tailored to the specific requirements of MANETs. A novel route discovery algorithm called endairA is also proposed together with a claimed security proof within the same model. In this paper we show the security proof for the route discovery algorithm endairA is malfunctioning and moreover this algorithm is vulnerable to a hidden channel attack. We also analyze the security framework that is used for route discovery and argue the compos ability is an essential feature for ubiquitous applications. We conclude by discussing some of the major security challenges for route discovery in MANETs.

Fireworks: an intelligent location discovery algorithm for vehicular ad hoc networks

Searching for and locating a certain destination in a vehicular ad-hoc network (VANET) are fundamental issues to ensure routing and data dissemination under high mobility and lack of fixed infrastructure. However, naive-flooding searching is too expensive and takes a considerable amount of valuable bandwidth in the network. To overcome this, GPS information of the vehicles can be exploited, which can aid searching and routing in VANETs. In this paper, we present a novel position-based searching algorithm—called Fireworks—that can be used as a location discovery algorithm in VANETs. The proposed scheme is purely reactive and has a limited usage of beacons. Fireworks algorithm provides the position of the destination vehicle without having a Location Information System infrastructure or a proactive mechanism. We show that the method is efficient and reliable while greatly reducing the searching overhead. The simulations show that the algorithm covers as many nodes as naive-flooding with less than one-fifth of the broadcast messages and with less than one-third of the Dynamic Source Routing (DSR). It also performs better than Acknowledgement-Based Broadcast Protocol (ABSM) in terms of total number of broadcast messages, node coverage speed and query success rate.

A Novel approach to prevent launching of attacks in MANETS using Bait tracing setup

In mobile ad hoc networks (MANETs), an essential necessity for the foundation of correspondence among hubs is that hubs ought to coordinate with each other. Within the sight of malicious hubs, this prerequisite may prompt genuine security worries; for occasion, such hubs may disturb the steering procedure. In this connection, counteracting or distinguishing pernicious hubs propelling gray hole or shared black hole assaults is a test. This paper endeavours to determine this issue by outlining a dynamic source steering (DSR)- based directing component, which is alluded to as the agreeable draw discovery plan (CBDS), that coordinates the upsides of both proactive and responsive guard structures. Our CBDS strategy actualizes an opposite following method to help in accomplishing the expressed objective. Recreation results are given, demonstrating that within the sight of noxious hub assaults, the CBDS beats the DSR, 2ACK, and best-exertion flaw tolerant steering (BFTR) conventions (picked as benchmarks) as far as parcel conveyance proportion and directing overhead (picked as execution measurements). Keywords—Cooperative bait detection scheme (CBDS),dynamic source routing (DSR), mobile ad hoc network (MANET).

English

English

Consistent Multipath Dynamic Source Routing Protocol for Mobile Ad hoc Network

Mobile Ad hoc Network consists of a large number of mobile nodes that communicate with each other without any infra-structure. Utilizing efficient energy of the nodes and selection of routes from the primary and secondary caches plays an important role. We propose a consistent multipath dynamic source routing protocol (CM-DSR) for mobile ad hoc network by selecting consistent route from cache. The results are simulated using NS-2 simulator. The observations show that our proposed protocol performs better in selection of routes in terms of average residual energy, average transmission per unit time for given density of nodes in the topology, which increases the data transmission from each node to other nodes in the network.

Secret Common Randomness From Routing Metadata in Ad Hoc Networks

Establishing secret common randomness between two or multiple devices in a network resides at the root of communication security. In its most frequent form of key establishment, the problem is traditionally decomposed into a randomness generation stage (randomness purity is subject to employing often costly true random number generators) and an information-exchange agreement stage, which relies either on public-key infrastructure or on symmetric encryption (key wrapping). In this paper, we propose a secret-common-randomness establishment algorithm for ad hoc networks, which works by harvesting randomness directly from the network routing metadata, thus achieving both pure randomness generation and (implicitly) secret-key agreement. Our algorithm relies on the route discovery phase of an ad hoc network employing the dynamic source routing protocol, is lightweight, and requires relatively little communication overhead. The algorithm is evaluated for various network parameters in an OPNET ad hoc network simulator. Our results show that, in just 10 min, thousands of secret random bits can be generated network-wide, between different pairs in a network of 50 users.

A Method to Cope with Black Holes’ Attack in Mobile Networks and the Study of their Impact on the Basic Parameters of AODV and DSR Protocol

Security is one of the most important concerns of the basic capabilities of mobile networks. Black hole attacks are one of the prevalent attacks with which routing protocols of mobile network s encounter. In this paper, a method has been presented to deal with those attacks, at same time considering the quality of service. In this method, packets are sent through configured reservation paths. Simulation is carried out in opnet and the results revealed that the proposed algorithms yield good results in terms of packet delivery ratio and throughput when compared with the Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol. Throughput parameters after applying proposed technique, show 6.51 percent increase for AODV, and 61.86 percent increase for DSR. Also the packet delivery ratio shows 96,68 increase for AODV while it is almost zero percent for DSR. Of course it must be noted that some increase has been observed in sending and receiving that will completely be explained in simulation part.

Performance Analysis of Dynamic Source Routing Protocol in TCP and UDP Environment in MANET Varying Number of Nodes

Dynamic Source Routing (DSR) is a proficient on-interest routing protocol for mobile ad-hoc networks (MANET). It relies on upon two fundamental systems: Route Discovery and Route Maintenance. Route discovery is the methodology utilized at the source of the packets to find a route to the destination. Route Maintenance is the methodology that finds link breakage also, repairs them. Route caching is the sub method serviceable to keep away from the interest for finding a route or to decrease route discovery delay before each information bundle is sent. The objective of this paper is to assess the execution of DSR in TCP and UDP environment. Distinctive execution expressions are explored including, average throughput, end to-end delay, and average packet delivery ratio, depending on TCP and UDP environment by varying number of nodes. In this study we find which environment best suit for DSR protocol.

Cognitive radio intelligent-MAC (CR-i-MAC): channel-diverse contention free approach for spectrum management

Cognitive radio was introduced to fill up the imbalance between spectrum scarcity and spectrum underutilization. So to make such an ideology work, a network which can utilize all the available channel in the best efficient manner, without causing any harmful interface to primary user (PU) and maintaining the Quality of Service (QoS) for cognitive user (CU) is required. In both Mesh as well as ad-hoc networks, effective utilization of the white-spaces by the CUs maintaining the QoS for both primary and CU is a challenging task due to the frequent and instant change in their channel status. In this paper an intelligent-MAC (i-MAC) for cognitive radio (CR) using two transceivers based on hybrid approach of combination of cooperative decision and contention-free approach is proposed. Cooperative decision, to overcome hidden node or the case when there is no common channel between the CU's and contention-free approach, to solve the issues in contention mechanism, where same channel is selected simultaneously by multiple CU's. Proposed CR-i-MAC permits an effective dynamic spectrum access to CUs without effecting the QoS for PU's. The simulative performance analysis of proposed CR-i-MAC is tested in various critical cases like multi-channel single-radio and multi-channel multi-radio over different on demand routing protocols like dynamic source routing, ad-hoc on demand distance vector and weighted cumulative expected transmission time using network simulator (NS-2). The performance of the network is measured on the basis of parameters like throughput, delay and interference. The analysis of the simulation results shows that the proposed CR-i-MAC outperforms various other CR MAC's in terms of both increased throughput and reduced delays thereby making the system stable and efficient.

Improving Performance Through Reputation Based Routing Protocol for Manet

In ad hoc networks, nodes act as routers and transmit data packets originating from other nodes to destinations beyond the transmission range of the source node. Traditional routing protocols designed for Mobile Ad hoc Network all nodes in the network are trustworthy. Security of routing protocol is challenging in realistic setting as networks are attacked by untrustworthy nodes which disrupt the communication. In this paper, it is proposed to investigate the performance of dynamic source routing (DSR) routing protocol under untrustworthy environment. A novel fuzzy based model with trust and reputation is proposed to enhance the performance of the network with untrustworthy nodes. Reputation system takes input of previous records of successful transmissions, capability of nodes calculated as total trust value and the node mobility. Trust and reputation parameters are used to identify a secured route for transmission in the network. Simulation results show improved Quality of Service of the proposed technique compared to DSR in untrustworthy environment.

Comparative Analysis of Indoor Mobility Scenarios Creation (IMSC) in Mobile Ad Hoc Networks

Objectives: Mobile Ad hoc Networks (MANETs) are self configuring mobile nodes each mobile node connected with other mobile node without any physical connection, nodes connected thorough wireless links. Major issues in MANET are routing and mobility. Each mobile node can act as router, it stores routing information such as Neighborhood id, hop count, source and destination address. Analysis: Here, we have compared indoor mobility models of Mobile Ad hoc Networks (MANETs) such as Manhattan Grid (MG), Random way Point (RWP) and Random Direction (RD) mobility models. This comparison based on their existing routing protocols like Dynamic Source Routing (DSR) and Ad hoc On Demand vector (AODV) protocols. Mobility node (MN) plays a very significant role while moving node from one to another. Mobility scenarios are created with help of BonnMotion tool version 2.1.3. The full simulation work done under Network Simulator 2.3.4. Findings: We have compared Routing protocols with different mobility models under different scenarios; found RWP-DSR gives some better results. Improvement: Out of three mobility models, RWP-DSR mobility model gives better results when compared with other models. The Performance measurements are based on various QoS parameters like Average End to End Delay, Average Throughput and Average Packet Delivery Ratio. In Future we implement a novel Bio inspired mobility models based on group mobility behavior.

QoS enhancement in MANETs using priority aware mechanism in DSR protocol

Quality of service (QoS) enhancement is one of the prominent research areas in a mobile ad hoc network in which a variety of routing protocols is introduced. However, those routing protocols do not support efficiently, the multiple routes in the network, as congestion occurs owing to multiple routes. Hence, the infrastructure-less and dynamic nature of the mobile ad hoc network (MANET) demands a new set of networking strategies to improve the QoS. In this paper, a priority aware (PA) mechanism is implemented by assigning priority in accordance with their data rates in dynamic source routing (DSR) protocol in order to enhance the QoS for MANET. Five different connections are considered, and the performance parameter of the network such as throughput, packet delivery ratio (PDR), and end-to-end delay (EED) is estimated for the proposed priority aware DSR (PA-DSR) protocol. From the simulation, it is observed that the proposed PA-DSR protocol performs better than the DSR protocol due to its rate cutting mechanism.