%0 Journal Article
	%A M. Kargar and  F.Fartash and  T. Saderi and  M. Ebrahimi Dishabi
	%D 2008
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 24, 2008
	%T A Theory in Optimization of Ad-hoc Routing Algorithms
	%U https://publications.waset.org/pdf/9047
	%V 24
	%X 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.
	%P 4079 - 4084