Node movement based neighbor discovery in opportunistic networks

Abstract

To make efficient use of the resources, node discovery in opportunistic networks is very important because of short communication range of the devices. Encounters are uncertain in opportunistic networks and it is difficult to determine the occurrence of next encounter. So it is essential to have an efficient node discovery mechanism in opportunistic networks to make most out of short duration of encounters. In this paper we consider these factors and proposed a new method to calculate the probing intervals and to make node discovery well-organized and more effective. We perform simulations to test the performance of our proposals.