scholarly journals Disjoint Spanning Tree Based Reliability Evaluation of Wireless Sensor Network

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3071
Author(s):  
Sonam Lata ◽  
Shabana Mehfuz ◽  
Shabana Urooj ◽  
Asmaa Ali ◽  
Nidal Nasser
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Spanning Tree ◽  
Large Scale ◽  
Spanning Trees ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Stable Operation ◽  
Communication Reliability

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.

scholarly journals A Distributed Collision-Free Data Aggregation Scheme for wireless sensor network

2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879584 ◽  
Author(s):  
Danyang Qin ◽  
Yan Zhang ◽  
Jingya Ma ◽  
Ping Ji ◽  
Pan Feng
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Aggregation ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Delay ◽  
Free Data ◽  
Aggregation Scheme ◽  
Aggregation Technology

Due to the advantages of large-scale, data-centric and wide application, wireless sensor networks have been widely used in nowadays society. From the physical layer to the application layer, the multiply increasing information makes the data aggregation technology particularly important for wireless sensor network. Data aggregation technology can extract useful information from the network and reduce the network load, but will increase the network delay. The non-exchangeable feature of the battery of sensor nodes makes the researches on the battery power saving and lifetime extension be carried out extensively. Aiming at the delay problem caused by sleeping mechanism used for energy saving, a Distributed Collision-Free Data Aggregation Scheme is proposed in this article to make the network aggregate data without conflicts during the working states periodically changing so as to save the limited energy and reduce the network delay at the same time. Simulation results verify the better aggregating performance of Distributed Collision-Free Data Aggregation Scheme than other traditional data aggregation mechanisms.

scholarly journals Transmission Power Control with the Guaranteed Communication Reliability in WSN

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Dae-Young Kim ◽  
Zilong Jin ◽  
Jungwook Choi ◽  
Ben Lee ◽  
Jinsung Cho
Keyword(s):  
Wireless Sensor Network ◽  
Power Control ◽  
Sensor Network ◽  
Data Transmission ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transmission Power ◽  
Efficient Data ◽  
Communication Reliability

In a wireless sensor network, sensor nodes are deployed in an ad hoc fashion and they deliver data packets using multihop transmission. However, transmission failures occur frequently in the multihop transmission over wireless media. Thus, a loss recovery mechanism is required to provide end-to-end reliability. In addition, because the sensor nodes are very small devices and have insufficient resources, energy-efficient data transmission is crucial for prolonging the lifetime of a wireless sensor network. This paper proposes a transmission power control mechanism for reliable data transmission, which satisfies communication reliability through recovery of lost packets. The proposed method calculates packet reception rate (PRR) of each hop to maintain end-to-end packet delivery rate (PDR), which is determined based on the desired communication reliability. Then, the transmission power is adjusted based on the PRR to reduce energy consumption. The proposed method was evaluated through extensive simulations, and the results show that it leads to more energy-efficient data transmission compared to existing methods.

scholarly journals DATA TRAFFIC TRUST MODEL FOR CLUSTERED WIRELESS SENSOR NETWORK

2021 ◽  
Vol 9 (1) ◽  
pp. 1225-1229
Author(s):  
Dr. Senthilkumar A, Dr. Lekashri S, Abhay Chaturvedi, Dr. R. Manikandan
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Trust Management ◽  
Large Scale ◽  
Sampling Rate ◽  
Trust Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Data Packets

Trust is an essential parameter among sensor nodes to provide secured and successful communication. Many trust management schemes have been proposed earlier for large scale Wireless Sensor Network (WSN) however not cooperates well in terms of low dependability, memory overheads, large communication etc, therefore a system called Data Traffic Trust Scheme (DTTS) for clustered WSN is proposed here. Here the trust nodes are identified through the data traffic sampling rate. The trust rate is identified through the number of sent and receive data packets and the malicious packets are diagnosed through the un-matching packet rate. The simulation results are evaluated to show the efficiency for the proposed scheme.

scholarly journals A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Matheswaran Saravanan ◽  
Muthusamy Madheswaran
Keyword(s):  
Simulated Annealing ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Spanning Tree ◽  
Simulated Annealing Algorithm ◽  
Minimum Spanning Tree ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Bee Algorithm

Wireless sensor network (WSN) consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST) routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST). The proposed algorithm computes the distance-based Minimum Spanning Tree (MST) of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

scholarly journals Investigation of Parameter Effects on Virtual-Spring-Force Algorithm for Wireless-Sensor-Network Applications

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3082
Author(s):  
Zhiyong Yu ◽  
Rongxin Tang ◽  
Kai Yuan ◽  
Hai Lin ◽  
Xin Qian ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Central Force ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Area ◽  
Node Deployment ◽  
Spring Force

Virtual-force algorithms (VFAs) have been widely studied for accurate node deployment in wireless-sensor-network (WSN) applications. Their main purpose is to achieve the maximum coverage area with the minimum number of sensor nodes in the target area. Recently, we reported a new VFA based on virtual spring force (VFA-SF) and discussed in detail the corresponding efficiency via statistical analysis. The optimized strategy by adding an external central force (VFA-SF-OPT) was presented, which effectively eliminates the coverage hole or twisted structure in the final network distribution. In this paper, the parameter effects on VFA-SF and the VFA-SF-OPT were further investigated: (1) Node velocity dramatically affects the convergence rate of the node-deployment process. (2) A suitable external central force improves equilibrium distance and reduces energy consumption. (3) The effects of VFA-SF and VFA-SF-OPT for different types of obstacles are discussed. Generally, by choosing suitable parameters, both VFA-SF and VFA-SF-OPT can effectively improve node deployment and energy consumption for the whole sensor network. The results give important insight in parameter selection and information fusion in the application of a large-scale WSN.

scholarly journals An Efficiency of Timing to Route Discovery in Mobile Sink by using WSN

2019 ◽  
Vol 8 (12) ◽  
pp. 4559-4564
Keyword(s):  
Wireless Sensor Network ◽  
Time Delay ◽  
Energy Dissipation ◽  
Sensor Network ◽  
Large Scale ◽  
Hot Spot ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delay Bound

Due to the prospective implementation in many fields, study functionality in the wireless sensor network has risen very impressively in recent years. Wireless large-scale sensor networks contain various sources and various sink numbers. This plays a significant part in application performance. To this end, we will concentrate on the primary issue of sink arrangement in this study to minimize time delay in the worst scenario as well as to increase the lifespan of the wireless sensor network. Here we suggest an interconnected anatomy frame for calculating the mobility of the junction sink, routing details. We're talking about the causes of sub problems and bringing them efficient results. Then we combine all these outcomes and suggest the real issue with the optimum polynomial-time algorithm. From this consequence, the merits of involving nodes (mobile sink) and network argument or parametric quantity impact will be displayed. (Example: various sensors, sinks and time delay bound) the lifespan of the network. As we understand, Wireless sensor network nodes are battery-dependent equipment that collects information from the surroundings and send this (information) information to the sink node for further computational processing leading to energy dissipation in batteries The batteries are non-rechargeable or in certain settings it may be hard to replace or recharge. These problems result in the design of a new algorithm for node energy efficiency In typical conditions, the sensor nodes display many to one communication with the sink, resulting in a faster energy depletion of the nodes near the sink, commonly referred to as the energy deficiency hole problem or the hot spot problem. hence in this situation, the mobility of the sink can help in balancing of energy dissipation of the sensor nodes In wireless sensor network when information data hold up by working sink it should be Bounded. Our results show that the proposed algorithm can work better than previous methods and yield results in remote locations such as in the wide region of the wireless sensor network, lake, mountains, hill stations, etc. Additional guideline antennas can boost the transfer chain, which increases to lower hops and low routing delays. Finally, numerical studies analyze the suggested work and simulations are performed to validate through MATLAB.

Research on Modeling of Sensor Nodes Reliability

2012 ◽  
Vol 203 ◽  
pp. 247-251
Author(s):  
Li Juan Qiu ◽  
Cheng Ming Jin ◽  
Ming Ma
Keyword(s):  
Distribution Function ◽  
Wireless Sensor Network ◽  
Weibull Distribution ◽  
Sensor Network ◽  
Exponential Distribution ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Comparative Results ◽  
Two Parameters

To establish the model of wireless sensor network reliability, the sensor nodes’ reliability was assumed to be exponential distribution. By the methods of MLE and K-S , reliability distribution function of sensor nodes was verified in line with two parameters Weibull distribution . Basing on experimental dates , reliability distribution function of sensor nodes accorded with two parameters Weibull distribution and exponential distribution were in Eq.9 and Eq.10. Comparative results in Fig.5 shows that the two parameters Weibull distribution exceeds the exponential distribution to describe the distribution of sensor nodes.

scholarly journals An Optimized Node Deployment Solution Based on a Virtual Spring Force Algorithm for Wireless Sensor Network Applications

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1817 ◽  
Author(s):  
Xiaohua Deng ◽  
Zhiyong Yu ◽  
Rongxin Tang ◽  
Xin Qian ◽  
Kai Yuan ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Early Stage ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Spring Force

How to effectively deploy all wireless sensors and save a system’s energy consumption is a key issue in current wireless sensor network (WSN) applications. Theoretical analysis has proven that a hexagonal structure is the best topology in the two-dimensional network, which can provide the maximum coverage area with the minimum number of sensor nodes and minimum energy consumption. Recently, many scientists presented their self-deployment strategies based on different virtual forces and discussed the corresponding efficiency via several case studies. However, according to our statistical analysis, some virtual force algorithms, e.g., virtual spring force, can still cause holes or twisted structure in a small region of the final network distribution, which cannot achieve the ideal network topology and will waste the system energy in real applications. In this paper, we first statistically analyzed the convergence and deployment effect of the virtual spring force algorithm to derive our question. Then we presented an optimized strategy that sensor deployment begins from the center of the target region by adding an external central force. At the early stage, the external force will be added to the most peripheral nodes to promote the formation of hexagonal topology and avoid covering holes or unusual structure. Finally, a series of independent simulation experiments and corresponding statistical results proved that our optimized deployment solution is very stable and effective, which can improve the energy consumption of the whole sensor network and be used in the application of a large scale WSN.

Sign in / Sign up

Export Citation Format

Share Document