A Survey of Rendezvous planning Algorithms for Wireless Sensor Networks

Abstract

In recent years, sensors in some applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. For this, we will briefly discuss the operations of various rendezvous planning algorithms, as well as comparisons on the performance with different parameters such as the power consumption and network lifetime. We survey different these algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also discuss improvements to be made for future proposed rendezvous planning schemes. This paper should provide the reader with a basis for research in rendezvous planning schemes for Wireless Sensor Networks.