Sink mobility is one of the most effective solutions for improving lifetime and has been widely investigated for the last decade. Algorithms for single-sink mobility are not directly applied to the multiple-sink case due to the latter’s specific challenges. Most of the approaches proposed in the literature use mathematical programming techniques to solve the multiple-sink mobility problem. In this paper, they propose two algorithms that do not consider all possible sink-site combinations to determine migration points.
Search to explore resources
