English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In mobile ad-hoc networks, neighbor discovery protocols are used to findsurrounding devices and to establish a first contact between them. Since theclocks of the devices are not synchronized and their energy-budgets arelimited, usually duty-cycled, asynchronous discovery protocols are applied.Only if two devices are awake at the same point in time, they can rendezvous.Currently, time-slotted protocols, which subdivide time into multiple intervalswith equal lengths (slots), are considered to be the most efficient discoveryschemes. In this paper, we break away from the assumption of slotted time. Wepropose a novel, continuous-time discovery protocol, which temporally decouplesbeaconing and listening. Each device periodically sends packets with a certaininterval, and periodically listens for a given duration with a differentinterval. By optimizing these interval lengths, we show that this scheme can,to the best of our knowledge, outperform all known protocols such as DISCO,U-Connect or Searchlight significantly. For example, Searchlight takes up to740 % longer than our proposed technique to discover a device with the sameduty-cycle. Further, our proposed technique can also be applied in widely-usedasymmetric purely interval-based protocols such as ANT or Bluetooth Low Energy.

Slotless Protocols for Fast and Energy-Efficient Neighbor Discovery