S.Rajayoka priyadharshini, S.Sumithra
The problem that has been faced in WSNs is the increased latency in data collection due to the speed at which the data have been collected. So in order to collect the data efficiently a rendezvous point (RP) is used. Here data are collected by the base station while visiting the rendezvous points. The rendezvous points collect the data which are being buffered from various source nodes which aggregate at a particular point known as RP. This work proposes an efficient rendezvous design algorithm with provable performance bounds with mobility and fixed tracking.