Design and implementation of monitoring and management system based on wireless sensor network hop estimation with the moving target Kalman prediction and Greedy-Vip

  • Authors:
  • Wei Chen;Zhibo Tang;Xiaorong Jiang;Qichong Tian;Jing Gao;Tongfeng Sun;Renke Sun;Ming Zhao

  • Affiliations:
  • School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, 430074, China;School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, 221116, China;College of Information and Electrical Engineering, China Agricultural University, Beijing, 100083, China

  • Venue:
  • Computer Standards & Interfaces
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent advances in wireless sensor networks (WSNs) technologies and their incorporation with geographic information system (GIS) technologies offer vast opportunities for development and application of environment monitoring data communication. This paper analyzes the method of predicting the location of moving target with the Kalman filter and Greedy-ViP approach to establish WSN flat network routing and the data management system. Simulation results demonstrate that the predicted information collection node locations by the proposed method are consistent with the majority of real ones, the hops tend to straight lines, the hops count is the least, lower repetition rate of the nodes on different hops, and the environment monitoring data can be saved and queried.