Header menu link for other important links
A novel crash-tolerant data gathering in wireless sensor networks
, S. Chakraborty, S. Nandi, S. Karmakar
Published in
Pages: 940 - 946
Event driven data gathering or convergecast through sensor nodes requires efficient and correct delivery of data at the sink. A tree rooted at the sink is an ideal topology for data gathering which utilizes sensor resources properly. Resource constrained sensor nodes are highly prone to sudden crash. A set of algorithms, proposed in this paper, builds a data gathering tree rooted at the sink. The tree eventually becomes a Breadth First Search(BFS) tree where each node maintains the shortest distance in hop-count to the root to reduce the routing delay and power consumption. The data gathering tree is repaired locally within a constant round of message transmissions after any random node fails. Simulation result shows that the repairing delay is very less in average, and the proposed scheme can repair from arbitrary node failure using constant number of message passing. © 2012 IEEE.
About the journal
JournalProceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012