Abstract
Message ferry is a controllable mobile node equipped with long distance communication antennas and rechargeable energy, to collect data in sparse wireless networks and delivery it to the base station. The Energy-Constrained Ferry Route Design (ECFRD) Problem aims to schedule the ferry route when the energy of the ferry is not sufficient to access all the nodes in the network in one tour without charging, so as to minimize the total route length of the ferry. In this paper, we propose a simulated annealing based algorithm to solve the ECFRD problem. The experimental results show that the algorithm proposed in this paper can greatly reduce the total route length of the ferry, comparing the classic nearest neighbor algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call