Distributed power-source-aware routing in wireless sensor networks

Wireless Networks - Although many applications use battery-powered sensor nodes, in some applications battery- and mains-powered nodes coexist. In this paper, we present a distributed algorithm...     

Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks

Due to inherent issue of energy limitation in sensor nodes, the energy conservation is the primary concern for large‐scale wireless sensor networks. Cluster‐based routing has been found to be an effective mechanism to reduce the energy consumption of sensor nodes. In clustered wireless sensor networks, the network is divided into a set of clusters; each cluster has a coordinator, called cluster head (CH). Each node of a cluster transmits its collected information to its CH that in turn aggregates the received information and sends it to the base station directly or via other CHs. In multihop communication, the CHs closer to the base station are burdened with high relay load; as a result, their energy depletes much faster as compared with other CHs. This problem is termed as the hot spot problem. In this paper, a distributed fuzzy logic‐based unequal clustering approach and routing algorithm (DFCR) is proposed to solve this problem. Based on the cluster design, a multihop routing algorithm is also proposed, which is both energy efficient and energy balancing. The simulation results reinforce the efficiency of the proposed DFCR algorithm over the state‐of‐the‐art algorithms, ie, energy‐aware fuzzy approach to unequal clustering, energy‐aware distributed clustering, and energy‐aware routing algorithm, in terms of different performance parameters like energy efficiency and network lifetime.     

仿血管路径的无线传感器网络故障容错路由算法

为提高无线传感器网络故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿血管路径的无线传感器网络故障容错路由算法.研究了人体血管路径特性及属性关联,对网络节点分区域等级标定并以不同概率值进行静态分簇,运用改进的蚁群算法BWAS(最优最差蚂蚁系统)生成节点路径,以路径信息素值作为传输路径的选择概率建立仿血管拓扑结构路由...     

基于认知的无线传感器网络抗干扰路由算法

针对无线传感器网络受Wi—Fi等异构系统干扰日益严重的问题,在引入基于簇的动态多信道组网策略的基础上,综合考虑频谱受干扰程度、信道切换代价、节点剩余能量等因素,提出了一种认知频谱干扰的能量有效的路由（CSIEE）算法。仿真结果表明,该路由与EEPA,AODV,AODV—EA路由相比,有效地节约了传感器节点能量,延长了网络生命周期。     

An ellipse-guided routing algorithm in wireless sensor networks

In wireless sensor networks, sensor nodes are deployed to collect data, perform calculations, and forward information to either other nodes or sink nodes. Recently, geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very efficient. However, the local minimum phenomenon, which hinders greedy forwarding, is a major problem in geographic routing. This phenomenon is attributed to an area called a hole that lacks active sensors, which either prevents the packet from being forwarded to a destination node or produces a long detour path. In order to solve the hole problem, mechanisms to detect holes and determine landmark nodes have been proposed. Based on the proposed mechanisms, landmark-based routing was developed in which the source node first sends a packet to the landmark node, and the landmark node then sends the packet to the destination. However, this approach often creates a constant node sequence, causing nodes that perform routing tasks to quickly run out of energy, thus producing larger holes. In this paper, a new approach is proposed in which two virtual ellipses are created with the source, landmark, and destination nodes. Then guide the forwarding along the virtual ellipses. Furthermore, a recursive algorithm is designed to ensure a shortcut even if there are multiple holes or a hole has multiple landmarks. Thus, the proposed approach improves both geographic routing and energy efficiency routing. Simulation experiments show that the proposed approach increases the battery life of sensor nodes, lowers the end-to-end delay, and generates a short path.     

一种能耗均衡的无线传感器网络路由算法

为了延长采用电池供电的无线传感器网络的生命周期,提出了一种综合考虑单个节点能耗和节点传输信息至汇集节点所需总能耗的路由算法.该算法首先根据网络中节点到汇集节点从小到大的距离顺序选择待规划节点,然后计算各对应候选节点的评价参数,该参数由单节点能耗和节点传输信息至汇集节点所需总能耗加权得到,最后选择评价参数最小的候选节点作为待规划节点的中继节点.仿真结果表明,该算法的生命周期明显长于LEACH(Low Energy Adaptive Clustering Hier-archy)算法.     

A dynamic-clustering reactive routing algorithm for wireless sensor networks

The clustering is a key routing method for large-scale wireless sensor networks, which effective extends the lifetime and the expansibility of network. In this paper, a node model is defined based on the structure and transmission principle of neuron, and a dynamic-clustering reactive routing algorithm is proposed. Once the event emergences, the cluster head is dynamic selected in the incident region according to the residual energy. The data collected by the cluster head is sent back to the Sink along the network backbone. Two kinds of accumulation ways are designed to increase the efficiency of data collection. Meanwhile through the fluctuation of action-threshold, the cluster head can trace the changing speed of incident; the nodes outside the incident region use this fluctuation to send data periodically. Finally, the simulation results verify that the DCRR algorithm extends the network’s lifetime considerably and adapts to the change of network scale. The analysis shows that DCRR has more prominent advantages under low and middle load.

基于可信度的无线传感器网络安全路由算法

为了应对无线传感器网络节点缺乏固定基础设施、节点恶意行为难以检测等引发的安全隐患,提出了节点可信度概念,与群体智能优化算法结合,在路由中引入节点可信度,作为信息素的一个分配策略,类似MPLS的一个可信安全标签,建立可信安全路由,把恶意节点排除出网络,提供安全可信的无线传感器网络环境.仿真实验表明,对目前尚无有效抵御办法的Wormholes攻击,效果显著.     

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node’s gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.     

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

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

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

一种近似秩排序的无线传感器网络分簇路由算法

为了延长无线传感器网络(WSN)的生存期,能量有效的路由算法至关重要。以分配网络中的业务负载为目标的传感器节点聚类是解决无线传感器网络能量均衡的有效方法。文中为无线传感器网络提出一种基于近似秩排序(ARO)的分层和基于距离的组合聚类方法,并使用多跳数据传输。仿真结果表明,ARO-WSN在能耗和网络生存期方面优于经典的LEACH算法、LEACH-C算法和K-means聚类算法,能有效地延长网络的生存期。     

无线传感器网络中的分布式Voronoi覆盖控制算法

以覆盖部分目标区域的传感器网络为研究背景,在通信半径不小于2倍传感半径的条件下,提出了一种维持网络原有覆盖范围、连通性的分布式Voronoi覆盖控制算法.首先,提出了一种基于局部Voronoi区域的冗余识别规则,其计算复杂度与节点密度无关;然后,提出了一种能量优先的Voronoi调度规则,通信相邻、局部Voronoi不相邻的节点可以同步执行冗余识别,提高分布式调度的收敛性.仿真实验表明,所提算法求解活跃节点的数量、平均覆盖度与集中式算法接近,优于一般的分布式算法,而在活跃节点的平均能量、算法性能等方面更加具有优势.     

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.     

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.     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

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

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

无线传感器网络的分布式能量有效非均匀成簇算法

研究了现有成簇路由算法,提出了分布式能量有效成簇路由算法,该算法主要包括3部分内容:一是选择候选簇头时通过引入平均能量因子来平衡全网节点的剩余能量情况;二是构造了基于能量和距离的能量消耗率函数以平衡节点的能量效率;三是首次提出了基于同构单跳网络的分布式能量有效非均匀成簇路由算法.理论和仿真结果均说明该算法优于EECS,生命周期比EECS延长达到约30%.     

Enhanced tree routing for wireless sensor networks

Tree routing (TR) is a low-overhead routing protocol designated for simple, low-cost and low-power wireless sensor networks. It avoids flooding the network with path search and update messages in order to conserve bandwidth and energy by using only parent–child links for packet forwarding. The major drawback of TR is the increased hop-counts as compared with more sophisticated path search protocols. We propose an enhanced tree routing (ETR) strategy for sensor networks which have structured node address assignment schemes. In addition to the parent–child links, ETR also uses links to other one-hop neighbours if it is decided that this will lead to a shorter path. It is shown that such a decision can be made with minimum storage and computing cost by utilizing the address structure. Detailed algorithms for applying ETR to ZigBee networks are also presented. Simulation results reveal that ETR not only outperforms TR in terms of hop-counts, but also is more energy-efficient than TR.     

混合光无线传感网络节能路由算法优化

为解决混合光无线传感网络节点因自身能量耗尽而过早消亡的问题.结合改进的蚁群算法,对一般混合光无线传感网络节能路由算法进行优化.首先给出节能路由算法的假定条件,设置算法具体应用场景,然后构建混合光无线传感器网络通信能耗模型,最后从引入路径度量,改进前向蚂蚁和返回蚂蚁的信息素更新规则着手,提高传统蚁群算法收敛速度,以减少能...