後卓越進度報告 蔡育仁老師實驗室 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

Server 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 Server Cross-section

Simulation: Coverage Ratio Proposed Density Linear Decreasing Uniform Density Rounds Coverage Ratio

Simulation: Number of Useless * Nodes (Total 100 Nodes) Proposed Density Linear Decreasing Uniform Density Rounds Number of Useless Nodes *Useless Nodes = Dead Nodes & Isolated Nodes