A Routing algorithm based on Wireless networks which routes packets by creating a route on-demand based on the source instead of relying on Traditional Routing Tables..
DSR is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes.. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration.. The protocol is composed of the two main mechanisms of "Route Discovery" and "Route Maintenance", which work together to allow nodes to discover and maintain routes to arbitrary destinations in the ad hoc network.. All aspects of the protocol operate entirely on demand, allowing the routing packet overhead of DSR to scale automatically to only what is needed to react to changes in the routes currently in use.. The protocol allows multiple routes to any destination and allows each sender to select and control the routes used in routing its packets, for example, for use in load balancing or for increased robustness.. Other advantages of the DSR protocol include easily guaranteed loop- free routing, operation in networks containing unidirectional links, use of only "soft state" in routing, and very rapid recovery when routes in the network change. ..The DSR protocol is designed mainly for mobile ad hoc networks of up to about two hundred nodes and is designed to work well even with very extremely high rates of mobility..
Refer Contributing.md file for more details and also the Contributors Code Structure should follow CODE_OF_CONDUCT Guidelines present in the CODE_OF_CONDUCT.md File..
Refer GitHub Wiki Pages for More Info,
- GitHub Wiki Pages - @EbenezerJesuraj
- Ebenezer Jesuraj - @EbenezerJesuraj
- Sujai Ram Prasath C - @sujairamprasathc