A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks

Ali Abbasi, Euhanna Ghadimi, Ahmad Khonsari, Naser Yazdani, Mohamed Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages493-502
Number of pages10
Volume4743 LNCS
Publication statusPublished - 2007
Event5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 International Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN - Niagara Falls, ON, Canada
Duration: Aug 29 2007Aug 31 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4743 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 International Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN
CountryCanada
CityNiagara Falls, ON
Period8/29/078/31/07

Fingerprint

Distributed Algorithms
Fault-tolerant
Parallel algorithms
Clustering algorithms
Clustering Algorithm
Cluster Analysis
Wireless Sensor Networks
Wireless sensor networks
Data Aggregation
Wireless Sensors
Vertex of a graph
Information Processing
Automatic Data Processing
Sensor nodes
Simulation Experiment
Sensing
Agglomeration
Manufacturing
Clustering
Sensor

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Abbasi, A., Ghadimi, E., Khonsari, A., Yazdani, N., & Ould-Khaoua, M. (2007). A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4743 LNCS, pp. 493-502). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4743 LNCS).

A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks. / Abbasi, Ali; Ghadimi, Euhanna; Khonsari, Ahmad; Yazdani, Naser; Ould-Khaoua, Mohamed.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4743 LNCS 2007. p. 493-502 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4743 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abbasi, A, Ghadimi, E, Khonsari, A, Yazdani, N & Ould-Khaoua, M 2007, A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4743 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4743 LNCS, pp. 493-502, 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 International Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN, Niagara Falls, ON, Canada, 8/29/07.
Abbasi A, Ghadimi E, Khonsari A, Yazdani N, Ould-Khaoua M. A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4743 LNCS. 2007. p. 493-502. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Abbasi, Ali ; Ghadimi, Euhanna ; Khonsari, Ahmad ; Yazdani, Naser ; Ould-Khaoua, Mohamed. / A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4743 LNCS 2007. pp. 493-502 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{50b8d5d93b1c48f2a9dfe33b2f2047ac,
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.",
author = "Ali Abbasi and Euhanna Ghadimi and Ahmad Khonsari and Naser Yazdani and Mohamed Ould-Khaoua",
year = "2007",
language = "English",
isbn = "9783540747666",
volume = "4743 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "493--502",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A distributed clustering algorithm for fault-tolerant event region detection in wireless sensor networks

AU - Abbasi, Ali

AU - Ghadimi, Euhanna

AU - Khonsari, Ahmad

AU - Yazdani, Naser

AU - Ould-Khaoua, Mohamed

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149000220&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149000220&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149000220

SN - 9783540747666

VL - 4743 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 493

EP - 502

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -