Search Results - (( java application optimization algorithm ) OR ( using ad protocol algorithm ))

Refine Results
  1. 1

    Performance Enhancement of Routing Protocols in Mobile Wireless Ad-Hoc Networks Using Fuzzy Reasoning Algorithm by Natsheh, Essam Fathi

    Published 2006
    “…We will present the various application of that algorithm to ad-hoc routing protocols. Then, we will focus on four major applications that are the core of any ad-hoc routing protocol. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm by Uddin, Mueen, Abdul Rahman, Azizah, Alarifi, Abdulrahman, Talha, Muhammad, Shah, Asadullah, Iftikhar, Mohsin, Zomaya, Albert

    Published 2012
    “…This paper presents that the proposed on demand routing algorithm performs better in mobile ad-hoc environment than other traditional algorithms. …”
    Get full text
    Get full text
    Article
  3. 3

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…Ad hoc On-Demand Distance Vector (AODV) routing protocol is a reactive protocol in Mobile Ad hoc Network (MANET). …”
    Get full text
    Get full text
    Thesis
  4. 4

    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

    Published 2014
    “…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Enhanced Ad Hoc On-Demand Distance Vector Routing Protocol For Mobile Ad Hoc Network Internet Connectivity by Gurusamy, Gobi

    Published 2006
    “…In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile ad hoc network and the Internet. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    A modification of Shamir's Three-Pass protocol by implementing one-time pad algorithm / Nur Khairunnisa' Kusman, Nurul Hanis Abd Rashid and An Nur Ameera Zamani by Kusman, Nur Khairunnisa', Abd Rashid, Nurul Hanis, Zamani, An Nur Ameera

    Published 2019
    “…In order to improve security, a proper algorithm should be implemented in the three-pass protocol by adding phases at starting and ending of the process. …”
    Get full text
    Get full text
    Student Project
  9. 9

    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. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    A design of redirect link failure protocol based on dynamic source routing for mobile ad hoc networks by Ghazali, Osman, Hassan, Suhaidi, M. Kadhum, Mohammed

    Published 2011
    “…The characteristics of ad hoc networks are that they are decentralized, self-organized, self-deployed, and they possess dynamic network topology.All mobile nodes in ad hoc network communicate with each other directly or through intermediate nodes by using routing protocols algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  11. 11

    Development of a Reliable Multicast Protocol in Mobile Ad Hoc Networks by Alahdal, Tariq A. A.

    Published 2008
    “…The main objectives of this research are to enhance the FIP and decrease the recovery delays in reliable multicast protocol for mobile ad hoc networks using suggested approaches. …”
    Get full text
    Get full text
    Thesis
  12. 12

    GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks by Al-Shugran, Mahmoud Ali

    Published 2014
    “…The Greedy Forwarding Strategy (GFS) has been the most used strategy in position-based routing protocols. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol by Sjaugi, Muhammad Farhan

    Published 2008
    “…To facilitate communication within the network, a routing protocol is used to dis- cover routes between nodes. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  16. 16

    Enhancing DSR protocol performance in mobile ad hoc network using ACK reply by Gani, Abdullah, Han, Q., Anuar, N.B., Zakaria, O.

    Published 2009
    “…This paper presents a new method to improve performance of DSR in Ad Hoc Network. We present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using ACK reply path as a backup route when an original route fails in Mobile Ad Hoc networks. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…Ad hoc on-demand distance vector routing protocol (AODV) is a commonly used protocol in MANET. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Reduced latency in restricted flooding routing protocol for mobile ad hoc network. by A. Latif, Liza, Ali, A., Fisal, Norsheila

    Published 2007
    “…Packet delivery and latency are several performance metrics used to determine the effectiveness of a new routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Finding shortest routing solution in mobile AD HOC networks using firefly algorithm and queuing network analysis by Aznida Hayati, Zakaria@Mohamad, Hasni, Hassan, Ahmad Shukri, Mohd Noor

    Published 2015
    “…Mobile ad hoc network (MANET) is a group of mobile nodes establishing a wireless network without using centralized and fixed infrastructure. …”
    Get full text
    Get full text
    Article
  20. 20

    An enhanced cluster head selection algorithm for routing in mobile AD-HOC network by Abdulsaheb, Ghaida Muttasher

    Published 2017
    “…This thesis proposes a cluster based routing protocol, the Enhanced Cluster Routing Protocol (ECRP), which uses a modified cluster formation algorithm to build the cluster structure and select one of the nodes to be the cluster head. …”
    Get full text
    Get full text
    Thesis