Premium
Effect of redundancy on the mean time to failure of wireless sensor networks
Author(s) -
Speer Anh Phan,
Chen IngRay
Publication year - 2007
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1162
Subject(s) - mean time between failures , redundancy (engineering) , wireless sensor network , computer science , data redundancy , real time computing , wireless , reliability engineering , computer network , distributed computing , failure rate , engineering , telecommunications , database , operating system
In data‐driven wireless sensor networks (WSNs), the system must perform data sensing and retrieval and possibly aggregate data as a response at runtime. As a WSN is often deployed unattended in areas where replacements of failed sensors are difficult, energy conservation is of primary concern. While the use of redundancy is desirable in terms of satisfying user queries to cope with sensor and transmission faults, it may adversely shorten the lifetime of the WSN, as more sensor nodes will have to be used to answer queries, causing the energy of the system to drain quickly. In this paper, we analyze the effect of redundancy on the mean time to failure (MTTF) of a WSN in terms of the number of queries the system is able to answer correctly before it fails due to either sensor/transmission faults or energy depletion. In particular, we analyze the effect of redundancy on the MTTF of cluster‐structured WSNs for energy conservations. We show that a tradeoff exists between redundancy and MTTF. Furthermore, an optimal redundancy level exists such that the MTTF of the system is maximized. Copyright © 2007 John Wiley & Sons, Ltd.