An Mobile-Sink Path Selection using Weighted Rendezvous Planning for WSN
Sri Shakthi · 2014
Over the last decade a large number of routing protocols has been designed for achieving energy efficiency in data collecting wireless sensor networks. It has been shown that a mobile sink may improve the energy dissipation and to prevent the formation of energy holes. However, these benefits are dependent on the path taken by the mobile sink, particularly in delay-sensitive applications, as all sensed data must be collected within a given time constraint. An approach proposed to address this challenge is to form a hybrid moving pattern in which a mobile-sink node only visits rendezvous points (RPs), as opposed to all nodes. The fundamental problem then becomes computing a tour that visits all these RPs within a given delay bound. To address this problem, a heuristic called weighted rendezvous planning (WRP) is proposed, whereby each sensor node is assigned a weight corresponding to its hop distance from the tour and the number of data packets that it forwards to the closest RP. Simulation results show that WRP reduces energy consumption and also increases network lifetime.