Search Results - (( data distribution path algorithm ) OR ( _ evaluation window algorithm ))

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
Get full text
Get full text
Get full text

A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems by Ary, Maxsi

“…For objective two, three routing strategies were evaluated. Based on a single-vehicle optimal route, the algorithm provided the shortest distance, 91.74 km. …”
Get full text
Get full text
Get full text
Get full text

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. The obtained results show that the continuous in-band overlay path probing algorithm (COPPA) provides up-to-date bandwidth information with reduced overhead and minimal impact on the traffic of the path.…”
Get full text
Get full text

Performance analysis of ZigBeePRO network using shortest path algorithm for Distributed Renewable Generation by Islam, Syed Zahurul, Othman, Mohammad Lutfi, Islam, Syed Zahidul

“…In this paper, we have analysed the performance of the ZigBeePRO network by applying the shortest path algorithm while delivering energy data from the solar DRG to the SG. …”
Get full text
Get full text

Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

“…Ants’ algorithm belongs to the Swarm Intelligence (SI), which is proposed to find the shortest path. …”
Get full text
Get full text

Resource-efficient coverage path planning for unmanned aerial vehicle based aerial gateway in LoRaWAN by Ibrahim, Nurul Saliha Amani

“…Due to finite resource, multiple issues need to be considered in designing such system, including AG flight time, coverage radius and the achievable data rate of the ground-to-air system, thus an Energy Efficient Coverage Path Planning (EECPP) algorithm has been proposed. …”
Get full text
Get full text
Get full text
Get full text

Synchronization algorithm for remote heterogeneous database environment by Imam, A.A., Basri, S.B., Ahmad, R.B.

“…In this paper, we proposed a model and a unique algorithm to synchronize data between heterogeneous databases, in order to provide alternative synchronization paths, concurrency in operation and bidirectional mode of data exchange. …”
Get full text
Get full text

Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

“…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
Get full text
Get full text
Get full text

Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

“…The first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
Get full text
Get full text

An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network by Wan Isni Sofiah, Wan Din, Asyran Zarizi, Abdullah, Razulaimi, Razali, Ahmad Firdaus, Zainal Abidin, Salwana, Mohamad, Eh Phon, Danakorn Nincarean, Cik Feresa, Mohd Foozy

“…Currently, the data transmission from sensor nodes to the cluster head uses a single hop which consumes more energy; thus, in this paper the enhancement of previous algorithm, which is MAP, the data transmission will use several paths to reach the cluster head. …”
Get full text
Get full text
Get full text
Get full text

Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

“…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
Get full text
Get full text
Get full text

An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

“…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
Get full text
Get full text
Get full text

Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

Get full text
Get full text

Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

“…Crucial to this is the width of the sliding window. This study utilized raw data from network traffic and built a Neural Network (NN) model trained with the Cuckoo Search (CS) algorithm. …”
Get full text
Get full text
Get full text
Get full text

Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

“…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text

Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

“…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
Get full text
Get full text

Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

“…The proposed algorithm was evaluated using benchmark datasets comprising 56 VRPTW instances and 56 Pickup and Delivery Problems with Time Windows (PDPTW). …”
Get full text
Get full text

Performance evaluation and enhancement of EDCA protocol to improve the voice capacity in wireless network by Abu-Khadrah, Ahmed Ismail Mohammad

“…The OPNET simulator and the mathematical model were used to evaluate the performance for the proposed algorithm. …”
Get full text
Get full text
Get full text

Windows-Based bandwidth allocation on optical networks by Mahadevan, V., Yu, W., Zhou, J.

“…We hope in the next article we will make a comparison table among static and dynamic bandwidth allocations algorithms and propose an algorithm on dynamic bandwidth allocation and evaluate our proposed algorithm.…”
Get full text
Get full text

Design of intelligent Qira’at identification algorithm by Kamarudin, Noraziahtulhidayu

“…The process of the SPAP Algorithm is to extend parameters of the Affine Projection Block with two different selections of windowing length that affect the final accuracy on pattern classification. …”
Get full text
Get full text