Query driven Broadcast through wireless sensor nodes also leads to the domain of event driven converge cast. A query-response based application in Wireless Sensor Networks(WSN) demands the correct delivery of data message at each sensor node. A Breadth-First Search(BFS) tree rooted at the base station offers shortest path traversal for each data message which utilizes the sensor resources efficiently. Resource constrained sensor nodes are highly prone to sudden crash. So the application demands a quick and smart approach to repair the tree when a node dies. In this paper a novel scheme has been proposed to locally repair the tree with constant round of message transmissions. Each node piggybacks a few bytes of extra information along with each query and response messages. Based on these piggybacked values each node calculates its alternate parent. When a parent node fails, its children can contact their respective alternate parents immediately to establish an alternate path to the root. Reduced communication cost in terms of extra message transmissions saves battery power at each node. Efficient query-response message handler ensures the correct delivery of messages. Fast repairing offers good Quality of Service(QoS). Simulation result shows that no message is lost except the one holding by the crashed node.
展开▼
