Asymmetric Slotless Neighbor Discovery Protocols in Mobile Wireless Networks (Masterthesis)


Marco Saur

01.08.2016, 13:00, room 3945


In mobile wireless networks, finding nearby devices and establishing a first contact between them is an essential aspect. Therefore, asynchronous neighbor discovery protocols, which are based on wake-up scheduling, are applied frequently. Since the involved devices are usually battery powered, the design goal of such protocols is to achieve energy-efficient and fast discovery. Neighbor discovery protocols can be divided into the widely used time-slotted protocols, which subdivide time into multiple slots of equal length, and continuous-time, purely interval-based protocols, which temporally decouple beaconing and listening.Based on the protocol design, neighbor discovery protocols can be further subdivided into protocols that apply the same discovery scheme for each device, and protocols that assign different roles to the involved devices. In this thesis we introduce two versions (same device roles and different device roles) of a novel asynchronous, purely interval-based neighbor discovery protocol, which ensures fast and energy-efficient discovery. Each device can operate on its own duty-cycle independently based on different energy requirements. Beside this protocol, we derive equations to compute local discovery latency minima and maxima in purely interval-based neighbor discovery scenarios such as Bluetooth Low Energy or ANT. Finally, we provide a testbed to demonstrate the realizability of different purely interval-based discovery protocols in practice.