Date: 3:00pm, April 24, 2017
Location: EE Conference Room (Mudd 1300)
Speaker: Philipp Kindt, PhD Candidate, Technical University of Munich (TUM)
Abstract: To initiate a connection in mobile ad-hoc networks (MANETs), neighbor discovery protocols repeatedly broadcast packets on a certain set of channels, whereas other devices repeatedly switch on their receivers for short amounts of time. Two devices have discovered each other successfully once both have received a first packet from their opposite. Most common neighbor discovery protocols are referred to as slotted protocols, which subdivide time into multiple, equal-length intervals, called slots. In this talk, we consider a different paradigm, which may be characterized as slotless, periodic-interval- based discovery. In protocols following this paradigm, the transmitting device sends packets at periodic intervals. The other device switches on its receiver also at periodic intervals and remains on for a specified duration during each period. Based on this, we present slotless protocols that achieve significantly higher performances than the best known slotted protocols. Compared to e.g., the popular protocol Searchlight, they can realize by up to 89 % shorter worst-case latencies, while consuming the same amount of energy. In this talk, the theoretical backgrounds of such protocols are presented. Further, it covers deriving beneficial parametrizations and techniques for speeding up the discovery procedure (e.g., mutual assistance). To make the theory more intuitive, a live-demo is included. The talk is concluded by outlining future research directions and the limitations of slotless approaches.