一种无线传感器网络分簇路由算法研究

在分析LEACH协议的基础上提出一种基于能量和距离的多跳路由算法（CAED）。由基站依据节点剩余能量和簇头与基站的距离分别选出二层簇头,簇内节点利用单跳和多跳模式与簇头进行通信。仿真实验表明,新算法有效地平衡了节点的能量消耗,并显著地延长了网络的生命周期。     

一种可靠的无线传感器网络路由算法

在基于分簇的无线传感器网络中,为了有效地转发数据,研究者们提出了各种簇组织和簇首选举机制,但是这些机制缺少关注簇首与汇聚节点之间数据传输的可靠性.针对该问题,提出一种可靠的数据路由方案,通过链路代价函数和动态的簇首间路由,控制簇首到汇聚节点的数据转发.仿真结果表明,该方案不仅有效地增加数据包的投递率,也能够均衡网络的能量消耗.     

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

无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期.     

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

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

改进遗传算法优化无线传感器网络路由算法

为了有效延长无线传感器网络的生存时间,针对传感器节点能耗不均衡难题,提出一种改进遗传算法优化的无线传感器网络路由算法。首先对LEACH算法不足进行分析,然后构建簇头节点选择的目标函数,并将其作为遗传算法的搜索目标,最后通过遗传算法找到下一时刻簇头的候选节点,并针对遗传算法不足进行相应改进。采用仿真实验对算法的性能进行分析,结果表明,相对于其它无线传感器路由算法,本文算法可以保证无线传感器的节点能量均衡,延长了网络的生存时间。     

无线传感器网络功率路由算法研究

无线传感器网络的应用越来越广泛,主要是军事、工业、医疗等方面。然而无线传感器网络具有节点能量、存储和计算能力非常有限等特点,文中在传统的LEACH（低功耗自适应集簇分层型）协议的基础上进行了改进,并提出了一种新的无线传感器网络路由算法LEACH-N。新算法沿用了LEACH协议簇的结构,在簇头选择方法上基于传统DCHS算法的簇头选择算法,簇内成员与簇头之间直接通信,簇头与基站之间轮流进行单跳和多跳通信;多跳通信则是采用一种改进的MTE（最小传输能量）路由算法。通过NS2仿真软件对LEACH-N协议与LEACH协议分别进行了性能测试。实验结果表明,相比LEACH协议,LEACH—N协议系统能耗低、网络生命周期长,且具有更好的规模可扩展性。     

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

针对无线传感器网络节点能耗不均匀,容易形成网络分区的问题,提出了一种基于博弈论的无线传感网络路由选择策略,建立传感器节点之间以剩余能量为效用的博弈模型,求解并确定节点剩余能量最优的路由。仿真结果表明,所提出的路由选择策略可以有效地最大化节点的剩余能量,同时当该模型处于纳什均衡解时,每条路径的能耗处于均衡状态,有效地利用了传感器节点的能量资源,避免了网络能量的空洞,延长了网络的生命周期。     

无线传感器网络中基于剩余能量的联合选举动态成簇路由算法

针对无线传感器网络中突发事件监测等响应式网络应用,提出了一种基于能量的联合选举动态成簇算法。基于节点剩余能量,在事件区域内周期性地进行簇首选举,建立以簇首为根的簇树结构对事件区域内的数据进行搜集融合,从而减少网络中传输的数据量。仿真结果表明：该算法降低了节点平均能耗,具有良好的能量均衡效果,延长了网络生存时间。     

基于数据融合的无线传感器网络路由算法

在分簇协议LEACH和链状协议PEGASIS的基础上,提出一种新的基于数据融合的分簇路由算法.簇首节点采用多跳方式传输数据,并根据周围节点的密集程度构造不同大小的簇;簇内节点计算上行和下行节点构造数据融合树,采用时分复用调度算法进行多跳路由.NS2仿真结果表明该路由算法均衡了各个节点的能量消耗,延长了网络存活时间,并降低了网络延迟.     

无线传感器网络能量均衡分簇路由协议

针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多...     

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

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

The novel communication algorithm and the throughput analysis for wireless sensor networks

Aiming at the significance of the energy controls of wireless sensor networks, an economical energy consumption algorithm for wireless communicating in Wireless Sensor Networks (WSN) is presented. Based on the algorithm, the maximal system throughput of WSN is analyzed, and the upper bound of throughput of WSN is proposed and proved. Some numerical simulations are conducted and analyzed. The conclusions include that the transmitting radius of sensor node and the parameters of the energy cost function have significant influence upon the throughput, but the monitoring region radius has little influence. For the same transmitting distance, the more the hopping of information trans- mitting, the better the throughput of WSN. On the other hand, for the energy optimization of the whole WSN, the trade-off problem between the throughput capacity and the relay nodes is proposed, and the specific expression of relay hops that minimized the energy consumptions and the maximal throughput of WSN under the specific situation is derived.     

Power control based cooperative opportunistic routing in wireless sensor networks

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the cooperation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.     

MST-based clustering topology control algorithm for wireless sensor networks

In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes’ transmission power in two-tiered hierarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy &; Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated information to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs’ transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs’ transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node’s degree, average node’s power radius and network lifetime, respectively.     

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.     

An efficient elite group-based routing protocol for wireless sensor network

ABSTRACT

In recent days, due to the wide verities of applications of Wireless Sensor Networks, it gets recognition from research communities. As the sensor nodes are operated through limited battery capacity, how to utilise the battery power or energy in an optimum way is a major concern. In this paper, we have addressed the energy issue of wireless sensor networks. We have developed an energy-efficient routing protocol. This paper proposes the Novel Elite group concept where the cluster-head selection process is restricted to only a few high-energy nodes rather than all nodes in the network, which substantially reduces the number of cluster-head selection overhead in every iteration, decreases the energy consumption and increases network lifetime. Our method is compared with three well-known routing protocols, i.e. EECRP (Energy Efficient Centroid-Based Routing Protocol) protocol, NCBR (New Cooperative Balancing Routing Protocol) and Mod-LEACH (Modified low-Energy Adaptive Clustering Hierarchy Protocol). We have conducted a simulation in NS-2 simulator. We have computed various network quality parameters like Throughput, transmission delay, analysis of the number of dead nodes (reciprocal of alive nodes) and energy dissipation with respect to the number of simulation rounds. The simulation results show that our proposed methodology outperforms the rest of the protocol.     

An efficient UE cluster head selection algorithm in wireless sensor networks and cellular networks

Wireless Sensor Networks (WSNs) have been applied in many different areas. Energy efficient algorithms and protocols have become one of the most challenging issues for WSN. Many researchers focused on developing energy efficient clustering algorithms for WSN, but less research has been concerned in the mobile User Equipment (UE) acting as a Cluster Head (CH) for data transmission between cellular networks and WSNs. In this paper, we propose a cellular-assisted UE CH selection algorithm for the WSN, which considers several parameters to choose the optimal UE gateway CH. We analyze the energy cost of data transmission from a sensor node to the next node or gateway and calculate the whole system energy cost for a WSN. Simulation results show that better system performance, in terms of system energy cost and WSNs life time, can be achieved by using interactive optimization with cellular networks.     

A local dynamic cluster self-organization algorithm in wireless sensor networks for rainfall monitoring

Wireless Sensor Networks for Rainfall Monitoring (RM-WSNs) is a sensor network for the large-scale regional and moving rainfall monitoring, which could be controlled deployment. Delivery delay and cross-cluster calculation leads to information inaccuracy by the existing dynamic collaborative self-organization algorithm in WSNs. In this letter, a Local Dynamic Cluster Self-organization algorithm (LDCS) is proposed for the large-scale regional and moving target monitoring in RM-WSNs. The algorithm utilizes the resource-rich node in WSNs as the cluster head, which processes target information obtained by sensor nodes in cluster. The cluster head shifts with the target moving in chance and re-groups a new cluster. The target information acquisition is limited in the dynamic cluster, which can reduce information across-clusters transfer delay and improve the real-time of information acquisition. The simulation results show that, LDCS can not only relieve the problem of “too frequent leader switches” in IDSQ, also make full use of the history monitoring information of target and continuous monitoring of sensor nodes that failed in DCS.