A Novel Approach to Energy Optimization:Efficient Path Selection in Wireless Sensor Networks with Hybrid ANN

In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing protocols.InWSNs,the limited energy resources of Sensor Nodes(SNs)are a big challenge for ensuring their efficient and reliable operation.WSN data gathering involves the utilization of a mobile sink(MS)to mitigate the energy consumption problem through periodic network traversal.The mobile sink(MS)strategy minimizes energy consumption and latency by visiting the fewest nodes or predetermined locations called rendezvous points(RPs)instead of all cluster heads(CHs).CHs subsequently transmit packets to neighboring RPs.The unique determination of this study is the shortest path to reach RPs.As the mobile sink(MS)concept has emerged as a promising solution to the energy consumption problem in WSNs,caused by multi-hop data collection with static sinks.In this study,we proposed two novel hybrid algorithms,namely“ Reduced k-means based on Artificial Neural Network”(RkM-ANN)and“Delay Bound Reduced kmeans with ANN”(DBRkM-ANN)for designing a fast,efficient,and most proficient MS path depending upon rendezvous points(RPs).The first algorithm optimizes the MS’s latency,while the second considers the designing of delay-bound paths,also defined as the number of paths with delay over bound for the MS.Both methods use a weight function and k-means clustering to choose RPs in a way that maximizes efficiency and guarantees network-wide coverage.In addition,a method of using MS scheduling for efficient data collection is provided.Extensive simulations and comparisons to several existing algorithms have shown the effectiveness of the suggested methodologies over a wide range of performance indicators.

A consensus time synchronization protocol in wireless sensor network

Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.

A Novel Negative Multinomial Distribution Based Energy-Efficient Reputation Modeling for Wireless Sensor Networks(WSNs)

In wireless sensor networks(WSNs),nodes are usually powered by batteries.Since the energy consumption directly impacts the network lifespan,energy saving is a vital issue in WSNs,especially in the designing phase of cryptographic algorithms.As a complementary mechanism,reputation has been applied to WSNs.Different from most reputation schemes that were based on beta distribution,negative multinomial distribution was deduced and its feasibility in the reputation modeling was proved.Through comparison tests with beta distribution based reputation in terms of the update computation,results show that the proposed method in this research is more energy-efficient for the reputation update and thus can better prolong the lifespan of WSNs.

WSN Mobile Target Tracking Based on Improved Snake-Extended Kalman Filtering Algorithm

A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.

Effective data transmission through energy-efficient clustering and Fuzzy-Based IDS routing approach in WSNs

Wireless sensor networks(WSN)gather information and sense information samples in a certain region and communicate these readings to a base station(BS).Energy efficiency is considered a major design issue in the WSNs,and can be addressed using clustering and routing techniques.Information is sent from the source to the BS via routing procedures.However,these routing protocols must ensure that packets are delivered securely,guaranteeing that neither adversaries nor unauthentic individuals have access to the sent information.Secure data transfer is intended to protect the data from illegal access,damage,or disruption.Thus,in the proposed model,secure data transmission is developed in an energy-effective manner.A low-energy adaptive clustering hierarchy(LEACH)is developed to efficiently transfer the data.For the intrusion detection systems(IDS),Fuzzy logic and artificial neural networks(ANNs)are proposed.Initially,the nodes were randomly placed in the network and initialized to gather information.To ensure fair energy dissipation between the nodes,LEACH randomly chooses cluster heads(CHs)and allocates this role to the various nodes based on a round-robin management mechanism.The intrusion-detection procedure was then utilized to determine whether intruders were present in the network.Within the WSN,a Fuzzy interference rule was utilized to distinguish the malicious nodes from legal nodes.Subsequently,an ANN was employed to distinguish the harmful nodes from suspicious nodes.The effectiveness of the proposed approach was validated using metrics that attained 97%accuracy,97%specificity,and 97%sensitivity of 95%.Thus,it was proved that the LEACH and Fuzzy-based IDS approaches are the best choices for securing data transmission in an energy-efficient manner.

Hybrid Marine Predators Optimization and Improved Particle Swarm Optimization-Based Optimal Cluster Routing in Wireless Sensor Networks(WSNs)

Wireless Sensor Networks(WSNs)play an indispensable role in the lives of human beings in the fields of environment monitoring,manufacturing,education,agriculture etc.,However,the batteries in the sensor node under deployment in an unattended or remote area cannot be replaced because of their wireless existence.In this context,several researchers have contributed diversified number of cluster-based routing schemes that concentrate on the objective of extending node survival time.However,there still exists a room for improvement in Cluster Head(CH)selection based on the integration of critical parameters.The meta-heuristic methods that concentrate on guaranteeing both CH selection and data transmission for improving optimal network performance are predominant.In this paper,a hybrid Marine Predators Optimization and Improved Particle Swarm Optimizationbased Optimal Cluster Routing(MPO-IPSO-OCR)is proposed for ensuring both efficient CH selection and data transmission.The robust characteristic of MPOA is used in optimized CH selection,while improved PSO is used for determining the optimized route to ensure sink mobility.In specific,a strategy of position update is included in the improved PSO for enhancing the global searching efficiency of MPOA.The high-speed ratio,unit speed rate and low speed rate strategy inherited by MPOA facilitate better exploitation by preventing solution from being struck into local optimality point.The simulation investigation and statistical results confirm that the proposed MPOIPSO-OCR is capable of improving the energy stability by 21.28%,prolonging network lifetime by 18.62%and offering maximum throughput by 16.79%when compared to the benchmarked cluster-based routing schemes.

基于WSN+UWB的室内人员定位系统设计

随着社会发展,家长对幼儿安全越来越重视,幼儿园环境安全与否直接关系到儿童的健康及生命。为保障园区内幼儿状况及安全,文章提出了一种室内人员定位系统设计,该系统在满足基本定位需求的同时,采用了超宽带(Ultra Wide Band,UWB)技术,具有穿透性强、抗干扰和功耗低等优势,其性能表现已超过蓝牙和Wi-Fi,并以UWB技术作为主要技术依据,将无线传感网络(Wireless Sensor Network,WSN)技术与UWB技术相结合,设计了一款智能化的人员看护及定位系统,测试结果证明了该系统设计可满足园区内人员监测及定位警报的需求。

基于IPSO-BP神经网络的WSNs数据融合算法

针对无线传感器网络(WSNs)数据融合算法中反向传播(BP)神经网络存在对初值敏感、收敛速度慢、易陷入局部最优解等问题,提出基于改进粒子群优化BP(IPSO-BP)神经网络的WSNs数据融合算法。首先,用细菌觅食算法的趋化、迁徙算子对粒子群优化(PSO)算法进行改进;然后,用IPSO算法优化BP神经网络的权值和阈值,再引入到WSNs数据融合中,簇成员节点负责采集监测数据,在簇首节点通过优化后的BP神经网络对数据进行特征提取,并将融合结果发送至汇聚节点。仿真结果表明:IPSO-BP算法能有效提高融合精度和收敛速度,减少冗余数据传输,延长网络生命周期。

基于WSN的流程行业安全生产数据多优先级多路径传输方法

为区分基于无线传感网络(wireless sensor network,WSN)的流程行业安全生产监测数据的优先级,保证关键安全生产决策数据的高质量、低时延传输,减少监测系统对生产事故的误判或漏判现象发生,通过建立实现多层级数据融合的分簇监测网络架构,划分流程安全生产过程中3个级别的数据类型,并提出数据多优先级多路径传输方法。研究结果表明:与传统基于WSN的传输方法相比,本文提出的基于WSN的流程行业安全生产数据多优先级多路径传输方法能够提升高优先级数据传输的及时性和可靠性,有利于安全生产的准确决策。研究结果可为基于WSN的流程行业安全生产监测提供参考。

Comparison of Energy Harvesting Systems for Wireless Sensor Networks

Wireless sensor networks (WSNs) offer an attractive solution to many environmental,security,and process monitoring problems.However,one barrier to their fuller adoption is the need to supply electrical power over extended periods of time without the need for dedicated wiring.Energy harvesting provides a potential solution to this problem in many applications.This paper reviews the characteristics and energy requirements of typical sensor network nodes,assesses a range of potential ambient energy sources,and outlines the characteristics of a wide range of energy conversion devices.It then proposes a method to compare these diverse sources and conversion mechanisms in terms of their normalised power density.

Chain-type wireless sensor network node scheduling strategy

In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.

Clustering routing algorithm of wireless sensor networks based on Bayesian game

To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.

A Methodology for Reliability of WSN Based on Software Defined Network in Adaptive Industrial Environment

As communication technology and smart manufacturing have developed, the industrial internet of things(IIo T)has gained considerable attention from academia and industry.Wireless sensor networks(WSNs) have many advantages with broad applications in many areas including environmental monitoring, which makes it a very important part of IIo T. However,energy depletion and hardware malfunctions can lead to node failures in WSNs. The industrial environment can also impact the wireless channel transmission, leading to network reliability problems, even with tightly coupled control and data planes in traditional networks, which obviously also enhances network management cost and complexity. In this paper, we introduce a new software defined network(SDN), and modify this network to propose a framework called the improved software defined wireless sensor network(improved SD-WSN). This proposed framework can address the following issues. 1) For a large scale heterogeneous network, it solves the problem of network management and smooth merging of a WSN into IIo T. 2) The network coverage problem is solved which improves the network reliability. 3) The framework addresses node failure due to various problems, particularly related to energy consumption.Therefore, it is necessary to improve the reliability of wireless sensor networks, by developing certain schemes to reduce energy consumption and the delay time of network nodes under IIo T conditions. Experiments have shown that the improved approach significantly reduces the energy consumption of nodes and the delay time, thus improving the reliability of WSN.

An Approach of Distributed Joint Optimization for Cluster-based Wireless Sensor Networks

Wireless sensor networks(WSNs) are energyconstrained,so energy saving is one of the most important issues in typical applications.The clustered WSN topology is considered in this paper.To achieve the balance of energy consumption and utility of network resources,we explicitly model and factor the effect of power and rate.A novel joint optimization model is proposed with the protection for cluster head.By the mean of a choice of two appropriate sub-utility functions,the distributed iterative algorithm is obtained.The convergence of the proposed iterative algorithm is proved analytically.We consider general dual decomposition method to realize variable separation and distributed computation,which is practical in large-scale sensor networks.Numerical results show that the proposed joint optimal algorithm converges to the optimal power allocation and rate transmission,and validate the performance in terms of prolonging of network lifetime and improvement of throughput.

TDOA-based Sybil attack detection scheme for wireless sensor networks

As wireless sensor networks （WSN） are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node with multiple non-existent identities （ID） will cause harmful effects on decision-making or resource allocation in these applications. In this paper, we present an efficient and lightweight solution for Sybil attack detection based on the time difference of arrival （TDOA） between the source node and beacon nodes. This solution can detect the existence of Sybil attacks, and locate the Sybil nodes. We demonstrate efficiency of the solution through experiments. The experiments show that this solution can detect all Sybil attack cases without missing.

RESEARCH ON ADAPTIVE COMPRESSION CODING FOR NETWORK CODING IN WIRELESS SENSOR NETWORK

Based on the sequence entropy of Shannon information theory, we work on the network coding technology in Wireless Sensor Network (WSN). In this paper, we take into account the similarity of the transmission sequences at the network coding node in the multi-sources and multi-receivers network in order to compress the data redundancy. Theoretical analysis and computer simulation results show that this proposed scheme not only further improves the efficiency of network transmission and enhances the throughput of the network, but also reduces the energy consumption of sensor nodes and extends the network life cycle.

Weak node protection to maximize the lifetime of wirelesssensor networks

Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network lifetime by optimizing therouting strategy. First, a network model is established, an operatingcontrol strategy is devised, and energy consumption characteristicsare analyzed. Second, a fast route-planning algorithm isproposed to obtain the original path that takes into account the remainingenergy of communicating nodes and the amount of energyconsumed in data transmission. Next, considering the amount ofenergy consumed by an individual node and the entire network,a criterion function is established to describe node performanceand to evaluate data transmission ability. Finally, a route optimizingalgorithm is proposed to increase network lifetime by adjusting thetransmission route in protection of the weak node （the node withlow transmission ability）. Simulation and comparison experimentalresults demonstrate the good performance of the proposed algorithmsto increase network lifetime.

Autoregressive moving average model as a multi-agent routing protocol for wireless sensor networks

A prediction-aided routing algorithm based on ant colony optimization mode （PRACO） to achieve energy-aware data-gathering routing structure in wireless sensor networks （WSN） is presented. We adopt autoregressive moving average model （ARMA） to predict dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic factor and guided by novel pheromone updating rule, multi-agent, i. e. , artificial ants, can adaptively foresee the local energy state of networks and the corresponding actions could be taken to enhance the energy efficiency in routing construction. Compared with some classic energy-saving routing schemes, the simulation results show that the proposed routing building scheme can ① effectively reinforce the robustness of routing structure by mining the temporal associability and introducing multi-agent optimization to balance the total energy cost for data transmission, ② minimize the total communication consumption, and ③prolong the lifetime of networks.

Power Line Monitoring Data Transmission Using Wireless Sensor Network

The WSN used in power line monitoring is long chain structure, and the bottleneck near the Sink node is more obvious. In view of this, A Sink nodes’ cooperation mechanism is presented. The Sink nodes from different WSNs are adjacently deployed. Adopting multimode and spatial multiplexing network technology, the network is constructed into multi-mode-level to achieve different levels of data streaming. The network loads are shunted and the network resources are rationally utilized. Through the multi-sink nodes cooperation, the bottlenecks at the Sink node and its near several jump nodes are solved and process the competition of communication between nodes by channel adjustment. Finally, the paper analyzed the method and provided simulation experiment results. Simulation results show that the method can solve the funnel effect of the sink node, and get a good QoS.

Research on Time Synchronization Method Under Arbitrary Network Delay in Wireless Sensor Networks

To cope with the arbitrariness of the network delays,a novel method,referred to as the composite particle filter approach based on variational Bayesian(VB-CPF),is proposed herein to estimate the clock skew and clock offset in wireless sensor networks.VB-CPF is an improvement of the Gaussian mixture kalman particle filter(GMKPF)algorithm.In GMKPF,Expectation-Maximization(EM)algorithm needs to determine the number of mixture components in advance,and it is easy to generate overfitting and underfitting.Variational Bayesian EM(VB-EM)algorithm is introduced in this paper to determine the number of mixture components adaptively according to the observations.Moreover,to solve the problem of data packet loss caused by unreliable links,we propose a robust time synchronization(RTS)method in this paper.RTS establishes an autoregressive model for clock skew,and calculates the clock parameters based on the established autoregressive model in case of packet loss.The final simulation results illustrate that VB-CPF yields much more accurate results relative to GMKPF when the network delays are modeled in terms of an asymmetric Gaussian distribution.Moreover,RTS shows good robustness to the continuous and random dropout of time messages.