Wesam Almobaideen

Learn More
Providing Quality of Service (QoS) for Mobile Ad Hoc Networks (MANET) is a challenging issue due to th e dynamic nat ure and limit ed res ources of such in frastructureless wireless net works. T his paper proposes a ne w app roach f or supporting QoS in clus tered MANET. T he proposed Cluster-Based Qo S (CBQoS) pro vides MA NET with i(More)
This paper proposes an enhancement for the ADRW algorithm to achieve dynamic fragmentation and object allocation in distributed databases. The algorithm adapts to the changing patterns of object requests with the objective to dynamically adjust the allocation schemes of objects in order to minimize the total servicing cost of all requests. Objects may be(More)
Detecting objects in a given video stream is an important step to understand their types, movements, and activities. Existing object detection algorithms suffer from their inability to detect the components constituting a particular object that may result in classifying such components as standalone objects. Such instances may happen particularly when the(More)
Clustering routing protocol provides an effective method for prolonging the lifetime of a wireless sensor network. But most of the researches care less about the communication between Cluster Head (CH) nodes [4] and Base Station (BS). This paper proposed a Multi-hop Cluster based Routing Protocol for long range transmission in wireless sensor network. The(More)
This paper describes a new fault tolerance routing algorithm for Hex-Cell networks. Hex-Cell is an interconnection network topology that employs an efficient routing algorithm and combines attractive features which make it a good candidate to be used for many applications. The Fault Tolerance Routing algorithm for Hex-cell networks (FTRH) presented in this(More)
AbstrAct: In many computer vision applications such as surveillance systems, detecting moving objects is the first step of information extraction. This paper introduces a query answering system that aims at responding to user queries without the need to scan the whole video tape. The proposed system is based on finding the minimum boundary rectangles (MBRs)(More)
1 Q A P C ,C 2m ij ij ij i j = Σ − i j i j c 1 (c) 0 otherwise c c  =   = = (ij k k 1 Q A C ,C) 2m 2m i j ij i j Abstract: Graph clustering is defined as grouping the vertices of a given input graph into clusters. This article proposes a Two-Phase Modularity-Based Graph Clustering (2-PMGC) algorithm based on modularity optimization. The algorithm(More)