Weighted rendezvous planning for energy efficient mobile-sink path in wireless sensor networks

Wireless sensor networks (WSNs) uses mobile sink to reduce the energy consumption of nodes and to prevent the formation of energy holes. Within a given time constraint all sensed data should be collected. Here mobile-sink node only visits rendezvous points (RPs). If Sensor nodes are not RPs then forward its sensed data via multi hopping to the nearest RP. The basic problem is computing a tour that visits all these RPs within a given delay bound. The NP-hard problem is identifying the optimal tour. In order to overcome this, a heuristic called weighted rendezvous planning (WRP) has been used, and then each sensor node is assigned a weight depending on the hop distance from the tour and the number of data packets. WRP is calculated using extensive computer simulation and results gives that WRP enables a mobile sink to get all sensed data within a given constraint while conserving the energy expenditure of sensor nodes. As compared with existing algorithms WRP reduces energy consumption and increases network lifetime by using multiple mobile sink than a single mobile sink.