@article{(Open Science Index):https://publications.waset.org/pdf/9047, title = {A Theory in Optimization of Ad-hoc Routing Algorithms}, author = {M. Kargar and F.Fartash and T. Saderi and M. Ebrahimi Dishabi}, country = {}, institution = {}, abstract = {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.}, journal = {International Journal of Computer and Information Engineering}, volume = {2}, number = {12}, year = {2008}, pages = {4079 - 4084}, ee = {https://publications.waset.org/pdf/9047}, url = {https://publications.waset.org/vol/24}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 24, 2008}, }