Hyper-heuristics for power-aware routing protocols

• Autorzy: Pilski M. , Seredynski F.
• Języki publikacji: EN

Abstrakty

EN

The idea underlying hyper-heuristics is to discover some combination of straightforward heuristics that performs very well across a whole range of problems. In this paper we describe genetic algorithm-based (GA) approach that learns such a heuristic combination for solving energy-efficient routing problem in mobile ad hoc networks (MANETs).

Słowa kluczowe

EN

protocols; ad hoc network; genetic algorithm; hyper-heuristics

• Wydawca: Wydawnictwo Uniwersytetu Przyrodniczo-Humanistycznego w Siedlcach
• Czasopismo: Studia Informatica : systems and information technology
• Rocznik: 2008
• Tom: Vol. 2(11)
• Strony: 37--47
• Opis fizyczny: Bibliogr. 9 poz., rys., wykr.

Twórcy

autor

Pilski M.

• Institute of Computer Science, University of Podlasie, Sienkiewicza Str. 51, 08-110 Siedlce, Poland

autor

Seredynski F.

• University of Warmia and Mazury in Olsztyn, Oczapowskiego Str. 2,10-719 Olsztyn-Kortowo, Poland

Bibliografia

• 1. Abolhasan М., Wysocki T.A., Dutkiewicz E., (2004). A review of routing protocols for mobile ad hoc networks, Elsevier, Ad Hoc Networks Vol. 2, No. 1,1-22.
• 2. Basagni S., Conti М., Giordano S., Stojmenovic I., (2004) Mobile Ad Hoc Networking, Published Wiley-ШЕЕ Press.
• 3. Cui Y., Xue Y., Nahrstedt K. (2006). A utility-based distributed maximum lifetime routing algorithm for wireless networks, Vehicular Technology ШЕЕ Transactions on Vehicular technology, Volume 55, Issue 3, 797-805.
• 4. Goldberg D.E., (1989). Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley.
• 5. Johnson D.B., Maltz D.A., Hu Y.C., (2004, visited: January 2008). The dynamic source routing protocol for mobile ad hoc networks (DSR) http://tools.ietf.org/id/draft-ietf-manet- dsr-10.txt
• 6. Pilski М., Seredynski F., (2008). Hyper-heuristics for Power-aware Routing Protocols, Proceedings of Artificial Intelligence Studies, Vol. 5 (28)/2008 Publishing House of University of Podlasie, Siedlce 2008,93-100.
• 7. Ross P., Marin-Blazquez J. G, Schulenburg S., Hart E., (2003). Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics, Genetic and Evolutionary Computation - GECCO 2003, Springer-Verlag Berlin Heidelberg, LNCS 2724,1295-1306.
• 8. Tseng Y.C., Ni S.Y., Chen Y.S., Sheu J.P., (2002). The broadcast storm problem in a mobile ad hoc network, Wireless Networks, vol. 8, Short version in MOBICOM 99, 153-167.
• 9. Wedde H.F., Farooq М., Pannenbaecker Т., Vogel B., Mueller C., Meth J., Jeruschkat R., (2005). BeeAdHoc: An Energy Efficient Routing Algorithm for Mo-bile Ad Hoc Networks Inspired by Bee Behavior, Proc. of Genetic and Evolutionary Computation Conference, 153-160.