Network lifetime maximization for time-sensitive data gathering in wireless sensor networks with a mobile sink

• Published in: Wireless communications and mobile computing Vol. 13; no. 14; pp. 1263 - 1280
• Main Authors: Liang, Weifa, Luo, Jun, Xu, Xu
• Format: Journal Article
• Language: English
• Published: Blackwell Publishing Ltd 10.10.2013
• Subjects: Algorithms; Computer simulation; data gathering; distance-constrained shortest path; Heuristic; load-balanced tree construction; Maximization; multiple-constrained joint optimization; network flow; network lifetime maximization; Networks; Optimization; Remote sensors; Robots; sink mobility; sojourn time schedule; wireless sensor networks
• ISSN: 1530-8669; 1530-8677
• DOI: 10.1002/wcm.1179

ABSTRACTWith the advances of more and more mobile sink deployments (e.g., robots and unmanned aerial vehicles), mobile sinks have been demonstrated to play an important role in the prolongation of network lifetime. In this paper, we consider the network lifetime maximization problem for time‐sensitive data gathering, which requires sensing data to be sent to the sink as soon as possible, subject to several constraints on the mobile sink. Because the mobile sink is powered by petrol or electricity, its maximum travel distance per tour is bounded. The mobile sink's maximum moving distance from its current location to the next must also be bounded to minimize data loss. As building a new routing tree rooted at each new location will incur an overhead on energy consumption, the mobile sink must sojourn at each chosen location at least for a certain amount of time. The problem, thus, is to find an optimal sojourn tour for the mobile sink such that the network lifetime is maximized, which is subject to a set of constraints on the mobile sink: its maximum travel distance, the maximum distance of each movement, and the minimum sojourn time at each sojourn location. In this paper, we first formulate this novel multiple‐constrained optimization problem as the distance‐constrained mobile sink problem for time‐sensitive data gathering. We then devise a novel heuristic for it. We finally conduct extensive experiments by simulation to evaluate the performance of the proposed algorithm. The experimental results demonstrate that the performance of the proposed algorithm is very promising, and the solution obtained is fractional of the optimal one. Copyright © 2011 John Wiley & Sons, Ltd. In this paper, we deal with the network lifetime maximization problem for time‐sensitive data gathering in wireless sensor networks with a mobile sink, which is subject to multiple constraints on the mobile sink. We first formulate the problem as a multiple‐constrained optimization problem. We then devise a novel three‐stage heuristic. We finally conducted experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results demonstrate that the proposed heuristic is very promising, and the solution obtained is fractional of the optimal one.