Search In this Thesis
   Search In this Thesis  
العنوان
Routing Optimization Of Mobile Ad-Hoc Networks Based On Ant Colony Algorithms /
المؤلف
Abd Elmoniem, Ahmed Mohamed.
هيئة الاعداد
باحث / احمد محمد عبد المنعم سيد
مشرف / حسنى محمد ابراهيم
مناقش / فتحى احمد السيد عامر
مناقش / يوسف بسيونى مهدى
الموضوع
Algorithms.
تاريخ النشر
2012.
عدد الصفحات
109 P. ;
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
Computer Networks and Communications
الناشر
تاريخ الإجازة
29/7/2012
مكان الإجازة
جامعة أسيوط - كلية الحاسبات والمعلومات - Computer Science
الفهرس
Only 14 pages are availabe for public view

from 16

from 16

Abstract

In recent years, mobile computing and wireless networks have enjoyed a tremendous rise
in popularity and technology advancement. The design of smaller and more powerful
communication devices is rapidly changing the way humans interact and communicate.
Ad-hoc networking is a concept in computer communications, which means that users
wanting to communicate with each other form a temporary network, without any form
of centralized administration. Each node participating in the network acts both as host
and a router and must therefore be willing to forward packets for other nodes. For this
purpose, a routing protocol is needed.
An ad-hoc network has certain characteristics, which imposes new demands on the
routing protocol. The most important characteristic is the dynamic topology, which is a
consequence of node mobility. Nodes can change position quite frequently, which means
that a routing protocol that quickly adapts to topology changes is needed. The nodes
in an ad-hoc network can consist of laptops and personal digital assistants and are often
very limited in resources such as CPU processing, storage capacity, battery power and
bandwidth. This means that the routing protocol should try to minimize control trac,
such as periodic update messages. Instead the routing protocol should be reactive, thus
only calculates routes upon receiving a speci c request.