A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks (HWSN). In this paper, a clustering-tree topology control algorithm based on the energy forecast (CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round (the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function (including the energy, link quality and packet loss rate) and their distance. The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several non-cluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy (LEACH), energy dissipation forecast and clustering management (EDFCM) and efficient and dynamic clustering scheme (EDCS) protocols, CTEF has longer network lifetime and receives more data packets at base station. © 2014 Chinese Association of Automation.

Cluster Based Secure Dynamic Keying Technique for Heterogeneous Mobile Wireless Sensor Networks

In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.

Energy-Efficient Area Coverage in Heterogeneous Energy Wireless Sensor Networks

Sensing coverage and energy consumption are two primary issues in wireless sensor networks. Sensing coverage is closely related to network energy consumption. The performance of a sensor network depends to a large extent on the sensing coverage, and its lifetime is determined by its energy consumption. In this paper, an energy-efficient Area Coverage protocol for Heterogeneous Energy sensor networks (ACHE) is proposed. ACHE can achieve a good performance in terms of sensing area coverage, lifetime by minimizing energy consumption for control overhead, and balancing the energy load among all nodes. Adopting the hierarchical clustering idea, ACHE selects the active nodes based on the average residual energy of neighboring nodes and its own residual energy parameters. Our simulation demonstrates that ACHE not only provide the high quality of sensing coverage, but also has the good performance in the energy efficiency. In addition, ACHE can better adapt the applications with the great heterogeneous energy capacities in the sensor networks, as well as effectively reduce the control overhead.

Novel routing protocol for heterogeneous wireless sensor networks

An improved LEACH for heterogeneous wireless sensor networks is proposed. Nodes are distributed in a sensing area that is divided into a number of same equilateral hexagons. Heterogeneous nodes act as the cluster heads and ordinary nodes act as those cluster sensors in all clusters. The structure of WSNs is a two-layer structure. The upper layer consists of all cluster heads and the lower layer consists of all ordinary sensors managed by their corresponding cluster heads. The cluster heads and the ordinary sensors establish their pairwise keys respectively through utilizing different methods. The arithmetic balances energy expense among all kinds of nodes, saves the node energy, and prolongs the life of wireless sensor networks. Additionally, Analysis demonstrates that the security of wireless sensor networks has been improved obviously even with some heterogeneous nodes.

Study on key management scheme for heterogeneous wireless sensor networks

Heterogeneous wireless sensor network( HWSN) is composed of different functional nodes and is widely applied. With the deployment in hostile environment,the secure problem of HWSN is of great importance; moreover,it becomes complex due to the mutual characteristics of sensor nodes in HWSN. In order to enhance the network security,an asymmetric key pre-distributed management scheme for HWSN is proposed combining with authentication process to further ensure the network security; meanwhile,an effective authentication method for newly added nodes is presented. Simulation result indicates that the proposed scheme can improve the network security while reducing the storage space requirement efficiently.

Optimal Control of Heterogeneous-Susceptible-Exposed-Infectious-Recovered-Susceptible Malware Propagation Model in Heterogeneous Degree-Based Wireless Sensor Networks

Heterogeneous wireless sensor networks(HWSNs)are vulnerable to malware propagation,because of their low configuration and weak defense mechanism.Therefore,an optimality system for HWSNs is developed to suppress malware propagation in this paper.Firstly,a heterogeneous-susceptible-exposed-infectious-recovered-susceptible(HSEIRS)model is proposed to describe the state dynamics of heterogeneous sensor nodes(HSNs)in HWSNs.Secondly,the existence of an optimal control problem with installing antivirus on HSNs to minimize the sum of the cumulative infection probabilities of HWSNs at a low cost based on the HSEIRS model is proved,and then an optimal control strategy for the problem is derived by the optimal control theory.Thirdly,the optimal control strategy based on the HSEIRS model is transformed into corresponding Hamiltonian by the Pontryagin’s minimum principle,and the corresponding optimality system is derived.Finally,the effectiveness of the optimality system is validated by the experimental simulations,and the results show that the infectious HSNs will fall to an extremely low level at a low cost.

Energy Proficient Reliable Rim Routing Technique for Wireless Heterogeneous Sensor Networks Lifespan Fortification

Sensor nodes are mainly shielded in the field with limited power supply. In Wireless Sensor Networks, there must be a requirement of an efficient power management, because sensor nodes are deployed in unman attended area with non-rechargeable batteries. Power management can be done by different methods of routing protocols. The proposed Reliable Rim Routing (3R) technique is based on hybrid routing protocol for homogeneous and heterogeneous system for WSNs to ameliorate the performance of the overall system. In 3R, total node deployment area can be multipart in terms of rim and in each rim, and some of the sensor nodes transmit their sensed data directly to base station, and meanwhile remaining sensor nodes send the data through clustering technique to base station like SEP. Proposed 3R technique implementation proves its enhanced WSNs lifetime of 70% energy consumption and 40% throughput compared with existing protocols. Simulation and evaluation results outperformed in terms of energy consumption with increased throughput and network lifetime.

A Reliable and Efficient Time Synchronization Protocol for Heterogeneous Wireless Sensor Network

L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for the synchronization precision of two remote nodes was considered. Clustering in L-SYNC is according to larger degree techniques. These techniques reduce cluster overlapping, resulting in the routing algorithm requiring fewer hops to move from one cluster to another remote cluster. Even though L-SYNC offers higher precision compared to other algorithms, it does not support heterogeneous topologies and its synchronization algorithm can be influenced by unreliable data. In this paper, we present the L-SYNCng (L-SYNC next generation) protocol, working in heterogeneous topologies. Our proposed protocol is scalable in unreliable and noisy environments. Simulation results illustrate that L-SYNCng has better precision in synchronization and scalability.

Cluster Head Selection and Multipath Routing Based Energy Efficient Wireless Sensor Network

The Wireless Sensor Network(WSN)is a network of Sensor Nodes(SN)which adopt radio signals for communication amongst themselves.There is an increase in the prominence of WSN adaptability to emerging applications like the Internet of Things(IoT)and Cyber-Physical Systems(CPS).Data secur-ity,detection of faults,management of energy,collection and distribution of data,network protocol,network coverage,mobility of nodes,and network heterogene-ity are some of the issues confronted by WSNs.There is not much published information on issues related to node mobility and management of energy at the time of aggregation of data.Towards the goal of boosting the mobility-based WSNs’network performance and energy,data aggregation protocols such as the presently-used Mobility Low-Energy Adaptive Clustering Hierarchy(LEACH-M)and Energy Efficient Heterogeneous Clustered(EEHC)scheme have been exam-ined in this work.A novel Artificial Bee Colony(ABC)algorithm is proposed in this work for effective election of CHs and multipath routing in WSNs so as to enable effective data transfer to the Base Station(BS)with least energy utilization.There is avoidance of the local optima problem at the time of solution space search in this proposed technique.Experimentations have been conducted on a large WSN network that has issues with mobility of nodes.

Optimal Deployment of Heterogeneous Nodes to Enhance Network Invulnerability

Wireless sensor networks(WSN)can be used in many fields.In wireless sensor networks,sensor nodes transmit data in multi hop mode.The large number of hops required by data transmission will lead to unbalanced energy consumption and large data transmission delay of the whole network,which greatly affects the invulnerability of the network.Therefore,an optimal deployment of heterogeneous nodes(ODHN)algorithm is proposed to enhance the invulnerability of the wireless sensor networks.The algorithm combines the advantages of DEEC(design of distributed energy efficient clustering)clustering algorithm and BAS(beetle antenna search)optimization algorithm to find the globally optimal deployment locations of heterogeneous nodes.Then,establish a shortcut to communicate with sink nodes through heterogeneous nodes.Besides,considering the practical deployment operation,we set the threshold of the mobile location of heterogeneous nodes,which greatly simplifies the deployment difficulty.Simulation results show that compared with traditional routing protocols,the proposed algorithm can make the network load more evenly,and effectively improve energy-utilization and the fault tolerance of the whole network,which can greatly improve the invulnerability of the wireless sensor networks.

Joint Design of Clustering and In-cluster Data Route for Heterogeneous Wireless Sensor Networks

A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.

Low-latency Data Gathering with Reliability Guaranteeing in Heterogeneous Wireless Sensor Networks

In order to achieve low-latency and high-reliability data gathering in heterogeneous wireless sensor networks(HWSNs),the problem of multi-channel-based data gathering with minimum latency(MCDGML),which associates with construction of data gathering trees,channel allocation,power assignment of nodes and link scheduling,is formulated as an optimization problem in this paper.Then,the optimization problem is proved to be NP-hard.To make the problem tractable,firstly,a multi-channel-based low-latency(MCLL)algorithm that constructs data gathering trees is proposed by optimizing the topology of nodes.Secondly,a maximum links scheduling(MLS)algorithm is proposed to further reduce the latency of data gathering,which ensures that the signal to interference plus noise ratio(SINR)of all scheduled links is not less than a certain threshold to guarantee the reliability of links.In addition,considering the interruption problem of data gathering caused by dead nodes or failed links,a robust mechanism is proposed by selecting certain assistant nodes based on the defined one-hop weight.A number of simulation results show that our algorithms can achieve a lower data gathering latency than some comparable data gathering algorithms while guaranteeing the reliability of links,and a higher packet arrival rate at the sink node can be achieved when the proposed algorithms are performed with the robust mechanism.

Heterogeneous coverage method with multiple unmanned aerial vehicle assisted sink nodes

A heterogeneous coverage method with multiple unmanned aerial vehicle assisted sink nodes(MUAVSs)for multi-objective optimization problem(MOP)is proposed,which is based on quantum wolf pack evolution algorithm(QWPEA)and power law entropy(PLE)theory.The method is composed of preset move and autonomous coordination stages for satisfying non-repeated coverage,connectedness,and energy balance of sink layer critical requirements,which is actualized to cover sensors layer in large-scale outside wireless sensor networks(WSNs).Simulation results show that the performance of the proposed technique is better than the existing related coverage technique.

面向无线异构传感器网络的三维覆盖研究

【目的】为达到增强无线异构传感器网络(HWSN)三维覆盖能力的目的,提出了一种基于改进蜜獾优化算法(IHBA)的无线异构传感器网络三维部署方法。【方法】首先,结合自适应果蝇优化算法,增强算法的随机搜索性,便于算法得到全局最优解,然后引入替换最差个体策略,避免适应度过低的个体占据种群位置,提高算法收敛速度,同时引入新个体提高种群多样性,避免算法个体早熟。【结果】将该算法应用于无线异构传感器网络的覆盖优化,相比标准蜜獾算法,其网络覆盖率提升18.1%。【结论】仿真结果表明,该算法收敛速度更快,可以有效提高无线异构传感器的网络覆盖能力,整个网络的节点分布也更加均匀。

基于半马尔可夫过程的异质WSNs可用度评估

为评估异质无线传感器网络(HWSNs)的可用性,提出一种异质传感器节点状态更契合实际情况的SEQIRD(Susceptible Exposed Quarantined Infected Recovered Dead)新模型。使用半马尔可夫过程描述节点各状态之间的动态转换过程,得到各个状态的稳态概率,并计算得出不同拓扑结构下整个HWSNs稳态可用度。最后进行数值分析,以验证初始感染率、感染变化率和恢复率对HWSNs稳态可用度的影响。

基于微分博弈的异质无线传感器网络恶意程序传播研究与分析

为抑制异质无线传感器网络(Heterogeneous Wireless Sensor Networks,HWSNs)恶意程序的传播,考虑节点能量和计算能力差异,提出一种HWSNs攻防博弈模型。通过计算得到攻防双方的混合纳什均衡,再结合微分博弈建立攻防双方节点转换微分方程,分析得到恶意节点比例动态演化规律。结合数值实验分析,验证有效抑制HWSNs恶意程序传播的方式。

基于改进GWO和贪婪算法的覆盖优化方法

针对能量异构无线传感器网络中节点随机部署时,节点冗余造成覆盖率低的问题,提出一种基于改进灰狼优化和贪婪算法的两阶段覆盖优化方法IGWO-GA。首先,将静态节点和移动节点随机部署在目标区域内;其次,根据网络的覆盖率、节点的能量和虚拟移动距离建立多因素协同适应度函数,将灰狼包围策略划分为内层包围和外层包围,并提出猎物权重因子动态分配策略,确定移动节点的初选位置序列;最后,在终选位置优化阶段,提出贪婪算法确定节点与初选位置的最优匹配,重新进行节点部署,从而完成覆盖优化。仿真结果表明,相较于DPSO、IPSO-IRCD、GWO、GRDSA,IGWO-GA能够有效提高网络覆盖率,降低节点能耗,延长网络生命周期。

Network Invulnerability Enhancement Algorithm Based on WSN Closeness Centrality

Wireless Sensor Network(WSN)is an important part of the Internet of Things(IoT),which are used for information exchange and communication between smart objects.In practical applications,WSN lifecycle can be influenced by the unbalanced distribution of node centrality and excessive energy consumption,etc.In order to overcome these problems,a heterogeneous wireless sensor network model with small world characteristics is constructed to balance the centrality and enhance the invulnerability of the network.Also,a new WSN centrality measurement method and a new invulnerability measurement model are proposed based on the WSN data transmission characteristics.Simulation results show that the life cycle and data transmission volume of the network can be improved with a lower network construction cost,and the invulnerability of the network is effectively enhanced.

基于无线传感器网络的智慧农业架构及应用研究

无线传感器网络(WSN)是一种先进的物联网技术,具有诸多优点,在智慧农业领域广泛应用。提出一种基于无线传感器网络的智慧农业架构体系,采用根据地理区域及农业产业,进行分区异构的无线传感器网络架构,具有节约节点传输资源、距离、能量,从而延长网络生命期的优点。总结了无线传感器网络在智慧农业全产业链中的应用模式,为相关技术人员提供参考。

基于相似路径的曲面异构无线传感器网络节点定位算法

针对曲面场景中的异构无线传感器网络节点定位问题,提出了一种基于相似路径的节点定位算法(Node Localization Algorithm Based on Similar Paths,NLA-SP)。首先,依据Ochiai系数计算锚节点到未知节点的传播路径与各锚节点对间路径的相似值,找出相似路径;其次,根据相似路径对应的锚节点对距离与各单跳路径首节点的通信半径估算锚节点到未知节点的距离;然后,利用融合黄金正弦策略与粒子群优化算法的麻雀算法搜索未知节点的坐标;最后,为减小三维曲面Z轴的坐标误差采用坐标投影法对未知节点的坐标进行校正。仿真结果表明,所提算法较IDV-Hop算法、CPPA算法、HHOMA算法,定位精度明显提高。