一种改进的基于时间竞争成簇的路由算法

为平衡无线传感器网络中的簇头负载并进一步降低多跳传输能耗,文中提出了一种改进的基于时间竞争成簇的路由算法。该算法通过限制近基站节点成簇入簇,以防止近基站节点成簇入簇的节能收益无法补偿成簇入簇能耗;利用基站广播公共信息和基于时间机制成簇,以减少节点基本信息交换能耗;通过候选簇头中继来平衡簇头负载。候选簇头的评价函数综合考虑了剩余能量和最优跳数的理想路径,以期在保持中继负载平衡的基础上尽量降低多跳能耗。仿真结果显示,该算法较LEACH和DEBUC算法延长了以30%节点死亡为网络失效的网络生存周期,表明该算法在降低节点能耗和平衡负载方面是有效的。     

能耗与时延权衡的分布式信息扩散方法

能量消耗与传输时延是无线传感器网络协议设计的两个重要指标。针对一维线型传感器网络，探究能耗与时延权衡的信息扩散问题。通过理论推导与分析，计算得出给定时延约束下高能效信息扩散的最优传输次数与单跳传输距离。基于理论分析结果，提出能耗与时延权衡的分布式信息扩散算法。该算法包含确定候选转发节点集合以及最优中继节点选择两部分。仿真表明所提算法能够实现信息扩散的能耗与时延权衡。     

基于天牛须搜索的无线传感网分簇路由协议

针对无线传感器网络中的能耗不均衡问题,提出一种基于天牛须搜索算法的负载均衡分簇路由协议算法(LEACH-BAS)。该算法引入候选簇首选举机制,使用天牛须搜索算法对簇首分布进行搜索优化,形成合理分簇。此外,在簇间路由通信时,考虑剩余能量因子和传输能耗因子来选择中继节点。仿真结果表明,LEACH-BAS算法的网络生命周期相比LEACH、EAMMH、LEACH-GA和LEACH-PSO算法分别延长了39%、22%、15%和8%。LEACH-BAS算法应用在WSN监测场景,能有效解决WSN中能量不足的问题,优化簇首节点分布,降低节点能耗,有效地延长网络生命周期。     

无线传感器网络中基于概率的能量平衡算法

各传感器节点的能耗不平衡严重地影响了无线传感器网络的生命周期。该文提出了基于传输概率的能量平衡算法。首先把圆形区域网络模型划分成若干圆环,每一圆环中的传感器节点以混合传输的方式传输数据。其次,为使每个传感器节点能耗均衡,提出了一种混合传输概率求解算法,获得一组传输概率决定节点传输数据的方式,从而更好地平衡网络能耗。然后对圆环宽度进行了分析和优化。仿真结果证明这些算法可以有效地降低网络能耗,延长网络生命周期。     

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

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

浅水环境中基于熵的能量均衡路由优化算法

浅水环境具有覆盖面积小、水位低、水底环境较为复杂的特点,当在水下部署传感器节点时,其传输路径容易受到水底障碍物、水中杂物、水浪等影响,给水下传感器的路由选择带来困扰。针对浅水中传感器节点路由选择困难、能量消耗不均、生命周期短的问题,提出一种基于熵的能量均衡路由算法。该算法综合多种节点部署形式,在节点均匀分布和非均匀分布两种条件下分别计算传感器网络通信的能量损耗,权衡考虑节点的剩余能量和位置信息来选择下一跳节点,从而均衡网络能耗。利用NS-2仿真工具对该算法的性能进行仿真分析。结果表明该算法能够实现浅水中的节点通信,有效延长网络生命周期。     

面向智慧园区的WSN路由优化算法

为解决智慧园区中无线传感器网络(WSN)的能耗不均衡问题,构建了路由代价函数,并提出了一种新的能耗均衡路由算法.该算法结合智慧园区中无线传感器网络的特点,综合考虑节点地理位置和剩余能量来构建路由代价函数.传感器节点通过选择其邻居节点中路由代价最小的节点进行数据转发.仿真结果表明,该算法可以有效节约网络能耗,同时延长了网络的生命周期.     

一种基于历史信息的簇头选取机制

无线传感器网络（WSN,Wireless Sensor Network）中,如何减少节点的能耗一直是簇头选择机制的研究目标。现提出了一种基于历史能耗信息选择机制的簇头选择算法（CHCM,Cluster Head Choosing Mechanism）,该算法通过节点历史能耗信息和节点分布密度参数预测簇头能耗速度,并将该预测方法融入簇头选取过程当中,使网络生命期延长。最后利用CHCM对LEACH路由协议进行改进,得到CHCM＋LEACH路由协议。仿真结果表明CHCM＋LEACH在网络生命期和网络总剩余能量上分别比LEACH算法分别提高了27%和14%。     

一种基于贝叶斯博弈的传感器网络分簇算法

提出了一种基于贝叶斯博弈的无线传感器网络分簇算法.算法将无线传感器网络节点的簇头选择抽象为一个多人的博弈过程,节点之间通过不完全信息的静态博弈实现簇头的合理分布.算法在支付函数的设计时充分考虑了节点能耗和路径损耗等因素,因此通过博弈该算法能实现簇头的合理分布.仿真结果表明,算法在保证数据传输实时性的前提下可使网络能耗更加稳定、能量分布更加均匀,有效地延长网络生命周期.     

交通路灯监控系统的无线传感网链状路由算法

在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法(CRASMS)。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明,CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。     

基于位置感知和代理的WSN多径路由方案

针对无线传感器网络(WSN)中多径路由的可靠性和能量效率问题,提出了一种基于代理和位置感知的多径路由发现方案(LABMR).事件节点根据位置信息,动态寻找其到Sink节点之间的特殊中间节点,来构建多径路由.利用移动代理来收集多径路由的局部拓扑结构信息,Sink节点根据代理收集的路由参数来计算路径权值,以此选择最优不相交路径.同时,对于信息的重要性差异,Sink节点选择单条或多条路径来传输数据,在保证传输可靠性的同时减少能耗.与现有的基于代理的多径路由(ABMR)方法相比,LABMP在数据包投递率、能量消耗、额外开销和延迟方面具有更好的性能.     

移动无线传感网的生存时间优化算法研究

当sink节点位置固定不变时,分布在sink 节点周围的传感节点很容易成为枢纽节点,因转发较多的数据而过早失效。为解决上述问题,提出移动无线传感网的生存时间优化算法（LOAMWSN）。LOAMWSN算法考虑sink节点的移动,采用减聚类算法确定sink节点移动的锚点,采用最近邻插值法寻找能遍历所有锚点的最短路径近似解,采用分布式非同步Bellman-Ford算法构建sink节点k跳通信范围内的最短路径树。最终,传感节点沿着最短路径树将数据发送给sink节点。仿真结果表明：在节点均匀分布和非均匀分布的无线传感网中,LOAMWSN算法都可以延长网络生存时间、平衡节点能耗,将平均节点能耗保持在较低水平。在一定的条件下,比Ratio_w、TPGF算法更优。     

Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network

In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.     

Wheel Based Event Triggered Data Aggregation and Routing in Wireless Sensor Networks: Agent Based Approach

Event triggered data aggregation and routing minimizes the amount of energy and bandwidth required to transmit the data from the event affected area. This paper proposes a Wheel based Event Triggered data aggregation and routing (WETdar) scheme in Wireless Sensor Networks (WSNs) by employing a set of static and mobile agents. A wheel with spokes is constructed by WSN nodes around an event node (a sensor node where an event occurs). Gathering and aggregation of the information is performed along the spokes of a wheel in Spoke Aggregator (SA) nodes and sent to an event node, which routes to a sink node. Spoke generation and identification of SA nodes along the spokes is performed by using a mobile agent, based on parameters such as Euclidean distance, residual energy, spoke angle and connectivity. Mobile agent and its clones discover multiple paths to a sink node from an event node. The scheme is simulated in various WSN scenarios to evaluate the effectiveness of the approach. The performance parameters analyzed are number of SAs, SA selection time, aggregation time, aggregation energy, energy consumption, number of isolated nodes and network life time. We observed that proposed scheme outperforms as compared to the existing aggregation scheme.     

Design and Implementation of Routing Algorithm to Enhance Network Lifetime in WBAN

Today’s era is the era of smart and remote applications exploiting advancement in sensors, cloud, Internet of things etc. Major application is in healthcare monitoring and support using wireless body area network (WBAN) in which sensor nodes sense vital physiological parameters and send to server through sink i.e. smart phone nowadays for seamless monitoring. The most significant issue in such applications is energy efficiency which leads to enhanced network life time that ensures uninterrupted seamless services. From source to sink data transmission may occur considering three different scenarios: source to sink single hop direct data transmission irrespective of in-between node distance, source to sink multi hop data transmission in which transmission range of source node is fixed at a threshold to find next forwarder node and transmission range of source node is incremented by affixed value until data gets transmitted to sink. In this work WBAN having different network configurations based on fixed or random positions of nodes have been simulated. Different scenarios with fixed and varying number of nodes are framed and simulated using MATLAB 2020a for performance evaluation of proposed algorithm in terms of energy consumption, network lifetime, path loss etc. due to data transmission from source to sink. Experimental results show that incremental approach is better than direct one in terms of energy consumption, path loss and network lifetime. While selecting transmission range of a source node, it is considered to keep Specific Absorption Rate (SAR) lower to reduce impact on human tissue.

     

Nature inspired discrete firefly algorithm for optimal mobile data gathering in wireless sensor networks

Nowadays wireless sensor networks enhance the life of human beings by helping them through several applications like precision agriculture, health monitoring, landslide detection, pollution control, etc. The built-in sensors on a sensor node are used to measure the various events like temperature, vibration, gas emission, etc., in the remotely deployed unmanned environment. The limited energy constraint of the sensor node causes a huge impact on the lifetime of the deployed network. The data transmitted by each sensor node cause significant energy consumption and it has to be efficiently used to improve the lifetime of the network. The energy consumption can be reduced significantly by incorporating mobility on a sink node. Thus the mobile data gathering can result in reduced energy consumption among all sensor nodes while transmitting their data. A special mobile sink node named as the mobile data transporter (MDT) is introduced in this paper to collect the information from the sensor nodes by visiting each of them and finally it sends them to the base station. The Data collection by the MDT is formulated as a discrete optimization problem which is termed as a data gathering tour problem. To reduce the distance traveled by the MDT during its tour, a nature-inspired heuristic discrete firefly algorithm is proposed in this paper to optimally collect the data from the sensor nodes. The proposed algorithm computes an optimal order to visit the sensor nodes by the MDT to collect their data with minimal travel distance. The proposed algorithm is compared with tree-based data collection approaches and ant colony optimization approach. The results demonstrate that the proposed algorithm outperform other approaches minimizing the tour length under different scenarios.     

一种能量平衡的无线体域网络AODV多播路由发现协议

在动态网络拓扑中,AODV协议通过数据源节点S泛洪广播RREQ消息请求到任意目标节点D的路由,而在无线体域网络中,只有一个sink目标节点,除最短跳数路由上的节点外,其他参与RREQ接收和转发的节点浪费了能量。提出了一种能量平衡的无线体域网络AODV多播路由发现协议,通过在节点广播的hello消息中增加到sink的最小跳数hops、到sink的下一跳节点next和节点本身是否具备转发能力isforward 3 个参数,只选择能到达sink节点的邻居节点参与转发RREQ消息,变广播为多播,有效地降低了路由发现的能量开销,并通过能量平衡延长了WBAN的使用寿命。性能分析与模拟实验表明,该协议在RREQ数量、数据传输率和能量消耗等方面优于相似协议EAAODV。     

遗传算法在无线传感器网络中的应用

传感器节点能量的供应一般采用电池,节点能量有限.为了尽可能减少传感器节点通信模块的能量消耗,保证能量供应的持续性,文中提出了一种基于遗传算法的路由算法,不仅降低了单个节点的能量消耗,而且使整个网络能量的消耗更加均衡,从而延长了整个传感器网络的生存周期.     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

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.