Title :
Failed node replacement policies for maximising sensor network lifetime
Author :
Sakib, Kazi ; Tari, Zahir ; Bertok, Peter
Author_Institution :
Dept. of CSIT, RMIT Univ., Melbourne, VIC, Australia
Abstract :
A failed node can create coverage and connectivity holes in a sensor network. In order to maintain network effectiveness, failed nodes should be replaced. A new concept, called policy for failed node replacement, has been given to improve the network operational lifetime by repairing network holes created by failed nodes. These policies can be incorporated in any topology control algorithms. In the Directed Furthest Node First (DFNF) policy, an active node repairs the hole using one of its deactivated neighbours, selected based on distances from the hole. Weighted Directed Furthest Node First (WDFNF) selects replacements by considering both the distance and direction of a node. In Best Fit Node (BFN) policy, all the active nodes adjacent to a coverage hole participate in the replacement procedure. BFN can efficiently handle the network holes with higher computational complexities, however, the simulation result shows that DFNF and WDFNF can maintain the same network lifetime as BFN when network condition was extremely dense.
Keywords :
computational complexity; telecommunication network reliability; wireless sensor networks; BFN; WDFNF; active nodes adjacent; best fit node; computational complexity; connectivity holes; failed node replacement policies; network holes; network operational lifetime; sensor network lifetime maximisation; weighted directed furthest node first; Computational modeling; Fault tolerance; Image edge detection; Maintenance engineering; Mathematical model; Robot sensing systems;
Conference_Titel :
Wireless and Pervasive Computing (ISWPC), 2011 6th International Symposium on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-9868-0
Electronic_ISBN :
978-1-4244-9867-3
DOI :
10.1109/ISWPC.2011.5751310