1. 1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong Kong *Illinois Institute of Technology INFOCOM 2007

2. 2 Outlines Introductions Multiple Directional Cover Sets Problem (MDCS) Solutions to the MDCS problem  Progressive algorithm  Prog-Resd algorithm  Feedback algorithm Simulation Results Conclusions

3. 3 Introductions omni-directional sensor  Have an omni-angle of sensing range. [10] M. Cardei, M. T. Thai, Y. Li, and W. Wu, “Energy-efficient target coverage in wireless sensor networks,” in IEEE INFOCOM, 2005. directional sensor  Video sensors, ultrasonic sensors, and infrared sensors.  The sensing region of each direction of a directional sensor is a sector of the sensing disk centered at the sensor with a sensing radius.  Each sensor has a uniform sensing region and the sensing regions of different directions of a sensor do not overlap. The objective of this paper  To maximize the network lifetime of a directional sensor network network lifetime : the time duration when each target is covered by the work direction of at least one active sensor.

4. 4

5. 5 Introductions cover set  A subset of directions of the sensors, in which the directions cover all the targets. No more than one direction of a sensor can be in a cover set. directional cover set problem (DCS)  “Finding a cover set” and it is NP-complete. non-disjoint cover sets  Organize the directions of sensors into non-disjoint subsets, each of which is a cover set, and allocate the work time for each cover set.  Allow a direction or a sensor to participate in multiple cover sets. multiple directional cover sets problem (MDCS)  Finding non-disjoint cover sets and allocating the work time for each of them to maximize the network lifetime.

6. 6 Multiple Directional Cover Sets Problem (MDCS) Notations  M : the number of targets.  N : the number of sensors.  W : the number of directions per sensor.  a m : the m th target, 1  m  M.  s i : the i th sensor, 1  i  N.  d i,j : the j th direction of the i th sensor, 1  i  N, 1  j  W. d i,j = { a m | a m is covered by d i,j, a m  A } and s i = {d i,j | j = 1…W}.  A : the set of targets. A = {a 1, a 2, …, a M }  S : the set of sensors. S = {s 1, s 2, …, s N }  D : the set of the directions of all the sensors. D = {d i,j | i = 1…N, j = 1…W}  D k = {d i,j | t i,j,k > 0, d i,j  D} : the k th cover set of work directions.  t k : the work time of the k th cover set of directions,  t i,j,k : the work time of the direction d i,j in the k th cover set of directions  L i : the lifetime of a sensor s i

7. 7 Each sensor has an initial lifetime of 1 (time unit). Fig. 1(a), D 1 ={d 1,3, d 3,1 } with 0.5, D 2 ={d 1,3, d 2,2 } with 0.5, and D 3 = {d 2,2, d 3,1 } with 0.5. This results in a network lifetime of 1.5. Fig. 1(b), D 1 = {d 1,3, d 2,2 } with its available work time 1. This results in a network lifetime of 1.

8. 8 Multiple Directional Cover Sets Problem (MDCS) Model the MDCS as a Mixed Integer Programming (MIP) problem.  A directional sensor network with a set A of M targets a set S of N sensors a set D of directions Each sensor s i  S has W directions and an initial lifetime of L i Organize the directions in D into K cover sets. The k th cover set is denoted as D k, with the work time t k. A direction d i,j is allowed to participate into multiple cover sets.

9. 9 Multiple Directional Cover Sets Problem (MDCS) a boolean variable : The objective :

10. 10 Multiple Directional Cover Sets Problem (MDCS) Let t i,j,k = x i,j,k * t k  t i,j,k : the work time of d i,j in the cover set D k Get the following Linear Mixed Integer Programming (LMIP) problem. The objective : relax 0  t i,j,k  t k

11. 11 Progressive Algorithm Compute several cover sets and their corresponding work time which is accumulated to the total network lifetime in each iteration.  Step 1 : solve the LP problem and get the optimal solution of t k and t i,j,k conflicting directions  More than one direction of a sensor is in D k and these directions conflict with each other. non-conflicting direction  Only one direction of the sensor is in D k conflicting direction elimination process  The process of removing the conflicting directions in D k to make it a cover set.  Step 2 :If the update cover set D k ≠ 0, then call the direction selection process.  Step 3 : update the residual lifetime of any selected sensor s i using the work time t* k of the cover set D* k Repeat Step 1 ~ Step 3 until the lifetime computed in the current iteration is less than a small positive value of .

12. 12

13. 13

14. 14 D = {d 1,1, d 1,2, d 1,3, …, d 5,1, d 5,2, d 5,3 }. Assume D k = {d 1,3, d 2,1, d 2,3, d 3,1, d 3,3, d 4,1, d 4,3, d 5,1 } and the work time of the corresponding directions in D k is {0.8, 0.2, 0.8, 0.2, 0.8, 0.2, 0.8, 0.2}. Two non-conflicting directions d 1,3 with longer work time 0.8 and d 5,1 with work time 0.2, so d 1,3 is selected. Get U = {a 1 } and then remove a 1 from A’. Get V = {d 1,3, d 2,1 }, where d 1,3 is a non-conflicting direction and d 2,1 conflicts with d 2,3. Add d 1,3 to D k and remove both d 1,3 and d 2,1 from D’ k. Finally, we get D k = {d 1,3, d 2,3, d 3,3, d 4,3 } with {0.8, 1.0, 1.0, 1.0}.

15. 15 D k = {d 1,1, d 1,3, d 2,1, d 2,3, d 3,1, d 3,3, d 4,1, d 4,3, d 5,1, d 5,3, d 6,1, d 6,3 } and the work time of each direction in D k is {0.2, 0.8, 0.2, 0.8, 0.2, 0.8, 0.2, 0.8, 0.2, 0.8, 0.2, 0.8}. There is no non-conflicting direction in D’ k, and we select d 1,3 with its work time 0.8, d 1,1 conflicts with d 1,3, so d 1,1 is removed from D’ k. The direction d 1,3 is a non-conflicting direction in D’ k after d 1,1 is removed. Finally, we get D k = {d 1,3, d 2,3, d 3,3, d 4,3, d 5,3, d 6,3 } with { 1.0, 1,0, 1.0, 1.0, 1.0, 1.0}.

16. 16 Direction Selection Process To save energy, only a subset of D k can be selected. Select the direction d i,j  D k that satisfies t i,j,k > t* k and has the longest work time, to cover some uncovered targets each time. Repeat selecting another direction from D k to D* k until all the targets are covered by the selected directions. Then, remove redundant directions in D* k  Because the targets covered by some directions formerly selected into D* k may be totally covered by the ones selected into D* k later, which causes redundancy.

17. 17

18. 18 Prog-Resd Algorithm Direction selection process of Progressive algorithm  The direction with the longest work time is selected each time. Prog-Resd algorithm takes into consideration the residual lifetime of sensors. This algorithm differentiates from the Progressive algorithm only in the direction selection process. Select a cover set that has the longest residual lifetime L i to cover some uncovered targets each time.

19. 19 Feedback Algorithm Too many cover sets may be inefficient or impractical.  Frequently switching sensors from one direction to another may not be easy for physical reasons.  Too many cover sets mean too many state transition periods Lead to the occurrence of some targets may not be covered during the state transition period. Feedback that utilizes the results obtained from the previous iterations and finds a group of cover sets in the last iteration. Then use the results obtained in previous iterations as a feedback to the next iteration.  This algorithm is more useful and practical because it generates no more than K cover sets totally. (fewer cover sets) The LP problem, the conflicting direction elimination process, and the direction selection process are also used. In each iteration of the Feedback algorithm, we only determine one cover set from the solution to the LP problem, and add the constraints to the LP problem in the next iteration.  Then we solve the updated LP problem again to get the next cover set.

20. 20

21. 21

22. 22 Simulation Results Simulations running on a computer with 3 GHz CPU and 1 GB memory. The optimization toolbox in Matlab is used to solve the LP problem. N sensors with sensing radius r and M targets are deployed uniformly in a region of 400m  400m. Each sensor has W directions. Each algorithm runs 10 times through random placement of sensors and targets.  The Progressive algorithm and the Prog-Resd algorithm, set  = 0.001.  The Feedback algorithm, set δ= 0.0001.

23. 23 The network lifetime increases almost linearly when the number of sensors increases. The Feedback algorithm has te best performance.

24. 24 The network lifetime increases almost linearly when the sensing radius increases.

25. 25 The network lifetime drops quickly when M varies from 1 to 2, and then drops relatively slowly when M varies from5 up to 20.

26. 26 The network lifetime is almost linear to W.

27. 27 The runtime of the Feedback algorithm is longer than the other two algorithms.

28. 28 Both the Progressive algorithm and the Prog-Resd algorithm generate much more cover sets than the Feedback algorithm. Fewer cover sets with longer work time aremore efficient and practical.

29. 29 Conclusions Study the problem of the multiple directional cover sets (MDCS). Present the Progressive, Prog-Resd, and Feedback algorithm to solve the multiple directional cover sets (MDCS) problem. Future work  Design distributed algorithms to prolong the network lifetime of a directional sensor network.

30. 30 References [10] M. Cardei, M. T. Thai, Y. Li, and W. Wu, “Energy-efficient target coverage in wireless sensor networks,” in IEEE INFOCOM, 2005. [11] H. Liu, P. Wan, C. Yi, X. Jia, S. Makki, and P. Niki, “Maximal lifetime scheduling in sensor surveillance networks,” in IEEE INFOCOM, 2005. [12] M. X. Cheng, L. Ruan, and W. Wu, “Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks,” in IEEE INFOCOM, 2005. [13] H. Ma and Y. Liu, “On coverage problems of directional sensor networks,” in MSN, 2005. [14] J. Ai and A. A. Abouzeid, “Coverage by directional sensors in randomly deployed wireless sensor networks,” Journal of Combinatorial Optimization, vol. 11, no. 1, pp. 21–41, Feb. 2006.

31. 31 Target Coverage Problem (1/5) Definition ： Target Coverage Problem(TCP)  m targets with known location  n sensors randomly deployed in the closed proximity of the targets  schedule the sensor nodes activity  all the targets are continuously observed and network lifetime is maximized. Scheduling mechanism Step1 、 Sensors send their location information to the BS Step2 、 BS executes the sensor scheduling algorithm and broadcasts the schedule when each node is active Step3 、 Every sensor schedules itself for active/sleep intervals

32. 32 Maximum Set Covers (2/5) Definition ： MSC Problem  C: set of sensors （ n sensors ） every sensor can be part of more than one set assume each sensor ’ s lifetime is 1  R: set of targets （ m targets ）  Find a family of set covers S 1, …, S p with time weight t 1, …, t p in [0,1]  Goal ： to maximize t 1 + … + t p

33. 33 Disjoint set (3/5) S 1 = {s 1, s 2 } t 1 =1 S 2 = {s 3, s 4 } t 2 =1 Lifetime G = 2 R = {r 1, r 2, r 3 } C = {s 1, s 2, s 3, s 4 }

34. 34 Maximum Set Covers (4/5) S 1 = {s 1, s 2 } t 1 = 0.5 S 2 = {s 2, s 3 } t 2 = 0.5 S 3 = {s 1, s 3 } t 3 = 0.5 S 4 = {s 4 } t 4 = 1 Lifetime G = 2.5

35. 35 Solutions To Compute Maximum Set Covers (5/5) LP-MSC Heuristic Greedy-MSC Heuristic