| Abstract: | In wireless sensor networks (WSNs), data gathering is the main concern, since it directly affects the network lifetime and data latency. Rendezvous Point Selection Scheme (RPSS) is a mobile sink node approach; it offers superior performance than its preceding mobile sink schemes like Rendezvous Design for Variable Track (RD‐VT), RD‐VT with Steiner Minimum Tree (RD‐VT‐SMT), and Weight Rendezvous Planning with Steiner Minimum Tree (WRP‐SMT). However, a more uniform distribution of the rendezvous node leads to less energy consumption in WSNs. The more optimum path offers less data latency. In the proposed approach, we use particle swarm optimization (PSO) to find the optimum rendezvous point and adaptive PSO (APSO) to find an optimum path by solving the travelling salesman problem. By rigorous simulation, we prove that modified RPSS (M‐RPSS) increases the network lifetime by more than 10% and decreases the data latency. |
