A Theory in Optimization of Ad-Hoc Routing Algorithms

Free registration required

Executive Summary

In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amount possible. Ad-hoc networks are getting popular for their ease and speed in deployment, decreased dependence on infrastructure, being the only possible solution to interconnect a group of nodes and many commercial products available today.

  • Format: PDF
  • Size: 346.5 KB