A Self-stabilizing Algorithm for Edge Monitoring Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Self-stabilizing Algorithm for Edge Monitoring Problem

Brahim Neggazi
  • Fonction : Auteur
  • PersonId : 980815
Mohammed Haddad
Volker Turau
  • Fonction : Auteur

Résumé

Self-monitoring is a simple and effective mechanism for the security of wireless sensor networks (WSNs), especially to cope against compromised nodes. A node v can monitor an edge e if both end-nodes of e are neighbors of v; i.e., e together with v forms a triangle in the graph. Moreover, some edges need more than one monitor. Finding a set of monitoring nodes satisfying all monitoring constraints is called the edge-monitoring problem. The minimum edge-monitoring problem is long known to be NP-complete. In this paper, we present a novel silent self-stabilizing algorithm for computing a minimal edge-monitoring set. Correctness and termination are proven for the unfair distributed scheduler.
Fichier non déposé

Dates et versions

hal-01301092 , version 1 (11-04-2016)

Identifiants

Citer

Brahim Neggazi, Mohammed Haddad, Volker Turau, Hamamache Kheddouci. A Self-stabilizing Algorithm for Edge Monitoring Problem. Stabilization, Safety, and Security of Distributed Systems - 16th International Symposium, {SSS} 2014, Sep 2014, Paderborn, Germany. pp.93-105, ⟨10.1007/978-3-319-11764-5_7⟩. ⟨hal-01301092⟩
143 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More