@inproceedings{d4079ae877e340158a5a9be2930d75a6,

title = "A Decreasing k-means algorithm for the Disk Covering Tour Problem in wireless sensor networks",

abstract = "This paper studies a Disk Covering Tour Problem (DCTP) for reducing the energy consumption of a mobile robot's movement to provide services for sensor nodes in a wireless sensor network (WSN). Given a set of locations of sensor nodes and a starting location of mobile robot, the DCTP is to find a minimum cost tour of a sequence of tour stops for the mobile robot to serve sensor nodes by keeping every sensor node within a specified distance of a tour stop. We propose an algorithm, called Decreasing k-means (Dk-means), to find an approximate solution to the DCTP. The idea is to select a minimum number of disks or circles of a fixed radius to cover all sensor nodes, and then to find a minimum cost tour passing all disk centers. The simulation results show the proposed algorithm outperforms the related CSP (Covering Salesman Problem) algorithm and the QiF algorithm.",

keywords = "covering salesman problem, disk covering problem, disk covering tour problem, k-means algorithm, wireless sensor network",

author = "Yang, {Jia Jiun} and Jiang, {Jehn Ruey} and Lai, {Yung Liang}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 ; Conference date: 16-12-2014 Through 19-12-2014",

year = "2014",

doi = "10.1109/PADSW.2014.7097906",

language = "???core.languages.en_GB???",

series = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

publisher = "IEEE Computer Society",

pages = "906--910",

booktitle = "2014 20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 - Proceedings",

}