header
Local cover image
Local cover image
Image from OpenLibrary

Intelligent routing in mobile Ad-Hoc networks / Amir Ibrahim Amin Mohamad ; Supervised Imane Aly Saroit Ismail , Haitham Safwat Kamal Hamza

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Amir Ibrahim Amin Mohamad , 2014Description: 101 Leaves : charts ; 30cmOther title:
  • تحديد المسار الذكي في شبكات الـ-آد هوك المتحركة [Added title page title]
Subject(s): Online resources: Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Information Technology Summary: Recently, more and more attention is drawn to wireless communication especially Mobile Ad Hoc Networks (MANET) for the flexibility they provide. MANETs inherit traditional wireless and mobile communications problems such as bandwidth limitation, power conservation, and quality of service (QOS) issues. Shortest path problem in MANETs is a dynamic problem because of the unpredictable MANET environment and the continuously changing topology. To compute the continuously changing shortest path with at least two additive metrics, a meta-heuristic dynamic optimization technique is required. Some evolutionary dynamic optimization techniques (EDO) have been used to compute the shortest path in MANETs, namely multi-population genetic algorithm with immigrants scheme (iMPGA). In this thesis, we propose a modified Harmony Search (HS) algorithm called dynamic optimization harmony search algorithm (DOHS), to compute the dynamic shortest path in MANETs. When compared with iMPGA, proposed DOHS outperformed with a noticeable 98.52% reduction in time and 20.25% average improvement in solution quality
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.01.M.Sc.2014.Am.I (Browse shelf(Opens below)) Not for loan 01010110064188000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.01.M.Sc.2014.Am.I (Browse shelf(Opens below)) 64188.CD Not for loan 01020110064188000

Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Information Technology

Recently, more and more attention is drawn to wireless communication especially Mobile Ad Hoc Networks (MANET) for the flexibility they provide. MANETs inherit traditional wireless and mobile communications problems such as bandwidth limitation, power conservation, and quality of service (QOS) issues. Shortest path problem in MANETs is a dynamic problem because of the unpredictable MANET environment and the continuously changing topology. To compute the continuously changing shortest path with at least two additive metrics, a meta-heuristic dynamic optimization technique is required. Some evolutionary dynamic optimization techniques (EDO) have been used to compute the shortest path in MANETs, namely multi-population genetic algorithm with immigrants scheme (iMPGA). In this thesis, we propose a modified Harmony Search (HS) algorithm called dynamic optimization harmony search algorithm (DOHS), to compute the dynamic shortest path in MANETs. When compared with iMPGA, proposed DOHS outperformed with a noticeable 98.52% reduction in time and 20.25% average improvement in solution quality

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image