基于多跳中继转发的簇头拓扑维护算法研究

文章借鉴簇头节点与汇聚节点之间多跳中继转发数据的构想,重点针对拓扑维护的簇头重新选举,提出了一种以能量和节点距离综合考虑的数据中继转发的簇头维护算法。仿真证明该算法有效节约了节点工作耗能,达到了节点能量均衡的效果,使数据通信消耗的能量最低,从而减少了节点能耗,优化了网络拓扑结构,延长了网络生命期。     

分簇路由的无线传感器网络通信模式与能量有效性研究

无线传感器网络中的节点以簇的方式进行路由时,簇成员可使用单跳或多跳通信模式将感知数据包发送至簇头。该文以簇内成员节点的最大能耗作为评价指标,研究单簇头情形下单跳和多跳的能量有效性,得出了通信模式的选择取决于通道衰减系数的结论。考虑到单纯的单跳或多跳模式会引起网络能耗不均衡,提出簇成员节点以一定概率在单跳和多跳间切换的混合通信模式,并给出了混合通信模式的工程实现方法。仿真结果验证了混合通信模式在能量有效性和能耗均衡分配方面的优势。     

基于LEACH协议的兄弟节点算法——LEACH-BN

为了延长无线传感器网络的工作时间,针对LEACH算法中能量分布不均衡以及簇头节点能量浪费的问题,提出了一种基于LEACH协议的兄弟节点算法（LEACH-BN,LEACH-Brother Node）：通过簇内兄弟节点调整节点密度、簇头兄弟节点改进簇头选取和转发机制、簇间兄弟节点向基站转发数据。分析和仿真同时表明,改进后的算法实现了WSN中节点能量的全面均衡,提升了首节点和网络的生存时间,均衡弱势节点,增强系统的可靠性。     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

无线传感器网络中一种能量有效的簇内通信方案

为了提高簇内通信的能耗均衡性,提出了一种能量有效的分簇无线传感器网络簇内空分通信方案——近簇头节点采用单跳传输,远簇头节点多跳传输,给出了空分通信方案的工程实现。仿真结果验证了空分混合通信方案在能量有效性和能耗均衡分配方面的优势。     

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

在大规模无线传感器网络中以最节能的方式将数据发送到sink是该领域研究的热点之一。针对LEACH算法的不足之处,提出了一种能耗均衡的路由算法。此算法在考虑节点剩余能量的基础上采用两分法选举簇首,然后簇首通过能耗代价函数计算出一条能耗最小的路径,以多跳转发的方式将数据传送到sink.,为了进一步减少节点的能耗,算法在簇内采用了数据聚合机制。仿真结果表明,算法有效地均衡了网络能耗,延长了网络生存期。     

基于分环多跳的无线传感网分簇路由算法

为了提高无线传感网在大区域情形下的能量效率,提出了一种分环多跳分簇路由算法RBMC(ring based multi-hop clustering routing algorithm).RBMC算法采用分环的方式实现簇头间的多跳通信,通过在不同环内构建大小不同的簇解决传感器网络中存在的"热点"问题,在不同的簇头选举策略下,能够同时满足节点能量同构及异构两种情形.仿真结果表明,在大区域环境下,分环多跳分簇路由算法能在很大程度上均衡节点能量消耗,延长网络的生命周期.     

基于剩余能量与最小邻近簇半径的成簇算法

针对LEACH算法在选举簇首时没有考虑节点的剩余能量,并且簇首的分布不均匀,簇内节点与簇首采取单跳通信,从而影响网络生命期的问题,提出了利用剩余能量和最小邻近簇半径调整节点成为簇首的概率,并在簇内对部分节点采取多跳通信的成簇算法.仿真结果表明,该算法有效延长了网络生命期,均衡了簇首的分布,并且改善了簇内的结构.     

一种负载均衡且能量高效的水下传感网络分簇协议

针对水下无线传感网络能量效率低、生命周期短的问题,提出了一种负载均衡且能量高效的水下分簇（load balanced and energy efficient underwater clustering,LBEEUC）协议。该算法在分簇过程中首先根据节点的经验负载来确定节点所在区域簇头的比例,使经验负载大的区域分布较多的簇头,分担数据转发的任务,均衡网络的能耗;其次在节点入簇时,在簇内设置中继节点,用于均衡远离簇头节点的传输能耗,并提前进行数据融合,减少数据冗余;最后在建立簇间路由时,利用Q 学习算法根据路径消耗的总能量最小的原则选择最优传输路径。仿真结果表明,本算法有效地均衡了网络的能耗,提高了能量利用效率,进而提高了网络的生存时间。     

无线传感器网络能量均衡路由算法

设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间.     

Routing protocol over lossy links for ISA100.11a industrial wireless networks

This paper proposes novel routing and topology control algorithms for industrial wireless sensor networks (IWSNs) based on the ISA100.11a standard. The proposed algorithms not only reduces energy consumption at the node level but also reduces packet latency at the network level. Using the residual energy and packet reception rate of neighbor nodes, the source node can estimate the highest election weight. Hence, packets are conveyed by a multi-hop forwarding scheme from source nodes to the sink by the optimal path. Furthermore, energy consumption and network latency are minimized using integer linear programming. Simulation results show that the proposed algorithms are fully effective in terms of energy conservation and network latency for IWSNs.     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

Environment-Driven Opportunity Forwarding Cross-Layer Optimization for Ubiquitous Wireless Networks

In this paper, an environment-driven cross-layer optimization scheme is proposed to maximize packet forwarding efficiency. The proposed algorithm is aimed to improve the performance of location-based routing protocol in respect of greedy forwarding and avoid void regions for ubiquitous wireless networks. In greedy forwarding mode, we use a new routing metric IAPS which can estimate the forwarding distance, link quality and the difficulty of channel access during the process of the next hop node selection. When the packet forwarding comes into a local minimum, the proposed scheme uses an opportunistic forwarding method based on competitive advantage to bypass the void regions. NS2 simulation results indicate that the proposed algorithm can improve network resource utilization and the average throughput, and reduce congestion loss rate of wireless multi-hop network comparison with existing GPSR algorithm.     

Byzantine robust trust establishment for mobile ad hoc networks

In a mobile ad hoc network (MANET), the nodes act both as traffic sources and as relays that forward packets from other nodes along multi-hop routes to the destination. Such networks are suited to situations in which a wireless infrastructure is unavailable, infeasible, or prohibitively expensive. However, the lack of a secure, trusted infrastructure in such networks make secure and reliable packet delivery very challenging. A given node acting as a relay may exhibit Byzantine behavior with respect to packet forwarding, i.e., arbitrary, deviant behavior, which disrupts packet transmission in the network. For example, a Byzantine node may arbitrarily choose to drop or misroute a certain percentage of the packets that are passed to it for forwarding to the next hop. In earlier work, we proposed a trust establishment framework, called Hermes, which enables a given node to determine the “trustworthiness” of other nodes with respect to reliable packet delivery by combining first-hand trust information obtained independently of other nodes and second-hand trust information obtained via recommendations from other nodes. A deficiency of the Hermes scheme is that a node can fail to detect certain types of Byzantine behavior, such as packet misforwarding directed at a particular source node. In this paper, we propose new mechanisms to make Hermes robust to Byzantine behavior and introduce a punishment policy that discourages selfish node behavior. We present simulation results that demonstrate the effectiveness of the proposed scheme in a variety of scenarios involving Byzantine nodes that are malicious both with respect to packet forwarding and trust propagation.     

水下传感网络中基于链路质量和位置的协作路由

水下传感网络是开发水域环境的有效技术手段。但在水下环境传输数据,信号衰减快,通信链路质量差,降低了数据包传递率。提出基于链路质量和位置的协作(LQLC)路由。LQLC路由引用协作路由思想,利用链路质量和节点能量信息,构建候选转发节点集;再从候选转发节点集中选择具有最优链路质量的节点作为转发节点;最后在候选转发节点集中选择离转发节点最近的节点作为协作节点。仿真结果表明,提出的LQLC路由提高了数据包传递率。     

WSNs中基于转发区域调整的能效地理路由

针对无线传感网络(WSNs)的数据传输问题,提出基于转发区域调整的能效地理位置路由(FAEG)。FAEG限定了数据包的转发区域,构建候选转发节点集,并从节点集中选择权重大的节点传递数据包;通过节点剩余能量和离目的节点距离信息计算节点权重,使剩余能量大和离目的节点近的节点具有优先传递数据包的资格,提高了路由稳定性。节点遭遇路由空洞时,则调整转发区域,在更广范围内选择传输数据包的节点。仿真结果表明,提出的FAEG降低了能耗,并提高了数据包传递率。     

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.     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

自组织ZigBee网络节点通信研究

对自组织ZigBee网络的原理进行了研究,并抓住其精髓进行了剖析,给出了自组织ZigBee网络节点通信流程和软件流程。自组织ZigBee网络每个节点只和其邻近节点通信,从一个节点发出的数据包将根据相关协议的配置多跳传递到目的节点。网络中的每台设备都可直接通信,或者通过网络的转发而连接到其他设备。每个网络节点都具有选路功能,如果其中的某一条链路出现了故障,节点便可以自动转向其他可选链路进行接入,因而减轻了业务执行时发生冲突的可能性。自组织ZigBee网络的研究,对网络中的资源节俭,网络的维护与操作,升级与扩容有着指导意义。     

Performance evaluation of packet aggregation scheme for VoIP service in wireless multi-hop network

In a wireless multi-hop network environment, energy consumption of mobile nodes is an important factor for the performance evaluation of network life-time. In Voice over IP (VoIP) service, the redundant data size of a VoIP packet such as TCP/IP headers is much larger than the voice data size of a VoIP packet. Such an inefficient structure of VoIP packet causes heavy energy waste in mobile nodes. In order to alleviate the effect of VoIP packet transmission on energy consumption, a packet aggregation algorithm that transmits one large VoIP packet by combining multiple small VoIP packets has been studied. However, when excessively many VoIP packets are combined, it may cause deterioration of the QoS of VoIP service, especially for end-to-end delay. In this paper, we analyze the effect of the packet aggregation algorithm on both VoIP service quality and the energy consumption of mobile nodes in a wireless multi-hop environment. We build the cost function that describes the degree of trade-off between the QoS of VoIP services and the energy consumption of a mobile node. By using this cost function, we get the optimum number of VoIP packets to be combined in the packet aggregation scheme under various wireless channel conditions. We expect this study to contribute to providing guidance on balancing the QoS of VoIP service and energy consumption of a mobile node when the packet aggregation algorithm is applied to VoIP service in a wireless multi-hop networks.