Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor Networks

WOS: 000540974700001Wireless sensor networks (WSNs) are composed of a large number of wireless self-organized sensor nodes connected through a wireless decentralized distributed network without the aid of a predefined infrastructure. Fault-tolerance and power management are fundamental challenges in WSNs. A WSN is self-stabilizing if it can initially start at any state and obtain a legitimate state in a finite time without any external intervention. Self-stabilization is an important method for providing fault-tolerance in WSNs. Maximal independent set (MIS) is an extensively used structure for many important applications such as clustering (Randhawa and Jain in Wirel Personal Commun 97(3):3355, 2017. 10.1007/s11277-017-4674-5) and routing (Attea et al. in Wirel Personal Commun 81(2):819, 2015. 10.1007/s11277-014-2159-3; Lipinski in Wirel Personal Commun 101(1):251, 2018. 10.1007/s11277-018-5686-5) in WSNs. the capacitated MIS (CapMIS) problem is an extension of MIS in that each node has a capacity that determines the number of nodes it may dominate. in this paper, we propose a distributed self-stabilizing capacitated maximal independent set algorithm (CapMIS) in order to reduce energy consumption and support load balancing in WSNs. To the best of our knowledge, this is the first algorithm in this manner. the algorithm is validated through theoretical analysis as well as testbed implementations and simulations.TUBITAK (Scientific and Technical Research Council of Turkey)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [215E115]The authors would like to thank TUBITAK (Scientific and Technical Research Council of Turkey) for the project grant (Project Number 215E115)

A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks

Energy efficiency is one of the major issues in wireless sensor networks (WSNs) that lack a fixed infrastructure and centralized control. In order to prolong the network lifetime, a connected dominating set (CDS) has been widely used as a virtual backbone in WSNs. The sensor nodes in WSNs are prone to failure due to a lack of battery, hardware damage, link failure, or environmental interference. Therefore, designing an energy-efficient and fault-tolerant CDS algorithm is quite vital in WSNs. A non-masking fault tolerance method denoted selfstabilizing tolerates any finite number of transient faults. In this paper, we propose a fault-tolerant distributed algorithm for a minimal capacitated CDS (CapCDS) construction in WSNs. To the best of our knowledge, this is (the first distributed self-stabilizing CapCDS algorithm. It makes an illegitimate system legitimate at most n2 3 + )2n moves by using an unfair distributed scheduler where n is the number of nodes. The performance of the algorithm is validated through extensive experimental testbeds and simulations.Scientific and Technological Research Council of Turkey (TUBITAK) [215E115]This work was funded by The Scientific and Technological Research Council of Turkey (TUBITAK) for the 215E115 numbered project

A Fully Distributed Fault-Tolerant Cluster Head Selection Algorithm for Unit Disk Graphs

International Symposium on Networks, Computers and Communications (ISNCC) -- JUN 18-20, 2019 -- Istanbul, TURKEYArapoglu, Ozkan/0000-0001-7309-7948WOS: 000520478600012Wireless ad hoc and sensor networks, one of the important components of the Internet of Things, consist of hundreds or even thousands of tiny sensor nodes without a fixed infrastructure. Due to lack of transmission power, the presence of obstacles, and other environmental conditions, ordinary sensor nodes that are powered from their batteries may have to send data in a multi-hop manner to the sink node. Therefore, it is very important to conduct an energy-efficient and fault-tolerant routing algorithm. Clustering is one of the most popular methods for routing in wireless sensor networks. With the help of clustering, nodes are classified as cluster leaders and ordinary nodes. in this study, a distributed, fault-tolerant cluster leader selection algorithm is proposed for a wireless sensor and ad hoc networks that can be modeled as a unit disk graph. the proposed algorithm is self-stabilized and it is based on a maximum independent set. the theoretical analysis of the proposed algorithm is performed, it is implemented in SimPy environment and compared with other algorithms. According to the measurements taken, the proposed algorithm performs significantly better than its counterparts.IEEE, IEEE Commun Soc, TEST, CIS ARGE, AIRTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [215E115]The authors thank TUBITAK for the project grant: 215E115

An Asynchronous Self-Stabilizing Maximal Independent Set Algorithm in Wireless Sensor Networks Using Two-Hop Information

International Symposium on Networks, Computers and Communications (ISNCC) -- JUN 18-20, 2019 -- Istanbul, TURKEYArapoglu, Ozkan/0000-0001-7309-7948WOS: 000520478600097Maximal independent set (MIS) has significantly important in practical applications for wireless sensor networks (WSNs). A distributed self-stabilizing system can initially start at any illegal state and takes back a legal state as long as there is no external intervention. We propose a novel distributed self-stabilizing MIS algorithm using two-hop information. It stabilizes an unstable system at most n-1 moves under an unfair distributed scheduler where n is the number of nodes in the graph. We use the message passing model as the communication model where this model is very appropriate for WSNs. the communication consumes the most energy in WSNs. So, move count is at least as important as round count where reducing the move count prolongs the lifetime of the network. We analyzed theoretically and tested it on SimPy discrete event simulator on randomly generated connected simple undirected graphs to compare with its counterparts in terms of transmitted bit count and move count against various node degrees and node counts.IEEE, IEEE Commun Soc, TEST, CIS ARGE, AI

A Depth-First Search based Connectivity Estimation Approach for Fault Tolerant Wireless Sensor Networks

International Conference on Artificial Intelligence and Data Processing (IDAP) -- SEP 28-30, 2018 -- Inonu Univ, Malatya, TURKEYWOS: 000458717400160Connectivity stability is one of the most important requirements in Wireless Sensor Networks (WSNs) that has a considerable effect on the functionality of these networks. WSNs use multi hop connections for packet delivery. Failures on nodes may change the network topology and connectivity status. A reliable WSN must tolerate the node failures without loosing its connectivity. One of an important approach for increasing the network connectivity is k-connectivity. A k-connected network remains connected after removing arbitrary k-1 nodes. So, in high k values, the connectivity of a WSN can be considered as stable. Finding the k value of a WSN provides useful information about the stability of its connections. In this paper, we propose a distributed algorithm for estimating the k value of a WSN. The proposed approach establishes distributed depth first search (DFS) trees to find the available disjoint paths between the nodes. The minimum number of disjoint paths between the nodes determines the k value. During the DFS tree construction, the nodes overhear the sent packets of their neighbors to reduce the total energy consumption. The comprehensive simulation results show that the mean square errors of the estimated values by the proposed algorithm reach up to 28.5% lower and its correct estimations are up to 32% higher than the existing distributed algorithms.Inonu Univ, Comp Sci Dept, IEEE Turkey Sect, Anatolian SciTUBITAK (Scientific and Technical Research Council of Turkey)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [113E470]This work was supported by the TUBITAK (Scientific and Technical Research Council of Turkey) [Project number 113E470]

An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks

WOS: 000452936400003Maximal independent set (MIS) is a very important structure that provides data aggregation, topology control and routing for wireless sensor networks (WSNs). Energy-efficient and fault-tolerant construction of MIS on WSNs is one of the vital tasks. A distributed sensor network is self-stabilizing if it can initially start at any state and regain a legal state in a finite time without any external intervention. Self-stabilization is a considerable method to provide fault tolerance in WSNs. This paper presents a distributed self-stabilizing MIS algorithm which is an improved version of Turau's algorithm under a fully distributed scheduler for WSNs. The proposed algorithm is theoretically analyzed and evaluated with its counterparts. The proposed algorithm is compared with the other studies through testbed experiments on IRIS nodes and simulations on TOSSIM environment. It is shown that the proposed algorithm outperforms other algorithms in terms of move count and energy consumption.TUBITAK (Scientific and Technical Research Council of Turkey)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [215E115]Authors would like to thank TUBITAK (Scientific and Technical Research Council of Turkey) for the project grant (Project number 215E115)