Self-protection experiment 沙舟

Brief Introduction to the paper Efficient Self Protection Algorithms for Static Wireless Sensor Networks [1] The problem: Minimum p-self-protection [1] Y. Wang, X.-Y. Li, and Q. Zhang, “Efficient Self Protection Algorithms for Static Wireless Sensor Networks,” Proc. 50th IEEE Global Telecomm. Conf. (Globecom), 2007.

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) B A

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 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

The problem 1 Why MIS? Any MIS is a dominating set For 1-self-protection problem: find 1 MIS For p-self-protection problem: find p MISs Now we can see which MIS is the right one in this paper.

The problem 2 The algorithm of generating MIS in this paper: We only need to focus on the step 1 and step 3

The problem 2 We cannot get a MIS from step 3! The only explanation here is that the description of step 3 is not complete. Guess the step 3 should be: 1 : a node is selected to the MIS if it has the largest rank among all its neighboring nodes. 2: delete the node and all the nodes adjacent to it 3: Repeat 1 and 2 until no new node is selected to the MIS