Lifetime-Maximized Strong Barrier Coverage of 3D Camera Sensor Networks

Algorithm 1

Robust Barrier Coverage Algorithm for Homo-LifMax-BC Problem

1: Set ,

2: for each sensor in do

3:   ,

4: //Phase 1: Auxiliary Graph Transformation

5: //Step 1: Virtual source and destination introducing

6: 

7: 

8: //Step 2: Node-to-directed-edge converting

9: 

10: 

11: 

12: //Step 3: Undirected-edge-to-directed-edge duplexing

13: for each edge in do

14:   ,

15: for each edge in do

16:   ,

17: for each edge in do

18:  ,

19: 

20: //Phase 2: Barrier Coverage Scheduling

21: Apply Stint Algorithm in [21] to (, , ) and obtain node-disjoint

  paths collected in

21: for each path in do

23:  for each directed edge on do

24:   Case 1: for , it is restored into the source of .

25:   Case 2: for each , it is reduced into the undirected edge

   of .

26:   Case 3: for , it is restored into the destination of

  .

27: 

28: , .