Decentralized Binary Search
The sensor will first get the information of its neighbors, which include the relative positions and read of its neighbours, and then as the centralized Binary Search algorithm, the sensor calculate the approximate gradient, and then move in the direction where the gradient is high. Next, it will get new read and calculate the approximate gradient again. This procedure will be iterated until the sensor always stay the same place.
The University of Southern California does not screen or control the content on this website and thus does not guarantee the accuracy, integrity, or quality of such content. All content on this website is provided by and is the sole responsibility of the person from which such content originated, and such content does not necessarily reflect the opinions of the University administration or the Board of Trustees