Issue No. 02 - February (2008 vol. 19)
Jianliang Xu , Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, KLN, Hong Kong
Xueyan Tang , School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore
Wang-Chien Lee , Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an energy-conserving approximate storage (EASE) scheme to efficiently answer approximate location queries by keeping error-bounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter called the approximation radius. We derive the optimal setting of the approximation radius for our storage scheme based on the mobility pattern and devise an adaptive algorithm to adjust the setting when the mobility pattern is not available a priori or is dynamically changing. Simulation experiments are conducted to validate our theoretical analysis of the optimal approximation setting. The simulation results show that the proposed EASE scheme reduces the network traffic from a conventional approach by up to 96 percent and, in most cases, prolongs the network lifetime by a factor of 2-5.
Wireless sensor networks, Energy efficiency, Energy storage, Telecommunication traffic, Batteries, Adaptive algorithm, Analytical models, Traffic control, Memory, Wildlife
J. Xu, X. Tang and W. Lee, "A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. 2, pp. 262-275, 2008.