Performance Comparison of Congestion Aware
V. Ramesh, P. Subbaiah, Sangeetha Supriya · 2010
Ad hoc n etworks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable, and movement of communicating parties are allowed. Due to the dynamic topology, developing better routing protocol became a ch allenging task. The Dynamic Source Routing ( DSR) protocol is a simple and eff icient routing protocol designed s pecifically for u se in multi-hop wireless ad hoc n etworks of mobile nodes. Multi-path routing protocol is one of the approaches used to have l ess o verhead, b etter bandwidth c ost b y distributing the load among a set of paths . However, due to interfering in the channels of the paths, multi-path increases the e nd t o end del ay and do no t work well in highly congested networks. In this paper we propose a congestion aware multi-path Dynamic Source R outing Protocol. we generate a s et of disjoint multi-paths and h andle the problem of end t o end del ay using the correl ation factor measurement. A set of p ath selection criteria have been used t o improve t he e nd t o end del ay. The si mulation experiments a re conducted using n s-2 network si mulator. We will compare the performance of the suggested algorithm to the performance of the conventional Dynamic Source Routing Protocol (DSR).