An Optimal Sink Node Movement Scheme in Wireless Sensor Network
QU Wen-hu · Communications technology · 2010
This paper addresses the problem of scheduling mobile sink nodes among different candidate locations, thus to maximize network lifetime in wireless sensor network. A novel concept named placement pattern (PP) is proposed to bound the traffic patterns with candidate locations, which could significantly decrease the number of elements to be scheduled. Then this sink node placement problem is formulated by using linear programming techniques based on PP concept. Finally, an optimal placement schedule is constructed in the light of LP solution. Experiment results indicate that the proposed scheme is effective, and even sink node with limited mobility would greatly enhance the lifetime of wireless sensor network.