Abstract
Routing is the process to distribute and send the packets from one node to another so as to reach the desired node in the network. In static wireless networks, the routing does not get affected by the energy constraints. We focus on the static networks and discuss the constrained multipath, distributed and load balancing routing algorithm by considering a undirected graph G(V,E) and trace the algorithm manually. This is a routing algorithm that works along with the routed protocol such as Internet protocol (IP). We maintain the neighbor nodes set, N and update the delay, path length to delay ratio to select the node and also update neighbor set, N to optimize the routing. This algorithm is a loop free and adaptive in nature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
