مواقع التدريسيينجامعة الكوفة
هديل نوري سعد جريو
أستاذ

هديل نوري سعد جريو

English Version
0بحث منشور
0محاضرة
0اهتمام بحثي

الملف الشخصي

- بكالوريس علوم حاسبات/ كلية العلوم جامعة بابل
- ماجستير علوم حاسبات في معالجة الانماط الذكية/قسم علوم حاسبات/ كلية العلوم جامعة بابل
- دكتوراه علوم في الشبكات / معهد المعلوماتية للدراسات العليا/ الهيئة العراقية للحاسبات

الاهتمامات البحثية

1

البحوث المنشورة

3
2019

Hybrid DSR: Evaluating AODV-Hello Messages on DSR Protocol

الباحثونAsst. Prof. Dr. Hadeel Noori Saad، Dr. Zainab Abbas Harbi, BSc. Hannan Abbas Salman
المجلةJournal of Engineering and Applied Sciences Year: 2019 | Volume: 14 | Issue: 14 | Page No.: 4896-48
مختصر البحث

Abstract: Routing in Mobile Ad hoc Network (MANET) is challenging due to the mobility of node, DSR and other reactive protocols needed to keep track of the intermittent changes of topology. Stale information in node’s caches results in erroneous routing decisions. In this study an AODV-hello mechanism for link availability checking will be used which will decrease error transmission on dead rout path. A comparison and performance evaluation of standard DSR and hybrid DSR routing protocols expose outperformance of the proposed protocol. The simulation has been implemented using NS2 simulator to identify and evaluate the new protocol for MANET’s.

2017

Weight analysis for weighted cluster algorithms in mobile ad-hoc network

الباحثونAsst. Prof. Dr. Hadeel Noori Saad، Lecturer Mohammed B. M. Kamel
المجلةJournal of Theoretical and Applied Information Technology
مختصر البحث

ABSTRACT Mobile ad-hoc network (MANET) is an infrastructure-less network with unstable dynamic nature. Such environment may cause high control signaling for self-rearrangement, and scalable problems. Weight-based Cluster routing algorithms aim to reduce configuration steps, retransmission and collisions. These algorithms differ in principal of cluster head selection upon some weight criteria such as (energy, connectivity, no. of node’s neighbors and mobility). In this research an analytical model was proposed to examine different criteria’s weights themes for cluster head election. The result expos the effect of the significant of multi combinations of them. Computation of criteria weight upon another criteria gives a smooth weight update with different update steps as results show. This can reflect new trend of weighted clustering algorithms based on network state.

2010

Source routing: Best rout using genetic algorithm

الباحثونHadeel Noori Saad
المجلةJournal of Kufa for Mathematics and Computer مجلة الكوفة للرياضيات والحاسوب ISSN: 11712076 Year: 2
مختصر البحث

Abstract Abstract The success of distributed multimedia traffic presents many challenges to the network designer, certain bandwidth as well as bounds on delay, loss probability and jitter in order to maintain reception quality are issues of Constraint Base Routing (CBR). Flow routing requires deterministic path coordination in comparison with data routing. This paper presents a new technique for best CBR-rout path computation using genetic algorithm. Available bandwidth, delay jitter, and path availability are the fitness function, the genetic algorithm try to optimize. Source routed packets were established to hold the complete elected path in packet header. All studies made on NS2 simulator, where SARBE approach for rapid on-line estimation of available bandwidth shows performance optimization on OSPF algorithm for multimedia streaming applications.

المحاضرات

5
عرض التفاصيل