Topology Discovery Using Binary Connectivity Information: Distributed topology-aware algorithms and topology control probabilistic analysis for wireless sensor networks - Couverture souple

Li, Xiaoyun

 
9783838369341: Topology Discovery Using Binary Connectivity Information: Distributed topology-aware algorithms and topology control probabilistic analysis for wireless sensor networks
Couverture souple
ISBN 10 : 3838369343 ISBN 13 : 9783838369341
Editeur : LAP LAMBERT Academic Publishing, 2010

Synopsis

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 also introduced to calculate the probability of triangulation for any position in a randomly deployed sensor network given the node density. Another mathematical model is introduced to calculate the mean size of holes. Based on these models, the expected number of holes and the probability of complete coverage are formulated for a sensor network with any node density and target area.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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 also introduced to calculate the probability of triangulation for any position in a randomly deployed sensor network given the node density. Another mathematical model is introduced to calculate the mean size of holes. Based on these models, the expected number of holes and the probability of complete coverage are formulated for a sensor network with any node density and target area.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
3838369343
ISBN 13 
9783838369341
Reliure
Broché
Nombre de pages
108
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne