基于节点可信度的改进PBFT算法

本文主要是对区块链的核心技术—共识算法进行深入了解,在联盟链中难以避免会有恶意节点的存在,在节点达成共识的过程中,恶意节点将会散布不实信息,影响数据的一致性。本文对区块链防作弊技术进行研究,提出了一种基于节点可信度的NRPBFT(node-reliability-based PBFT consensus algorithm)共识算法,利用节点的可信度将所有的节点分成普通节点和共识节点,提高了共识的效率,降低了主节点作恶的可能性。     

基于扇形分簇的无线传感器网络路由算法

无线传感网络中低功耗自适应聚类分簇(LEACH)路由算法等概率选取簇首节点,容易导致整个网络节点能量损耗出现极端化,减少网络生存时间。为此,提出一种针对簇首节点选取和分簇的改进LEACH算法。该算法把整个网络区域分为四个扇形区域,在每个区域内独立进行分簇路由;然后基站根据节点剩余能量和与基站的距离进行簇首节点选择,节点根据簇首节点和基站接收信号强度选择路由方式,以均衡网络能量消耗。仿真结果表明,改进LEACH算法的网络寿命是原有LEACH算法的150%,数据吞吐量提升了3倍。     

无线传感网中基于DPAM-MD算法的恶意节点识别研究

随着无线传感器网络的不断发展,恶意节点对其安全造成了极大的威胁。传统的基于信誉阈值的模型无法准确的识别亚攻击性等恶意节点,而且会出现低识别率和高误判率等问题。为了解决这些问题,引入了基于DPAM-MD算法的新型恶意节点识别方法,在传统信誉阈值判断模型的基础上,通过结合曼哈顿度量和DPAM算法识别出亚攻击性节点。算法中提出一种新型的基于密度的聚类算法,并结合簇间和簇内距离均衡化的目标函数,将所有的节点进行分类。该算法可以提高聚类质量,有效缩短聚类时间,提高了恶意节点识别的效率。经仿真实验结果验证,改进后的算法对识别特征不明显的恶意节点效果十分显著。     

基于层次混合的高效概率包标记WSNs节点定位算法

在利用概率包标记技术对无线传感器网络(WSN)恶意节点的追踪定位中,标记概率的确定是关键,直接影响到算法的收敛性,最弱链,节点负担等方面。该文分析并指出了基本概率包标记(BPPM)和等概率包标记(EPPM)方法的缺点,提出了一种层次式混合概率包标记(LMPPM)算法,可以克服以上算法的不足。该算法对无线传感器网络进行分簇,将每个簇看成一个大的簇节点,整个网络由一些大的簇节点构成,每个簇节点内部又包含一定数量的传感器节点。在簇节点之间采用等概率包标记法,在簇节点内部采用基本概率包标记法。实验分析表明,该算法在收敛性、最弱链方面优于BPPM算法,在节点计算与存储负担方面优于EPPM算法,是在资源约束条件下的一种整体优化。     

一种基于超节点和能量优先的无线传感器网络的高效查询算法

文中提出一种基于超节点和能量优先的无线传感器网络的高效查询算法.该算法包括传感器节点的层次聚类算法及基于能量代价模型等支撑技术,主要解决了以下两个问题:(1)数据如何从传感器节点传送到汇聚节点;(2)通过对传感器节点进行聚类,形成超节点,使得在查询过程中减少对无关节点的访问.实验表明该算法在提高无线传感器网络查询效率的情况下,延长网络的使用寿命.     

RBFT:基于Raft集群的拜占庭容错共识机制

针对现有联盟链共识机制因可拓展性不足,无法在支持大规模网络的同时满足低时延、高吞吐量和安全性的问题,采用网络分片的思想,提出一种适用于联盟链的带有监督节点的两级共识机制——RBFT。首先对网络节点进行分组,组内采用改进的Raft机制进行共识,然后由每个组内选出的领导者组成网络委员会,网络委员会内部采用PBFT机制进行共识。研究结果表明,在大规模网络环境下,相比PBFT和Raft,RBFT在具备拜占庭容错能力的同时可以保证高共识效率,因而具有更高的扩展性。     

无线传感器网络动态分簇路由BWAS的算法研究

为加快无线传感器网络(WSN)路径搜索速度,减少了路径寻优能量消耗,提出了基于最优-最差蚂蚁系统(BWAS)算法的无线传感器网络动态分簇路由算法。该算法是基于WSN动态分簇能量管理模式,在簇头节点间运用BWAS算法搜寻从簇头节点到汇聚节点的多跳最优路径,以多跳接力方式将数据发送至汇聚节点。BWAS算法在路径搜寻过程中评价出最优-最差蚂蚁,引入奖惩机制,加强搜寻过程的指导性。结合动态分簇能量管理,避免网络连续过度使用某个节点,均衡了网络节点能量消耗。通过与基于蚁群算法(ACS)路由算法仿真比较,本算法减缓了网络节点的能量消耗,延长了网络寿命,在相同时间里具有较少的死亡节点,具有较强的鲁棒性。     

一种基于K-means的WSN移动汇聚路由算法

无线传感网络(Wireless Sensor Network,WSN)作为一种资源受限的网络,网络中节点的能耗直接影响了网络的性能。因此,均衡网络中的能耗,延长网络的生命周期,成为设计WSN路由算法的重要目标。于是,在LEACH-C协议的基础上提出了一种移动汇聚路由算法。分簇阶段由Sink节点计算最优簇首个数,通过K-means聚类将网络中的节点划分至不同的集群,选择通信成本最低的节点作为各集群的簇首。稳定传输阶段通过移动Sink进行数据采集,针对不同的延迟分别规划Sink节点的移动轨迹。MATLAB仿真结果表明,与LEACH和LEAHC-C算法相比簇首的分布更合理,结合Sink节点的移动策略能有效均衡网络能耗,延长网络的寿命。     

基于改进PBFT的区块链工程监理数据共享模型

为有效地解决云环境下工程监理数据流转中存在的数据安全得不到保障、各项目参建方间信任成本高等问题，提出一种基于改进实用拜占庭容错(Practical Byzantine Fault Tolerance, PBFT)的工程监理数据共享模型，结合星际文件系统(InterPlanetary File System, IPFS)实现监理数据的分布式安全存储，并通过智能合约保障数据上链、查询过程的高效性、透明性。针对PBFT算法存在的通信复杂度高、算法本身无法避免拜占庭节点担任主节点等问题，引入节点信任度评价模型对PBFT算法进行改进。进行仿真实验分析评估模型的安全性及算法性能，所得结果满足工程监理场景下对于数据共享的要求。通过对比分析得出，模型在共识效率、吞吐量和算力需求等方面相较于其他模型更有优势。     

适用于智能间隔棒的双集群无线传感网高效节能分簇算法

本文提出了一种双层集群的高效节能分簇算法,利用K-均值聚类算法和角色成员关系模型,将传感节点分为主、子集群并分别进行簇头选择,减小簇内节点的传输范围,均衡各节点能耗。仿真基于MATLAB实现,在网络生命周期和通信数据流量等方面与其他分簇算法进行了性能对比。结果表明,本文提出的算法使能耗负载均匀分布于各节点,实现了能源负载平衡,最终提升传感网络的整体寿命。     

Research on sybil attack in defense blockchain based on improved PBFT algorithm

Aiming at the problem that sybil attack has great harm to block chain technology,a method to improve the PBFT algorithm in the alliance chain to defend against sybil attacks was proposed.Firstly,using the idea of consensus algorithm based on proof of rights and interests,a reputation model was established,the reputation value of each node accorded to the behavior of each node in the consensus process was calculated,and different discourse rights accorded to the size of the reputation value was given.Then pre-commit phase was added to the PBFT algorithm to reduce the number of communication between nodes.The solution through formal analysis and reasoning and security testing shows that the improved PBFT algorithm can not only effectively defend against sybil attacks in the blockchain,but also make the performance of the blockchain system in terms of TPS and block generation delay.     

Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

基于聚类模型预测的无线传感网自适应采样技术研究

该文利用无线传感网(WSNs)的数据空间相关性,提出一种基于数据梯度的聚类机制,聚类内簇头节点维护簇成员节点的数据时间域自回归(AR)预测模型,在聚类内范围实施基于预测模型的采样频率自适应算法。通过自适应优化调整采样频率,在保证数据采样精度的前提下减少了冗余数据传输,提高无线传感网的能效水平。该文提出的时间域采样频率调整算法综合考虑了感知数据的时空联合相关性特点,仿真结果验证了该文算法的性能优势。     

A particle swarm optimization based energy efficient cluster head selection algorithm for wireless sensor networks

Clustering has been proven to be one of the most efficient techniques for saving energy of wireless sensor networks (WSNs). However, in a hierarchical cluster based WSN, cluster heads (CHs) consume more energy due to extra overload for receiving and aggregating the data from their member sensor nodes and transmitting the aggregated data to the base station. Therefore, the proper selection of CHs plays vital role to conserve the energy of sensor nodes for prolonging the lifetime of WSNs. In this paper, we propose an energy efficient cluster head selection algorithm which is based on particle swarm optimization (PSO) called PSO-ECHS. The algorithm is developed with an efficient scheme of particle encoding and fitness function. For the energy efficiency of the proposed PSO approach, we consider various parameters such as intra-cluster distance, sink distance and residual energy of sensor nodes. We also present cluster formation in which non-cluster head sensor nodes join their CHs based on derived weight function. The algorithm is tested extensively on various scenarios of WSNs, varying number of sensor nodes and the CHs. The results are compared with some existing algorithms to demonstrate the superiority of the proposed algorithm.     

一种无线传感器网络中的簇头变化机制

针对无线传感器网络节点密集和节点能量有限等特点,提出了一种簇头变化机制,数据业务节点使用指数退避算法来竞争本簇的簇头,而原簇头转入休眠状态。网络仿真结果表明该机制可提高能量效率和降低传输时延。     

无线传感器网络能量异构分簇算法的研究

在无线传感器网络能量异构环境下对低功耗自适应的分簇算法(Low Energy Adaptive Clustering Hierarchy,LEACH)与稳定选举协议(Stable Election Protocol,SEP)算法进行了分析,针对其存在的不足提出了一种改进的方案。在簇头选举过程中提高了剩余能量高、距离基站较近节点当选为簇头的概率,同时对当选为簇头的节点设定能量阈值,避免能量过低的节点当选为簇头。仿真结果表明,改进后的算法较好地均衡了网络中节点的能量消耗,有效地提高了网络中能量的利用效率,并且极大地延长了网络正常工作的生命周期。     

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

Designing energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.     

基于动态集群和DKF的协作式目标跟踪

针对具有有限感知范围的无线传感器网络中的动态目标跟踪问题,提出了一种将卡尔曼一致滤波和动态集群自组织相结合的协作式动态目标跟踪算法。首先,算法采用一个由群头挑选阶段和集群重新配置阶段构成的动态集群协议来限制参与目标状态估计过程中节点间的信息交换,然后用一个分布式加权估计预测算法即卡尔曼一致滤波来估计目标状态并预测其下一个位置,这样有助于唤醒最合适的节点来进行目标跟踪并最恰当地组织网络通信,而其他节点保持在睡眠状态。仿真结果表明,提出的算法相比于集中式和其他2种常用的分布式动态目标跟踪算法,不仅能够降低网络的平均能耗,而且能够明显提高跟踪过程中的误差估计质量。