Download - Maximizing Lifetime of Sensor Surveillance Systems Published : IEEE/ACM Transactions on Networking Authors…

Transcript

Maximizing Lifetime of Maximizing Lifetime of Sensor Surveillance Sensor Surveillance

SystemsSystemsPublished : IEEE/ACM Transactions on NetworkingPublished : IEEE/ACM Transactions on NetworkingAuthors : Hai Liu, Xiaohua Jia, Peng-Jun Wan, Chih-Wei Yi,Authors : Hai Liu, Xiaohua Jia, Peng-Jun Wan, Chih-Wei Yi, S. Kami Makki, and Niki PissinouS. Kami Makki, and Niki Pissinou

OutlineOutline System Model and Problem StatementSystem Model and Problem Statement Proposed solutionProposed solution

Find Maximal LifetimeFind Maximal Lifetime Decompose Workload MatrixDecompose Workload Matrix Determine Surveillance TreeDetermine Surveillance Tree

Experiments and SimulationsExperiments and Simulations ConclusionConclusion

System Model and Problem System Model and Problem StatementStatement

A set of targets A set of sensors Each sensor can watch at most one target at a time Each target should be watched by one sensor at

anytime the lifetime of network is maximized

there exists any target can not be watched by any sensor there exists any sensor can not send data to BSthere exists any sensor can not send data to BS

Proposed solutionProposed solution

Find Maximal Lifetime (1/2)Find Maximal Lifetime (1/2)

Find Maximal Lifetime (2/2)Find Maximal Lifetime (2/2)

Decompose Workload Matrix (1/3)Decompose Workload Matrix (1/3)

210111012

100010001

010100001

s1 t1

s2

s3

t2

t3

21

2

1

11

1

=

100001010

++

1

00

1

Decompose Workload Matrix (2/3)Decompose Workload Matrix (2/3)

Decompose Workload Matrix (3/3)Decompose Workload Matrix (3/3)

0 0 0 ? ? ?

17.2300 0 0 ? ? ?

0 0 0 ? ? ?

0 13.0999 0 ? ? ?

0 0 28.6972 ? ? ?

11.4672 15.5973 0 ? ? ?

L=28.6972 R=28.6972 C=28.6972

28.6972

0

0

0

0

0

0 0

R=11.4672

11.4672 0

C=17.2300

17.2300

0

0

0

11.4672

R=15.5973 C= 1.6327

15.5973

R= 0

0

R= 1.6327

1.6327

Determine Surveillance TreeDetermine Surveillance Tree

ffijij is proposed by LP is proposed by LP let sensor i forward its outgoing data first to s1

until flow fi1 is saturated, then switch to s2 until the value of fi2 is met, and finally forward the last flow fil to sl

Experiments and Simulations (1/5)Experiments and Simulations (1/5)

Experiments and Simulations (2/5)Experiments and Simulations (2/5)

Experiments and Simulations (3/5)Experiments and Simulations (3/5)

Experiments and Simulations (4/5)Experiments and Simulations (4/5)

Experiments and Simulations (5/5)Experiments and Simulations (5/5)

ConclusionConclusion presented the maximal lifetime scheduling pro

blem