Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-10-05
Computer Science
Distributed, Parallel, and Cluster Computing
this is a 5 page paper. this paper has been submitted to WCSN 2010
Scientific paper
Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation technique can help greatly to reduce power consumption. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes over {\it aggregation tree} and hence minimizing the overall power consumption in the network. If a sensor node fails during data aggregation then the aggregation tree is disconnected. Hence the WSNs rely on in-network aggregation for efficiency but a single faulty node can severely influence the outcome by contributing an arbitrary partial aggregate value. In this paper we have presented a distributed algorithm that reconstruct the aggregation tree from the initial aggregation tree excluding the faulty sensor node. This is a synchronous model that is completed in several rounds. Our proposed scheme can handle multiple number of faulty nodes as well.
Mandal Partha Sarathi
Sharma Punit
No associations
LandOfFree
Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-87372