Essay On ECDSR

852 Words4 Pages
Energy Conscious DSR in MANET (ECDSR) ECDSR [18] uses the concept of traditional DSR and exploit it's two very importance characteristics. As Energy saving and Energy Survival in DSR, through which it not only improve the life time of the network but also maximizes the overall performance of the networks. ECDSR is not only turning out to be an energy conscious routing protocol but also proved itself as a better routing protocol than the traditional DSR. In all performance metrics ECDSR has shown better results than DSR. Our method has improved the individual node life time and so the whole network life span with a 60.6 1 % of improvement with respect to traditional DSR. It is also found that the energy consumption per successful packet delivery is 0. 1 joule lesser than that of DSR. Packet delivery ration has been increased from 82.7 % to 85.3 %. Interestingly our proposed ECDSR reduces the number of dropping packet from 4 to 2 as ECDSR chooses its first path with the higher traffic time as the selection procedure is based on the residual power of the individual nodes. Adhoc Ondemand Distance Vector Routing(AODV) The AODV[8] algorithm is an improvement of DSDV. It reduces number of broadcast by creating routes on demand basis, as against DSDV that maintains mutes to each known destination (Royer 1999b, Perkins and Royer, 1999a]. When source requires sending data to a destination and if route to that destination is not known then it initiates route discovery. AODV allows the nodes to respond to link failure occur and network topology changes in a timely manner. So the routes, which are not in use for long time, are removed from the table. Also AODV uses Destination Sequence Numbers to avoid loop formation and Count to Infinity Pr... ... middle of paper ... ... AODV-EDPB [21] This protocol become aware of a broadcast message at each node, the node transmit a messages according to a high probability if the message or data is received for the first time, and the no. of neighbors of each node is less than average number of neighbors of its surrounding environment. Hence, if node has less number of neighbors, retransmission should be likely. Otherwise, if node has a high number of neighbors its rebroadcast probability is set low. This algorithm is a combination of the probability based and knowledge based approaches. It dynamically adjusts the re-broadcast probability at each mobile host according to the value of the local number of neighbors. The value of probability changes when the host moves to a different neighborhood. In a scattered area, the rebroadcast probability is larger and in soupy area, the probability is lower.

    More about Essay On ECDSR

      Open Document