Multi sink scheduling scheme for wireless sensor networks

In wireless sensor networks WSN increasing the network lifetime, where the information delay caused by moving the sink should be bounded. Some of the combinational complexity of this problem, most previous proposals focus on heuristics and provable optimal algorithms remain unknown. By build a unified framework for analyzing this joint sink mobility, routing, delay, and induced sub problems and present efficient solutions for them. We generalize these solutions and propose a polynomial-time optimal algorithm for the origin problem. Furthermore, we developing with multiple sink for the network and study the effects of different trajectories of the sink and provide important insights for designing mobility schemes in real-world mobile WNNs.