Avoiding Link Breakages In Ad-hoc Networks Using The Packet's Received Time Predictions

Most existing on-demand mobile ad-hoc network routing protocols continue using a route until a link breaks. During the route re-construction, packets can be dropped, which will cause significant throughput degradation. When two nodes are moving out of their transmission range the link will break. This thesis introduces the Packets Received Time (PRT) for predicting the link state, that is, if a particular node is soon to go out of transmission range. The PRT algorithm sends an error message to the sending node to re-establish a new route to the destination node or repair the old one.The Prediction Algorithm together with PRT approach enhances the performance of the existing reactive on-demand ad-hoc network protocols. The PRT algorithm was implemented with an Ad-hoc On-demand Distance Vector (AODV) protocol and a Dynamic Source Routing (DSR) protocol. The new approach is compared with the original AODV and (DSR) in both CBR and TCP traffics using various scenarios. In the simulation method I am not going to compare the TCP traffic with CBR traffic, but I will compare TCP traffic with the original AODV and the AODV PRT (AODV with packets received time prediction), and also compare CBR traffic with the original AODV and AODV PRT, because CBR is the service class and TCP is a transport layer protocol. The simulation results showed that this scheme is more efficient in reducing the total numbers of dropped packets during the data packets flow on...