SCHEDULING TIME OFF REQUESTS IN AD-HOC NETWORKS

摘要

We present in this paper a scheduling algorithm that determines the time intervals during which nodes will be scheduled for some time off. The time off intervals could be used for either the node's maintenance or for the carrier's maintenance. The carrier could be a car, an airplane or any mobile object that supports the node. The scheduling of the off times of the nodes will be done in sets, and the challenge is to make sure that the resultant sub network is connected. We present in this paper a polynomial time algorithm that forms each set, and schedules the sets dynamically.