A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks
TL;DR: This paper proposes a fault-tolerant distributed algorithm for a minimal capacitated CDS (CapCDS) construction in WSNs, and is believed to be the first distributed self-stabilizing CapCDS algorithm.
About: This article is published in Computer Standards & Interfaces.The article was published on 2021-08-01. It has received 4 citations till now. The article focuses on the topics: Distributed algorithm & Wireless sensor network.
Citations
More filters
01 Jan 2005
TL;DR: This paper presents a very simple distributed algorithm for computing a small CDS, improving upon the previous best known approximation factor of 8 and implying improved approximation factors for many existing algorithm.
Abstract: Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via back-bone nodes. One common way of constructing such a backbone is based on the construction of a minimum connected dominating set (CDS). In this paper we present a very simple distributed algorithm for computing a small CDS. Our algorithm has an approximation factor of at most 6.91, improving upon the previous best known approximation factor of 8 due to Wan et al. [INFOCOM'02], The improvement relies on a refined analysis of the relationship between the size of a maximal independent set and a minimum CDS in a unit disk graph. This subresult also implies improved approximation factors for many existing algorithm.
152 citations
TL;DR: This survey provides an elaborate classification and analysis of fault tolerance structures and their essential components and categorizes errors from several perspectives, and an extensive analysis of existing fault tolerance techniques based on eight constraints is presented.
Abstract: The Industrial Revolution 4.0 (IR 4.0) has drastically impacted how the world operates. The Internet of Things (IoT), encompassed significantly by the Wireless Sensor Networks (WSNs), is an important subsection component of the IR 4.0. WSNs are a good demonstration of an ambient intelligence vision, in which the environment becomes intelligent and aware of its surroundings. WSN has unique features which create its own distinct network attributes and is deployed widely for critical real-time applications that require stringent prerequisites when dealing with faults to ensure the avoidance and tolerance management of catastrophic outcomes. Thus, the respective underlying Fault Tolerance (FT) structure is a critical requirement that needs to be considered when designing any algorithm in WSNs. Moreover, with the exponential evolution of IoT systems, substantial enhancements of current FT mechanisms will ensure that the system constantly provides high network reliability and integrity. Fault tolerance structures contain three fundamental stages: error detection, error diagnosis, and error recovery. The emergence of analytics and the depth of harnessing it has led to the development of new fault-tolerant structures and strategies based on artificial intelligence and cloud-based. This survey provides an elaborate classification and analysis of fault tolerance structures and their essential components and categorizes errors from several perspectives. Subsequently, an extensive analysis of existing fault tolerance techniques based on eight constraints is presented. Many prior studies have provided classifications for fault tolerance systems. However, this research has enhanced these reviews by proposing an extensively enhanced categorization that depends on the new and additional metrics which include the number of sensor nodes engaged, the overall fault-tolerant approach performance, and the placement of the principal algorithm responsible for eliminating network errors. A new taxonomy of comparison that also extensively reviews previous surveys and state-of-the-art scientific articles based on different factors is discussed and provides the basis for the proposed open issues.
8 citations
Posted Content•
TL;DR: In this article, the authors present a phase clock algorithm suited to the model of transient memory faults in asynchronous systems with read/write registers, which is self-stabilizing and guarantees accuracy of phase clocks within O(k) time following an initial state that is k-faulty.
Abstract: Phase clocks are synchronization tools that implement a form of logical time in distributed systems. For systems tolerating transient faults by self-repair of damaged data, phase clocks can enable reasoning about the progress of distributed repair procedures. This paper presents a phase clock algorithm suited to the model of transient memory faults in asynchronous systems with read/write registers. The algorithm is self-stabilizing and guarantees accuracy of phase clocks within O(k) time following an initial state that is k-faulty. Composition theorems show how the algorithm can be used for the timing of distributed procedures that repair system outputs.
4 citations
TL;DR: In this paper , the authors proposed two-phase algorithms (ABCND) to detect 2D critical nodes in WSN topology using the neighbor's RSSI information, and a correlation-based reliable RSSI approach is proposed to increase the node resilience against the adversary.
Abstract: Node failure in the Wireless Sensor Networks (WSN) topology may lead to economic loss, endanger people, and cause environmental damage. Node reliability can be achieved by adequately managing network topology using structural approaches, where the critical nodes are precisely detected and protected. This paper addresses the problem of critical node detection and presents two-phase algorithms (ABCND). Phase-I, a 2D Critical Node (C-N) detection algorithm, is proposed, which uses only the neighbor's Received Signal Strength Indicator (RSSI) information. In Phase II, a correlation-based reliable RSSI approach is proposed to increase the node resilience against the adversary. The proposed algorithms (ABCND) require O(log(N)) time for convergence and O(δ(logN)) for Critical Node detection, N represents the number of IoT devices, and δ is the cost required to forward the message. We compare our algorithm (ABCND) with the current state-of-the-art on C-N detection algorithms. The simulation result shows that the proposed ABCND algorithm consumes 50% less energy to detect C-N with 90% to 95% accurate Critical Nodes (C-N).
1 citations
References
More filters
27 Jan 2006
2,237 citations
TL;DR: In this paper, the synchronization task between loosely coupled cyclic sequential processes is viewed as keeping the relation "the system is in a legitimate state" invariant, and each individual process step that could possibly cause violation of that relation is preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed.
Abstract: The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation “the system is in a legitimate state” invariant. As a result, each individual process step that could possibly cause violation of that relation has to be preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed. The resulting design is readily—and quite systematically—implemented if the different processes can be granted mutually exclusive access to a common store in which “the current system state” is recorded.
2,118 citations
Book•
27 May 2005
TL;DR: This book discusses the design principles for wireless sensor networks, and the many faces of forwarding and routing, and some of the approaches to combining hierarchical topologies and power control used in these networks.
Abstract: Preface. List of Abbreviations. A guide to the book. 1. Introduction. 1.1 The vision of Ambient Intelligence. 1.2 Application examples. 1.3 Types of applications. 1.4 Challenges for WSNs. 1.5 Why are sensor networks different? 1.6 Enabling technologies. PART I: ARCHITECTURES. 2. Single node architecture. 2.1 Hardware components. 2.2 Energy consumption of sensor nodes. 2.3 Operating systems and execution environments. 2.4 Some examples of sensor nodes. 2.5 Conclusion. 3. Network architecture. 3.1 Sensor network scenarios. 3.2 Optimization goals & figures of merit. 3.3 Design principles for WSNs. 3.4 Service interfaces of WSNs. 3.5 Gateway concepts. 3.6 Conclusion. PART II: COMMUNICATION PROTOCOLS. 4. Physical Layer. 4.1 Introduction. 4.2 Wireless channel and communication fundamentals. 4.3 Physical layer & transceiver design considerations in WSNs. 4.4 Further reading. 5. MAC Protocols 133 5.1 Fundamentals of (wireless) MAC protocols. 5.2 Low duty cycle protocols and wakeup concepts. 5.3 Contention-based protocols. 5.4 Schedule-based protocols. 5.5 The IEEE 802.15.4 MAC protocol. 5.6 How about IEEE 802.11 and Bluetooth? 5.7 Further reading. 5.8 Conclusion. 6. Link Layer Protocols. 6.1 Fundamentals: Tasks and requirements. 6.2 Error control. 6.3 Framing. 6.4 Link management. 6.5 Summary. 7. Naming and Addressing. 7.1 Fundamentals. 7.2 Address and name management in wireless sensor networks. 7.3 Assignment of MAC addresses. 7.4 Distributed assignment of locally unique addresses. 7.5 Content-based and geographic addressing. 7.6 Summary. 8. Time Synchronization. 8.1 Introduction to the time synchronization problem. 8.2 Protocols based on sender/receiver synchronization. 8.3 Protocols based on receiver/receiver synchronization. 8.4 Further reading. 9. Localization and Positioning. 9.1 Properties of positioning. 9.2 Possible approaches. 9.3 Mathematical basics for the lateration problem. 9.4 Single-hop localization. 9.5 Positioning in multi-hop environments. 9.6 Impact of anchor placement. 9.7 Further reading. 9.8 Conclusion. 10. Topology control 295 10.1 Motivation and basic ideas. 10.2 Flat network topologies. 10.3 Hierarchical networks by dominating sets. 10.4 Hierarchical networks by clustering. 10.5 Combining hierarchical topologies and power control. 10.6 Adaptive node activity. 10.7 Conclusions. 11. Routing protocols. 11.1 The many faces of forwarding and routing. 11.2 Gossiping and agent-based unicast forwarding. 11.3 Energy-efficient unicast. 11.4 Broadcast and multicast. 11.5 Geographic routing. 11.6 Mobile nodes. 11.7 Conclusions. 12. Data-centric and content-based networking 395. 12.1 Introduction. 12.2 Data-centric routing. 12.3 Data aggregation. 12.4 Data-centric storage. 12.5 Conclusions. 13. Transport Layer and Quality of Service. 13.1 The transport layer and QoS in wireless sensor networks. 13.2 Coverage and deployment. 13.3 Reliable data transport. 13.5 Block delivery. 13.6 Congestion control and rate control. 14. Advanced application support. 14.1 Advanced in-network processing. 14.2 Security. 14.3 Application-specific support. Bibliography. Index.
1,894 citations
[...]
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.
1,525 citations
TL;DR: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex.
Abstract: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex i
1,026 citations