000			02130cam a2200349 a 4500
003			EG-GiCUC
005			20250223031746.0
008			170722s2016 ua h f m 000 0 eng d
040			_aEG-GiCUC _beng _cEG-GiCUC
041	0		_aeng
049			_aDeposite
097			_aM.Sc
099			_aCai01.12.17.M.Sc.2016.Re.R
100	0		_aReem Farag Ahmed Farag
245	1	0	_aRouting algorithms over ad Hoc wireless Networks / _cReem Farag Ahmed Farag ; Supervised Laila F. Abdelal , Amira M. Kotb , Tamer H. Farag
246	1	5	_aخوارزميات التوجيه على الشبكات اللاسلكية المخصصة
260			_aCairo : _bReem Farag Ahmed Farag , _c2016
300			_a64 P. : _bfacsimiles ; _c25cm
502			_aThesis (M.Sc.) - Cairo University - Faculty of Science - Department of Mathematics
520			_aAlong the past two decades, a lot of routing algorithms were implemented to ad hoc wireless networks. Although most of them nd the shortest discovered path, they have di erent network performances. In this thesis, an empirical study is conducted to dis-cover the guidelines required for selecting the highest performance routing algorithm. The study has been conducted on two routing algorithms (AODV and SARA) and three topologies. The three topologies have been selected to represent three levels of interfer- ence. The characteristics of the routing algorithms have been investigated under di erent scenarios. According to the results, higher performance of the AODV routing algorithm has been observed in lower interference scenarios. On the other hand, higher performance of the SARA routing algorithm has been observed in higher interference scenarios
530			_aIssued also as CD
653		4	_aAd hoc routing algorithms
653		4	_aAd hoc wireless networks
653		4	_aSimple ant routing algorithm
700	0		_aAmira Mohamed Kotb , _eSupervisor
700	0		_aLaila Fahmy Abdelal , _eSupervisor
700	0		_aTamer Hashm Farag , _eSupervisor
856			_uhttp://172.23.153.220/th.pdf
905			_aNazla _eRevisor
905			_aSamia _eCataloger
942			_2ddc _cTH
999			_c61645 _d61645