Networks of hundreds or thousands of sensor nodes equipped with sensing, computing and communicationability are conceivable with recent technological advancement. Methods are presented in this report to recover and visualize data from wireless sensor networks, as well as to estimate node positions. Acommunication system is assumed wherein information from sensor nodes can be transferred to acentralized computer for data processing, though suggestions are made for extensions to distributed computation. Specifically, this report presents four topics. First, the notion of using network connectivity to reconstruct node positions via linear or semidefinite programming is explored. Random feasible node placement and bounding methods are both found to increase in precision with the indiviual geographical constraints. Second, the potential effectiveness of two correlation-based sensor data encoding schemes isreported. Blind correlation methods are found to provide meager compression while semi-blind correlation can effectively reduce bandwidth requirements by one-half. Third, trajectory reconstruction through a sparse sensor network is used to track objects with expectation-minimization techniques. Trajectories can be distinguished providing that sufficient spatial or temporal separation exists. Fourth, optical flow algorithms are used to visualize time-varying continuous flow around the network. A qualitative analysis ofthe reconstructed flow for several case studies suggests a minimal node density as related to flow speeds
August 31, 2000
Doherty, L. (2000). Algorithms for Position and Data Recovery in Wireless Sensor Networks: Research Project. United States: University of California Berkeley.
*Only registered BSAC Industrial Members may view project materials & publications. Click here to request member-only access.