We can suppose beacon nodes P 1, P 2, P 3,⋯, P j communicate with the node S, and the node S receives RSSI signal strength of the beacon node according to size of RSSI P 1 > RSS I P 2 > ⋯, > RSSI P j. 3.
Ping-emitting beacons in the black boxes still have about 20 days of battery life, but high waves had prevented the deployment of ping locators, which are dragged by ships.
When S has the distance of d i, d j (suppose d i > d j ) to any two beacon nodes P i, P j, the node to be located S and P i, P j will form a triangle SP i P j.
Then, we can select beacons P m, P n and repeat the above method.
We assume that the sorted order of beacon nodes is P 1, P 2, P 3,⋯,P k. 4.
In the CM1, the event that surrounding interferers detect the victim receiver's beacon signal p b above the predefined coordination threshold ρth is denoted by Υ 1 = p b R − α X ≥ ρ th.
Using an inter-primate comparison, we identified 21 extreme CpG beacon clusters (≥ 20/kb peaks, empirical p < 1.0 × 10−3) in humans, which include associations with four monogenic developmental and neurological disease related genes (Benjamini-Hochberg corrected p = 6.03 × 10−3).
According to the properties of the Voronoi diagrams, we can see that the unknown node S is in the Voronoi region of beacon node P 1.
So the fair share for A P i in the beacon interval is being calculated by all of its one hop neighbors'.
We can find the region with a maximum weight value and get the gravity coordinate as the calculation coordinate of the unknown node S. In Voronoi diagram algorithm, the Voronoi region of beacon node P i is made of midperpendiculars of this beacon node and the beacon nodes around it.
