350 rub
Journal Science Intensive Technologies №3 for 2009 г.
Article in number:
Optimization Method of a Routing Protocol for Wireless Network
Authors:
Ivanov D.V.
Abstract:
Wireless networks which are getting more wide usage are qualitatively differ from wired fixed networks. They are highly dynamic from their nature and thus require specialized routing protocols to function properly. The efficiency of a routing protocol depends also on the environment conditions. These factors force designers of wireless routing protocols to build protocols with the ability in mind to adjust the protocol to various working conditions defining a set of tunable parameters. However there is no methodology to optimize such routing protocols to given working conditions except manual selection or an expert-s opinion. In this paper a new optimization method for a wireless routing protocol based on a genetic algorithm is proposed. Genetic algorithms are one of the stochastic optimization methods for NP-full problems. To design and test the proposed optimization method OLSR routing protocol was chosen as one of the widely usable routing protocols for wireless networks. The protocol defines approximately 20 parameters which allows to adjust it to given working conditions. The goal is to improve two quality of service criteria: average packet delay and packet drop ratio for the network as a whole. A classical genetic algorithm was used for optimization process. To evaluate chromosomes in a population a simulation for the test scenarios is executed with the protocol parameters encoded in the chromosomes. The optimization and assessment of OLSR protocol was conducted in two network working modes: mobile where nodes moves at a fast pace within an area of the given size, and stationary where nodes move at a very low speed. The results show that the protocol optimized with the proposed method to given working conditions performs well on statistically similar operating conditions. Also, it is shown that in order to achieve robustness to various working scenarios it is necessary to train the protocol on more variable datasets that reflect a broad range of operating conditions. It allows to avoid the effect of overfitting though at the same time the protocol becomes less well tuned to specific conditions.
Pages: 26
References
  1. Sesay, S. A Survey on Mobile Ad Hoc Wireless Network [Text] / S. Sesay, Z. Yang, J. He // Information Technology Journal. - 2004. - V. 3. - P. 168-175.
  2. Liu, C. A Survey of Mobile Ad Hoc network Rotuing Protocols [Electronic document] / C. Liu, J. Kaiser. - University of Magdeburg. - 2005. - 36 P. Режим доступа: www.minema.di.fc.ul.pt/reports/report_routing-protocol-survey-final.pdf, свободный.
  3. Clausen, T. Optimized Link State Routing Protocol (OLSR) [Electronic document] / T. Clausen, P. Jacquet. - Project Hipercom. - 2003. - 75 P. (http://www.ietf.org/rfc/rfc3626.txt). Проверено 20.11.2008.
  4. Gomez, C. Improving Performance of a Real Ad Hoc Network by Tuning OLSR Parameters [Text] / C. Gomez, D. Garcia, J. Paradells // Proceedings of the 10th IEEE IEEE Symposium on Computers and Communication. - 2005. - P. 16 - 21.
  5. Huang, Y. Tuning OLSR / Y. Huang, N. Saleem, D. Parker [Text] // IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications. - 2006. - P. 1 -5.
  6. Spall, J. Introduction to Stochastic Search and Optimization: Estimation, Simulation and Control [Text] / J. Spall. - San-Francisco: WileyBlackwell, 2003. - 618 p.
  7. Рутковская, Д. Нейронные сети, генетические алгоритмы и нечеткие системы [Текст]/ Д. Рутковская, М. Пилиньский, Л. Рутковский; пер. И.Д. Рудинского. - М.: Горячая линия - Телеком, 2007. - 452 с.
  8. Adewuya, A. New Methods in Genetic Search with Real-Valued Chromosomes [Electronic document] / A. Adewuya. - Massachusetts Institute of Technology. - Режим доступа: http://dspace.mit.edu/handle/1721.1/10930, свободный.
  9. OMNET++ Discrete Event Simulation System [Electronic resource]. - Режим доступа: http://www.omnetpp.org/index.php, свободный. - Загл. с экрана.