Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking

Abstract

In opportunistic networking, it is hard to predict when a node gets and how long it keeps in contact with another. The persistent probing for prompt neighbor discovery consumes too much energy for battery-operated devices to afford. The most important issue is to carefully manage the power states at all stages of network operations. For the problem consisting of one sender and one receiver, we have presented a novel neighbor discovery scheme which is optimal in a sense that it does not miss a contact with the minimum energy consumed. In this paper, we extend the previous result to the optimal neighbor discovery scheme for the general case.