Wyniki wyszukiwania:

In this book a distributed algorithm for coordinate- free Wireless Sensor Networks to elect a small subset of nodes achieving full coverage is introduced. To the best of the authors knowledge, this is the first time that a practical and efficient algorithm for electing a sub-optimal subset of nodes for full coverage is introduced only using connectivity information. It also provides an efficient way to detect accurate boundary of un-triangulated holes and recovery them in Wireless Sensor Networks. A distributed hole recovery (DHR) algorithm is also introduced, which is executed on...

Discover Topology Using Connectivities A distributed coordinate-free topology aware algorithm called Triangular Mesh Self-organized self- Healing (3MeSH) is introduced to detect boundaries of coverage holes using connectivity information, and recover such holes by activating the minimum number of redundant nodes using a distributed iterative process. A routing hole can be detected in almost the same way as a coverage hole, therefore routing holes, jamming holes, sink/black holes and worm holes may also be detected or avoided using exactly the same algorithm (3MeSH). A probabilistic model is...