Search Results - (( data selection path algorithm ) OR ( using simulation based algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

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

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

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

    A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

    Published 2009
    “…Experimental works show the capabilities of the developed DSS in human path prediction using both simulated and actual WLAN-based positioning dataset. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…The end-to-end delay (EED) is introduced, which estimates the congestion level at the MAC and physical layers. The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…The end-to-end delay (EED) is introduced, which estimates the congestion level at the MAC and physical layers. The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

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

    Published 2018
    “…The proposed algorithm has been simulated and verified utilizing MATLAB and the simulation results demonstrate that new ant colony optimization based algorithm can achieve better performance and faster convergence to determine the best cost route.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  9. 9

    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
    “…There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective base station (BS). …”
    Get full text
    Get full text
    Article
  10. 10

    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
    “…In this work, an energy based cluster head selection unequal clustering algorithm (ECH-DUAL) using dual (static and mobile) sink is proposed. …”
    Get full text
    Get full text
    Article
  11. 11

    Genetic algorithm based network coding in wireless ad hoc networks by Tan, Shee Eng

    Published 2013
    “…In this work, an adaptive genetic algorithm based coding-aware routing (AGACAR) is also proposed to improve the solution on the GACAR. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Development of AODV based static multi-hop linear routing algorithm using 802.11 wireless sensor network for oil and gas pipeline by Mohamad Yusry Lee, Ikhwan Lee

    Published 2022
    “…On the other hand, in AODVTRI, the traffic is divided into three different routes (1) alpha path, (2) beta path, and (3) charlie path with consideration of x-axis. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Void avoidance opportunistic routing density rank based for underwater sensor networks by Ismail, Nasarudin

    Published 2021
    “…Firstly, the higher traffic load for selection next forwarding nodes in the problematic progression area problem was addressed by using the Opportunistic Routing Density Based (ORDB) algorithm to minimize the traffic load by introducing a beaconless routing to update the neighbor node information protocol. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

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

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Mobile Crowd Steering Evacuation Model via Agent Based Simulation by Applying the Social Force Model by Norhaida, Binti Hussain, Wai Shiang, Cheah, Wai Loke, Seng

    Published 2025
    “…The context manager, path planning, and movement module of the original SFM were used to create the simulation model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Totally opportunistic routing algorithm for underwater wireless sensor network by Rahman, Ziaur

    Published 2019
    “…In the third part, TORA and NA-TORA have been presented, which are energy efficient and opportunistic routing protocols that rely on node position information for data transmission to ensure packet delivery. In TORA next-hop forwarder is selected on the y, where the designated next-hop forwarder is selected based on its distance from the sink node. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Mitigating malicious nodes using trust and reputation based model in wireless sensor networks by Abdullah, Muhammad Daniel Hafiz

    Published 2018
    “…In order to achieve this, different sets of trust information including QoS, OSNs and ant colony system (ACS) algorithm are proposed to improve the selection of trustworthy node. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    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