KAIS T Adaptive Triangular Deployment Algorithm Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions On Computers 2007
33
Embed
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Low power consumption requirement: the most important metric
Other features
Wireless communication
Collaborative effort
Fault tolerance
IntroductionIntroduction
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 2944
Deployment problem for WSNProblem 1: “Where to place sensors?”
To maximize sensing coverage (using a certain number of sensors)
=To minimize coverage gaps and overlaps
→ Propose the ideal node layout for maximum coverage
Problem 2: “How to move sensors?”
To minimize the total energy consumption to move sensors
→ Propose a distributed greedy heuristic algorithm
IntroductionIntroduction
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 2955
AssumptionsAll sensors are mobile sensors
All sensors have the same capacities (=sensing range, energy, …)
Omni-directional sensing
No global information
No location-awarenessEach sensor only estimate the relative locations to neighbors
Initially, all sensors are randomly deployed
AssumptionAssumption
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Problem 1: “Where to place sensors?”Problem 1: “Where to place sensors?”- Ideal Node Layout for Maximum Coverage- Ideal Node Layout for Maximum Coverage
66
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 2977
The optimal node layout for the maximum no-gap coverage
Equilateral triangulation
Ideal Node Layout for Maximum CoverageIdeal Node Layout for Maximum Coverage
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
ProofThe maximum value of can be obtained when
In this case, the lengths of all three edges =
88
Ideal Node Layout for Maximum CoverageIdeal Node Layout for Maximum Coverage
2
3r
r6
r3
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Problem 2: “How to move sensors?”Problem 2: “How to move sensors?”- Basic Triangular Deployment Algorithm- Basic Triangular Deployment Algorithm
99
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 291010
Main ideaEach node divides the transmission circle into six sectors
And adjusts the relative distance to its one-hop neighbors in each sector separately
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Performance EvaluationPerformance Evaluation
Measurement of performanceDeployment quality: total coverage area
Moving energy consumption: moving distance
Comparison with VEC in [G. Wang, G. Cao, and T. La Porta, “Movement-Assisted Sensor Deployment,” INFOCOM, 2004]
2525
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Performance EvaluationPerformance Evaluation
Total coverage area gets larger
2626
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Performance EvaluationPerformance Evaluation
Average moving distance gets smaller
2727
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 292828
The optimal node layout for maximum coverageEquilateral triangulation (the length of each side equals )
Basic Triangular AlgorithmDivides the transmission circle into six sectors and adjust the relative distance between neighbors
For reducing node oscillationDistance threshold strategy
Movement state diagram strategy
Adaptive Triangular algorithmAvoiding obstacles and boundaries
Abstract them as virtual nodes
Non-uniform deploymentSet a shorter sensing range in important area
ConclusionConclusion
r3
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 292929
The lack of mentions aboutRelation between communication range and sensing range
Definition of some notations
The meaning of some equations
Termination condition
No consideration aboutCommunication overhead
Deployment time
Impact of threshold
Synchronization and collision
DiscussionDiscussion
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 29
Thank youThank you
3030
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 293131
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, 2002.[2] G. Wang, G. Cao, and T. La Porta, “Movement-Assisted Sensor Deployment,” INFOCOM, 2004
ReferencesReferences
Adaptive Triangular Deployment Algorithm for Unattended MSNs / 29/ 293232