Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"discovery latency"”.

  1. Analyzing discovery latency in mobile networks

    … parameters. On the other hand, neighbor discovery is the process by which nodes learn about the neighbors. Nodes can use radio communications to discover other neighbors. Timely, neighbor discovery is crucial for routing. But, neighbor discovery becomes more challenging in …

    wvu Repository record for Analyzing discovery latency in mobile networks (opens in a new tab)

  2. An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks

    … which uses mobile agents and reactive route discovery, introduced a more realistic solution to this problem. However, the mobile agents were not fully exploited in this protocol. In this thesis research, we will propose an improved MultiAnts-AODV routing protocol based on ant-AODV The goal of …

    unlv Repository record for An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks (opens in a new tab) Download PDF for An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks (opens in a new tab)

  3. Resource Efficient Urban Delay/disruptive Tolerant Networks

    … requirements on energy consumption and neighbor discovery latency. Then, we discuss our solution R2, a synchronous neighbor discovery algorithm based on Wi-Fi access points. It is energy efficient and has short discovery latency. Evaluations show that R2 can discover 90% of neighbors within 50 …

    nus Repository record for Resource Efficient Urban Delay/disruptive Tolerant Networks (opens in a new tab) Download file for Resource Efficient Urban Delay/disruptive Tolerant Networks (opens in a new tab)

  4. Talk Half Listen To Half: An Energy-Efficient Neighbor Discovery Protocol in Wireless Sensor Networks

    … low duty cycle, and high mobility, neighbor discovery is one of the most challenging problems in wireless sensor networks. Existing discovery designs can be divided into two types: pairwise-based and group-based. The former schemes suffer from high discovery delay, while the latter ones …

    ottawa-retro Repository record for Talk Half Listen To Half: An Energy-Efficient Neighbor Discovery Protocol in Wireless Sensor Networks (opens in a new tab)

  5. Leveraging clustering for efficient communication in opportunistic networks

    … enabling opportunistic communication is neighbor discovery. In this context, we have developed Searchlight, an asynchronous neighbor discovery protocol that uses systematic probing to considerably decrease discovery latency while allowing nodes to operate at low duty cycles. However, for an …

    uiuc Repository record for Leveraging clustering for efficient communication in opportunistic networks (opens in a new tab)

  6. An Extensible Information Dissemination Scheme over the Optimized Link State Routing Protocol for Mobile Ad Hoc Networks

    … that make MANETs powerful also make the discovery and operation of network services a challenge. This thesis presents the design and implementation of an extensible information dissemination scheme that is integrated with the Optimized Link State Routing (OLSR) protocol to address the …

    vt Repository record for An Extensible Information Dissemination Scheme over the Optimized Link State Routing Protocol for Mobile Ad Hoc Networks (opens in a new tab)

  7. Duty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting

    … many challenges, such as difficulty in neighbor discovery due to asynchronous wakeup/sleep scheduling, time-varying transmission latencies due to varying neighbor discovery latencies, and difficulty on multihop broadcasting due to non-simultaneous wakeup in neighborhood. This dissertation focuses …

    vt Repository record for Duty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting (opens in a new tab)