Abstract We present a new algorithm called Density-based probabilistic routing algorithm (AODV–Probabilistic) for efficient data transmission in mobile ad-hoc networks. We also define a new metric for routing called traffic density to represent the degree of contention at the medium access control layer. To evaluate the performance of our proposed protocol, we identify three different environments: a high density, a variable density and a... We present a new algorithm called Density-based probabilistic routing algorithm (AODV–Probabilistic) for efficient data transmission in mobile ad-hoc networks. We also define a new metric for routing called traffic density to represent the degree of contention at the medium access control layer. To evaluate the performance of our proposed protocol, we identify three different environments: a high density, a variable density and a sparse density. Simulation results show noticeable improvement under the three environments. Under the settings we examine, our proposed algorithm achieve up to 22 percent higher percentage of average data throughput for different offered data loads and speeds than AODV and 30 percent higher than OLSR at the three environments without incurring any additional routing overheads or intense computation. Read More Read Less

Abstract The purpose of the data dissemination in wireless sensor networks is to send any type of information (data or query) to all nodes concerned by this information, while minimizing the number of transmission nodes and the cost of energy. Data dissemination is considered as a main phase of energy consumption in the communication of Wireless Sensor Networks. Hence the way to eliminate redundant... The purpose of the data dissemination in wireless sensor networks is to send any type of information (data or query) to all nodes concerned by this information, while minimizing the number of transmission nodes and the cost of energy. Data dissemination is considered as a main phase of energy consumption in the communication of Wireless Sensor Networks. Hence the way to eliminate redundant data traffic and reduce communication cost are the main challenges of the data dissemination. Depending on how to collect data and process them, we can distinguish in this article the Client/Server based data dissemination protocols, and the Mobile Agents protocols. Read More Read Less

Abstract An ad hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Several routing protocols have been proposed for ad hoc networks and prominent among them are Ad hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR). Effort has been made to merge software Quality assurance... An ad hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Several routing protocols have been proposed for ad hoc networks and prominent among them are Ad hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR). Effort has been made to merge software Quality assurance parameters to adhoc networks to achieve desired results. This Paper analyses the performance of AODV and DSR routing protocols for the quality assurance metrics. The performance differentials of AODV and DSR protocols are analyzed using NS-2 simulator and compared in terms of quality assurance metrics applied. Read More Read Less