能量高效的WSNs分簇数据融合算法

针对无线传感器网络(WSNs)中多跳通信造成的“热区”以及数据冗余问题,提出了一种能量高效的分簇数据融合算法(EECDA).该算法在分簇阶段综合考虑节点的剩余能量、到基站的距离和邻居节点的数目,周期性地选择簇首和划分不同规模的簇;对簇内数据进行融合,利用辛普森积分法则计算预测接收数据,在保证采集数据实时性和准确性的前提下,降低数据的冗余性,减少通信负载,提高网络的能量利用率.仿真结果表明:该算法能够对数据进行高效预测,减少网络通信量,相较已有的算法,能够有效延长网络的生存周期.     

无线传感器网络中的节能路由算法

针对传感器网络中的节点能源有限的特点,文章在分析LEACH的基础上,提出一种高能效的路由算法。该算法根据各节点剩余能量大小和簇成员数控制簇的形成,使簇头之间通过多跳合作的方式与基站进行通信,从而使网络能量均匀消耗。仿真结果显示,与原LEACH协议相比,改进后的算法提供了更长的网络生存时间。     

无线传感器/执行器网络中能量有效的实时分簇路由协议

无线传感器/执行器网络(WSANs)主要应用于自动控制领域,实时性问题是其面临的首要挑战.根据实际环境中的节点部署情况,建立了系统模型;研究了分簇策略与功率控制技术对于自组织网络实时性的影响,提出了一种可适用于WSANs的能量有效的实时分簇路由协议--RECRP协议.该协议采用二级成簇策略使网络中的各类节点稳定分簇.分簇后的各类节点具有不同发射功率,利用执行器节点的强大通信能力有效降低网络延时.采用能量有效性算法使网络中的传感器节点轮换担任簇首,从而使网络能量均匀消耗,延长网络的生存时间.实验结果证明,在WSANs中RECRP协议可使网络稳定分簇,并且在网络的实时性与能量有效性方面与现有典型路由协议相比具有更优越的性能.     

C-DTB-CHR: centralized density- and threshold-based cluster head replacement protocols for wireless sensor networks

Advances introduced to electronics and electromagnetics leverage the production of low-cost and small wireless sensors. Wireless sensor networks (WSNs) consist of large amount of sensors equipped with radio frequency capabilities. In WSNs, data routing algorithms can be classified based on the network architecture into flat, direct, and hierarchal algorithms. In hierarchal (clustering) protocols, network is divided into sub-networks in which a node acts as a cluster head, while the rest behave as member nodes. It is worth mentioning that the sensor nodes have limited processing, storage, bandwidth, and energy capabilities. Hence, providing energy-efficient clustering protocol is a substantial research subject for many researchers. Among proposed cluster-based protocols, low-energy adaptive clustering hierarchy (LEACH) and threshold LEACH (T-LEACH), as well as modified threshold-based cluster head replacement (MT-CHR) protocols are of a great interest as of being energy optimized. In this article, we propose two protocols to cluster a WSN through taking advantage of the shortcomings of these protocols (i.e., LEACH, T-LEACH, and MT-CHR), namely centralized density- and threshold-based cluster head replacement (C-DTB-CHR) and C-DTB-CHR with adaptive data distribution (C-DTB-CHR-ADD) protocols that mainly aim at optimizing energy through minimizing the number of re-clustering operations, precluding cluster heads nodes premature death, deactivating some nodes located at dense areas from cluster’s participation, as well as reducing long-distance communications. In particular, in C-DTB-CHR protocol, some nodes belong to dense clusters are put in the sleeping mode based on a certain node active probability, thereby reducing the communications with the cluster heads and consequently prolonging the network lifetime. Moreover, the base station is concerned about setting up the required clusters and accordingly informing sensor nodes along with their corresponding active probability. C-DTB-CHR-ADD protocol provides more energy optimization through adaptive data distribution where direct and multi-hoping communications are possible. Interestingly, our simulation results show impressive improvements over what are closely related in the literature in relation to network lifetime, utilization, and network performance degradation period.     

一种能量高效的无线传感器网络分簇路由算法

无线传感器网络中节点的能量有限,提高能量的有效性便成为无线传感器网络路由协议设计的首要目标。设计了一种能量高效的分簇路由算法,它提出让候选节点在一定的覆盖范围内以剩余能量为标准来竞选簇头,以使簇头分布均匀;处于簇类交界的节点则根据能量和距离来选择归属的簇头,以平衡网络负载;新算法还采用多跳的簇间通信方式来降低大部分簇头节点的通信负载。仿真结果表明:新算法能够有效降低网络能耗,延长网络生存时间。     

能量高效的无线传感器网络分簇路由协议

无线传感器网络的路由协议设计要同时关注单个节点的能耗及整个网络能量的均匀消耗。在分析现有分簇路由协议的基础上,提出一种能量高效的分簇路由协议,通过结合节点能量选举簇头,采用限制簇规模的优化簇形成算法和改进的多跳簇间转发方式,节约节点能量,平衡簇间负载。仿真结果表明,该协议能有效降低网络能量消耗,延长网络生存周期。     

一种基于树均匀分簇的WSNs节能路由协议

针对无线传感器网络(WSNs)典型分簇LEACH算法簇首分布不均和簇首与基站一跳通信能耗大的问题,提出一种基于树均匀分簇的节能路由协议(EUCR).基于节点接收信号强度与自身剩余能量的乘积及网络连通度选取簇首,计算簇首间的合理距离,使网络均匀分簇;基于跳数与簇首当前剩余能量构造簇间优化路由树.在OMNeT++中对EUC...     

基于蚁群优化的无线传感器网络路由算法

如何在资源受限的无线传感器网络中进行高效的数据路由是无线传感器网络研究的热点之一。基于群智能优化技术的蚁群优化算法被广泛应用于网络路由算法。提出一种无线传感器网络蚁群优化路由算法,能够保持网络的生存时间最长,同时能找到从源节点到基站节点的最短路径;采用的多路数据传输也可提供高效可靠的数据传输,同时考虑节点的能量水平。仿真结果表明:提出的算法延长了无线传感器网络的寿命,实现无线传感器网络在通信过程中快速、节能的路由。     

基于LEACH协议的簇头多跳(LEACH-M)算法

为了延长网络的生存时间,需要设计能量有效的协议,适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间.早先提出的LEACH协议是无线传感网中的低功耗自适应分层路由算法,但节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点负载过重,在LEACH协议中引入簇头多跳算法,使得簇头之间形成一个多跳的最优路径通向基站,从而减少了簇头节点能量的消耗,延长了传感网的寿命.实验表明此方法行之有效.     

基于学习自动机的无线传感网能量均衡分簇算法

优化簇首选择、均衡节点能量负载以延长网络存活时间,一直是无线传感器网络分簇协议研究的重点。针对无线传感器网络节点随机分布的情况,在基于学习自动机(Learning Automata, LA)的ICLA算法基础上,提出一种兼顾节点密度的能耗均衡分簇算法。在簇头选举方面,综合考虑节点剩余能量和节点密度,利用学习自动机与周围环境进行信息交互和动作奖惩,选择出相对较优的簇头;根据簇首与基站距离和其节点密度构造大小非均匀的簇,实现不同位置不同网络疏密程度下簇内和簇间能耗互补均衡;构造了基于簇首剩余能量、簇内节点密度和传输距离的评价函数,并运用贪婪算法选择出最优中转簇首进行多跳传输。仿真实验结果表明,该算法能选择出更为合理的簇头,有效地均衡网络能量负载,延长网络生存时间。     

基于簇的无线传感器网络密钥管理协议

无线传感器网络密钥管理协议的研究是一个热点问题.针对无线传感器网络体系结构的特征,提出一种基于无线传感器网络簇路由选择协议的集中控制密钥管理协议.将逻辑密钥树协议应用于无线传感器网络中,降低基站节点和普通传感器节点的存储开销和降低普通传感器节点的密钥计算开销,各个簇内采用逻辑密钥树协议作为密钥管理协议,命令控制节点采用Kerberos方法对基站节点实行安全管理.最后对提出的密钥管理协议进行了性能分析.     

BARC: A Battery Aware Reliable Clustering algorithm for sensor networks

Clustering in wireless sensor networks (WSNs) provides scalability and robustness for the network; it allows spatial reuse of the bandwidth, simpler routing decisions, and results in decreased energy dissipation of the whole system by minimizing the number of nodes that take part in long distance communication. Clustering allows for data aggregation which reduces congestion and energy consumption. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper, we first provide an online mathematical battery model suitable for implementation in sensor networks. Using our battery model, we propose a new Battery Aware Reliable Clustering (BARC) algorithm for WSNs. BARC incorporates many features which are missing in many other clustering algorithms. It rotates cluster heads (CHs) according to a battery recovery scheme and it also incorporates a trust factor for selecting cluster heads thus increasing reliability. Most importantly, our proposed algorithm relaxes many of the rigid assumptions that the other algorithms impose such as the ability of the cluster head to communicate directly with the base station and having a fixed communication radius for intra-cluster communication. BARC uses Z-MAC which has several advantages over other MAC protocols. Simulation results show that using BARC prolongs the network lifetime greatly in comparison to other clustering techniques.     

Energy Efficient Backoff Hierarchical Clustering Algorithms for Multi-Hop Wireless Sensor Networks

Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.     

LEACH-EE——基于LEACH协议的高效聚类路由算法

为延缓传感器网络寿命,减少能量的消耗,提出一种基于LEACH协议的高效聚类路由算法(LEACH-EE)。它通过簇头来收集数据,然后簇头之间形成一个多跳的通向基站的最优路径,最后数据融合给一个簇头传给基站。这样解决了LEACH协议的簇头节点负载过重的问题,以及改善了网络能量的消耗和网络的生存时间。实验证明此方法行之有效。     

基于能量优化的无线传感器网络分簇路由算法研究

无线传感器网络的路由协议设计要同时关注单个节点的能耗及整个网络能量的均衡消耗.分簇算法能有效解决节点能耗受限与不同节点能量开销不平衡问题.在分析了传统分簇路由LEACH(low energy adaptive clustering hierarchy)协议中选择簇头算法不足和当前一些典型基于LEACH思想的路由改进算法...     

一种能量高效的非均匀分簇算法

针对无线传感器网络中的能量消耗不均衡问题,提出一种能量高效的非均匀分簇算法--EUCA。算法采取基于节点剩余能量的簇首选举策略,簇首采用非均匀分簇的思想来构建大小不等的簇,在构建簇间路由树时,综合考虑了邻近簇首的剩余能量、簇成员数目、相对自身的距离和相对基站的距离,以此来均衡簇首能量损耗。仿真结果表明,该算法有效均衡了网络能量损耗,延长了网络的生存周期。     

J-Sim下WSNs仿真框架的扩展设计与实现

随着无线传感器网络(WSNs)的应用,如何延长网络生命周期,对路由协议的研究提出了挑战。为了更好地研究能量高效利用的WSNs路由协议,建立对WSNs能耗支持较好的仿真平台具有十分重要的现实意义。针对J-Sim下WSNs框架对能耗仿真支持不好的问题,在现有的WSNs框架基础上提出了一种支持能耗仿真的WSNs仿真框架并在该框架上扩展实现LEACH协议。实验结果表明改进后的WSNs框架可以真实地仿真WSNs,获取有价值的仿真结果。     

Performance evaluation of network lifetime spatial-temporal distribution for WSN routing protocols

Despite the disparity in the objectives of sensor applications, the main task of sensor networks is to sense and collect data from a target domain, process the collected data, and transmit the information back to the base station. Achieving this task efficiently requires the development of an energy-efficient routing protocol to set up paths between sensor nodes and the base station. The path selection must be such that the lifetime of the network is maximized. The definition of this metric is determined by the type of the provided service. Using several definitions of lifetime and a common evaluation framework, the lifetime of some representative flat and hierarchical sensor network routing protocols has been analyzed, namely: DIRECT, FLOODING, GOSSIPING, LEACH, and HEED. Extensive simulations have been carried out yielding a detailed analysis of the spatial-temporal distribution of lifetimes. Through this study, a new technique aimed at providing a good spatial-temporal distribution of lifetime is proposed. The resulting EHEED protocol is compared to others. Experimental results show that EHEED can extend remarkably the network lifetime and can be very effective for long-lived sensor network.     

基于CS优化的双簇头分簇路由算法研究

为了减少无线传感器网络(WSNs)分簇路由中簇头的能量消耗,提出了一种基于布谷鸟搜索(CS)优化的双簇头分簇路由算法.CS通过采用节点的剩余能量和节点之间的位置关系来构造适应值函数并选举出最优双簇头.其中,主簇头将数据进行融合,副簇头将融合的数据发送给基站,缓解了以往单簇头同时负责数据融合和传输的双重压力,使得整体能耗在各个节点的分配更均衡.仿真实验表明:与LEACH算法、粒子群优化(PSO)算法相比,CS算法在减小网络能耗以及延长网络生存周期上更具优势.     

Random Walk Routing in WSNs with Regular Topologies

Topology is one of the most important characteristics for any type of networks because it represents the network's inherent properties and has great impact on the performance of the network. For wireless sensor networks (WSN), a well-deployed regular topology can help save more energy than what a random topology can do. WSNs with regular topologies can prolong network lifetime as studied in many previous work. However, little work has been done in developing effective routing algorithms for WSNs with regular topologies, except routing along a shortest path with the knowledge of global location information of sensor nodes. In this paper, a new routing protocol based on random walk is proposed. It does not require global location information. It also achieves load balancing property inherently for WSNs which is difficult to achieve by other routing protocols. In the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes, it is proved that the random walk routing protocol can guarantee high probability of successful transmission from the source to the base station with the same amount of energy consumption as the shortest path routing. Since in many applications of WSNs, sensor nodes often send only beep-like small messages to the base station to report their status, our proposed random walk routing is thus a viable scheme and can work very efficiently especially in these application scenarios. The random walk routing provides load balancing in the WSN as mentioned, however, the nodes near to the base station are inevitably under heavier burden than those far away from the base station. Therefore, a density-aware deployment scheme is further proposed to guarantee that the heavy-load nodes do not affect the network lifetime even if their energy is exhausted. The main idea is deploying sensors with different densities according to their distance to the base station. It will be shown in this paper that incorporating the random walk routing protocol with the density-aware deployment scheme can effectively prolong the network lifetime.