Work

Ahoi: Optimal Asymmetric Neighbor Discovery

Year: 2026
Type: article
Abstract: Neighbor discovery (ND) is the link-layer first-contact step that enables two wireless devices to find each other before any higher-layer communication can take place. Low-power devices perform ND by following wake-up schedules: they transmit short beacons at selected times, listen during selected reception windows, and sleep otherwise to save energy. Because these schedules determine both discovery latency and battery lifetime, ND has been studied for more than two decades and has led to a large body of protocols. Yet an important part of the design space remains insufficiently understood: asymmetric, duty cycle-unaware ND, where different devices may use different duty cycles and may adjust them independently at runtime, without knowing the duty cycle chosen by their peers. This setting arises naturally in heterogeneous IoT deployments, energy-harvesting devices, and battery-powered systems. This paper addresses this gap by introducing Ahoi, a deterministic family of transmission and reception schedules for asymmetric ND. We use optimal in the precise sense of matching the protocol-independent lower bound on worst-case discovery latency for a given pair of transmission and reception duty cycles. In unidirectional discovery, Ahoi allows each sender and receiver to autonomously select a schedule from a discrete set with different duty cycles, while still guaranteeing discovery for every combination of choices and matching the theoretical worst-case latency bound. This shows that, for this important class of ND protocols, the runtime flexibility of duty cycle-unaware operation need not incur any latency or energy penalty. We further extend the construction to bidirectional discovery. Here, Ahoi does not achieve this bound, but our evaluation results imply that the latencies remain close to it.
Language: English
Open Access status: hybrid
OpenAlex ID: W7236738941
FWCI:
Cites: 21
Cited by:
Related to: 10