Paper Info
Title
A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks
Abstract
Wireless sensor networks which are envisioned to consist of many simple processing, storage, sensing, and communication capabilities are believed to open the doors to a plethora of new applications. Efficient robust data aggregation is a key feature in information processing in wireless sensor environments, especially in the presence of faulty sensor nodes which arise due to harsh environments or manufacturing reasons. These conditions highly affect the quality of gathering data in different locations and times. In this paper we propose a distributed localized method for detecting regions that are susceptible to message loss above a given threshold, and then based on this method we suggest an algorithm for clustering nodes in that region which proportionally adapts based on message loss. Simulation experiments confirm the validity of the proposed algorithm with a high degree of accuracy.
Year
DOI
Venue
2007
10.1007/978-3-540-74767-3_51
ISPA Workshops
Keywords
Field
DocType
localized method,information processing,efficient robust data aggregation,clustering node,simple processing,wireless sensor network,wireless sensor environment,message loss,clustering algorithm,fault-tolerant event region detection,proposed algorithm,faulty sensor node,fault tolerant,simulation experiment,data aggregation
Sensor node,Key distribution in wireless sensor networks,Wireless,Computer science,Visual sensor network,Brooks–Iyengar algorithm,Real-time computing,Mobile wireless sensor network,Cluster analysis,Wireless sensor network,Distributed computing
Conference
Volume
ISSN
ISBN
4743
0302-9743
3-540-74766-4
Citations 
PageRank 
References 
3
0.40
15
Authors
5
Name
Order
Citations
PageRank
Ali Abbasi1162.00
Euhanna Ghadimi227513.75
Ahmad Khonsari321042.43
Naser Yazdani471.47
Mohamed Ould-khaoua585387.23