Sequenced Distance Vector Routing Protocol Research Articles

Modifikasi Protokol Routing DSDV Menggunakan Algoritma Dynamic-power transmission untuk Mengurangi Interferensi Sinyal dalam Pengiriman Data Berdasarkan Tingkat Kepadatan Node di Jaringan MANET

Mobile Ad-Hoc Network (MANET) is a decentralized collection of nodes that exchange information temporarily via wireless transmission. When nodes communicate, all nodes in the communication range will be affected by signal interference from other nodes. The problem that arises due to this signal interference is that it will affect or interfere with the signal transmitted to the receiver, resulting in a decrease in network performance which will impact the quality of service (QoS). To overcome the problem of signal interference, use interference management. This study applies the Dynamic-Power Transmission (DPT) algorithm to the Destination Sequence Distance Vector (DSDV) routing protocol framework. DPT-DSDV will adjust the communication range automatically based on the node density level. When a node sends data packets to neighbouring nodes, the communication range will be adjusted automatically based on the selected level. The performance of DPT-DSDV will be compared with standard DSDV and standard AODV by looking at performance based on three parameters, namely throughput, packet delivery ratio (PDR), and end-to-end delay. Based on the results of research trials, applying the dynamic-power transmission algorithm can improve the performance of the standard DSDV routing protocol. Throughput results on DPT-DSDV increased by 0.90%. The packet delivery ratio (PDR) increased by 0.50%, and end-to-end delay decreased by 2.80%.
 Key words: MANET, Interference, Quality of Service, Routing, DSDV, Dynamic-Power Transmission.

SIMULATION AND COMPARISON OF AD HOC NETWORKS ROUTING PROTOCOLS BASED ON OPNET

Ad-hoc routing algorithm has always been a core problem in research of ad-hoc networks. In order to be able to deal with various routing protocol problems on an ad-hoc network like poor validity and large control overhead, this paper classify and compare ad-hoc network routing protocols through OPNET simulation tool and focus on testing two routing protocols' performance namely, table-driven and on-demand routing protocol. The Destination Sequenced Distance Vector routing protocol is the most used table-driven routing protocols, While AODV and DSR routing protocols are the two most used on-demand routing protocols. The performance of these three protocols is simulated with a variety of packet delivery functions, average end-to-end delays, and routing loads. These protocols are also analyzed and compared. The simulation results show that for a high mobility environment, the on-demand routing protocol is the best option.

Simulation of the Performance Metrics for Securing DSDV Routing Protocol Based on Trusted Environments

To organize the network in an efficient way to minimize the risk of illegal node and to safeguard protected information, a security mechanism is required to secure communication. In addition, a security mechanism is also required to ensure that received information have not been tampered with. In this paper, a more efficient mechanism for Securing the Destination Sequenced Distance Vector Routing Protocol (SDSDV) is proposed. This paper comprehensively investigates the performance impacts by varying the number of maximum connections and mobility on securing the ad hoc network with Destination Sequenced Distance Vector Routing Protocol (DSDV) Routing Protocol. From simulation results, we explore the causes for performance degradation. Based on the investigation, we indicate that we have to impose restrictions on the maximum connections to acquire an expected performance. These results also reveal that the performance decreases with the increment of the mobility and maximum connections that is unequal to 60. If we want to obtain the optimal performance, the number of nodes in a network should be constrained to be 60 if the maximum connections are 60.

Context Information Aggregation Mechanism Based on Bloom Filters (CIA-BF) for High Performance Monitoring Applications of Internet of Things

Internet of Things (IoT) has become a popular technology in recent years. Different IoT applications such as traffic control, environment monitoring, etc. contain many sensor devices, routers, actuators, edge routers, and Base Stations (BS) which communicate with each other and send millions of data packets that need to be delivered to their destination nodes successfully to ensure the High-performance communication networks. IoT devices connect to the Internet using wired or wireless communication channels where most of the devices are wearable, which means people slowly move from one point to another or fast-moving using vehicles. How to ensure high performance of IoT data networks is an important research challenge while considering the limitation of some IoT devices that may have limited power resources or limited coverage areas. Many Kinds of research focus on how to customize routing protocols to be efficient for IoT devices. The traditional routing mechanisms utilized specific IP addresses to identify users while in IoT it is more beneficial to identify a group of users (things) based on any contexts, status, or values of their resources such as the level of their batteries (e.g., low, medium or high). While IoT devices have different characteristics, a multicasting mechanism to send one message to various groups of devices will not be efficient in IoT communication networks since the aggregation of packets is very difficult. Thus, it is useful to propose a mechanism that able to filter data packets that need to be sent to a specific group of devices. In this paper, we propose efficient context-aware addressing mechanism, which is based on bloom filters to increase the performance of IoT communication networks. A routing architecture is built based on bloom filters which store routing information. In our works, we reduce the size of routing information using a proposed aggregation mechanism which is based on connecting each group of IoT devices with an edge router which is hierarchically connected to an upper router after operating its bloom filter. Our simulation results show a significant improvement in the IoT performance metrics such as packets transmission delay, jitter the throughput, packets dropping ratio, and the energy consumption in comparison with well-known routing protocols of IoT such as Destination Sequenced Distance Vector routing protocol (DSDV), and Ad hoc On-demand Distance Vector routing protocol (AODV).

A hybrid approach for the optimization of quality of service metrics of WSN

The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.

Secure Routing through Refining Reliability for WSN against DoS Attacks using AODSD2V2 Algorithm for AMI

Secure and reliable routing expands the performance of wireless communication infrastructure of the Advanced Metering Infrastructure (AMI).This paper tries to deliver reliable routing using combination of AODV(Reactive type protocol) and DSDV(proactive type protocol) protocol considering WSN. Different kinds of Attack annoys the enactment of communication infrastructure of AMI. This paper defends communication infrastructure from DoS (Denial of service) attack. The main aim of this paper try to provide reliable routing with security. Communication infrastructure is a key element of AMI. Providing reliability and security for communication infrastructure we can improve the performance of AMI. Due to this electricity sector can save millions of dollars and we provide social awareness about importance of electricity security or Smart Grid. This paper calculates the security in terms of delay, energy consumption, throughput, PDR (Packet Delivery Ratio) and overhead. By considering these parameters we will calculate Confidentiality, Integrity, Availability and Accountability (non- repudiation). Wireless Sensor Network (WSN) considered for wireless communication infrastructure for the AMI. Sensor nodes are battered for attack. Intended for AODSD2V2 (Ad Hoc on Demand Destination Sequenced Distance Vector Routing Protocol) protects the data packets from malicious nodes and DoS attack. For the WSN network infrastructure two kinds of topologies are considered 1. Random deployment strategy 2. Grid deployment. Network Simulator2 (NS2) delivers comparatively simulation results intended for the calculation of reliability and security.

Performance Study of AODV and DSDV Routing Protocols for Mobile Ad Hoc Networks Based on Network Simulator NS2

Facebook Mobile Ad hoc Networks (MANET’s) is a self-configuring infrastructure less network of mobile devices connected by wireless . MANETs are a kind of Wireless ad hoc network that usually has a routable networking environment on top of a Link Layer . Route discovery and packet forwarding operations need an efficient routing protocol. Ad-Hoc on Demand Distance Vector Routing Protocol (AODV) and Destination Sequenced Distance Vector Routing protocol (DSDV) are counted as widely used routing protocols in MANET. In this paper we compare and evaluate the functionality of AODV and DSDV routing protocols. Simulation is based on NS2.34 network Simulator on Linux Fedora and the parameters are packet delivery ratio (PDR), Throughput and end-to-end delay. Simulation results show that AODV protocol is always superior as compared to DSDV protocol when using different number of nodes and scenario.

An Optimized Node Selection Routing Protocol for Vehicular Ad-hoc Networks – A Hybrid Model

Vehicular Ad-hoc networks (VANETs) are a subset of Mobile Ad-hoc Networks made by vehicles communicating among themselves on roadways. The Routing protocols implemented for MANETs such as Ad-hoc on Demand Distance Vector Routing Protocol (AODV), Dynamic Source Routing (DSR), and Destination Sequence Distance Vector Routing Protocol (DSDV) are not suitable for VANET due to high Mobility. Trusted routing in VANET is a challenging task due to highly dynamic network topology and openness of wireless architecture. To avoid a frequent communication link failure, to reduce the communication overhead and to provide a trusted routing among the vehicular nodes for achieving high packet transmission, we implemented an Optimized Node Selection Routing protocol (ONSRP) of VANET based on Trust. In our proposed work, we implemented an enhanced routing protocol which prevents the network from communication link failure frequently. The testing results stated that the ONSRP routing have a high performance measures than the above mentioned existing routing protocols.

Enhancement in Elimination of Security Threads using Trusted Proactive Routing

Ad hoc networks have been used in many applications which mandate a dynamic setup in the absence of fixed infrastructure. The design of ad hoc network has been mainly focuses on proper operation. It is possible that eventually a malicious node becomes easy to deploy in ad hoc n/w and they cause among other impact performance degradation. One attack that can deploy by malicious node is black hole attack. This paper reviews the problem of occurrence of black hole attack and its solution technique proposed enhancement in proactive routing protocol Destination Sequenced Distance Vector Routing protocol Using trust based and hop count method.

Performance Evaluation of the IBETX Routing Metric Over DSDV Routing Protocol in Wireless Ad hoc Networks

Wireless ad-hoc networks are characterized by a collection of wireless mobile nodes that dynamically form a temporary network without the use of any pre-defined network infrastructure or centralized administration. They have attributes such multi-hop wireless connectivity, continuously changing topology and easy deployment. The increasing demands that are made by users pose a challenge in the improvement of the quality of wireless ad-hoc networks. The performance of wireless ad-hoc networks depend on the efficiency of routing protocols, especially the routing metric operating within it. In this paper, the performance of the recently proposed routing metric Interference Bandwidth Adjusted Expected transmission count (IBETX) metric is compared with two prominent existing metrics, the Expected transmission count (ETX) and the Inverse Expected Transmission count (InvETX) over the Destination Sequenced Distance Vector (DSDV) routing protocol. The performance differentials are analysed using varying packet rates and node densities. From the simulations results, IBETX metric outperforms the ETX and InvETX metric because it implements the bandwidth sharing mechanism and makes use of the information available at the MAC layer. It can also be noted that it is very sensitive to data traffic rate. It performs well in low and medium node densities.

A Hybrid Routing Protocol and Performance Evaluation in a Wireless Mesh Network

The size of mesh networks depends upon the usage scenario so that the use of any single routing algorithm alone, either proactive or reactive, may not work efficiently. This letter proposes a hybrid routing algorithm, where a different algorithm is applied depending on the hop count between source and destination nodes. The algorithm allows using a proactive algorithm when a destination is nearby and a reactive algorithm when a destination is away from a source node. In this letter, we adopt the Destination Sequenced Distance Vector routing protocol (DSDV) for a nearby destination and the Ad hoc On-Demand Vector routing protocol (AODV) for a remote destination. A node maintains only a shared routing table for routing protocols, which helps reducing the size of the routing table at a node within a mesh network. Its routing performance is compared to those in DSDV and AODV in terms of normalized routing load, average packet transmission delay, and the average number of entries in the routing table.

Performance Characteristics of Cluster -Based Multicast Key Distribution Scheme for Mobile Adhoc Networks

Many emerging commercial and military applications require secure multicast communication in adhoc environments. Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, high packet loss rates and limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving reliable secure communication using multicast key distribution for mobile adhoc networks. This paper proposes and evaluates the performance of an new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol to provide efficient and reliable multicast key distribution. Simulation results in NS2 accurately predict the performance of proposed scheme in terms of energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio compared with the existing scheme.

Energy efficient CBMT for secure multicast key distribution in mobile ad hoc networks

Multicast key distribution in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority and limited resources such as bandwidth, time and power. In many multicast interactions, a new member can join, a current member can leave at any time and existing members must communicate securely using multicast key distribution within constrained energy for mobile adhoc networks. This paper proposes a new efficient cluster based multicast tree (CBMT) algorithm for secure multicast key distribution, in which the source node uses a Multicast version of the Destination Sequenced Distance Vector (MDSDV) routing protocol to consume less energy. It also reduces end to end delay in multicast transmission. Simulation results show the efficient CBMT using MDSDV have better system performance in terms of QOS metrics such as energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio.

Identifying Factors Affecting Data Delivery Performance in Mobile Ad-Hoc Network Routing Protocol Using A Systematic Approach

A mobile ad hoc network (MANET) is a collection of mobile nodes dynamically forming temporary network without the use of any existing network infrastructure or centralized administration. Due to the mobility of the nodes, as well as the continual arrival and departure of nodes, the topology of the network changes constantly. To manage the data transmission, routing protocols are needed. Therefore, analyzing performance of the protocols becomes crucial to finding an efficient routing protocol. Many performance evaluation of routing protocols have done through trial-and-error simulation experiment. This paper shows a systematic procedure of using Taguchi parameter design in analyzing Destination Sequence Distance Vector (DSDV) routing protocol performance. The affect of terrain size, node speed, network size and pause time on the performance of DSDV routing protocol is identified. Performance is evaluated with respect to packet delivery ratio. Based on the simulation data, it was found that the network size and the terrain have significant impact on the performance. Keywords: Taguchi parameter design; ANOVA; mobile ad hoc networks; performance evaluation; packet delivery ratio.

The Use of Taguchi Method to Determine Factors Affecting the Performance of Destination Sequence Distance Vector Routing Protocol in Mobile Ad Hoc Networks

In this study, Taguchi method was used to identify the several factors that may affect the performance of Destination Sequence Distance Vector (DSDV) routing protocol. The performance of DSDV routing protocol in mobile ad hoc networks were greatly influence by factors such as node speed, node pause time and traffic load. Problem statement: By using orthogonal experimental design and analysis techniques, the protocol performance can be analyzed with more objective conclusion through only a small number of simulation experiments. Approach: The performance was measured with respect to packet delivery ratio. Analysis of variance (ANOVA) was carried out to identify the significant factors affecting the response and the best possible factor level combination was determined through analysis of the signal-to-noise ratio. Results: It was found that the traffic load has a stronger influence on the packet delivery ratio, followed by the pause time. Conclusions/Recommendations: The optimal setting of the best performance is determined. The optimal setting has resulted in increased packet delivered. These findings demonstrate that Taguchi method may be valuable tool for the investigation of main effect or interactions of multiple factors in the performance of mobile ad hoc network routing protocols.