基于免疫系统的无线传感器网络性能优化

根据免疫系统B细胞和T细胞模型,建立人工免疫系统与无线传感器网络间的相似关系,提出一种邻域节点选择算法,以判断传感器节点是否被激活。由于事件信息传递到汇聚节点会产生偏差,利用时空相关理论和自适应最小均方误差滤波算法,建立偏差与激活节点数目及偏差与节点通信频率之间的关系,确定传递事件信息所需最少激活节点数和最佳通信频率。不同条件下仿真结果表明,这种无线传感器网络优化策略能起到减少节点数目、降低通信频率及节约能耗的效果。

基于割集矩阵算法风速监测智能优化

为建设传感器网络监测井下参数波动以实时反映风网运行状态,实现矿井通风参数智能感知,以最能体现风网变化的风速参数作为监测对象,以传感器优化数作无约束目标函数,利用割集矩阵算法进行函数解算,确定传感器安设分支条数,利用分支被影响度分布进行传感器布设选址寻优,实现传感器网络优化,利用适量风速传感器收集数据反映通风系统全局运行状态.为验证网络优化可靠性,以李雅庄煤矿为工程背景进行实例寻优,结果表明只需在32条分支布设传感器即可实现全矿井通风参数监测.

基于对称映射搜索策略的自适应金鹰算法及应用

金鹰优化算法(Golden Eagle Optimizer,GEO)是一种基于种群的元启发式算法,其模拟了金鹰的合作狩猎行为。针对GEO算法中存在的求解精度差和陷入局部最优等问题,文中提出了一种改进MERGEO(Mapped Elitist Reverse GEO)算法。在原算法基础上采用对称映射搜索策略、自适应精英策略和随机反向学习机制这3种方法平衡了算法的探索和开发阶段,获得了规避局部最优能力和较好的优化精度。在10个基准测试函数上对该算法进行独立策略有效性分析、可扩展性分析以及同其他算法的优化性能比较分析。实验结果表明,改进后的MERGEO算法具有较强的竞争力和良好的优化能力。将改进后的算法用于无线传感器网络的覆盖优化问题和压力容器设计问题研究,验证了其实际应用价值。

基于改进粒子群算法的WSN覆盖优化策略

为了实现WSN覆盖范围的最大化,延长网络寿命,在标准粒子群算法的基础上提出了一种无线传感器网络覆盖优化策略。通过粒子分簇并行搜索,采取碰撞理论使陷入局部最优的粒子迅速跳出,有效地避免了标准粒子群算法容易出现的早熟问题,提高了算法的稳定性。通过仿真实验分析了分簇数和碰撞阈值对覆盖性能指标的影响,仿真实验结果表明,基于碰撞理论的分簇粒子群算法覆盖策略有效地优化了网络的覆盖性能。

Energy-efficient mechanism based on ACO for the coverage problem in sensor networks

An energy-efficient heuristic mechanism is presented to obtain the optimal solution for the coverage problem in sensor networks. The mechanism can ensure that all targets are fully covered corresponding to their levels of importance at minimum cost, and the ant colony optimization algorithm （ACO） is adopted to achieve the above metrics. Based on the novel design of heuristic factors, artificial ants can adaptively detect the energy status and coverage ability of sensor networks via local information. By introducing the evaluation function to global pheromone updating rule, the pheromone trail on the best solution is greatly enhanced, so that the convergence process of the algorithm is speed up. Finally, the optimal solution with a higher coverage- efficiency and a longer lifetime is obtained.

改进VFPSO算法于WSN节点随机部署中的应用

无线传感器网络（Wireless Sensor Network,WSN）节点的随机部署一直是WSN覆盖的核心问题之一。尽可能提升WSN的覆盖质量对延长网络的生命周期起着重要的作用。虚拟力-粒子群优化（Virtual Force Particle Swarm Optimization,VFPSO）算法因虚拟力的引入使PSO算法的优化性能有所提升,但PSO算法的早熟问题仍未得到有效改善。在VFPSO算法的基础上提出了一种维度选择机制,主要目的在于改善VFPSO算法中后期的优化能力。仿真结果表明,将采用维度选择机制后的VFPSO算法应用于WSN的覆盖优化中,覆盖率较其他优化算法有3%~5%的提升。

Securing Sensor Networks Based on Optimization of Weighted Confidence

In this paper, an optimized rmlicious nodes detection algorithm, based on Weighted Confidence Filter （WCF）, is proposed to protect sensor networks from attacks. In this algorithm, each cluster head in a cluster-based hierarchical network figures out an average confidence degree by means of messages from its child nodes. The cluster head only accepts a message from the child node whose confidence degree is higher than the average. Meanwhile, it updates the confidence degrees for each of its child nodes by comparing the aggregation value and the received messages, and regards them as the weight of exactness of messages from nodes. A sensor node is judged to be rmlicious if its weight value is lower than the predefined threshold. Comparative simulation results verify that the proposed WCF algorithm is better than the Weighted Trust Evaluation （WTE） in terms of the detection ratio and the false alarm ratio. More specifically, with the WCF, the detection ratio is significantly improved and the false alarm ratio is observably reduced, especially when the malicious node ratio is 0.25 or greater. When 40% of 100 sensors are malicious, the detection accuracy is above 90% and the false alarm ratio is nearly only 1.8%.

Node deployment strategy optimization for wireless sensor network with mobile base station

The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.

Multi-objective optimization sensor node scheduling for target tracking in wireless sensor network

Target tracking in wireless sensor network usually schedules a subset of sensor nodes to constitute a tasking cluster to collaboratively track a target.For the goals of saving energy consumption,prolonging network lifetime and improving tracking accuracy,sensor node scheduling for target tracking is indeed a multi-objective optimization problem.In this paper,a multi-objective optimization sensor node scheduling algorithm is proposed.It employs the unscented Kalman filtering algorithm for target state estimation and establishes tracking accuracy index,predicts the energy consumption of candidate sensor nodes,analyzes the relationship between network lifetime and remaining energy balance so as to construct energy efficiency index.Simulation results show that,compared with the existing sensor node scheduling,our proposed algorithm can achieve superior tracking accuracy and energy efficiency.

Delay optimization for planar wireless sensor network with N-policy

In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay.The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.

Energy-Efficient Distributed Lifetime Optimizing Scheme for Wireless Sensor Networks

In this paper, a sensing model for the coverage analysis of wireless sensor networks is provided. Using this model and Monte Carlo method, the ratio of private range to sensing range required to obtain the desired coverage can be derived considering the scale of deployment area and the number of sensor nodes. Base on the coverage analysis, an energy-efficient distributed node scheduling scheme is proposed to prolong the network lifetime while maintaining the desired sensing coverage, which does not need the geographic or neighbor information of nodes. The proposed scheme can also handle uneven distribution, and it is robust against node failures. Theoretical and simulation results demonstrate its efficiency and usefulness.

A Routing Optimization Algorithm with Quality of Multi- Service in Wireless Sensor Network

According to the problem of energy consumption in wireless sensor network （WSN）,this paper puts forward a routing optimization algorithm with quality of multi-service, using the function of routing optimization with quality of multi-service and membership function of satisfaction, which integrates the energy consumption of communication and residual and the information of time delay into the membership function of satisfaction to solve the equilibrium factor, so that it can become the optimal routing that balances the network lifetime, transmission delay of data, and node energy consumption of nodes. Simulation experiment shows that adopting the algorithm can make lifecycle of nodes longer and network transmit more data packets at the same time. Experimental results verify the algorithm can effectively balance the network energy, reduce the energy consumption and prolong the network lifetime.

Wireless Sensor Networks for Optimisation of District Heating

The upgrading of the DH （district heating） system through installing WSN （wireless sensor networks）--a technology by which to monitor and control quality operation of the DH system will lead to more effective use of thermal energy, enabling also the provision of quality customer services, as the data concerning the status of the existing networks is available in a timely manner, and in the stated amounts. Over the last decades, the use of WSN systems in enabling quality monitoring of heat production and supply process has been widely discussed among various researchers and industry experts, but has been little deployed in practice. These researchers and industry experts have analysed the advantages and constraints related to the use of the WSN in district heating. A pilot project conducted by Riga Heat （the main heating supplier in Riga, Latvia） has allowed to gain a real life experience as to the use of the WSN system in district in-house heating substations, and is deemed to be a major step towards future development of WSN technologies.

Dynamically Optimized Sensor Deployment Based on Game Theory

Sensor network deployment is the key for sensors to play an important performance. Based on game theory, first, the authors propose a multi-type sensor target allocation method for the autonomous deployment of sensors, considering exploration cost, target detection value, exploration ability and other factors. Then, aiming at the unfavorable environment, e.g., obstacles and enemy interference, the authors design a method to maintain the connectivity of sensor network, under the conditions of effective detection of the targets. Simulation result shows that the proposed deployment strategy can achieve the dynamic optimization deployment under complex conditions.

Parameters optimization and nonlinearity analysis of grating eddy current displacement sensor using neural network and genetic algorithm

A grating eddy current displacement sensor(GECDS) can be used in a watertight electronic transducer to realize long range displacement or position measurement with high accuracy in difficult industry conditions.The parameters optimization of the sensor is essential for economic and efficient production.This paper proposes a method to combine an artificial neural network(ANN) and a genetic algorithm(GA) for the sensor parameters optimization.A neural network model is developed to map the complex relationship between design parameters and the nonlinearity error of the GECDS,and then a GA is used in the optimization process to determine the design parameter values,resulting in a desired minimal nonlinearity error of about 0.11%.The calculated nonlinearity error is 0.25%.These results show that the proposed method performs well for the parameters optimization of the GECDS.

Improved Algorithm for Distributed Localization in Wireless Sensor Networks

Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive.For the inherent shortcomings of general particle filter(the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it.Based on improvement a distributed localization algorithm named WC-IPF(weighted centroid algorithm improved particle filter) has been proposed for localization.In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm.Then the accurate position can be gotten via improved particle filter recursively.The extend simulation results show that the proposed algorithm is efficient for most condition.

Optimized algorithm for balancing clusters in wireless sensor networks

Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving a balanced placement of sensor nodes.The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops.The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks.In this paper we propose an optimal algorithm with cluster balance taken into consideration,and compare it with three well known and widely used approaches,i.e.,LEACH,MEER,and VAP-E,in performance evaluation.Experimental results show that the proposed approach increases the overall network lifetime,indicating that the amount of energy required for com-munication to the base station will be reduced for locating an optimal cluster.

Network Lifetime Global Optimization for Multi-Source and Single-Sink Topology in Wireless Sensor Networks

The multi-source and single-sink(MSSS) topology in wireless sensor networks(WSNs) is defined as a network topology,where all of nodes can gather,receive and transmit data to the sink.In energy-constrained WSNs with such a topology,the joint optimal design in the physical,medium access control(MAC) and network layers is considered for network lifetime maximization(NLM).The problem of integrating multi-layer information to compute NLM,which involves routing flow,link schedule and transmission power,is formulated as a nonlinear optimization problem.Specially under time division multiple access(TDMA) scheme,this problem can be transformed into a convex optimization problem.To solve it analytically we make use of the property that local optimization is global optimization in convex problem.This allows us to exploit the Karush-Kuhn-Tucker (KKT) optimality conditions to solve it and obtain analytical solution expression,i.e.,the globally optimal network lifetime(NL).NL is derived as a function of number of nodes,their initial energy and data rate arrived at them. Based on the analysis of analytical approach,it takes the influence of data rates,link access and routing method over NLM into account.Moreover,the globally optimal transmission schemes are achieved by solution set during analytical approach and applied to algorithms in TDMA-based WSNs aiming at NLM on OMNeT++ to compare with other suboptimal schemes.