MétaCan
Menu
Back to cohort
Record W2056635779 · doi:10.1109/wimob.2010.5645024

Reliability model for extending cluster lifetime using Backup Cluster Heads in cluster-based Wireless Sensor Networks

2010· article· en· W2056635779 on OpenAlexaff
Shafiq U. Hashmi, Sk. Md. Mizanur Rahman, Hussein T. Mouftah, Nicolas D. Georganas

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsBackupCluster (spacecraft)Computer scienceWireless sensor networkReliability (semiconductor)Base stationMarkov chainBCH codeMarkov processAlgorithmComputer networkDecoding methodsMathematicsStatisticsPhysicsOperating system

Abstract

fetched live from OpenAlex

In cluster-based two-tier Wireless Sensor Networks (WSNs), the cluster-head nodes (CHs) gather data from sensors and then transmit to the base station. When these cluster head nodes start to die, the coverage of the respective clusters is lost and it leaves the region unmonitored. Even if the CHs are rotated and reassigned after some time, until the next rotation that cluster in question will be out of cluster head, causing a loss of information and loss of coverage. To select a Backup Cluster Head (BCH) is suggested for those CHs which are close to deplete their energy [1]. When the CH dies, BCH takes over the responsibility and continues to work as a new cluster head. In this paper we present an analytical model of cluster reliability in cluster-based WSN using BCH, based on Markov chain model. We use non-homogeneous Markov process, along with Forward Chapman-Kolmogorov equations to illustrate the cluster monitoring period in a finite three state space model. We test the accuracy of the model by applying the probabilities of failure of CH and BCH nodes, for a fixed number of sensor nodes in a cluster. The results show that the presented model is able to match the behaviour of the cluster state transition accurately and validates the simulation results and analysis published in [1].

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.287
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.018
GPT teacher head0.267
Teacher spread0.248 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations19
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207