In this paper, we propose to optimize energy and overheads of a network by reducing the copies of messages in the network. The key idea behind the proposed scheme is to select the distance of encountered node from the destination to decide the relay nodes. This limits the number of relay nodes and thus reduces the communication energy and message overheads by producing lesser number of copies of the messages in the network. Further to maintain delivery of messages, the proposed protocol evaluates delivery probability of relay nodes. The measures of probability are inter-contact delay and variance in delay between the nodes. This probability is used to decide how many copies of a message is transferred to the encountered node. This further reduces the communication energy as well as message overheads. The simulation results show that our proposed strategy reduces message overheads and energy consumption as compared to the previous existing strategy while maintaining comparable delivery probability.

In this paper, we have evaluated the performance of flooding and probabilistic flooding broadcast methods in a VANET using real city map. A comparative analysis between the performance of these methods with varying traffic density and nodes speed has been conducted. Here, we have considered real city maps extracted from US census TIGER database. Node movements are generated using Intelligent Driving Model for lane Changing (IDM_LC) through VanetMobiSim mobility generator. A different probability for message dissemination is considered for the probabilistic broadcast method to investigate an appropriate probability value that may give best results. Different node densities, Sparse, Intermediate and Dense are considered. The results obtained show that in dense traffic scenario probabilistic flooding method achieves maximum packet delivery ratio for a specific value of p (i.e. 0.1). In sparsely populated network, the PDR is low as compared to other traffic conditions. In a sparse traffic density both the method perform better at high node mobility. But in intermediate and dense traffic scenario performance of both the methods is better in low node mobility.

In Mobile Ad hoc Network, path between source and destination node changes too frequently due to unpredictable behavior and movement of mobile nodes. The data delivery to the intended destination becomes very challenging. The paths exist between source and destination node may be various types. Data delivery may be done with single or multiple paths. Single path sometimes not guaranteed about data delivery, so one of the better solution is multipath data delivery. Here, in this paper, we have considered Link Disjoint and Node Disjoint multipath for data delivery. For this AOMDV protocol with node and link disjoint is considered to evaluate performance. To evaluate their performance different node pause time considered with varying number of nodes. We have computed various QoS network metrics like throughput, average end-to-end delay, routing overhead to identify in which method of data delivery perform better and in what conditions.  The results obtain shows that Node Disjoint multipath method AOMDV performs better than Link Disjoint method. The simulation work carried out using Simulator NS-2.34.

In Mobile Ad Hoc Network, data delivery is very challenging through single path due to dynamic changes in the network topology. To cope up this issue multipath data delivery is very useful. Recently, many works have been carried out in this domain but few are addressing the queueing effect on multipath scenarios. In this paper, we have designed a network model that based on the existence of multipath between source and destination node and every node behave as M/M/1 queue. In order to do this we generate K (K=1, 2, 3…i) paths are available between each source toward the destination node. The traffic arrivals in each node follow poisson process with arrival rate λ packets/sec. The simulation work of this multipath scenario based on varying mean inter-arrival time. The effect of arrival rate on the performance of multipath network model is analysed and compared. To better understand the effect of arrival rate in application and network layer various QoS metrics are computed. Significant performance of individual node is noticed in the obtained results with various arrival rates.