後卓越進度報告

蔡育仁老師實驗室2006/05/01

Implementation —Coverage-preserving Routing

(1/2) R1, R2 and R3: disjoint routes to the destination Coverage Metric: R2 < R1 < R3

Source

Dest.

Route R1

Route R2

Route R3

Implementation —Coverage-preserving Routing

(2/2) Ongoing parts Experimentations

Power consumption Coverage percentage / Lifetime

Integration Algorithm GUI

Serv

er

Coverage-based Sensor Deployment — Considering WSN with Multihop Routings Random deployment with a

distance-related Density An area consumes more

power will acquire more density

Power consumption of an observed area is proportional to the amount of flow through this area Consider the flow of a

cross-section in a sensor network

Serv

er

Cross-section

0 20 40 60 80 100 120 140 160 180 2000.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Simulation: Coverage Ratio

Proposed DensityLinear DecreasingUniform Density

Rounds

Cov

erag

e R

atio

0 20 40 60 80 100 120 140 160 180 2000

10

20

30

40

50

60

70

80

Simulation: Number of Useless* Nodes (Total 100 Nodes)

Proposed DensityLinear DecreasingUniform Density

Rounds

Num

ber

of U

sele

ss

Nod

es

*Useless Nodes = Dead Nodes & Isolated Nodes