Search Results - optimal ((((protocol algorithm) OR (window algorithm))) OR (based algorithm))

Search alternatives:

Refine Results
  1. 1

    QTCP: an optimized and improved congestion control algorithm of high-speed TCP networks by Qureshi, Barkatullah, Othman, Mohamed, K. Subramaniam, Shamala, Abdul Hamid, Nor Asilah Wati

    Published 2011
    “…To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP slow start algorithm and Additive Increase and Multiplicative Decrease (AIMD) algorithm have been proposed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Orthogonal Frequency Division Multiple Access resource unit allocation algorithms for IEEE 802.11AX medium access control protocol by Zazali, Azyyati Adiah

    Published 2024
    “…First is the Versatile Shuffle Recomputation Resource Units (VSR-RUs), which use the Fisher-Yates shuffling algorithm to optimize RU utilization and reduce collisions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    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

    Published 2016
    “…Additionally, the assured service is designed for applications relying on the Transmission Control Protocol (TCP). 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
    Article
  5. 5

    Adaptive medium access control protocol of Wifi-Halow for home machine-to-machine network by Liew, Jiun Terng

    Published 2019
    “…Firstly, this work proposed a novel algorithm known as probability-based opportunity dynamic adaptation (PODA) of CW for home M2M network. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  7. 7

    Distributed joint power control, beamforming and spectrum leasing for cognitive two-way relay networks by Iranpanah, Havzhin

    Published 2017
    “…A search method with numerous advantages over conventional algorithms, has been designed to solve the optimization problems with an enhanced global optimality and convergence speed. …”
    Get full text
    Get full text
    Thesis
  8. 8

    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

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

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
  10. 10

    An improved energy-efficient clustering protocol to prolong the wireless sensor network lifetime by Alhmood, Ali Abdul-Hussian Hassan

    Published 2021
    “…The simulation results prove that the IEECP prolongs the network lifetime better than Energy efficient clustering protocol based on K-means (EECPK-means)-midpoint algorithm (EECPK-means), Traffic-Aware Channel Access Algorithm (TACAA), and an optimal clustering mechanism based on Fuzzy C-means (OCM–FCM) protocols based on the First node die and Weighted first node die. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Low Complexity Error Correction in Low Density Parity Check (LDPC) Code Decoder and Encoder for Decode and Forward Cooperative Wireless Communication by JAM'AAH, SUUD

    Published 2021
    “…By using the optimization min-sum belief propagation approach, a low complexity min-sum (MS) based decoding algorithm called Variable Global Optimization Min-Sum (VGOMS) has been developed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…This paper proposes an optimal method to suppress the noise with high density properly based on a nonlinear filter and decision-based approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Variable Global Optimization min-sum (VGOMS) algorithm of decode-and forward-protocol for the relay node in the cooperative channel by Hushairi, Zen, Al-Khalid, Hj Othman, Khairuddin, Abdul Hamid, Jamaah, Suut

    Published 2020
    “…A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Variable Global Optimization min-sum (VGOMS) algorithm of decodeand-forward protocol for the relay node in the cooperative channel by Hushairi, Zen, Jamaah, Suut, Al-Khalid, Bin Hj Othman, Khairuddin, Bin Ab Hamid

    Published 2019
    “…A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    OPTIMIZATION OF MOBILE TRANSPORT NETWORK USING INTERNET PROTOCOL/MULTI-PROTOCOL LABEL SWITCHING (IP/MPLS) APPROACH by Ngo, Lip Chee

    Published 2014
    “…This report focuses on a research-based project of the title ‘Optimization of Mobile Transport Network using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Approach’. …”
    Get full text
    Get full text
    Final Year Project
  18. 18

    Simulation for dynamic patients scheduling based on many objective optimization and coordinator by Mahmed, Ali Nader, Mohd Nizam, Mohmad Kahar

    Published 2024
    “…Finally, the role of the coordinator is to select a subset of patients from the window and pass them to the optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks by Ghathwan, Khalil Ibrahim

    Published 2016
    “…The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. …”
    Get full text
    Get full text
    Get full text
    Thesis