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

Jia Jiun Yang, Jehn Ruey Jiang, Yung Liang Lai

研究成果: 書貢獻/報告類型會議論文篇章同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
主出版物標題2014 20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 - Proceedings
發行者IEEE Computer Society
頁面906-910
頁數5
ISBN(電子)9781479976157
DOIs
出版狀態已出版 - 2014
事件20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 - Hsinchu, Taiwan
持續時間: 16 12月 201419 12月 2014

出版系列

名字Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
2015-April
ISSN(列印)1521-9097

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014
國家/地區Taiwan
城市Hsinchu
期間16/12/1419/12/14

指紋

深入研究「A Decreasing k-means algorithm for the Disk Covering Tour Problem in wireless sensor networks」主題。共同形成了獨特的指紋。

引用此