EERP:一种能源有效的无线传感器网络路由协议

针对同构无线传感器网络的能源瓶颈问题提出一种能源有效的自适应路由协议,该协议在分布式动态分簇的基础上提出一种班车算法对数据进行逐层汇聚,以减少网络中流动数据包的数量,同时分担簇头节点的计算量。Tossim仿真试验表明该协议能够显著地减少节点的能量开销,提高网络的适应性,有效地延长网络的生命周期。     

Energy Efficient Fuzzy Routing Protocol for Wireless Sensor Networks

Wireless Personal Communications - Energy efficiency to route data in wireless sensor networks is key concern to enhance network lifetime. In this paper, an energy efficient routing protocol has...     

A New Energy Efficient Hierarchical Routing Protocol for Wireless Sensor Networks

Wireless sensor networks consist of low cost sensor nodes which have limited power supplies, memory capacity, processing capability and transmission rate. Sensor nodes gather information from the environment and send the collected information to base station with help of a routing cooperation. Because of limited resources in Wireless Sensor Networks, fulfilling these routing operations is a major problem. Routing protocols are used to perform these operations. The most important thing by considering while these protocols are designed is energy efficiency. Because wireless sensor networks are widely used in intelligent systems, the energy efficiency of these networks is very important in IoT. Researchers have proposed several hierarchical routing protocols such as LEACH, PEGASIS, TEEN and APTEEN. In this study, an energy efficient routing protocol is developed which is more efficient than currently avaliable routing protocols. The developed protocol involves mapping of the network, sleep–wake/load balancing, data merge processes. The proposed protocol gives better results than other protocols in number of surviving nodes and amount of energy consumed criterias.     

UCRP—一种能量有效的WSN非均匀分簇路由协议

提出了一种新的能量有效的非均匀分簇路由协议—UCRP.根据距离基站的远近将网络分为大小不同的簇;簇内数据传输根据簇范围的大小采用单跳或多跳;簇间数据传输构建多跳路由,簇首选择下一跳节点时将能量与最小跳数路由算法相结合;最后在能量有效的前提下对LEACH协议易受到HELLO flooding攻击提出了安全设想.仿真结果表明:该协议能够有效地均衡簇首和全网能耗,延长网络生存时间.     

A Novel Heterogeneous Clustering Protocol for Lifetime Maximization of Wireless Sensor Network

The network lifetime of Wireless Sensor Network (WSN) is one of the most challenging issues for any network protocol. The nodes in the network are densely deployed and are provided with limited power supply. The routing strategy is treated as an effective solution to improve the lifetime of the network. The cluster based routing techniques are used in the WSN to enhance the network lifespan and to minimize the energy consumption of the network. In this paper, an energy efficient heterogeneous clustering protocol for the enhancement of the network lifetime is proposed. The proposed protocol uses the sensor energy for the clustering process in a well-organized manner to maximize the lifetime of network. The MATLAB simulator is used for implementing the clustering model of proposed protocol and for measuring the effectiveness of the proposed technique the comparison is performed with the various existing approaches such as Stability Election Protocol, Distributed Energy Efficient Clustering and Adaptive Threshold Energy Efficient cross layer based Routing.

     

End-to-End Delay and Energy Efficient Routing Protocol for Underwater Wireless Sensor Networks

Providing better communication and maximising the communication performance in a Underwater Wireless Sensor Network (UWSN) is always challenging due to the volatile characteristics of the underwater environment. Radio signals cannot properly propagate underwater, so there is a need for acoustic technology that can support better data rates and reliable underwater wireless communications. Node mobility, 3-D spaces and horizontal communication links are some critical challenges to the researcher in designing new routing protocols for UWSNs. In this paper, we have proposed a novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) to address the issues of continuous node movements, end-to-end delays and energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packets toward the sinks without using any explicit configuration or location information. The simulation results show that L2-ABF has some advantages over some existing flooding-based techniques and also can easily manage quick routing changes where node movements are frequent.     

A Uniform Balancing Energy Routing Protocol for Wireless Sensor Networks

In wireless sensor network, the power supply is, generally, a non-renewable battery. Consequently, energy effectiveness is a crucial factor. To maximize the battery life and therefore, the duration of network service, a robust wireless communication protocol providing a best energy efficiency is required. In this paper, we present a uniform balancing energy routing protocol. In this later the transmission path is chosen for maximizing the whole network lifetime. Every transmission round, only the nodes which have their remaining energies greater than a threshold can participate as routers for other nodes in addition to sensing the environment. This choice allows the distribution of energy load among any sensor nodes; thus extends network lifetime. The experimental results shows that the proposed protocol outperforms some protocols given in the literature.     

Energy Balanced Model for Lifetime Maximization in Randomly Distributed Wireless Sensor Networks

In this paper, an energy balanced model (EBM) for lifetime maximization for a randomly distributed sensor network is proposed. The lifetime of a sensor network depends on the rate of energy depletion caused by multiple factors, such as load imbalance, sensor deployment distribution, scheduling, transmission power control, and routing. Therefore, in this work, we have developed a mathematical model for analysis of load imbalance under uniform and accumulated data flow. Based on this analysis, we developed a model to rationalize energy distribution among the sensors for enhancing the lifetime of the network. To realize the proposed EBM, three algorithms—annulus formation, connectivity ensured routing and coverage preserved scheduling have been proposed. The proposed model has been simulated in ns-2 and results are compared with Energy-Balanced Transmission Policy and Energy Balancing and unequal Clustering Algorithm. Lifetime has been measured in terms of the time duration for which the network provides satisfactory level of coverage and data delivery ratio. EBM outperform both the existing models. In our model the variance of residual energy distribution among the sensors is lower than other two models. This validated the essence of energy rationalization hypothesized by our model.     

一种能量感知无线传感器网络可靠协议研究

针对无线传感器网络协议中可靠性及能量有效性,提出能量感知的无线传感器网络可靠路由EARRP.EARRP通过本地节点选择、路径预留和路径延迟广播来减少由于路径不可达带来的重传,进而提供一个可依赖的传输环境.仿真实验表明EARRP优于在汇聚节点和感应节点之间建立有效路径的传统的方法可以有效利用节点的剩余能量和有限存储资源.同时可以均匀的分配传输路径,进而实现节能目的.     

基于非均匀分簇的能耗高效WSN路由协议

本文提出了能耗高效的非均匀分簇路由协议（EERP）.核心为由远及近依次求取各层成簇半径值,使得靠近sink节点的成簇半径小于远离sink节点的成簇半径;以节点剩余能量和相对距离为每个节点确定簇首竞争能力;簇间采用动态路由;依据接收比特值和簇首节点剩余能量发起簇重构.在Omnet＋＋仿真平台下模拟实验结果显示,EERP有效的均衡了全网节点能耗,显著延长了网络生命周期.     

Integrated Energy and Trust-Based Semi-Markov Prediction for Lifetime Maximization in Wireless Sensor Networks

Many of today’s computing and communication models are distributed systems that are composed of autonomous computational entities that communicate with each other, usually by passing messages. Distributed systems encompass a variety of applications and wireless sensor networks (WSN) is an important application of it. The tiny, multiple functionality and low power sensor nodes are considered to be interconnected in the WSN for efficient process of aggregating and transmitting the data to the base station. The clustering-based schemes of sensor networks are capable of organizing the network through the utilization of a specifically designated node termed as the cluster head for the objective of energy conservation and data aggregation. Further, the cluster head is responsible for conveying potential information collected by the cluster member nodes and aggregate them before transmitting it to the base station. In this paper, a Reliable Cluster Head Selection Technique using Integrated Energy and Trust-based Semi-Markov Prediction (RCHST-IETSMP) is proposed with the view to extend the lifetime of sensor networks. This proposed RCHST-IETSMP incorporated two significant parameters associated with energy and trust for effective selection of cluster head facilitated through the merits of Semi-Markoc prediction integrated with the Hyper Erlang distribution process. The simulation results of the proposed RCHST-IETSMP scheme is proving to be efficient in upholding the residual energy of the network and the throughput to a maximum level of 23% and 19% predominant to the trust and energy-based clustering schemes considered for investigation.

     

RK-Energy Efficient Routing Protocol for Wireless Body Area Sensor Networks

Wireless Body Area Sensor Networks are related to the monitoring of human physiological parameters. In these small sized machines called sensors are used to observe the physiological parameters. They are small in size which makes them easy to carry around but on the same time they have a serious problem that they can carry with them a very small sized battery. The sensors deplete their energy while sensing the parameter, communication of the sensed data to the base station and also in processing of the observed data. The sensors cannot be charged on regular intervals because they are attached to human body and charging them may not be an easy option. In this paper an energy efficient routing protocol is presented which uses sensors in WBASN to observe parameter in much efficient way. The concept of multi hopping has been utilized with forwarder node. Forwarder node accepts data from sensor nodes which are far from the sink. After accepting data the forwarder node forwards this data to the sink node. This scheme is compared with an existing scheme with which it has been compared in terms of four parameters which are residual energy, network stability and life time, throughput and path loss.

     

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

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

WSN中一种基于剩余能量级别的负载均衡路由协议

文中提出了一种WSN中基于剩余能量级别的负载均衡的分簇路由协议REICRP.在簇的建立阶段,RELCRP采用了基于优先级的簇头选取策略,高优先级的节点能更早地广播簇头竞选通告,从而避免剩余能量低的节点成为簇头.簇间通信采用单跳一多跳混合传输模式,簇头节点根据剩余能量级别切换传输方式,以缓解"热点"问题.仿真结果表明:RELCRP有效地均衡了网络中节点的能量消耗,延长了网络的生存时间.     

Energy Efficient Layered Cluster Head Rotation Based Routing Protocol for Underwater Wireless Sensor Networks

Energy efficiency is of paramount concern in underwater sensor networks. The very nature of underwater environment makes it difficult to deploy an energy efficient network that enhances network lifetime. The existing protocols of terrestrial networks cannot be implemented directly to underwater scenarios and as such new protocols have to be designed because of speed of signal propagation under water. Improving the energy efficiency in UWSNs is an active area of research and many protocols to that end have been proposed. The routing protocol that this paper proposes is Energy Efficient Layered Cluster Head Rotation (EE-LCHR) routing protocol. This protocol makes use of the multi sink architecture and creates virtual layers containing a number of sensor nodes such that the hop count from the sensor nodes in a particular layer to the surface sink is the same. Also each layer has a number of clusters with a cluster head that keeps on rotating depending on the fitness value of the sensor nodes. The proposed protocol as compared to other extant protocols like EE-DBR and DBR improves network lifetime. The presence of virtual layers and rotation of cluster heads together ensure that energy balance is better achieved in our proposed protocol which leads to an enhanced network lifetime.

     

Cluster-Head Restricted Energy Efficient Protocol (CREEP) for Routing in Heterogeneous Wireless Sensor Networks

A magnanimous number of collaborative sensor nodes make up a Wireless Sensor Network (WSN). These sensor nodes are outfitted with low-cost and low-power sensors. The routing protocols are responsible for ensuring communications while considering the energy constraints of the system. Achieving a higher network lifetime is the need of the hour in WSNs. Currently, many network layer protocols are considering a heterogeneous WSN, wherein a certain number of the sensors are rendered higher energy as compared to the rest of the nodes. In this paper, we have critically analysed the various stationary heterogeneous clustering algorithms and assessed their lifetime and throughput performance in mobile node settings also. Although many newer variants of Distributed Energy-Efficiency Clustering (DEEC) scheme execute proficiently in terms of energy efficiency, they suffer from high system complexity due to computation and selection of large number of Cluster Heads (CHs). A protocol in form of Cluster-head Restricted Energy Efficient Protocol (CREEP) has been proposed to overcome this limitation and to further improve the network lifetime by modifying the CH selection thresholds in a two-level heterogeneous WSN. Simulation results establish that proposed solution ameliorates in terms of network lifetime as compared to others in stationary as well as mobile WSN scenarios.     

An Adaptive Fuzzy-Based Clustering and Bio-Inspired Energy Efficient Hierarchical Routing Protocol for Wireless Sensor Networks

Wireless Personal Communications - Wireless Sensor Network (WSN) based Communication has been devised for exchanging data with low cost, minimal maintenance, and for more convenience. These...     

Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks

We consider the joint optimal design of the physical, medium access control (MAC), and routing layers to maximize the lifetime of energy-constrained wireless sensor networks. The problem of computing lifetime-optimal routing flow, link schedule, and link transmission powers for all active time slots is formulated as a non-linear optimization problem. We first restrict the link schedules to the class of interference-free time division multiple access (TDMA) schedules. In this special case, we formulate the optimization problem as a mixed integerconvex program, which can be solved using standard techniques. Moreover, when the slots lengths are variable, the optimization problem is convex and can be solved efficiently and exactly using interior point methods. For general non-orthogonal link schedules, we propose an iterative algorithm that alternates between adaptive link scheduling and computation of optimal link rates and transmission powers for a fixed link schedule. The performance of this algorithm is compared to other design approaches for several network topologies. The results illustrate the advantages of load balancing, multihop routing, frequency reuse, and interference mitigation in increasing the lifetime of energy-constrained networks. We also briefly discuss computational approaches to extend this algorithm to large networks     

一种基于分簇的无线传感器网络安全路由协议

LEACH协议首次提出在WSNs（无线传感器网络）中采用动态分簇的层次结构,大大降低了能耗,提高了网络寿命。基于集中式簇头选举的LEACH-C协议比LEACH更节省能耗,但二者都没有考虑安全性,从而可能遭遇各种攻击。论文采用动态密钥分配对LEACH-C进行了安全性改进,并提出了一种适用于集中式控制的安全分簇路由协议SLEACH-C。     

Network Lifetime Maximization for Estimation in Multihop Wireless Sensor Networks

We consider the distributed estimation by a network consisting of a fusion center and a set of sensor nodes, where the goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional. In energy-limited wireless sensor networks, both local quantization and multihop transmission are essential to save transmission energy and thus prolong the network lifetime. The network lifetime optimization problem includes three components: i) optimizing source coding at each sensor node, ii) optimizing source throughput of each sensor node, and iii) optimizing multihop routing path. Fortunately, source coding optimization can be decoupled from source throughput and multihop routing path optimization, and is solved by introducing a concept of equivalent 1-bit MSE function. Based on the optimal source coding, the source throughput and multihop routing path optimization is formulated as a linear programming (LP) problem, which suggests a new notion of character-based routing. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.