Fault tolerance measures for large-scale wireless sensor networks

Author:

Ammari Habib M.1,Das Sajal K.2

Affiliation:

1. Hofstra University, Hempstead, NY

2. University of Texas at Arlington, TX

Abstract

Connectivity , primarily a graph-theoretic concept, helps define the fault tolerance of wireless sensor networks (WSNs) in the sense that it enables the sensors to communicate with each other so their sensed data can reach the sink. On the other hand, sensing coverage , an intrinsic architectural feature of WSNs plays an important role in meeting application-specific requirements, for example, to reliably extract relevant data about a sensed field. Sensing coverage and network connectivity are not quite orthogonal concepts. In fact, it has been proven that connectivity strongly depends on coverage and hence considerable attention has been paid to establish tighter connection between them although only loose lower bound on network connectivity of WSNs is known. In this article, we investigate connectivity based on the degree of sensing coverage by studying k-covered WSNs, where every location in the field is simultaneously covered (or sensed) by at least k sensors (property known as k-coverage , where k is the degree of coverage ). We observe that to derive network connectivity of k -covered WSNs, it is necessary to compute the sensor spatial density required to guarantee k -coverage. More precisely, we propose to use a model, called the Reuleaux Triangle , to characterize k -coverage with the help of Helly's Theorem and the analysis of the intersection of sensing disks of k sensors. Using a deterministic approach, we show that the sensor spatial density to guarantee k -coverage of a convex field is proportional to k and inversely proportional to the sensing range of the sensors. We also prove that network connectivity of k -covered WSNs is higher than their sensing coverage k . Furthermore, we propose a new measure of fault tolerance for k -covered WSNs, called conditional fault tolerance , based on the concepts of conditional connectivity and forbidden faulty sensor set that includes all the neighbors of a given sensor. We prove that k -covered WSNs can sustain a large number of sensor failures provided that the faulty sensor set does not include a forbidden faulty sensor set.

Publisher

Association for Computing Machinery (ACM)

Subject

Software,Computer Science (miscellaneous),Control and Systems Engineering

Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. ABCRF: Atomic Bond Connectivity Based Range Optimized Fuzzy Clustering Algorithm for WSN;J INF SCI ENG;2022

2. Sensors Deployment in IoT Environment;Digital Technologies and Applications;2022

3. On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost;ACM Transactions on Sensor Networks;2021-11-30

4. Analysis of Scalability for Hierarchical Routing Protocols in Wireless Sensor Networks;Proceedings of ICETIT 2019;2019-09-24

5. Comparative analysis of energy conservation schemes in wireless sensor network;Proceedings of the Third International Conference on Advanced Informatics for Computing Research - ICAICR '19;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3