Information Technology and Computer Application Engineering – Liu, Sung & Yao (Eds)
© 2014 Taylor & Francis Group, London, ISBN 978-1-138-00079-7
Sensor network coverage problem research based on rail transport
of dangerous goods
X.Z. Han & N. Zhang
College of Computer and Information Technology, Beijing JiaoTong University, Beijing, China
ABSTRACT: This paper researches on node coverage problem of the wire-less sensor network in the course
of transportation of dangerous goods in railway. Under the condition of completely covering the monitoring area
and neighbor nodes connected, an optimal node covering method which makes use of regular polyhedron space
subdivision is proposed to achieve complete coverage with the least number of nodes.
Keywords: