DyKCo-Dynamic K-Coverage in Wireless Sensor Networks - PowerPoint

							DyKCo, Dynamic K-Coverage in
  Wireless Sensor Networks
      2008 IEEE International Conference on Systems, Man, and
                      Cybernetics (SMC 2008)

By:
              Amir Yahyavi†, Laleh Roostapour‡,
            Roohollah Aslanzadeh‡, Nasser Yazdani†

              †ECE Department, University of Tehran
       ‡CEIT Department, Amirkabir University of Technology


                                                       October 2008
       • Introduction & Problem Definition
       • Related Works & Assumptions
       • DyKCo – Dynamic K-Coverage
       • Misplaced K-Coverage Problem & MAC
         Support
       • Simulations, Conclusions &Future works


  Introduction & Problem
  Definition


October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   2
Problem Definition
    Power-constrained wireless sensor networks
     ◦ Prolonging network lifetime through power saving
       techniques

    Sensor scheduling
     ◦ Active mode vs. sleep mode

    Coverage problem
     ◦ Given:
          Field (Area A)
          N sensor nodes
          Sensing Range
          Node Distribution
     ◦ Question:
        How well can the field be monitored?
            Maximizing network lifetime by sensor scheduling


           October 15, 2008       DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   3
K-Coverage Problem
  Each point covered by K sensors
  Reasons
     ◦   Intruder Classification
     ◦   Fault Tolerance
     ◦   Detecting False Alarms
     ◦   Better Accuracy                                   1
                                                                    8      R
                                                 2
                                                                               7
                                                               6
                                                     3

                                                     4               5


          October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   4
       • Introduction & Problem Definition
       • Related Works & Assumptions
       • DyKCo – Dynamic K-Coverage
       • Misplaced K-Coverage Problem & MAC
         Support
       • Simulations, Conclusions &Future works


  Related Works &
  Assumptions


October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   5
Related Works
    Sensor Scheduling
     ◦ Deterministic
       High Computational Overhead
       High Communication Overhead
       Too Many Conditions for Networks
     ◦ Probabilistic




                             [Abrams2004]
        October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   6
Probabilistic Approach
  Wake up probability in each cycle – p
  Network Lifetime increased by factor
   of – 1/p


     Tail!               Tail!                Head!                    Tail!



                                                                                 t
                                                                     [Kumar 2004]


             October 15, 2008    DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   7
Assumptions
    High density network
    Synchronized Nodes
    Few concurrent events in network
    No need for geographical data
    Definite detection of an intruder in range of
     an active sensor
    Several Distributions
     ◦ Random Uniform
     ◦ Grid
     ◦ Poisson
                                                                      [Kumar2006]
        October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks  8
       • Introduction & Problem Definition
       • Related Works & Assumptions
       • DyKCo – Dynamic K-Coverage
       • Misplaced K-Coverage Problem & MAC
         Support
       • Simulations, Conclusions &Future works


  DyKCo – Dynamic K-
  Coverage


October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   9
Parameters
    Parameters
     ◦   Number of Deployed Nodes – n
     ◦   Wakeup Probability – p
     ◦   Sensing Range – r
     ◦   Coverage Required – K
    Goal:
     ◦ lim Prob(all points k-covered) = 1 as n → ∞



          October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   10
Static k-Coverage
    For slowly increasing function
     ◦ c(n) = npπr2/log(np)
     ◦ As n →∞ if we have:
     c(n)  [ (np)(1+ p log(np) ) + k loglog(np)]/log(np)
                                                               [Kumar2006]

     ◦ Then all points are K covered




        October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   11
Dynamic k-Coverage
  Wakeup probability of all nodes is set
   to 1-Coverage
  Upon detection the only active node in
   the area of the intruder sends an alarm
   message
  All neighbor nodes increase their
   wakeup probability to K-Coverage
  If the intruder is not detected the level
   is decreased to 1-Coverage
      October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   12
Dynamic K-Coverage
    Dynamic K-Coverage
     ◦ Providing 1-Coverage
     ◦ Providing K-Coverage over the intrusion




        October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   13
       • Introduction & Problem Definition
       • Related Works & Assumptions
       • DyKCo – Dynamic K-Coverage
       • Misplaced K-Coverage Problem &
         MAC Support
       • Simulations, Conclusions &Future works


  Misplaced K-Coverage
  problem & MAC Support


October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   14
Misplaced k-Coverage
    The area K-Covered is centered around the alarming
     node    The area that will have k-coverage in the next cycle



          The area that
         should have k-
                                             The area that should have k-
         coverage in
                                            coverage in the next cycle
         the next cycle
         if the intruder
         doesn’t move




         October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   15
Solution
    Using higher wakeup probably
     ◦ Considering only half of the effective nodes
       hear the alert message




        October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   16
Mac Support
    MAC Layer Support
     ◦ Synchronized wakeups
     ◦ S-MAC, T-MAC, Delay Efficient S-MAC
    Not waking up all nodes in intrusion
     area:
     ◦ Lower Energy Consumption
     ◦ Collision avoidance



       October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   17
       • Introduction & Problem Definition
       • Related Works & Assumptions
       • DyKCo – Dynamic K-Coverage
       • Misplaced K-Coverage Problem & MAC
         Support
       • Simulations, Conclusions & Future
         works


  Simulations, Conclusions &
  Future Works


October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   18
Simulations
  Area: Square 150mX150m
  Communication & Sensing Range: 4m
                               8


                               7
  Minimum Coverage on Target




                               6


                               5
                                                                                              Dykco (n/2)
                               4                                                              Dykco
                                                                                              Static K-Coverage
                               3


                               2


                               1


                               0

                                   15000     20000       25000        30000        35000   40000
                                                      Number of Deployed Sensors

                                       Minimum Coverage Provided over the Intruder
                                   October 15, 2008      DyKCo, Dynamic K-Coverage in Wireless Sensor Networks    19
Simulations

                                 1800

                                 1600
Avergae Number of Active Nodes




                                 1400

                                 1200

                                 1000

                                 800

                                 600                                                                  Dykco (n/2)
                                 400                                                                  Dykco

                                 200                                                                  Static K-Coverage

                                    0
                                        15000        20000      25000         30000       35000   40000
                                                             Number of Deployed Sensors

                                                Average number of Active nodes in each cycle


                                        October 15, 2008       DyKCo, Dynamic K-Coverage in Wireless Sensor Networks      20
Conclusions
  Dramatic Energy Savings
  Very low Computational and
   Communicational Overhead
  Stealthy
  Secure
  Scalable
  Configurable



     October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   21
Future Works
  Better approximations for wakeup
   probability
  Other solutions for Misplaced K-
   Coverage problem
     ◦ Estimating the covered Area
     ◦ Delayed Coverage Reduction
     ◦ Diffusion Model



       October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   22
Future Works




                )(a                                   )(b


                       Covered Area Estimation

    October 15, 2008       DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   23
Future Works
          Delayed Reduction Model
                                                  k-3

                                                        k-2
   Diffusion Model

                                                          k-1
       k-2
             k-1                                                k
                   k




       October 15, 2008     DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   24
    References
   Geoffrey Werner-Allen, "Deploying a Wireless Sensor Network on an Active Volcano," IEEE Internet Computing, Mar 2006.
   A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, "Wireless sensor networks for habitat monitoring," Proceedings
    of the 1st ACM international workshop on Wireless sensor networks and applications, pp. 88-97, 2002.
   I.F. Akyildiz, W. Su , Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, vol. 38,
    pp. 393-422, 2002.
   S. Kumar, T.H. Lai, and J. Balogh, "On k- coverage in a mostly sleeping sensor network," Wireless Networks, October 2006.
   W. Ye, J. Heidemann, and D. Estrin, "Medium access control with coordinated adaptive sleeping for wireless sensor networks,"
    IEEE/ACM Trans. Netw., vol. 12, pp. 493-506, 2004.
   T.V. Dam, and K. Langendoen, "An adaptive energy-efficient MAC protocol for wireless sensor networks," in Proceedings of the 1st
    international conference on Embedded networked sensor systems, Los Angeles, California, USA: ACM, 2003, pp. 171-180.
   K. Wu , Y. Gao, F. Li, and Y. Xiao, "Lightweight deployment-aware scheduling for wireless sensor networks," MOBILE
    NETWORKS & APPLICATIONS, vol. 10, pp. 837-852, December 2005.
   G. Lu, N. Sandagopan, B. Krishnamachari, and A. Goel, "Delay efficient sleep scheduling in wireless sensor networks," INFOCOM
    2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4, pp. 2470-2481
    vol. 4, 2005.
   X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, , and C. Gill, "Integrated coverage and connectivity configuration in wireless sensor
    networks," Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 28-39, 2003.
   S. Meguerdichian, F. Koushanfar,M. Potkonjak, and M. Srivastava, "Coverage problems in wireless ad-hoc sensor networks,"
    INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol.
    3, 2001.
   F. Ye, G. Zhong, S. Lu, and L. Zhang, "PEAS: a robust energy conserving protocol for long-lived sensor networks," Network
    Protocols, 2002. Proceedings. 10th IEEE International Conference on, pp. 200-201, 2002.
   Z. Abrams, A. Goel, and S. Plotkin, "Set k-cover algorithms for energy efficient monitoring in wireless sensor networks," in
    Proceedings of the third international symposium on Information processing in sensor networks, Berkeley, California, USA: ACM,
    2004, pp. 424-432.

                    October 15, 2008                 DyKCo, Dynamic K-Coverage in Wireless Sensor Networks                               25
References
   B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in
    Ad Hoc Wireless Networks," Wireless Networks, vol. 8, pp. 481-494, 2002.
   J. Zhao and R. Govindan, "Understanding packet delivery performance in dense wireless sensor networks," Proceedings of the first
    international conference on Embedded networked sensor systems, pp. 1-13, 2003.
   A. Arora, P. Dutta, S. Bapat, V. Kulathumani, H. Zhang, V. Naik, V. Mittal, H. Cao, M. Demirbas, M. Gouda, Y. Choi, T. Herman, S.
    Kulkarni, U. Arumugam, M. Nesterenko, A. Vora, and M. Miyashita, "A line in the sand: a wireless sensor network for target detection,
    classification, and tracking," Computer Networks, vol. 46, pp. 605-634, 2004.
   D. Tian and N.D. Georganas, "A coverage-preserving node scheduling scheme for large wireless sensor networks," in Proceedings of the 1st
    ACM international workshop on Wireless sensor networks and applications, Atlanta, Georgia, USA: ACM, pp. 32-41, 2002.
   F. Ye, G. Zhong, S. Lu, and L. Zhang, "Energy efficient robust sensing coverage in large sensor networks," Computer Science Dept-UCLA,
    Tech. Rep..
   P. Wan and C. Yi, "Coverage by randomly deployed wireless sensor networks," IEEE/ACM Trans. Netw., vol. 14, pp. 2658-2669, 2006.
   T. He, S. Krishnamurthy, J.Stankovic, T. Abdelzaher, L. Luo, R. Stoleru, T. Yan, and Lin Gu, "Energy-efficient surveillance system using
    wireless sensor networks," Proceedings of the 2nd international conference on Mobile systems, applications, and services, pp. 270-283,
    2004.
   M. Cardei, M. Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," IEEE INFOCOM, pp. 1976–1984,
    2005.
   Huang and Tseng, "The Coverage Problem in a Wireless Sensor Network," Mobile Networks and Applications, vol. 10, pp. 519-528, 2005.
   S. Nazemi Gelyan, A. Nasiri Eghbali, L. Roustapoor, Amir Yahyavi, and M. Dehghan, "SLTP: Scalable Lightweight Time Synchronization
    Protocol for Wireless Sensor Network," MSN, pp. 536-547, 2007.
   J. Elson, L. Girod, and D. Estrin, "Fine-Grained Network Time Synchronization using Reference Broadcasts," Proceeding of the 5th
    symposium on Operating systems design and implementation , Vol. 36, pp. 147-163, ACM Press, USA, 2002.
   S.A. Hosseininezhad, G. Saeedi Nejad, K. Rahmizadeh, M. Dehghan, “Adaptive Quorum: A Traffic Aware Power Saving Mechanism for
    Multi-hop Mobile Ad-hoc Networks,” Proceedings of The 10th International Conference on Advanced Communication Technology, pp.
    322-327, 2008.
   L. Wang and Y. Xiao, "Energy saving mechanisms in sensor networks," Broadband Networks, 2005 2nd International Conference on, pp.
    777-785, 2005.
                     October 15, 2008                 DyKCo, Dynamic K-Coverage in Wireless Sensor Networks                                 26
Thanks




              Questions/Comments




    October 15, 2008   DyKCo, Dynamic K-Coverage in Wireless Sensor Networks   27