Search Results - (( data selection path algorithm ) OR ( data simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

    A noble approach of ACO algorithm for WSN by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2018
    “…A noble approach of ant colony optimization (ACO) algorithm for discovering the optimum route in the WSNs for data transmission is proposed here for enhancement and optimization considering the issue of path selection to reach the nodes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  3. 3

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

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  4. 4

    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
  5. 5

    Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2014
    “…Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  6. 6

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
    Get full text
    Get full text
    Thesis
  7. 7

    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
    “…To minimize the communication overhead with the help of optimal path selection in Wireless Sensor Network (WSN) routing protocols is the challenging issue. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…The RRSEB operations focus on enhancement of the path recovery process, this is done by introducing proactively route mechanism to create alternative paths together with the data routing obtained by path discovery stage in order to reduce the packet drops. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A mating technique for various crossover in genetic algorithm for optimum system identification by Abd Samad @ Mahmood, Md Fahmi, Zainuddin, Farah Ayiesya

    Published 2021
    “…To researchers who are involved in the application of Genetic Algorithm (GA) in optimization, the process of choosing the best parents in the population for mating has become of great interest. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…Furthermore, recent Internet traffic dominated by video data transmission in real-time requires path selection metrics for handling delay stringent nature of such traffic. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  11. 11

    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

    Published 2016
    “…As a result, this thesis proposes a centralized on-demand channel reservation scheme (AODV-MRCR) that provides an efficient way of utilizing the multiradio and multi-channel resources to establish high throughput path for the gateway traffic. To ensure high throughput path, AODV-MRCR uses path optimization as an intelligent mechanism to select a path with least interference and eliminate the intra-flow interference. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  14. 14

    Efficient hybrid flooding scheme for ad-hoc on-demand distance vector routing protocol in MANET by Waheed, Bassam M.S.

    Published 2014
    “…The protocol is a distance-based one, which depends on the change in the nodes geographic location to make them exchange their neighbor information. Thresholds selection is based on three performance metrics namely: maintenance overhead, number of times the links break and data delivery ratio. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    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
    “…When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Empirical evidences based on simulated data sets indicated that the proposed modified k-means algorithm is able to recognise the optimum number of clusters for uncorrelated data sets. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…There is also the case where the Ant-miner cannot find any optimal solution for some data sets. Thus, this thesis proposed two variants of hybrid ACO with simulated annealing (SA) algorithm for solving problem of classification rule induction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20