Dynamic Source Routing (DSR)

In recent time huge development going on in the field of the wireless sensor network and this network divided into two groups which are known as MANET and VANET. Our main work is to design an algorithm in such a way that the network parameter is optimized efficiently. So the cluster head can't communicate with other nodes. That the same time, the congestion will occur and packet can't be transferred to the nodes. It will take more time to complete the packet transmission. This approach illustrates that the proposed method is a routing protocol. The proposed research we have used no of connection in a group or cluster. Every cluster has a cluster head and the cluster head directly interconnects with the improper place. The results of the proposed method are a comparison with existing Leach Protocol. Here the base connection is located to equal distance of a cluster and it's directly communicating to the cluster connection. This method is increasing to life instance of a network. As compare LEACH and Proposed method, we have noticed proposed method-have better force, lifetime, less delay, better transmission and consumed less time. LEACH Protocol is based on the cluster to make a comparison of native parameters so that we design the proposed method cluster based. The cluster used no of the group to increase the performance. This consist of many advantages which are listed below. Existing Number of groups is low. We can analyze a number of groups here. Every group's stage check in this proposed research. Proposed method routing protocol has a better result as compared to LEACH protocol. As cluster-head dies, series is rebuilt to bypass the deceased node. So the initial topology is not affected. Head node receives all the aggregated data moreover transmits further to cluster-head.

A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.

Providing security to Mobile Ad-hoc Networks (MANETs) is one of the essential and demanding task in recent days, due to the mobility of nodes. Typically, the malicious or attacker nodes intend to access the data packet for interrupting the communication by misbehaving. So, the data packets must be protected and the communication nodes can be authenticated while enabling the transmission. For this purpose, various authentication based security mechanisms are developed in the traditional works, but it lacks with the limitations of increased network overhead, delay, and energy consumption. To solve these issues, this paper aims to develop a new Hybrid Authentication based Secure Data Transmission (HA-SDT) framework for increasing the security of MANET. It comprises the stages of node authentication, optimal path selection, data encryption, and transmission. Initially, each node in the network can be registered with the Certificate Authority (CA) and, it can be authenticated based on the hash function. After that, the optimal path between the source and destination is identified by the use of Particle Swarm Optimization (PSO) algorithm. Correspondingly, an Advanced Encryption Standard (AES) algorithm is used to convert the original data into a cipher data with the private and public key pair. Then, the route establishment and packet transmission are performed by using the Dynamic Source Routing (DSR) protocol. This framework improves the overall performance and security of network with reduced energy consumption, delay ratio, and loss of packets. The experimental analysis is performed to evaluate the proposed framework based on the measures of Packet Delivery Ratio (PDR), average time consumption, memory consumption, and throughput. Also, it is compared with the existing security mechanisms for proving the superiority of the proposed technique.

A mobile adhoc network is a collection of autonomous mobile nodes that that communicate with each other over wireless links. Hosts need to specify the requirements of the neighbors for efficient routing outside their transmission range. However, since there is no stationary infrastructure such as base stations, each host has to act as a router in itself and hence, a routing protocol runs on every host and is therefore subject to the limit of the resources at each mobile host. This paper proposes a new Efficient and dynamic probabilistic broadcasting (EDPB) approach, which solves the broadcast storm problem of AODV. Global Mobile Simulator is used to run simulations. The main performance metrics considered in simulations are routing overhead and end-to-end delays. The results show that, the normalized routing load is reduced to around 35% to 40% compared with AODV-blind flooding and AODV-fixed probability model, at a very heavy traffic load, when used with AODV-EDPB. The results show that AODV-EDPB algorithm performs better than AODV-blind flooding and AODV-fixed probability in terms of packet delivery ratio, end-to-end delay etc. especially in dense networks.

Quality of Service (QoS) guarantees must be supported in a network that intends to carry real time and multimedia traffic. IETF RFC 2386 defines QoS as a set of service requirements to be met by the network while transporting a packet stream from source to the destination. The dynamic network topology and wireless bandwidth sharing makes QoS provisioning far more challenging in wireless networks as compared to the wired counterparts. The support for the QoS services is underpinned by QoS routing. A QoS routing protocol selects network routes with sufficient resources for the satisfaction of the requested QoS parameters. The goal of QoS routing is to satisfy the QoS requirements for each admitted connection, while achieving global efficiency in resource utilization. The problem of QoS routing with multiple additive constraints is known to be NP-hard. This requires the QoS dynamics to be fully understood before it can be implemented in wireless ad hoc networks. The paper discusses the issues involved in QoS routing and presents an overview and comparison of some existing QoS routing protocols. The article concludes with some open issues for further investigation.

MANET is a network that consists of mobile autonomous nodes often composed of mobile devices. Here the nodes must cooperate with each other to establish communication. Each node in the MANET acts as a router by cooperating with each other's to forward data packets. The presence of collaboration of malicious nodes may disrupt the routing processes and lead to network failures. The lack of infrastructure with dynamic topology may lead MANETs to be exposed to black hole attacks and gray hole attacks. If there are malicious nodes present in the MANET it may violate Security conditions and launch grey hole attacks and black hole attacks. This can be overcome by CBDS which is defined using DSR protocol which integrates both proactive and reactive defense architectures. CBDS uses the reverse tracing algorithm. A security algorithm is proposed to enhance security, increase and refine the throughput and increase the packet delivery ratio. The proposed security algorithm outperforms the CBDS scheme.