Cluster-based rendezvous points selection for reducing tour length of mobile element in WSN

In this paper we develop two new algorithms viz., CCP (Cluster-based Collection Point) and CRP (Cluster-based Rendezvous collection Points) that focus on i) reducing the number of data collection points to be visited by the Mobile Element (ME), and ii) determining an optimal path for ME. The algorithms follow a clustering approach, where a Cluster Head (CH) aggregates data from its cluster nodes and keeps this information ready for onward transmission to the ME. Due to this approach, the ME need only visit the CH instead of visiting each cluster node individually. The CCP algorithm determines an optimal path for ME by connecting all CH/Collection Points (CP). Taking advantage of the transmission range of CH/CPs, the CRP algorithm determines optimum number of Rendezvous Points that cover all CPs, which further reduces the tour length. Both algorithms were subjected to extensive simulations to study their efficacy. The algorithms have outperformed the best known algorithms in terms of tour length and latency.