We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount of data being shipped across the network. Hence, it locates the objects over the network with minimal energy conservation using short-range message transmissions. The performance analysis (both experimental and theoretical) shows the effectiveness of the two algorithms in comparison to another tracking algorithm.
A. Rapaka and S. K. Madria, "Two Energy Efficient Algorithms for Tracking Objects in a Sensor Network," Wireless Communications and Mobile Computing, John Wiley & Sons, Jul 2006.
The definitive version is available at https://doi.org/10.1002/wcm.423
Keywords and Phrases
Algorithm; Communication; Energy Efficient; Sensor Nodes; Wireless Ad Hoc Network
International Standard Serial Number (ISSN)
Article - Journal
© 2006 John Wiley & Sons, All rights reserved.