Load aware multipath load balanced ad hoc routing protocol

During the last decade and especially during the late 90's, Wireless networks have almost exploded probably because of the fast growing Internet. Ad hoc networks need no infrastructure at all except the participating mobile nodes. The network topology being dynamic, the nodes need to always keep track of the other nodes or at least the nodes of interest. To maintain seamless communication between nodes, the routing algorithm to be employed should be an efficient one which takes into consideration various features of packet radio networks. These protocols must be designed and implemented so as to preserve the bandwidth and battery power, which are important resources, and also the main constraints of Ad hoc networking world. In large networks a significant amount of bandwidth would be used for route updates. These large amounts of updates result in great amount of overhead utilizing the already constraint bandwidth, and using a large amount of power needed to forward the updates. Various researches have showed that most of the protocols use a few centrally located nodes in a large number of routes.; In this thesis the author proposes a method for efficient balancing of the load across various nodes in the ad hoc network, thus removing the congestion problem and also preventing the early death of nodes. An analytical model has been developed to compare the power savings from the proposed model with respect to the traditional AODV protocol. A total network power savings of 0.4 to 14 percent has been found depending upon the case being considered and an average per node power saving of 39 to 54 percent has been observed.