@article{oai:muroran-it.repo.nii.ac.jp:00009616,
 author = {XIE, Guangqian and OTA,  Kaoru and 太田, 香 and DONG,  Mianxiong and 董, 冕雄 and PAN, Feng and LIU, Anfeng},
 issue = {3},
 journal = {Peer-to-Peer Networking and Applications},
 month = {May},
 note = {application/pdf, This paper proposes an energy-efficient routing mechanism by introducing intentional mobility to wireless sensor networks (WSNs) with obstacles. In the sensing field, Mobile Data Collectors (MDCs) can freely move for collecting data from sensors. An MDC begins its periodical movement from the base station and finally returns and transports the data to the base station. In physical environments, the sensing field may contain various obstacles. A research challenge is how to find an obstacle-avoiding shortest tour for the MDC. Firstly, we obtain the same size grid cells by dividing the network region. Secondly, according to the line sweep technique, the spanning graph is easily constructed. The spanning graph composed of some grid cells usually includes the shortest search path for the MDC. Then, based on the spanning graph, we can construct a complete graph by Warshall-Floyd algorithm. Finally, we present a heuristic tour-planning algorithm on the basis of the complete graph. Through simulation, the validity of our method is verified. This paper contributes in providing an energy-efficient routing mechanism for the WSNs with obstacles.},
 pages = {472--483},
 title = {Energy-efficient routing for mobile data collectors in wireless sensor networks with obstacles},
 volume = {10},
 year = {2017},
 yomi = {オオタ, カオル and トウ, メンユウ}
}