Efficient data‐forwarding strategies for wireless sensor networks with a mobile sink which visits rendezvous points (RPs) to gather data from sensor nodes are proposed. With the first proposed strategy, selections of the RP nodes and the final routing paths are based on the latest information of the already selected RP nodes. The second proposed strategy adopts a simpler RP node‐ and routing path‐selection algorithm with the same level of complexity of an existing algorithm. Numerical results show that both of the proposed strategies result in more efficient energy consumption and reduce forwarding hop counts compared with the existing algorithm.
No takes yet. Share an insight, caveat, or question.
Suh et al. (2015) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: