Search Results - (( data distribution computer algorithm ) OR ( data distribution path algorithm ))

Refine Results
  1. 1

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

    Published 2013
    “…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
    Thesis
  2. 2

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

    Published 2012
    “…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2015
    “…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
    Article
  4. 4

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

    Published 2016
    “…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
    Thesis
  5. 5

    Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine by Jalaluddin, Mohammad Fariduddin, Kamaru-Zaman, Ezzatul Akmal, Abdul Rahman, Shuzlina, Mutalib, Sofianita

    Published 2017
    “…The problem is caused by the delivery process that is not synchronized due to the problem of finding the best route of distribution. Distributors are unable to plan their distribution path with the minimal distance.Furthermore distributors are only able to reach each district distribution centre once a day and revisit the distribution centre will increase the time spent and operation cost. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    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

    Published 2019
    “…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
    Article
  7. 7

    Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network by Shabani, Hikma, Ahmed Mohamed, Ahmed Haidar, Norhuzaimin, Julai, Musse, Mohamud Ahmed, Hoole, P.R.P., Marai, Majdi

    Published 2017
    “…This paper proposes an optimal route configuration technique based on an adaptive genetic algorithm in which the architecture of multi-hop wireless sensor network is considered as a distributed computing infrastructure. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…The computational results suggest that the AS approach embedded with heuristic(s) outperforms the pure AS algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network by Najm Us, Sama, Kartinah, Zen, Atiq Ur, Rahman, Aziz Ud, Din

    Published 2019
    “…In this paper a novel energy efficient routing hole detection (EEHD) algorithm is presented, on the detection of routing hole, the periodic re-clustering is performed to avoid the long detour path. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2014
    “…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
    Thesis
  12. 12

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

    Published 2010
    “…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
    Thesis
  13. 13

    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2025
    “…This paper provides an overview of localization algorithms, including centralized and distributed algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Nano-scale VLSI clock routing module based on useful-skew tree algorithm by Eik Wee, Chew, Heng Sun, Ch'ng, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…This way, the computation result of proposed synthesis module can generate a clock signal distribution routing path with minimum wire length and, ensures the reliability of data synchronization for nano-scale VLSI design.…”
    Get full text
    Get full text
    Article
  15. 15

    Secured route optimization in mobile IPv6 wireless networks in terms of data integrity by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…This algorithm is able to detect and prevent the attacker from modifying the data with using an encryption algorithm at a cost of a small increase in delay. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks by Azam Khalili, Vahid Vahidpour, Amir Rastegarnia, Ali Farzamnia, Teo, Kenneth Tze Kin, Saeid Sanei

    Published 2021
    “…The incremental least-mean-square (ILMS) algorithm is a useful method to perform distributed adaptation and learning in Hamiltonian networks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Estimation of transformers health index based on condition parameter factor and hidden Markov model by Mohd Selva, Amran, Yahaya, Muhammad Sharil, Azis, Norhafiz, Ab Kadir, Mohd Zainal Abidin, Jasni, Jasronita, Yang Ghazali, Young Zaidey

    Published 2018
    “…Subsequently, the future states probability distribution was computed based on the HMM prediction model and viterbi algorithm was applied to find the best optimal path sequence of HI for the respective observable condition. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

    Published 2019
    “…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Boolean routing on high degree chordal ring networks by Matroud Bashi, Atheer Abbas

    Published 2001
    “…O(1) time complexity to compute a shortest path to any destination for the ring topologies has been shown. …”
    Get full text
    Get full text
    Thesis
  20. 20

    An energy based cluster head selection unequal clustering algorithm with dual sink (ECH-DUAL) for continuous monitoring applications in wireless sensor networks by Alagirisamy, Mukil, Chow, Chee Onn

    Published 2018
    “…Secondly, in applications like continuous monitoring, usage of static sink causes the clusters near the sink to die out faster, as the cluster heads in these clusters form the fixed path for data routing, hence resulting in hot spot problems. …”
    Get full text
    Get full text
    Article