The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2008 vol.57)
pp: 849-863
ABSTRACT
Wireless sensor networks have often been used to monitor and report the locations of moving objects. Since sensors can also be used for storage, a wireless sensor network can be considered a distributed database, enabling us to update and query the location information of moving objects. Many researchers have studied the problem of how to construct message-pruning trees that can update a database and query objects with minimum cost (the Minimum Cost Message-Pruning Tree problem). The trees are constructed in such a way that the total cost of updating the database and querying objects is kept as minimum as possible, while the hardness of the Minimum Cost Message-Pruning Tree problem remains unknown. In this paper, we first show that the Minimum Cost Message-Pruning Tree problem is NP-complete. Subsequently, since the message-pruning tree with minimum cost is hard to be constructed in polynomial time, we propose a new data aggregation structure, a message-pruning tree with shortcuts, instead of the message-pruning tree. Simulation results show that the proposed data aggregation structure significantly reduces the total cost of updating the database and querying objects, as compared to the message-pruning tree.
INDEX TERMS
Nonnumerical Algorithms and Problems, Distributed applications
CITATION
Bing-Hong Liu, Wei-Chieh Ke, Chin-Hsien Tsai, Ming-Jer Tsai, "Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure", IEEE Transactions on Computers, vol.57, no. 6, pp. 849-863, June 2008, doi:10.1109/TC.2008.22
REFERENCES
[1] F. Aurenhammer, “Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, 1991.
[2] J.J. Caffery, “A New Approach to the Geometry of TOA Location,” Proc. 52nd IEEE Vehicular Technology Conf., pp. 1943-1949, 2000.
[3] W.P. Chen, J.C. Hou, and L. Sha, “Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 258-271, July-Sept. 2004.
[4] M.R. Garey and D.S. Jonson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[5] H.T. Kung and D. Vlah, “Efficient Location Tracking Using Sensor Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp.1954-1961, 2003.
[6] Q. Li and D. Rus, “Global Clock Synchronization in Sensor Networks,” IEEE Trans. Computers, vol. 55, no. 2, pp. 214-226, Feb. 2006.
[7] C.Y. Lin, W.C. Peng, and Y.C. Tseng, “Efficient In-Network Moving Object Tracking in Wireless Sensor Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 1044-1056, Aug. 2006.
[8] C.Y. Lin and Y.C. Tseng, “Structures for In-Network Moving Object Tracking in Wireless Sensor Networks,” Proc. First Ann. Int'l Conf. Broadband Networks, pp. 718-727, 2004.
[9] A. Rapaka and S. Madria, “Two Energy Efficient Algorithms for Tracking Objects in a Sensor Network,” Wireless Comm. and Mobile Computing J., 2006.
[10] K. Sohrabi, J. Gao, V. Ailawadhi, and G.J. Pottie, “Protocols for Self-Organization of a Wireless Sensor Network,” IEEE Personal Comm., vol. 7, no. 5, pp. 16-27, 2000.
[11] Y.C. Tseng, S.P. Kuo, H.W. Lee, and C.F. Huang, “Location Tracking in a Wireless Sensor Network by Mobile Agents and Its Data Fusion Strategies,” Computer J., vol. 47, no. 4, pp. 448-460, 2004.
[12] Y. Xu, J. Winter, and W.C. Lee, “Dual Prediction-Based Reporting for Object Tracking Sensor Networks,” Proc. First Ann. Int'l Conf. Mobile and Ubiquitous Systems: Networking and Services, pp. 154-163, 2004.
[13] W.L. Yeow, C.K. Tham, and W.C. Wong, “Energy Efficient Multiple Target Tracking in Wireless Sensor Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 2, pp. 918-928, 2007.
[14] O. Younis and S. Fahmy, “A Scalable Framework for Distributed Time Synchronization in Multi-Hop Sensor Networks,” Proc. Second Ann. IEEE Conf. Sensor and Ad Hoc Comm. and Networks, pp.13-23, 2005.
[15] W. Zhang and G. Cao, “DCTC: Dynamic Convoy Tree-Based Collaboration for Target Tracking in Sensor Networks,” IEEE Trans. Wireless Comm., vol. 3, no. 5, pp. 1689-1701, 2004.
[16] W. Zhang and G. Cao, “Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks,” Proc. IEEE INFOCOM '04, pp. 2434-2445, 2004.
[17] F. Zhao, J. Shin, and J. Reich, “Information-Driven Dynamic Sensor Collaboration for Tracking Applications,” IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 61-72, 2002.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool