More formally, a system is self-stabilizing if and only if, despite the arbitrary initial state, at least one privileged node will always exist and the system eventually reaches a legitimate state within a limited number of moves. A distributed setting like WSN is considered self-stabilizing if it reaches a legitimate state in case of node leaves. Self-stabilization is one of the best candidates for WSNs to provide fault tolerance and to deal with their ad hoc nature.Ī sensor node can leave WSN due to software failures, battery drains and other similar faults. Fault tolerance is an important property to deal with these kinds of challenges. In such environments, tiny sensor motes can malfunction due to natural challenges. Most of the time, WSNs are deployed for various applications in forests, mines and land borders, where they should bear harsh circumstances. They are crucial communication layer technologies for providing environmental sensing operations in the Internet of Things (IoT). ![]() Wireless sensor networks (WSNs) do not have a predefined structure to maintain fundamental data-transfer operations. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after O ( n ) moves in O ( n ) step, which is acceptable for most WSN setups. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most O ( n 2 ) step, where n is the count of nodes. To the best of our knowledge, these algorithms are the first attempts in this manner. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. ![]() In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |