Effective Reconstruction of the Message-Pruning Trees in Wireless Sensor Networks

Wireless sensor networks are often used to monitor and report the locations of moving objects. In light of storage in sensors, the wireless sensor network can be viewed as a distributed database for storing and retrieving the location information of objects. Many methods for the construction of the message-pruning trees have been studied to reduce the cost of updating databases and querying objects. In this paper, our goal is to minimize the cost of updating a database. Instead of finding a new message-pruning tree, we reduce the cost of updating a database by reconstructing the existing message-pruning tree. The simulation results show that the proposed method significantly reduces the cost of updating a database while slightly increasing the cost of querying objects.