International Journal of Information Technology and Web Engineering, 2014
In geographical routing algorithms, mobile nodes rely on geographical position to make routing ju... more In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show ...
International Journal of Information Technology and Web Engineering, 2014
In this paper, the authors present a robust three-dimensional fingerprint algorithm for verificat... more In this paper, the authors present a robust three-dimensional fingerprint algorithm for verification, indexing, and identification. The core idea behind our technique is to apply the eigen-decomposition to the mesh Laplacian matrix, and then compute minimum spanning trees (MST) of several concentrations of the mesh shape structure. The fixed size hash vector of a 3D mesh is defined in terms of the MST values and number of the initial patches. The extensive experimental results on several 3D meshes prove the uniqueness of the extracted hash vectors and the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as mixtures of these attacks.
2013 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT), 2013
ABSTRACT In this paper we present a robust three-dimensional fingerprinting algorithm for verific... more ABSTRACT In this paper we present a robust three-dimensional fingerprinting algorithm for verification, indexing, and identification. The core idea behind our technique is to capture the distribution of the normal vectors of a 3D triangle mesh, followed by partitioning the mesh into smaller sub-meshes. The hash vector of a 3D mesh is defined in terms of the mean values of several intervals extracted from the normal distribution and the minimum spanning tree of each sub-mesh. The experimental results on several 3D meshes prove the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as combinations of these attacks.
Abstract: In position-based routing algorithms, the nodes use the geographical information to mak... more Abstract: In position-based routing algorithms, the nodes use the geographical information to make routing decisions. Recent research in this field addresses such routing algorithms in two-dimensional (2 D) space. However, in real applications, the nodes may be distributed ...
International Journal of Information Technology and Web Engineering, 2014
In geographical routing algorithms, mobile nodes rely on geographical position to make routing ju... more In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show ...
International Journal of Information Technology and Web Engineering, 2014
In this paper, the authors present a robust three-dimensional fingerprint algorithm for verificat... more In this paper, the authors present a robust three-dimensional fingerprint algorithm for verification, indexing, and identification. The core idea behind our technique is to apply the eigen-decomposition to the mesh Laplacian matrix, and then compute minimum spanning trees (MST) of several concentrations of the mesh shape structure. The fixed size hash vector of a 3D mesh is defined in terms of the MST values and number of the initial patches. The extensive experimental results on several 3D meshes prove the uniqueness of the extracted hash vectors and the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as mixtures of these attacks.
2013 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT), 2013
ABSTRACT In this paper we present a robust three-dimensional fingerprinting algorithm for verific... more ABSTRACT In this paper we present a robust three-dimensional fingerprinting algorithm for verification, indexing, and identification. The core idea behind our technique is to capture the distribution of the normal vectors of a 3D triangle mesh, followed by partitioning the mesh into smaller sub-meshes. The hash vector of a 3D mesh is defined in terms of the mean values of several intervals extracted from the normal distribution and the minimum spanning tree of each sub-mesh. The experimental results on several 3D meshes prove the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as combinations of these attacks.
Abstract: In position-based routing algorithms, the nodes use the geographical information to mak... more Abstract: In position-based routing algorithms, the nodes use the geographical information to make routing decisions. Recent research in this field addresses such routing algorithms in two-dimensional (2 D) space. However, in real applications, the nodes may be distributed ...
Uploads
Papers by Alaa M Abdallah