Neggazi, BrahimBrahimNeggaziHaddad, MohammedMohammedHaddadTurau, VolkerVolkerTurauKheddouci, HamamacheHamamacheKheddouci2019-10-222019-10-222016-09-20Information and Computation (254): 367-376 (2017-06-01)http://hdl.handle.net/11420/3609Self-monitoring is a simple and effective mechanism for surveilling wireless sensor networks, especially to cope against faulty or compromised nodes. A node v can monitor the communication over a link e if both end-nodes of e are neighbors of v. Finding a set of monitoring nodes satisfying all monitoring constraints is called the edge-monitoring problem. The minimum edge-monitoring problem is known to be NP-complete. In this paper, we present a novel self-stabilizing algorithm for computing a minimal edge-monitoring set under the unfair distributed scheduler. For sparse networks the time complexity of this new algorithm is much lower than the currently best known algorithm.en0890-54012016367376ElsevierSelf-monitoringSelf-stabilizationWireless sensor networksHandel, Kommunikation, VerkehrTechnikJournal Article10.1016/j.ic.2016.09.003Other