Abstract
Wireless sensor networks (WSNs) are becoming very common in numerous manufacturing industries; especially where it is difficult to connect a sensor to a sink. This is an evolving issue for researchers attempting to contribute to the proliferation of WSNs. Monitoring a WSN depends on the type of collective data the sensor nodes have acquired. It is necessary to quantify the performance of these networks with the help of network reliability measures to ensure the stable operation of WSNs. Reliability plays a key role in the efficacy of any large-scale application of WSNs. The communication reliability in a wireless sensor network is an influential parameter for enhancing network performance for secure, desirable, and successful communication. The reliability of WSNs must incorporate the design variables, coverage, lifetime, and connectivity into consideration; however, connectivity is the most important factor, especially in a harsh environment on a large scale. The proposed algorithm is a one-step approach, which starts with the recognition of a specific spanning tree only. It utilizes all other disjoint spanning trees, which are generated directly in a simple manner and consume less computation time and memory. A binary decision illustration is presented for the enumeration of K-coverage communication reliability. In this paper, the issue of computing minimum spanning trees was addressed and it is a pertinent method for further evaluating reliability for WSNs. This paper inspects the reliability of WSNs and proposes a method for evaluating the flow-oriented reliability of WSNs. Further, a modified approach for the sum-of-disjoint products to determine the reliability of WSN from the enumerated minimal spanning trees is proposed. The proposed algorithm when implemented for different sizes of WSNs demonstrates its applicability to WSNs of various scales. The proposed methodology is less complex and more efficient in terms of reliability.
Highlights
Wireless sensor networks (WSNs) are formed by sensor nodes scattered over a large target area, to record, observe, or monitor as per the requirement of an application
Two major factors affecting network connectivity, the "reliability" of WSN can be characterized as the probability of an operating network reliability are connectivity and the capacity to manage the traffic between nodes
2 and then1’2675 and of non-spanning trees occur after taking the Cartesian product of,fundamental the criteria used for fundamental cut set selection are arduous
Summary
Wireless sensor networks (WSNs) are formed by sensor nodes scattered over a large target area, to record, observe, or monitor as per the requirement of an application. Two major factors affecting network connectivity, the "reliability" of WSN can be characterized as the probability of an operating network reliability are connectivity and the capacity to manage the traffic between nodes. The probability of success of data forwarding from source to destination is called network methods that are based on calculating the minimal path, sets, cut sets, and factoring theory. Links and nodes so that of thethe system is said used to be aupcut-based or down,approach if nodes and path-sets for calculating the reliability because it has been observed that a network has the least number. The WSN reliability accommodating spanning tree algorithm can be calculated by transforming the network in the form of a linear graph having nodes and links representing centers for computers and communication channels, respectively.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
