A geodesic is the real world analog of a straight line. Where a straight line on a flat piece of paper minimizes the distance between two points, a geodesic minimizes the distance between two points on any surface; be it flat or not.Supposing that we have a surface in spacegiven by the equation z = f (x, y).The search for a geodesic line on this surface, or more generally in the plan provided by an arbitrary metric, may be made by solving the coupled differential second orderequations of Euler-Lagrange system. More precisely, the search of the shortest path connecting two given points may be made by solving that system for a specific initial velocity. In this paper we determine the geodesic lines corresponding the metric of type g =(dx2 + dy2) for f (x, y) defines positive. Starting from a metric of this type, we determine the Euler- Lagrange system correspondence; its solutions are geodesics. We designed geodesics and the shortest path for the given metric and a specific function f (x, y). We will need to determine the appropriate initial velocity for the system's numerical resolution of two differential equations of second order. Therefore, we are providing a suitable method for this.

---

Journal: International Journal of Computer Science and Information Security, (Feb 2016), pp.19-22. Vol.14. 2016

Finding correspondences automatically from a pair of un-calibrated images is a challenging phase in 3D reconstruction. Two proposed methods based on the existing SIFT and SURF key point detector and descriptor are introduced in this work to find correspondences automatically from high resolution pair of images for aerial scenes. The characteristics of the data set involved in this research in terms of size and the presence of affine transformation add more challenges in finding the set of desirable matches.

---

Journal: The Journal of MacroTrends in Technology and Innovation Vol.4. 2016

Mobile Ad-hoc network (MANET) is characterized with high mobility and frequent topology change. Routing in MANET should follow these constrains, otherwise, it can severely degrade the performance of MANET. Greedy perimeter stateless routing (GPSR) in MANET uses one-hop neighbor's location information to make the forwarding decision. GPSR uses proactive update method to distribute position information via periodic “beacon” messages (PMs). The increasing in accuracy ratio leads to high communication overhead that will be in the expense of network resources. To address this problem, this paper presents a simple and efficient updating algorithm using Dynamic Fuzzy Logic Controller and Mobility Prediction (DBUM). DBUM is constructed of two patterns to improve the accuracy of node's location information. DBUM algorithm is able to improve the accuracy of node's location information with less

---

Journal: 2018 IEEE International Conference on Electro/Information Technology (EIT)

Mobile learning applications utilise the advantages of mobile technologies to increase learning opportunities, mainly on an anytime, anywhere basis. The advancement of mobile technology has facilitated the development of numerous applications to improve students’ learning experience and performance. Successful implementation of m-learning is highly dependent on learning context and environment awareness. This work presents a multiphase exploration of early phases responsible for defining and validating the m-learning context, and later phases based on context validation results achieved from the previous phases, involving the development and evaluation of a new m-learning context prototype. This new prototype proved to provide context-aware and ubiquitous learning services fulfilling several diverse user interaction levels and requirements.

---

Journal: , Int. J. Computer Applications in Technology, Vol. 58, No. 4, pp.296–307.

Mobile Ad-hoc network (MANET) is the guiding technology of ubiquitous era and a cornerstone in the 4G communication architecture. MANET has limited resources and characterized with high mobility and frequent topology change. Routing in MANET should follow these constrains, otherwise, it can severely degrade the performance of MANET. Owing to Greedy routing (GFS) nature in MANET, a certain part of the MANET becomes congested before other parts. In such area the nodes have failed to forward packets in a timely manner or drop them, thus such nodes called Network Holes. This paper presents a simple and efficient enhanced GFS routing algorithm called Intelligent Fuzzy logic Greedy forwarding Scheme (IFGFS). IFGFS consider the De-congestion level of each mobile node as another selective metric besides distance. In order to validate our algorithm, we rely on a wide simulation experiments. The evaluation results showed the correctness of our new proposed algorithm the adaptive- congestion IFGFS which maximize the performance of the network.

---

Journal: ComputerandInformation Science; Vol. 11, No. 2; 2018 ISSN 1913-8989 E-ISSN 1913-8997

This paper delves into the capacity of enhanced Big Bang-Big Crunch (EBB-BC) metaheuristic to handle data clustering problems. BB-BC is a product of an evolution theory of the universe in physics and astronomy. Two main phases of BB-BC are big bang and big crunch. The big bang phase involves a creation of a population of random initial solutions, while in the big crunch phase these solutions are shrunk into one elite solution exhibited by a mass center. This study looks into enhancing the BB-BC’s effectiveness in clustering data. Where, the inclusion of an elite pool alongside implicit solution recombination and local search method, contribute to such enhancement. Such strategies resulted in a balanced search of good quality population that is also diverse. The proposed elite pool-based BB-BC was compared with the original BB-BC and other identical metaheuristics. Fourteen different clustering datasets were used to test BB-BC and the elite pool-based BB-BC showed better performance compared to the original BB-BC. BB-BC was impacted more by the incorporated strategies. The experiments outcomes demonstrate the high quality solutions generated by elite pool-based BB-BC. Its performance in fact supersedes that of identical metaheuristics such as swarm intelligence and evolutionary algorithms.

---

Journal: Journal of Computer Science Volume 14, Issue 12

Mobile Ad hoc Networks (MANETs) are considered as a reunion of wireless mobile devices (nodes) that form a temporary wireless network. In order to facilitate communication in MANET, every node has to participate in the routing process. Reaching an optimal route is a fundamental task in MANET, because routes are multi-hoped and susceptible. Several routing protocols exist and can be categorized to; topology-based and position-based routing protocols. However, the efficiency of these protocols in highly dynamic and dense environments is a challenging task to be considered for increasing perceived Quality of Service (QoS) in MANET. This paper focuses on the presentation and basic operation of each category. A performance evaluation study was conducted comparing between both categories in terms of End-to End delay, packet- delivery ratio and routing overhead. Results analysis show that position-based protocols outperforms topology-based protocols in dense and high dynamic environments. Recommendations for implementing future efficient position-based protocols were presented.

---

Journal: International Journal of Interactive Mobile Technologies (iJIM), 11(1), 84-97

Current greedy routing protocol (GFS) designed to find shortest path as a single routing objective. Considering only one routing objective is insufficient for the computation of a reliable rout, and can severely compromise network performance on the remaining overlooked objectives. This paper introduces the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism (DRESM). The intended DRESM is constructed of two coherent techniques; the Fuzzy Logic Dynamic Nodes’ Reliability Estimation (FLDRE) and the Status Information Distribution and Outgoing Traffic Control Management (IDOTM). FLDRE introduce the notion of multi-criteria next relay node selection using fuzzy weighted logic multi-objectives. IDOTM provides the sender node with fresh information about its neighbour and control the outgoing traffic. The simulation results show that DRESM outperforms GFS in terms of packet delivery ratio, average end-to-end delay. Moreover, DRESM can find routs whose cost is close to the optimum.

---

Journal: IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.6, June 2016

Mobile Ad-hoc Network (MANET) characterized with high mobility and very limited resources. Such network requires a very high reliable routing protocol to be compatible with its limitations. In position-based routing protocols for MANET, each node chooses the next relay node for packet routing solely from neighbourhood stored in its neighbours’ matrix (NLM). The lifetime of neighbors’ entry in NLM matrix relates to beacon interval and timeout interval. Inaccurate information of NLM matrix may lead to a wrong selection decision, which can have devastating consequences on MANET resources. Thus, the freshness of the information in a node’s NLM matrix is in a high demand. This paper presents an intelligent dynamic fuzzy logic controller refreshment period of entries in neighbourhood matrices (IFPE) scheme. The IFPE algorithm utilizes neighbour’s Residual Lifetime of Links (RLT) in the fuzzy logic controller as an input, and the called neighbour expire entry life-time (ELT) as an output. Simulation results show that IFPE algorithm keeps neighbourhood matrices consistent, which achieve considerable improvement for position-based routing protocols performance.

---

Journal: International Journal of Computer Science and Information Security (IJCSIS), Vol. 14, No. 1, January 2016

A Mobile Ad hoc network (MANET) is a dynamic selforganizing multi-hop wireless network. Owing the random and unpredictable movement of the mobile nodes, the topology is changing rapidly and frequently. In MANET, where is no routing infrastructure like fixed routers and routing backbones, all MNs participate in the routing process. Recently, position-aware routing protocols, and because of their simplicity, position awareness, and scalability, are the most routing protocols used with MANET. In recent years, a variety of position-aware routing protocols have been developed. The efficiency of such protocol affects by the used underlying mobility model. Thus, wrong selection of the Mobility model may has devastating consequences on the performance MANET. Research efforts haven't focused much in evaluating their performance when applied to different mobility models. In this paper, we have studied the effect of two different mobility models; Random Waypoint mobility model (RWP) and Boundless Mobility Model (BDM) on the performance of selected group of position-based routing protocols. The performance analysis was carried out by using the network simulator, Ns2. The simulation results clarify the performance of the selected routing protocols with three performance metrics

---

Journal: Performance Evaluation