. Protocols have designed for multicasting in MANETs that ODMRP is one of them. ODMRP is on-demand and mesh based protocol that delivers packets from source to destination by building a mesh. PDR is most important metric that we should consider in packet forwarding. It may affects by different criteria

at the destination without incurring excessive delay. Our scheme works by adding an overhead to each packet, which is calculated as a linear function of the original packet bits. The resulting packet (information and overhead) is fragmented into smaller blocks and distributed over the available paths

Most existing on-demand mobile ad hoc network routing protocols continue using a route until a link breaks. During the route reconstruction, packets can be dropped, which will cause significant throughput degradation. In this paper, we add a link breakage prediction algorithm to the Dynamic Source

Vehicular adhoc network is promising approach for future intelligent transportation system. These networks have no fixed infrastructure and instead relay on the vehicles to provide network functionality [1]. Intelligent transport system [2] is evolved by increasing road accidents, user demands for drive-thru internet connection and some other applications is to improve road safety, Increase transport efficiency. Vehicles as equipped with sensors and communication devices these are formed by communication

. Results show that DRP considerably improves the packet delivery ratio.

multicast routing protocol that delivers packets to all intended recipients with high probability. Due to a number of reasons, 100 % packet delivery cannot be achieved, but packet delivery ratios in excess of 99 % are possible in most cases. 1

Wireless sensor networks promise fine-grain monitoring in a wide variety of environments. Many of these environments (e.g., indoor environments or habitats) can be harsh for wireless communication. From a networking perspective, the most basic aspect of wireless communication is the packet delivery

This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today’s heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.

-to-end behaviors due to the different directions of the Internet paths, which often exhibit asymmetries. We characterize the prevalence of unusual network events such as out-of-order delivery and packet corruption; discuss a robust receiver-based algorithm for estimating "bottleneck bandwidth

of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar