Reorganization in OCOOutlineIntroduction to Reorganization in WSNImportance of Reorganization in WSNOCO in WSNOCO Reorganization AlgorithmConditions for the AlgorithmReferences11Reorganization in Reorganization in OCOOCOPresented By:Presented By:Aiyaz Amin PaniwalaAiyaz Amin PaniwalaSaurav Kumar BenganiSaurav Kumar Bengani22OutlineOutlineIntroduction to Reorganization in WSNIntroduction to Reorganization in WSNImportance of Reorganization in WSNImportance of Reorganization in WSNOCO in WSNOCO in WSNOCO Reorganization AlgorithmOCO Reorganization AlgorithmConditions for the AlgorithmConditions for the AlgorithmReferencesReferences33Introduction to Reorganization in WSNIntroduction to Reorganization in WSNNodes have limited resources for powerNodes have limited resources for powerNodes are exposed to natural and deliberate Nodes are exposed to natural and deliberate damagesdamagesNode positions could changeNode positions could changeOverall network topology changesOverall network topology changesReorganization provides methods to adjust to Reorganization provides methods to adjust to these changesthese changes44Importance of Reorganization in WSNImportance of Reorganization in WSNNodes may get exhausted, dead or Nodes may get exhausted, dead or repositionedrepositionedWSN may become partially non functionalWSN may become partially non functionalReorganization ensures recoveryReorganization ensures recoveryReorganization utilizes the redundancy in Reorganization utilizes the redundancy in WSNWSNNon-functional nodes can be replaced by Non-functional nodes can be replaced by Reorganizing the WSNReorganizing the WSN55OCO in WSNOCO in WSNConsists of 4 phasesConsists of 4 phasesPosition CollectionPosition CollectionProcessingProcessingTrackingTrackingMaintenanceMaintenance66OCO Reorganization AlgorithmOCO Reorganization AlgorithmMaintenance phase provides ReorganizationMaintenance phase provides ReorganizationAlgorithms have been designed to handle Algorithms have been designed to handle different node failuresdifferent node failuresReorganization in OCO can be achieved byReorganization in OCO can be achieved byLocal Reorganization of Border NodesLocal Reorganization of Border NodesLocal Reorganization of Forwarding NodesLocal Reorganization of Forwarding NodesGlobal ReorganizationGlobal Reorganization77Conditions for the AlgorithmConditions for the AlgorithmThis part describes three conditions in which This part describes three conditions in which algorithm runsalgorithm runsThe conditions are :The conditions are :The dead node is a forwarding nodeThe dead node is a forwarding nodeThe dead node is a border nodeThe dead node is a border nodeSeveral nodes in the network are deadSeveral nodes in the network are dead88ReferencesReferences“Maintenance Efficient Routing in Wireless Sensor Networks” Barroso, A.; Roedig, U.; Sreenan, C.; Embedded Networked Sensors, 2005. EmNetS-II. The Second IEEE Workshop on 30-31 May 2005 Page(s):97 - 106 “Loop-Based Topology Maintenance in Wireless Sensor Networks” Volume 3619/2005 ISBN 978-3-540-28102-3 “Location-free Coverage Maintenance in Wireless Sensor Networks” Rong Zhengy, Guanghui Hezand Xue Liuz Department of Computer Science University of Houston Technical Report Number UH-CS-05-15, July 21,
View Full Document