An availability predictive trust factor‐based semi‐Markov mechanism for effective cluster head selection in wireless sensor networks

The longevity of the sensor networks purely depends on the effectiveness of a cluster head selection process that attributes towards effective network management in wireless sensor networks. However, the majority of the cluster head selection schemes are considered an unrealistic condition which ponders the sensor nodes that have the possibility of being selected as cluster heads are highly energy competitive and trustworthy. In this paper, an availability predictive trust factor‐based semi‐Markov mechanism (APTFSMM) was proposed for facilitating effective cluster head selection with the view to enhance its degree of longevity degree in wireless sensor networks. This proposed APTFSMM inherited the merits of semi‐Markov process for estimating availability predictive trust factor that quantifies the maximum likelihood probability under which it is selected as the cluster head through maximized exploration of multiple transition states of the sensors in the networks. This proposed APTFSMM is determined to be predominant in enhancing the lifetime of the sensor network by 31% with a significantly reduced energy consumption rate of 38% compared with the benchmarked cluster head selection approaches considered for investigation.     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

无线传感器网络多业务仿真平台的实现方案

在无线传感器网络中,由于传感器节点的能源十分有限,节能是设计的首要因素。然而,无线传感器网络的多业务在现实生活应用中对QoS(服务质量)都有不同的需求,这就使得WSN网络的QoS研究成为了专家学者们的主要研究方向。在WSN网络拓扑结构和业务类型的研究基础上,使用网络模拟器(Network Simulator Version 2,NS2)来搭建基于多业务共存的星型以及对等结构两种WSN网络仿真平台,建立多种业务流量模型,实现以无线传感器网络协议、流量模型、拓扑为基础的功能模块化设计;并对无线传感器网络关键性能进行了仿真模拟,实现延时、吞吐量、能耗等关键性能的分析。     

大规模输电线路状态监测传感器网络的周期性低功耗通信技术方案

为了实现输电线路监测的功耗低、寿命长、绿色发展的目的，提出大规模输电线路状态监测传感器网络周期性低功耗通信技术方案。依据网络中传感器网络组网特征以及节点运行状态转换特点，设置睡眠定时器，以周期性运行方式使传感器网络通信节点在初始化、睡眠、激活状态间转换，通信节点在输电线路状态监测数据无传递需求时进入睡眠状态，节省通信功耗；传感器网络汇聚（sink）节点利用梯度创建上行路由，通过源路由的方式创建下行路由，以跳数和剩余能量为依据进行上、下行路由数据分组传递，降低节点功耗，延长通信运行时间。实验显示，大规模输电线路状态监测传感器网络应用该技术方案后，通信功耗明显降低，运行时间明显延长，且不会影响监测传感器网络的数据传输性能，延长了监测传感器网络的使用寿命。     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

A new load balancing and data collection algorithm for energy saving in wireless sensor networks

Data gathering is a major function of many applications in wireless sensor networks. The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirements of special applications or users. Wireless sensor networks are characterized by centralized data gathering, multi-hop communication and many to one traffic pattern. These three characteristics can lead to severe packet collision, network congestion and packet loss, and even result in hot-spots of energy consumption thus causing premature death of sensor nodes and entire network. In this paper, we propose a load balance data gathering algorithm that classifies sensor nodes into different layers according to their distance to sink node and furthermore, divides the sense zone into several clusters. Routing trees are established between sensor node and sink depending on the energy metric and communication cost. For saving energy consumption, the target of data aggregation scheme is adopted as well. Analysis and simulation results show that the algorithm we proposed provides more uniform energy consumption among sensor nodes and can prolong the lifetime of sensor networks.     

A Tabu search based routing algorithm for wireless sensor networks

In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime.     

Wireless sensor networks with energy harvesting technologies: a game-theoretic approach to optimal energy management

Energy harvesting technologies are required for autonomous sensor networks for which using a power source from a fixed utility or manual battery recharging is infeasible. An energy harvesting device (e.g., a solar cell) converts different forms of environmental energy into electricity to be supplied to a sensor node. However, since it can produce energy only at a limited rate, energy saving mechanisms play an important role to reduce energy consumption in a sensor node. In this article we present an overview of the different energy harvesting technologies and the energy saving mechanisms for wireless sensor networks. The related research issues on energy efficiency for sensor networks using energy harvesting technology are then discussed. To this end, we present an optimal energy management policy for a solar-powered sensor node that uses a sleep and wakeup strategy for energy conservation. The problem of determining the sleep and wakeup probabilities is formulated as a bargaining game. The Nash equilibrium is used as the solution of this game.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

A Pre-Determined Nodes Deployment Strategy of Two-Tiered Wireless Sensor Networks Based on Minimizing Cost

Nodes deployment is a fundamental factor in determining the connectivity, coverage, lifetime and cost of wireless sensor networks. In this paper, a two-tiered wireless sensor networks consisting of sensor clusters and a base station is considered. Within a sensor cluster, there are many sensor nodes and a relay node. We focus on the deployment strategy for sensor nodes and relay nodes to minimize cost under some constraints. Several means are used. The regular hexagonal cell architecture is employed to build networks. Based on the analysis of energy consumption of sensors and cost of network, an integer programming model is presented to minimize the cost. By the model, number of layers of sensor cluster is determined. In order to balance the energy consumption of sensors on the identical layer, a uniform load routing algorithm is used. The numerical analysis and simulation results show that the waste of energy and cost of wireless sensor networks can be effectively reduced by using the strategy.     

无线传感器网络能耗分析与策略研究

无线传感器网络技术得到了广泛应用,但是该技术一直受能量的制约,因此能量始终是无线传感器网络的核心问题。通过对传感器节点结构与网络体系的分析,得出了传感器网络的能耗特性。为了延长无线传感器网络的生命周期,对传感器节点工作能耗与传感网络能耗做了具体研究,再从低功耗节点设计、网络协议及环境中能量补给三个方面总结出了一套有效的节能策略。     

一种基于无交集节点分组的无线传感器网络覆盖算法

无线传感器网络是一种无线自组织网络,它由大量能量有限的传感器节点组成.能量消耗和网络覆盖是无线传感器网络的两个核心问题,网络覆盖决定了无线传感器网络对物理世界的监测能力,能量消耗则决定了无线传感器网络的生存时间.本文研究了一种改进的基于无交集节点分组算法,针对随机选取节点实现无交集节点分组方式获得的分组个数少且节点通信...     

一种无线传感器网络全连通群的休眠调度算法

该文针对无线传感器网络的覆盖性和连通性问题,在假设传感器节点地理位置信息已知的条件下,设计了一种包含全连通群的建立和维护以及群内节点休眠调度的全新算法。该算法采用保证群内节点彼此一跳可达的全连通群分群方法,以及分布式节能的休眠调度策略,最大程度上减少传感器网络的能量消耗,延长了网络寿命。仿真结果表明:该算法能较好地保证无线传感器网络的覆盖性和连通性,且能耗较低。     

Energy-aware wireless microsensor networks

This article describes architectural and algorithmic approaches that designers can use to enhance the energy awareness of wireless sensor networks. The article starts off with an analysis of the power consumption characteristics of typical sensor node architectures and identifies the various factors that affect system lifetime. We then present a suite of techniques that perform aggressive energy optimization while targeting all stages of sensor network design, from individual nodes to the entire network. Maximizing network lifetime requires the use of a well-structured design methodology, which enables energy-aware design and operation of all aspects of the sensor network, from the underlying hardware platform to the application software and network protocols. Adopting such a holistic approach ensures that energy awareness is incorporated not only into individual sensor nodes but also into groups of communicating nodes and the entire sensor network. By following an energy-aware design methodology based on techniques such as in this article, designers can enhance network lifetime by orders of magnitude     

基于TinyOS的无线传感器网络LEACH算法的改进

LEACH协议是无线传感器网络中最流行的分簇路由协议之一.针对LEACH算法簇分布不均匀以及网络能耗不均衡等问题提出了一种高效节能多跳路由算法.在簇建立阶段,新算法根据网络模型计算出最优簇头间距值,调整节点通信半径以控制簇的大小,形成合理网络拓扑结构;在数据传输阶段,簇头与基站之间采用多跳的通信方式,降低了节点能耗.在TinyOS操作系统下,使用nesC语言设计实现了LEACH-EEMH算法.基于TOSSIM平台的仿真结果表明,新算法较LEACH算法在均衡网络能耗、延长网络寿命方面具有显著优势.     

A Cross-Layer Architecture of Wireless Sensor Networks for Target Tracking

We propose the Low Energy Self-Organizing Protocol (LESOP) for target tracking in dense wireless sensor networks. A cross-layer design perspective is adopted in LESOP for high protocol efficiency, where direct interactions between the Application layer and the Medium Access Control (MAC) layer are exploited. Unlike the classical Open Systems Interconnect (OSI) paradigm of communication networks, the Transport and Network layers are excluded in LESOP to simplify the protocol stack. A lightweight yet efficient target localization algorithm is proposed and implemented, and a Quality of Service (QoS) knob is found to control the tradeoff between the tracking error and the network energy consumption. Furthermore, LESOP serves as the first example in demonstrating the migration from the OSI paradigm to the Embedded Wireless Interconnect (EWI) architecture platform, a two-layer efficient architecture proposed here for wireless sensor networks     

无线传感器网络最优簇首节点数量研究

在无线传感器网络中能耗是必须考虑的一个重要因素,由于无法对节点的能量进行再输送,应尽可能地减少系统能量的开销、延长整个网络的生存时间。文中对无线传感器网络的能耗与最优簇首节点数量之间的关系进行了理论分析与研究,得出的结论对无线传感器网络规划、设计有一定的指导作用。     

Optimal tracking interval for predictive tracking in wireless sensor network

An important application of wireless sensor networks is tracking moving objects. Prediction-based techniques have been proposed to reduce the power consumption in wireless sensor networks by limiting the sensor active time. This paper proposes a quantitative method to optimize the power efficiency by analyzing the effect of prediction on the energy consumption in such networks. To our best knowledge, our efforts are the first attempt made to calculate the optimal tracking interval for a given predictive tracking algorithm. Based on this method, the lifetime and power efficiency of a sensor network can be effectively improved.     

基于离散多目标优化粒子群算法的多移动代理协作规划

无线传感器网络中多移动代理协作能快速高效地完成感知数据汇聚任务,但是随着移动代理访问数据源节点数的增加,移动代理携带的数据分组会逐渐增大,导致传感器节点能量负载不均衡,部分数据源节点能耗过快,网络生存期缩短。目前,针对该问题所设计的能耗均衡算法,多以降低多移动代理总能耗为目标,却未充分考虑部分数据源节点能量消耗过快对网络生存期造成的影响。提出离散多目标优化粒子群算法,以网络的总能耗和移动代理负载均衡作为适应度函数,在多移动代理协作路径规划中寻求近似最优解。通过仿真实验验证,所提出的多移动代理协作路径规划,在网络总能耗和网络生存期方面的性能优于同类其他算法。     

Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor Networks

Wireless sensor networks are data centric networks, which transmit gathered data to sink nodes. Considering energy constraints, how to make full use of the limited energy to reliably transmit data as much as possible becomes a main research region in sensor networks. In this paper, we focus on energy consumption and reliability of different communication modes. Single hop communication mode is simple and easy to implement, but the distant cluster members, especially those on the edge of the networks, need to enlarge transmission power. On the other hand multi-hop communication is not constrained by the communication distance. The relay communication mode guarantees data transmission to a remote cluster head. Considering of the reliability and energy consumption, we propose a voting based clustering communication algorithm. And the optimal cluster number is calculated based on the geometry locations. Finally, several experiments have been done to validate the analysis in this paper.