SlideShare a Scribd company logo
1 of 18
Download to read offline
SPIE Europe Security+Defence 2008




        A Knapsack Approach to
     Sensor-Mission Assignment with
           Uncertain Demands

    Diego Pizzocaro a Matthew P. Johnson b Hosam Rowaihy c
Stuart Chalmers d Alun Preece a Amotz Bar-Noy b Thomas La Porta c


a   Cardiff University   b The   City University of New York    c   Pennsylvania State University
                                     d University of Aberdeen
Outline


1. Motivation

2. Formal model

3. Pre-existent algorithms

4. Novel algorithm

5. Performance evaluation

6. Conclusion
Motivation
•   An homogeneous sensor network which is already deployed.

•   It is usually required to support multiple missions to be accomplished
    simultaneously.

•   Missions compete for the exclusive usage of a sensor:
    we need a scheme to assign individual sensors to missions.


                                            X
                                   X
                                  Target
                                           Target                                X
                                                                               Target 2


                                     X                        X
                                                             Target    X
                                 Target 1            X                Target
                                                    Target
                                                                                  X
                                                              X                  Target   X
                                                             Target                   Target




•   Missions have an uncertain demand for sensing resource capabilities
    (due to weather, unexpected events, ...)
Formal Model
•   We model this assignment problem by introducing the Sensor Utility Maximization
    (SUM) model.
                                                           Sensors

•   SUM can be represented as a bipartite graph:             S1
                                                                                (e11, p1
                                                                                         1   )
                                                                                                 Missions

                                                                     (e
                                                                          12
                                                                               ,p
     ‣                                                                                                      (d1, p1)
                                                                                                   M1
         Vertex sets:                                                           12
                                                                                     )

         Sensors {Si}, Missions {Mj}                         S2




     ‣   For each mission (Mj):
                                                             S3
                                                                                                   M2       (d2, p2)
          dj = utility demand
          pj = priority
                                                             S4

     ‣   For each sensor-mission pair:
          eij = utility that Si could contribute to Mj
          pij = eij / dj * pj profit of Si for mission Mj


•   Goal: a sensor assignment that maximizes the total profit.
Formal Model (contd)
•   Integer Linear Programming (ILP) formulation:


                                          m       n
                     Maximize:            j=1     i=1   pij xij , where pij = eij /dj × pj .
                                            n
                     Such that:             i=1   xij eij ≤ dj , for each mission Mj ∈ M ,
                                 m
                                 j=1   xij ≤ 1, for each sensor Si , and
                              xij ∈ {0, 1}, for each variable xij


•   Most important constraint (knapsack-style):
      Total utility cumulated by each mission Mj ≤ its demand dj

•   This assumption is based:
      ‣   on the uncertainty of the demands,

      ‣   on the principle that sensing resources are in high demand
          and should not be wasted.
          (from “JP 2-01 joint and national intelligence support to military operations”, see ref, in the paper)
Pre-existent Algorithms
•   Problem hardness: it is NP-Complete
    - Proof by showing that SUM is a generalization of the knapsack problem

•   We adapted three pre-existent algortihms to solve SUM:

      1. Mission-side greedy
         - Sort missions by decreasing priority ( pj )
         - For each mission: Assign sensors with highest utilities ( eij ) to the mission,
                                  until the cumulated utility does not exceed its demand ( dij ).

      2. Sensor-side greedy
         - Unsorted sensors
         - For each sensor:       Assign the sensor to the mission where that sensor is of most use
                                  (the one which maximizes the profit of each sensor pij)

      3. State-of-the-art approximation algorithm for GAP
         - Proved that SUM is a special case of Generalized Assignment Problem (GAP)
         - Provide a very good guaranteed approximation of the optimal solution
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -   IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
            the sensor can contribute ( max{pij} ).


                                                  X                      S1         M1
                          Sensor 2              Target 2


                 X              Sensor 3
                                                                         S2         M2
               Target 1
                                                Sensor 3

                                       X                                 S3         M3
                                     Target 3




        -   Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
            is of most use (the one which maximizes the profit pij).

        -   Further improvement: If a sensor cannot be assigned to the mission which
            maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -    IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
             the sensor can contribute ( max{pij} ).


        S1           M1




        S2           M2




        S3           M3




        -    Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
             is of most use (the one which maximizes the profit pij).

        -    Further improvement: If a sensor cannot be assigned to the mission which
             maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -    IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
             the sensor can contribute ( max{pij} ).


        S1           M1

                                                                      M1
                                                                 .1
                                                              =0
        S2           M2                                 p11

                                                   S1
                                                        p12 = 0.3     M2
                                                        p13
                                                              =0
        S3           M3                                         .4

                                                                      M3




        -    Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
             is of most use (the one which maximizes the profit pij).

        -    Further improvement: If a sensor cannot be assigned to the mission which
             maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -    IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
             the sensor can contribute ( max{pij} ).


        S1           M1


                                                            .3     M1        M1
                                                     p21 = 0 = 0.1
        S2           M2                        S2           p11
                                                     p22 = p12 = 0.3
                                                    S1    0.2           M2   M2
                                                           p13
                                                                 =0
        S3           M3                                            .4

                                                                             M3




        -    Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
             is of most use (the one which maximizes the profit pij).

        -    Further improvement: If a sensor cannot be assigned to the mission which
             maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -    IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
             the sensor can contribute ( max{pij} ).


        S1           M1
                                                         .6       M2
                                                  p32 = 0
                                                                 .3        M1   M1
                                            S3
                                                          p21 = 0 = 0.1
        S2           M2                           p
                                                 S233 = 0        p11
                                                         .2        M3
                                                         p22 = p12 = 0.3
                                                        S1     0.2         M2   M2
                                                                 p13
                                                                     =0
        S3           M3                                                 .4

                                                                                M3




        -    Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
             is of most use (the one which maximizes the profit pij).

        -    Further improvement: If a sensor cannot be assigned to the mission which
             maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -    IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
             the sensor can contribute ( max{pij} ).


                                                                                                      +
        S1           M1
                                                         .6       M2                 S3   p32 = 0.6
                                                  p32 = 0
                                                                 .3        M1   M1
                                            S3
                                                          p21 = 0 = 0.1
        S2           M2                           p
                                                 S233 = 0        p11                 S1   p13 = 0.4
                                                         .2        M3
                                                         p22 = p12 = 0.3
                                                        S1     0.2         M2   M2
                                                                 p13
                                                                     =0
        S3           M3                                                 .4           S2   p21 = 0.3
                                                                                                      -
                                                                                M3




        -    Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
             is of most use (the one which maximizes the profit pij).

        -    Further improvement: If a sensor cannot be assigned to the mission which
             maximize its profit, we consider the second most profitable mission, and so on ...
Novel algorithm
•   It is an improved version of Sensor-side greedy:

    ‣   Ordered Sensor-side greedy

        -   IDEA: Sorts sensors by decreasing max profit offer between all the missions to which
            the sensor can contribute ( max{pij} ).


                                                                        X
                                                Sensor 2              Target 2


                                       X              Sensor 1
                                     Target 1
                                                                      Sensor 3

                                                             X
                                                           Target 3




        -   Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor
            is of most use (the one which maximizes the profit pij).

        -   Further improvement: If a sensor cannot be assigned to the mission which
            maximize its profit, we consider the second most profitable mission, and so on ...
Performance evaluation
•   Simulation environment implemented in Java.

•   Missions and Sensors are deployed in random positions in the field.

•   Utility of sensor Si to mission Mj is a function                                                                                                                                
                                                                                                                                                                                                    1
                                                                                                                                                                                                      2                                              if Dij ≤ SR
                                                                                                                                                                                                   1+Dij /c
    of the distance Dij between sensor and mission.                                                                                      eij =
                                                                                                                                                                                     0                                                                otherwise


•   For each experiment:
           - Constant number of sensors (200, 500, 1000)
           - Number of simultaneous missions was varied from 10 to 150.

•   Experiments divided into two main groups to test algs’ efficiency:

                                                                                                                                                             18000
                                                   84
                   % Optimal Fractional Solution




                                                                                                                                                             16000
                                                   82
                                                                                                                                                             14000
                                                   80
                                                                                                                                         Running Time (ms)




                                                             Optimality                                                                                                                  Time
                                                                                                                                                             12000
                                                   78

                                                   76                                                                                                        10000

                                                   74                                                                                                         8000

                                                   72                                                                                                         6000

                                                   70                                                                                                         4000

                                                   68                                                                                                         2000

                                                   66                                                                                                            0
                                                        10   20   30   40   50   60   70   80   90   100   110   120   130   140   150                               10   20   30   40   50   60   70      80     90   100   110   120   130   140   150
                                                                                 Number of Missions                                                                                           Number of Missions
                                                                                                                                                                                                        1000 sensors
Performance evaluation (Optimality)
•   The graphs show the sum of the profits pij of each sensor-mission assignments
    (i.e. the value of the objective function in the ILP formulation)

                                         500 sensors                                                                 1000 sensors
                                                                                                      96
                         92                               GAP approx alg                                                             GAP approx alg
    % Optimal Solution




                                                                                 % Optimal Solution
                         88                                                                           92



                         84
                                              Ordered Sensor-side greedy                              88                   Ordered Sensor-side greedy

                              10    30   50    70    90     110   130      150                             10   30    50      70    90    110   130     150
                                         Number of Missions                                                           Number of Missions




•   We show only the best two algs: Sensor-Side Greedy and GAP approx algorithm

                              ‣    Optimality results differ only by 1% in average.

                              ‣    The best solution quality: GAP approx algorithm
Performance evaluation (Time)

                                      Effective running time (1000 sensors)




                 Running Time (ms)
                                     8000             GAP approx alg

                                     6000

                                     4000

                                     2000              Ordered Sensor-side greedy

                                        0
                                            10   30      50    70      90   110     130   150
                                                        Number of Missions




     •    Best effective running time:                              Ordered Sensor-side greedy



‣   Best trade off optimality/running time:                                       Ordered Sensor-side greedy
Conclusion
•   We considered an homogeneous sensor network which was already deployed,
    to support competing simultaneous missions with uncertain demands.


•   We developed a formal model and a new greedy algorithm.


•   Simulation results show that:
    our novel Ordered Sensor-side greedy algorithm offers the best trade-off between
    optimality of the solution and effective running time.




•   Future work:


     ‣   Heterogeneous sensor types


     ‣   Sharing of a sensing resource
Thanks for listening

More Related Content

What's hot

Modern features-part-1-detectors
Modern features-part-1-detectorsModern features-part-1-detectors
Modern features-part-1-detectorszukun
 
Bouguet's MatLab Camera Calibration Toolbox
Bouguet's MatLab Camera Calibration ToolboxBouguet's MatLab Camera Calibration Toolbox
Bouguet's MatLab Camera Calibration ToolboxYuji Oyamada
 
Lesson 8: Basic Differentiation Rules (Section 21 slides)
Lesson 8: Basic Differentiation Rules (Section 21 slides)Lesson 8: Basic Differentiation Rules (Section 21 slides)
Lesson 8: Basic Differentiation Rules (Section 21 slides)Matthew Leingang
 
Accelerometers to Augmented Reality
Accelerometers to Augmented RealityAccelerometers to Augmented Reality
Accelerometers to Augmented Realityjblocksom
 
Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides)Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides)Matthew Leingang
 
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)Joo-Haeng Lee
 
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registration
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, RegistrationCVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registration
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registrationzukun
 
Sparsity and Compressed Sensing
Sparsity and Compressed SensingSparsity and Compressed Sensing
Sparsity and Compressed SensingGabriel Peyré
 
igarss11benedek.pdf
igarss11benedek.pdfigarss11benedek.pdf
igarss11benedek.pdfgrssieee
 
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)Jia-Bin Huang
 
14.20 o1 m miller
14.20 o1 m miller14.20 o1 m miller
14.20 o1 m millerNZIP
 
Learning Moving Cast Shadows for Foreground Detection (VS 2008)
Learning Moving Cast Shadows for Foreground Detection (VS 2008)Learning Moving Cast Shadows for Foreground Detection (VS 2008)
Learning Moving Cast Shadows for Foreground Detection (VS 2008)Jia-Bin Huang
 
Visual Odomtery(2)
Visual Odomtery(2)Visual Odomtery(2)
Visual Odomtery(2)Ian Sa
 
Global illumination techniques for the computation of hight quality images in...
Global illumination techniques for the computation of hight quality images in...Global illumination techniques for the computation of hight quality images in...
Global illumination techniques for the computation of hight quality images in...Frederic Perez
 
Hussain Learning Relevant Eye Movement Feature Spaces Across Users
Hussain Learning Relevant Eye Movement Feature Spaces Across UsersHussain Learning Relevant Eye Movement Feature Spaces Across Users
Hussain Learning Relevant Eye Movement Feature Spaces Across UsersKalle
 
Signal Processing Course : Compressed Sensing
Signal Processing Course : Compressed SensingSignal Processing Course : Compressed Sensing
Signal Processing Course : Compressed SensingGabriel Peyré
 
Bouguet's MatLab Camera Calibration Toolbox for Stereo Camera
Bouguet's MatLab Camera Calibration Toolbox for Stereo CameraBouguet's MatLab Camera Calibration Toolbox for Stereo Camera
Bouguet's MatLab Camera Calibration Toolbox for Stereo CameraYuji Oyamada
 

What's hot (19)

Modern features-part-1-detectors
Modern features-part-1-detectorsModern features-part-1-detectors
Modern features-part-1-detectors
 
Bouguet's MatLab Camera Calibration Toolbox
Bouguet's MatLab Camera Calibration ToolboxBouguet's MatLab Camera Calibration Toolbox
Bouguet's MatLab Camera Calibration Toolbox
 
Lesson 8: Basic Differentiation Rules (Section 21 slides)
Lesson 8: Basic Differentiation Rules (Section 21 slides)Lesson 8: Basic Differentiation Rules (Section 21 slides)
Lesson 8: Basic Differentiation Rules (Section 21 slides)
 
Accelerometers to Augmented Reality
Accelerometers to Augmented RealityAccelerometers to Augmented Reality
Accelerometers to Augmented Reality
 
Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides)Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides)
 
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)
Note on Coupled Line Cameras for Rectangle Reconstruction (ACDDE 2012)
 
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registration
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, RegistrationCVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registration
CVPR2010: Advanced ITinCVPR in a Nutshell: part 4: Isocontours, Registration
 
Sparsity and Compressed Sensing
Sparsity and Compressed SensingSparsity and Compressed Sensing
Sparsity and Compressed Sensing
 
M16302
M16302M16302
M16302
 
igarss11benedek.pdf
igarss11benedek.pdfigarss11benedek.pdf
igarss11benedek.pdf
 
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)
A Physical Approach to Moving Cast Shadow Detection (ICASSP 2009)
 
14.20 o1 m miller
14.20 o1 m miller14.20 o1 m miller
14.20 o1 m miller
 
Learning Moving Cast Shadows for Foreground Detection (VS 2008)
Learning Moving Cast Shadows for Foreground Detection (VS 2008)Learning Moving Cast Shadows for Foreground Detection (VS 2008)
Learning Moving Cast Shadows for Foreground Detection (VS 2008)
 
Visual Odomtery(2)
Visual Odomtery(2)Visual Odomtery(2)
Visual Odomtery(2)
 
Nanotechnology
NanotechnologyNanotechnology
Nanotechnology
 
Global illumination techniques for the computation of hight quality images in...
Global illumination techniques for the computation of hight quality images in...Global illumination techniques for the computation of hight quality images in...
Global illumination techniques for the computation of hight quality images in...
 
Hussain Learning Relevant Eye Movement Feature Spaces Across Users
Hussain Learning Relevant Eye Movement Feature Spaces Across UsersHussain Learning Relevant Eye Movement Feature Spaces Across Users
Hussain Learning Relevant Eye Movement Feature Spaces Across Users
 
Signal Processing Course : Compressed Sensing
Signal Processing Course : Compressed SensingSignal Processing Course : Compressed Sensing
Signal Processing Course : Compressed Sensing
 
Bouguet's MatLab Camera Calibration Toolbox for Stereo Camera
Bouguet's MatLab Camera Calibration Toolbox for Stereo CameraBouguet's MatLab Camera Calibration Toolbox for Stereo Camera
Bouguet's MatLab Camera Calibration Toolbox for Stereo Camera
 

Viewers also liked

Year 9 wow[1]
Year 9 wow[1]Year 9 wow[1]
Year 9 wow[1]katiecog
 
高技术战争 Gaojishu People's Liberation Army high tech war in 2014
高技术战争 Gaojishu People's Liberation Army high tech war in 2014高技术战争 Gaojishu People's Liberation Army high tech war in 2014
高技术战争 Gaojishu People's Liberation Army high tech war in 2014Bill Hagestad II
 
Science Fiction Sensor Networks
Science Fiction Sensor NetworksScience Fiction Sensor Networks
Science Fiction Sensor NetworksDiego Pizzocaro
 
On Multi-Sensor Task Allocation
On Multi-Sensor Task AllocationOn Multi-Sensor Task Allocation
On Multi-Sensor Task AllocationDiego Pizzocaro
 
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...leonvit2005
 

Viewers also liked (6)

Year 9 wow[1]
Year 9 wow[1]Year 9 wow[1]
Year 9 wow[1]
 
Ciu 56 web2
Ciu 56 web2Ciu 56 web2
Ciu 56 web2
 
高技术战争 Gaojishu People's Liberation Army high tech war in 2014
高技术战争 Gaojishu People's Liberation Army high tech war in 2014高技术战争 Gaojishu People's Liberation Army high tech war in 2014
高技术战争 Gaojishu People's Liberation Army high tech war in 2014
 
Science Fiction Sensor Networks
Science Fiction Sensor NetworksScience Fiction Sensor Networks
Science Fiction Sensor Networks
 
On Multi-Sensor Task Allocation
On Multi-Sensor Task AllocationOn Multi-Sensor Task Allocation
On Multi-Sensor Task Allocation
 
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...
Τα δημογραφικά δεδομένα του μεταεπαναστατικού Ελληνικού Πολεμικού Ναυτικού πα...
 

Similar to A Knapsack Approach to Sensor-Mission Assignment with Uncertain Demands

Sensor-Task Assignment in Heterogeneous Sensor Networks
Sensor-Task Assignment in Heterogeneous Sensor NetworksSensor-Task Assignment in Heterogeneous Sensor Networks
Sensor-Task Assignment in Heterogeneous Sensor NetworksDiego Pizzocaro
 
Probability And Stats Intro2
Probability And Stats Intro2Probability And Stats Intro2
Probability And Stats Intro2mailund
 
Programming with Python - Adv.
Programming with Python - Adv.Programming with Python - Adv.
Programming with Python - Adv.Mosky Liu
 
How good is your prediction a gentle introduction to conformal prediction.
How good is your prediction  a gentle introduction to conformal prediction.How good is your prediction  a gentle introduction to conformal prediction.
How good is your prediction a gentle introduction to conformal prediction.Deep Learning Italia
 
Aaa ped-17-Unsupervised Learning: Dimensionality reduction
Aaa ped-17-Unsupervised Learning: Dimensionality reductionAaa ped-17-Unsupervised Learning: Dimensionality reduction
Aaa ped-17-Unsupervised Learning: Dimensionality reductionAminaRepo
 
Video Surveillance System
Video Surveillance SystemVideo Surveillance System
Video Surveillance SystemAli Mattash
 
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)STAIR Lab, Chiba Institute of Technology
 
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...Masahiro Kanazaki
 
Randomness conductors
Randomness conductorsRandomness conductors
Randomness conductorswtyru1989
 
Secure information aggregation in sensor networks
Secure information aggregation in sensor networksSecure information aggregation in sensor networks
Secure information aggregation in sensor networksAleksandr Yampolskiy
 
p-Median Cluster Analysis Based on General-Purpose Solvers (1)
p-Median Cluster Analysis Based on General-Purpose Solvers (1)p-Median Cluster Analysis Based on General-Purpose Solvers (1)
p-Median Cluster Analysis Based on General-Purpose Solvers (1)SSA KPI
 
Parameter Estimation for Semiparametric Models with CMARS and Its Applications
Parameter Estimation for Semiparametric Models with CMARS and Its ApplicationsParameter Estimation for Semiparametric Models with CMARS and Its Applications
Parameter Estimation for Semiparametric Models with CMARS and Its ApplicationsSSA KPI
 
Auto encoders in Deep Learning
Auto encoders in Deep LearningAuto encoders in Deep Learning
Auto encoders in Deep LearningShajun Nisha
 

Similar to A Knapsack Approach to Sensor-Mission Assignment with Uncertain Demands (16)

Sensor-Task Assignment in Heterogeneous Sensor Networks
Sensor-Task Assignment in Heterogeneous Sensor NetworksSensor-Task Assignment in Heterogeneous Sensor Networks
Sensor-Task Assignment in Heterogeneous Sensor Networks
 
QMC: Transition Workshop - Monte Carlo and (Randomized) Quasi-Monte Carlo Sim...
QMC: Transition Workshop - Monte Carlo and (Randomized) Quasi-Monte Carlo Sim...QMC: Transition Workshop - Monte Carlo and (Randomized) Quasi-Monte Carlo Sim...
QMC: Transition Workshop - Monte Carlo and (Randomized) Quasi-Monte Carlo Sim...
 
Probability And Stats Intro2
Probability And Stats Intro2Probability And Stats Intro2
Probability And Stats Intro2
 
Programming with Python - Adv.
Programming with Python - Adv.Programming with Python - Adv.
Programming with Python - Adv.
 
How good is your prediction a gentle introduction to conformal prediction.
How good is your prediction  a gentle introduction to conformal prediction.How good is your prediction  a gentle introduction to conformal prediction.
How good is your prediction a gentle introduction to conformal prediction.
 
Aaa ped-17-Unsupervised Learning: Dimensionality reduction
Aaa ped-17-Unsupervised Learning: Dimensionality reductionAaa ped-17-Unsupervised Learning: Dimensionality reduction
Aaa ped-17-Unsupervised Learning: Dimensionality reduction
 
Svm V SVC
Svm V SVCSvm V SVC
Svm V SVC
 
Video Surveillance System
Video Surveillance SystemVideo Surveillance System
Video Surveillance System
 
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
Higher-order Factorization Machines(第5回ステアラボ人工知能セミナー)
 
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...
Multidisciplinary Design Optimization of Supersonic Transport Wing Using Surr...
 
Randomness conductors
Randomness conductorsRandomness conductors
Randomness conductors
 
Secure information aggregation in sensor networks
Secure information aggregation in sensor networksSecure information aggregation in sensor networks
Secure information aggregation in sensor networks
 
Lec 2-2
Lec 2-2Lec 2-2
Lec 2-2
 
p-Median Cluster Analysis Based on General-Purpose Solvers (1)
p-Median Cluster Analysis Based on General-Purpose Solvers (1)p-Median Cluster Analysis Based on General-Purpose Solvers (1)
p-Median Cluster Analysis Based on General-Purpose Solvers (1)
 
Parameter Estimation for Semiparametric Models with CMARS and Its Applications
Parameter Estimation for Semiparametric Models with CMARS and Its ApplicationsParameter Estimation for Semiparametric Models with CMARS and Its Applications
Parameter Estimation for Semiparametric Models with CMARS and Its Applications
 
Auto encoders in Deep Learning
Auto encoders in Deep LearningAuto encoders in Deep Learning
Auto encoders in Deep Learning
 

Recently uploaded

The_Chronological_Life_of_Christ_Part_93_Fear God
The_Chronological_Life_of_Christ_Part_93_Fear GodThe_Chronological_Life_of_Christ_Part_93_Fear God
The_Chronological_Life_of_Christ_Part_93_Fear GodNetwork Bible Fellowship
 
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...Cometan
 
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short vers
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short versDP & Nostradamus-Fatima-Bailey-Branham-Ford - Short vers
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short versBengt & Maarit de Paulis
 
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...iqra tube
 
DP & Jesus Marriage - 2 potential candidates
DP & Jesus Marriage - 2 potential candidatesDP & Jesus Marriage - 2 potential candidates
DP & Jesus Marriage - 2 potential candidatesBengt & Maarit de Paulis
 
SERPENT COIL: THE AWAKENING OF KUNDALINI
SERPENT COIL: THE AWAKENING OF KUNDALINISERPENT COIL: THE AWAKENING OF KUNDALINI
SERPENT COIL: THE AWAKENING OF KUNDALINISantanu Das
 
Easter Apocalypse_Palm Sunday_Rev. 7.pptx
Easter Apocalypse_Palm Sunday_Rev. 7.pptxEaster Apocalypse_Palm Sunday_Rev. 7.pptx
Easter Apocalypse_Palm Sunday_Rev. 7.pptxStephen Palm
 
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...Eizijesu Obahaiye
 
Free eBook ~Short Inspirational Stories - The Benefits.pdf
Free eBook ~Short Inspirational Stories - The Benefits.pdfFree eBook ~Short Inspirational Stories - The Benefits.pdf
Free eBook ~Short Inspirational Stories - The Benefits.pdfOH TEIK BIN
 
Deerfoot Church of Christ Bulletin 3 24 24
Deerfoot Church of Christ Bulletin 3 24 24Deerfoot Church of Christ Bulletin 3 24 24
Deerfoot Church of Christ Bulletin 3 24 24deerfootcoc
 
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]iqra tube
 
Old Age but fruitful and meaningful.pptx
Old Age but fruitful and meaningful.pptxOld Age but fruitful and meaningful.pptx
Old Age but fruitful and meaningful.pptxInnovator Marbun
 

Recently uploaded (13)

The_Chronological_Life_of_Christ_Part_93_Fear God
The_Chronological_Life_of_Christ_Part_93_Fear GodThe_Chronological_Life_of_Christ_Part_93_Fear God
The_Chronological_Life_of_Christ_Part_93_Fear God
 
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...
The Mormon & Quaker Moons of Lancashire: Stories of Religious Conversion & Mi...
 
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short vers
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short versDP & Nostradamus-Fatima-Bailey-Branham-Ford - Short vers
DP & Nostradamus-Fatima-Bailey-Branham-Ford - Short vers
 
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...
All About Zakah for Muslim Americans - Dr. Main Alqudah [https://www.guidance...
 
DP & Jesus Marriage - 2 potential candidates
DP & Jesus Marriage - 2 potential candidatesDP & Jesus Marriage - 2 potential candidates
DP & Jesus Marriage - 2 potential candidates
 
SERPENT COIL: THE AWAKENING OF KUNDALINI
SERPENT COIL: THE AWAKENING OF KUNDALINISERPENT COIL: THE AWAKENING OF KUNDALINI
SERPENT COIL: THE AWAKENING OF KUNDALINI
 
Easter Apocalypse_Palm Sunday_Rev. 7.pptx
Easter Apocalypse_Palm Sunday_Rev. 7.pptxEaster Apocalypse_Palm Sunday_Rev. 7.pptx
Easter Apocalypse_Palm Sunday_Rev. 7.pptx
 
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...
365 Days of Thanking God_ Cultivating a Heart of Thanksgiving Everyday (Revis...
 
Free eBook ~Short Inspirational Stories - The Benefits.pdf
Free eBook ~Short Inspirational Stories - The Benefits.pdfFree eBook ~Short Inspirational Stories - The Benefits.pdf
Free eBook ~Short Inspirational Stories - The Benefits.pdf
 
Deerfoot Church of Christ Bulletin 3 24 24
Deerfoot Church of Christ Bulletin 3 24 24Deerfoot Church of Christ Bulletin 3 24 24
Deerfoot Church of Christ Bulletin 3 24 24
 
English - The 1st Book of Adam and Eve.pdf
English - The 1st Book of Adam and Eve.pdfEnglish - The 1st Book of Adam and Eve.pdf
English - The 1st Book of Adam and Eve.pdf
 
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]
Islamic Finance 101 - Dr. Main Alqudah [https://www.guidancecollege.org/]
 
Old Age but fruitful and meaningful.pptx
Old Age but fruitful and meaningful.pptxOld Age but fruitful and meaningful.pptx
Old Age but fruitful and meaningful.pptx
 

A Knapsack Approach to Sensor-Mission Assignment with Uncertain Demands

  • 1. SPIE Europe Security+Defence 2008 A Knapsack Approach to Sensor-Mission Assignment with Uncertain Demands Diego Pizzocaro a Matthew P. Johnson b Hosam Rowaihy c Stuart Chalmers d Alun Preece a Amotz Bar-Noy b Thomas La Porta c a Cardiff University b The City University of New York c Pennsylvania State University d University of Aberdeen
  • 2. Outline 1. Motivation 2. Formal model 3. Pre-existent algorithms 4. Novel algorithm 5. Performance evaluation 6. Conclusion
  • 3. Motivation • An homogeneous sensor network which is already deployed. • It is usually required to support multiple missions to be accomplished simultaneously. • Missions compete for the exclusive usage of a sensor: we need a scheme to assign individual sensors to missions. X X Target Target X Target 2 X X Target X Target 1 X Target Target X X Target X Target Target • Missions have an uncertain demand for sensing resource capabilities (due to weather, unexpected events, ...)
  • 4. Formal Model • We model this assignment problem by introducing the Sensor Utility Maximization (SUM) model. Sensors • SUM can be represented as a bipartite graph: S1 (e11, p1 1 ) Missions (e 12 ,p ‣ (d1, p1) M1 Vertex sets: 12 ) Sensors {Si}, Missions {Mj} S2 ‣ For each mission (Mj): S3 M2 (d2, p2) dj = utility demand pj = priority S4 ‣ For each sensor-mission pair: eij = utility that Si could contribute to Mj pij = eij / dj * pj profit of Si for mission Mj • Goal: a sensor assignment that maximizes the total profit.
  • 5. Formal Model (contd) • Integer Linear Programming (ILP) formulation: m n Maximize: j=1 i=1 pij xij , where pij = eij /dj × pj . n Such that: i=1 xij eij ≤ dj , for each mission Mj ∈ M , m j=1 xij ≤ 1, for each sensor Si , and xij ∈ {0, 1}, for each variable xij • Most important constraint (knapsack-style): Total utility cumulated by each mission Mj ≤ its demand dj • This assumption is based: ‣ on the uncertainty of the demands, ‣ on the principle that sensing resources are in high demand and should not be wasted. (from “JP 2-01 joint and national intelligence support to military operations”, see ref, in the paper)
  • 6. Pre-existent Algorithms • Problem hardness: it is NP-Complete - Proof by showing that SUM is a generalization of the knapsack problem • We adapted three pre-existent algortihms to solve SUM: 1. Mission-side greedy - Sort missions by decreasing priority ( pj ) - For each mission: Assign sensors with highest utilities ( eij ) to the mission, until the cumulated utility does not exceed its demand ( dij ). 2. Sensor-side greedy - Unsorted sensors - For each sensor: Assign the sensor to the mission where that sensor is of most use (the one which maximizes the profit of each sensor pij) 3. State-of-the-art approximation algorithm for GAP - Proved that SUM is a special case of Generalized Assignment Problem (GAP) - Provide a very good guaranteed approximation of the optimal solution
  • 7. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). X S1 M1 Sensor 2 Target 2 X Sensor 3 S2 M2 Target 1 Sensor 3 X S3 M3 Target 3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 8. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). S1 M1 S2 M2 S3 M3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 9. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). S1 M1 M1 .1 =0 S2 M2 p11 S1 p12 = 0.3 M2 p13 =0 S3 M3 .4 M3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 10. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). S1 M1 .3 M1 M1 p21 = 0 = 0.1 S2 M2 S2 p11 p22 = p12 = 0.3 S1 0.2 M2 M2 p13 =0 S3 M3 .4 M3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 11. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). S1 M1 .6 M2 p32 = 0 .3 M1 M1 S3 p21 = 0 = 0.1 S2 M2 p S233 = 0 p11 .2 M3 p22 = p12 = 0.3 S1 0.2 M2 M2 p13 =0 S3 M3 .4 M3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 12. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). + S1 M1 .6 M2 S3 p32 = 0.6 p32 = 0 .3 M1 M1 S3 p21 = 0 = 0.1 S2 M2 p S233 = 0 p11 S1 p13 = 0.4 .2 M3 p22 = p12 = 0.3 S1 0.2 M2 M2 p13 =0 S3 M3 .4 S2 p21 = 0.3 - M3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 13. Novel algorithm • It is an improved version of Sensor-side greedy: ‣ Ordered Sensor-side greedy - IDEA: Sorts sensors by decreasing max profit offer between all the missions to which the sensor can contribute ( max{pij} ). X Sensor 2 Target 2 X Sensor 1 Target 1 Sensor 3 X Target 3 - Like basic Sensor-Side Greedy: Assign sensor to the mission where that sensor is of most use (the one which maximizes the profit pij). - Further improvement: If a sensor cannot be assigned to the mission which maximize its profit, we consider the second most profitable mission, and so on ...
  • 14. Performance evaluation • Simulation environment implemented in Java. • Missions and Sensors are deployed in random positions in the field. • Utility of sensor Si to mission Mj is a function   1 2 if Dij ≤ SR 1+Dij /c of the distance Dij between sensor and mission. eij =  0 otherwise • For each experiment: - Constant number of sensors (200, 500, 1000) - Number of simultaneous missions was varied from 10 to 150. • Experiments divided into two main groups to test algs’ efficiency: 18000 84 % Optimal Fractional Solution 16000 82 14000 80 Running Time (ms) Optimality Time 12000 78 76 10000 74 8000 72 6000 70 4000 68 2000 66 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 Number of Missions Number of Missions 1000 sensors
  • 15. Performance evaluation (Optimality) • The graphs show the sum of the profits pij of each sensor-mission assignments (i.e. the value of the objective function in the ILP formulation) 500 sensors 1000 sensors 96 92 GAP approx alg GAP approx alg % Optimal Solution % Optimal Solution 88 92 84 Ordered Sensor-side greedy 88 Ordered Sensor-side greedy 10 30 50 70 90 110 130 150 10 30 50 70 90 110 130 150 Number of Missions Number of Missions • We show only the best two algs: Sensor-Side Greedy and GAP approx algorithm ‣ Optimality results differ only by 1% in average. ‣ The best solution quality: GAP approx algorithm
  • 16. Performance evaluation (Time) Effective running time (1000 sensors) Running Time (ms) 8000 GAP approx alg 6000 4000 2000 Ordered Sensor-side greedy 0 10 30 50 70 90 110 130 150 Number of Missions • Best effective running time: Ordered Sensor-side greedy ‣ Best trade off optimality/running time: Ordered Sensor-side greedy
  • 17. Conclusion • We considered an homogeneous sensor network which was already deployed, to support competing simultaneous missions with uncertain demands. • We developed a formal model and a new greedy algorithm. • Simulation results show that: our novel Ordered Sensor-side greedy algorithm offers the best trade-off between optimality of the solution and effective running time. • Future work: ‣ Heterogeneous sensor types ‣ Sharing of a sensing resource