The Disk Covering Tour Problem in the Wireless Sensor Network

摘要: The paper discusses the disk covering tour problem for reducing mobile devices' electricity costs consumed in wireless sensor network. DCTP how to find a whose cost is minimum under condition of defined initial points and some planar points. starts from stop point. After passing many points, returns Although point unnecessary be distance between each certain during at least should within de- fined radius. can much when devices move out There- fore, less number is, is. How reduce re- garded as problem. decreasing k-means algorithm proposed try finding nearly mini- mum all then Lin-Kernighan heuristic introduced approximating shortest through obtained experimental simulations compare solution algorithms method other related methods with Qi-Ferry tour, results show that has advantage having smaller cost.