Self-protection experiment沙舟
Self-protection experiment 沙舟
Brief Introduction to the paper· Efficient Self Protection Algorithmsfor Static Wireless Sensor Networks[1]. The problem:-Minimum p-self-protection
Brief Introduction to the paper • Efficient Self Protection Algorithms for Static Wireless Sensor Networks [1] • The problem: – Minimum p-self-protection
Brief Introduction to the paperWhatis self protection?- The nodes in the network is“protected" by theother nodes in the same network. (A is active)
Brief Introduction to the paper • What is self protection? – The nodes in the network is “protected” by the other nodes in the same network. (A is active) A B
Brief Introduction to the paperWhatis p-self-protection?-For any wireless sensor, there are at least p activesensors can monitor it. What is minimum p-self-protection?- The number of active nodes is minimized
Brief Introduction to the paper • What is p-self-protection? – For any wireless sensor, there are at least p active sensors can monitor it • What is minimum p-self-protection? – The number of active nodes is minimized
Brief Introduction to the paper& The problem 1.The solution:- Find p MISs.Whatis MIs?- Two definition in the paper:: Maximum independent set (Mis): no otherindependent set has morevertices Maximal independent set (Mis): is not a subset of anyotherindependentset
Brief Introduction to the paper & The problem 1 • The solution: – Find p MISs • What is MIS? – Two definition in the paper: • Maximum independent set (MIS) : no other independent set has more vertices • Maximal independent set (MIS) : is not a subset of any other independent set