Abstract:
Battery energy drain causes WSN node faults. Data aggregation is widely used to conserve energy, but aggregator nodes can drain batteries. When an aggregator/intermediary node in a data aggregation tree fails, its child nodes become disconnected, forming Affected Nodes (ANs) and/or subtrees.
We use component-based graph theory to treat subtrees as components that must be connected to the root-component tree to tolerate such faults.
We develop two component-based self-healing fault-tolerant algorithms, SCR and SCR-DTRA, that use WSN redundancy to find alternate paths from affected components to the root node.
Component-based algorithms preserve data aggregation hierarchy precedence relations, unlike most other methods. Our simulations show that the two algorithms recover over 90% of faulted ANs and subtrees. Compared to other algorithms, the two algorithms last twice as many rounds.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student requirments.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
