2 results
Filters
Settings
Now showing1 - 2 of 2
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , An agile and stable neighborhood protocol for WSNsSelf-stabilizing algorithms (SSA) are defined on the assumption that either the system's topology is fixed over time or topology changes are isolated events occurring at a very low rate. These assumptions are not valid in wireless sensor networks (WSNs) where link qualities change rapidly. The contribution of this paper is a neighborhood management protocol (NMP) providing a neighborhood relation sufficiently stable to apply existing SSAs in WSNs.Publicationtype: Conference Paper150 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , A self-stabilizing algorithm for maximal p-star decomposition of general graphsA p-star is a complete bipartite graph K1,p with one center node and p leaf nodes. In this paper we propose the first distributed self-stabilizing algorithm for graph decomposition into p-stars. For a graph G and an integer p ≥ 1, this decomposition provides disjoint components of G where each component forms a p-star. We prove convergence and correctness of the algorithm under an unfair distributed daemon. The stabilization time is 2[n/p+1] + 2 rounds.Publicationtype: Conference Paper75