CBE2R: clustered-based energy efficient routing protocol for underwater wireless sensor network

Routing in undersea environment is one of the challenging research areas due to the nature of acoustic channel and underwater harsh environment. In underwater environment, the major challenges are propagation delay, high bit error rates, limited bandwidth, uncontrolled node mobility, water current, 3D deployment and limited resources. Hence, designing an efficient and communication protocols for underwater environment is a challenging issue. To control the node mobility and prolong the battery power of the nodes, we proposed Clustered-Based Energy Efficient Routing (CBE2R) protocol. CBE2R controls the node mobility and prolongs the battery power of nodes by dividing the water depth into seven numbers of layers from top to seabed. CBE2R prolongs the battery power through powerful static courier nodes which are deployed from sea surface to seabed on different layers. Clustered-based routing mechanism with highest weighted value for data forwarding is based on seabed to bottom layer courier nodes through ordinary nodes. Bottom layer courier nodes collects the information from ordinary nodes and forwards to surface sink nodes by maximum power levels (p₁, p₂, …., p_n-1) through courier nodes which are deployed in different layers. For performance analysis the NS2.30 with AquaSim is used. The simulation results of CBE2R are compared with energy efficient REEP, EMGGR, and DRP. From simulation results it is observed that the performance CBE2R is higher than REEP, EMGGR and DRP.     

一种响应型无线传感器网络路由算法

提出一种节能型无线传感器网络路由算法——TEENNEW.该算法利用能量模型确定了最优簇头数,在簇头选取阶段考虑了节点剩余能量;在数据传输阶段,该算法根据距离和能量建立簇头与基站之间的多跳通信路径.与传统的TEEN协议相比,TEENNEW算法延长了网络的生命周期,有效均衡了节点能耗.     

Energy efficient routing with delay guarantee for sensor networks

The paper presents a routing algorithm that maximizes the lifetime of a sensor network in which all data packets are destined for a single collection node. Lifetime is maximized by adjusting the number of packets traversing each node. The adjustment is carried out by transmitting over alternative routes. The first part of the paper assumes that the worst case delay resulting from energy efficient routing is less than the maximum tolerable value. Ignoring the delay constraint of the network, the routes are selected as the solution to a linear programming (LP) problem in which the objective is to maximize the minimum lifetime of each node. The solution is implemented in a centralized algorithm, and then approximated by an iterative algorithm based on least cost path routing, in which each step is implemented efficiently in a distributed manner. The second part of the paper incorporates delay guarantee into energy efficient routing by constraining the length of the routing paths from each sensor node to the collection node. Simulations reveal that the lifetime of the network increases significantly by optimal routing, and including delay constraint in energy efficient routing improves the network performance since the delay of the network keeps increasing as the delay constraint is relaxed beyond the value at which the optimal lifetime is achieved. Research supported by National Science Foundation under Grant CMS-0408627 and California Department of Transportation. Sinem Coleri Ergen received the BS degree in electrical and electronics engineering from Bilkent University, Ankara, Turkey, in 2000, and the M.S. and Ph.D. degrees in electrical engineering and computer sciences from University of California Berkeley (UCB), in 2002 and 2005. Since January 2006, she has been a postdoctoral researcher in electrical engineering at UCB. Her research interests are in wireless communications and networking with a current focus on energy efficient system design for sensor networks. She is a member of the Sensor Networks for Traffic Monitoring project at UCB. She received Regents Fellowship from University of California Berkeley in 2000. Pravin Varaiya is Nortel Networks Distinguished Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. From 1975 to 1992 he was also Professor of Economics at Berkeley. From 1994 to 1997 he was Director of the California PATH program, a multi-university research program dedicated to the solution of Californias transportation problems. His current research is concerned with communication networks, transportation, and hybrid systems. He has taught at MIT and the Federal University of Rio de Janeiro. Varaiya has held a Guggenheim Fellowship and a Miller Research Professorship. He received an Honorary Doctorate from LInstitut National Polytechnique de Toulouse, and the Field Medal of the IEEE Control Systems Society. He is a Fellow of IEEE and a member of the National Academy of Engineering. He is on the editorial board of several journals, including “Discrete Event Dynamical Systems” and “Transportation Research—C”. He has co-authored three books and more than 250 technical papers. The second edition of “High-Performance Communication Networks” (with Jean Walrand) was published by Morgan-Kaufmann in 2000. “Structure and interpretation of signals and systems" (with Edward Lee) was published by Addison-Wesley in 2003. Varaiya is a member of the Board of Directors of Sensys Networks.     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

基于提前选择策略的传感器网络的分层路由协议

能量的有限性严重限制了无线传感器网络的发展,而数据冗余问题在分层路由协议中广泛存在,网络的密度越高,数据冗余问题越严重.现介绍一种新的方法来解决这个问题.在群建立之前从网络中选取一些已分配的节点,而这些操作类似于群首节点的选取过程,这些被选取的节点将用来完成整个网络的数据融合过程.仿真结果分析表明采用了这种策略之后网络生存期延长了很多.     

Radio range adjustment for energy efficient wireless sensor networks

In wireless ad hoc sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. Topology management schemes such as GAF put the redundant nodes for routing to sleep in order to save the energy. The radio range will affect the number of neighbouring nodes, which collaborate to forward data to a base station or sink. In this paper we study a simple linear network and deduce the relationship between optimal radio range and traffic. We find that half of the power can be saved if the radio range is adjusted appropriately compared with the best case where equal radio ranges are used.     

An efficient distributed routing protocol for wireless sensor networks with mobile sinks

Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd.     

An energy efficient and QoS aware routing protocol for wireless sensor and actuator networks

Wireless sensor and actuator networks are composed of sensor and actuator nodes interconnected via wireless links. The actuators are responsible for taking prompt decisions and react accordingly to the data gathered by sensor nodes. In order to ensure efficient actions in such networks, we propose a new routing protocol that provides QoS in terms of delay and energy consumption. The network is organized in clusters supervised by CHs (Cluster-Heads), elected according to important metrics, namely the energy capability, the riches of connectivity, which is used to select the CH with high node density, and the accessibility degree regarding all the actuators. The latter metric is the distance in number of hops of sensor nodes relative to the actuator nodes. This metric enhances more the network reliability by reducing the communication delay when alerting the actuator nodes, and hence, reducing the energy consumption. To reach efficiently the actuator nodes, we design a delay and energy sensitive routing protocol based on-demand routing approach. Our protocol incurs less delay and is energy efficient. We perform an evaluation of our approach through simulations. The obtained results show out performance of our approach while providing effective gain in terms of communication delay and energy consumption.     

无线传感器网络路由协议性能研究

无线传感器网络是目前网络研究的热点,其路由协议的设计是最具挑战性的问题之一,对目前典型的无线传感器网络的路由协议进行分类研究和性能分析,设计并实现了在NS2环境下典型协议的仿真场景和性能分析比较。对无线传感器网络路由协议的研究和组网具有参考指导意义。     

DRP: An energy‐efficient routing protocol for underwater sensor networks

The features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy.     

An unequal cluster-based routing protocol in wireless sensor networks

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime. Guihai Chen obtained his B.S. degree from Nanjing University, M. Engineering from Southeast University, and PhD from University of Hong Kong. He visited Kyushu Institute of Technology, Japan in 1998 as a research fellow, and University of Queensland, Australia in 2000 as a visiting professor. During September 2001 to August 2003, he was a visiting professor at Wayne State University. He is now a full professor and deputy chair of Department of Computer Science, Nanjing University. Prof. Chen has published more than 100 papers in peer-reviewed journals and refereed conference proceedings in the areas of wireless sensor networks, high-performance computer architecture, peer-to-peer computing and performance evaluation. He has also served on technical program committees of numerous international conferences. He is a member of the IEEE Computer Society. Chengfa Li was born 1981 and obtained his Bachelor’s Degree in mathematics in 2003 and his Masters Degree in computer science in 2006, both from Nanjing University, China. He is now a system programmer at Lucent Technologies Nanjing Telecommunication Corporation. His research interests include wireless ad hoc and sensor networks. Mao Ye was born in 1981 and obtained his Bachelor’s Degree in computer science from Nanjing University, China, in 2004. He served as a research assistant At City University of Hong Kong from September 2005 to August 2006. He is now a PhD candidate with research interests in wireless networks, mobile computing, and distributed systems. Jie Wu is a professor in the Department of Computer Science and Engineering at Florida Atlantic University. He has published more than 300 papers in various journal and conference proceedings. His research interests are in the areas of mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. Dr. Wu serves as an associate editor for the IEEE Transactions on Parallel and Distributed Systems and several other international journals. He served as an IEEE Computer Society Distinguished Visitor and is currently the chair of the IEEE Technical Committee on Distributed Processing (TCDP). He is a member of the ACM, a senior member of the IEEE, and a member of the IEEE Computer Society.     

水下无线传感器网络DBR路由协议研究

DBR(Depth Based Routing)协议是水下无线传感器网络中第一个基于深度信息的路由协议。分析了水下无线传感器网络中DBR路由协议特性,详细阐述了DBR协议中的网络拓扑结构、数据转发机制及其存在的一些问题。并简单介绍了目前有关DBR的改进路由协议。     

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.     

Data aggregated maximum lifetime routing for wireless sensor networks

In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing so that the network lifetime can be maximized. A recursive smoothing method is adopted to overcome the non-differentiability of the objective function. We derive the necessary and sufficient conditions for achieving the optimality of the optimization problem and design a distributed gradient algorithm accordingly. Extensive simulations are carried out to show that the proposed algorithm can significantly reduce the data traffic and improve the network lifetime. The convergence property of the algorithm is studied under various network configurations.     

Enhanced mobility routing protocol for wireless sensor network

Wireless Networks - Recently, the routing protocol for low power and lossy networks (RPL) was standardized and is considered as the default standard for routing over the low power and lossy...     

An efficient routing protocol for wireless networks

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and secondto-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.This work was supported in part by the Advanced Research Projects Agency (ARPA) under contract F19628-93-C-0175 and by the Office of Naval Research under Contract No. N-00014-92-J-1807.     

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

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

An intelligent hybrid MAC protocol for a sensor-based personalized healthcare system

Sensors based on personalized healthcare systems have been widely used in the medical field. However, energy limitations have greatly hindered the further development of medical sensors. For the traditional Medium Access Control (MAC) protocol, the duration of low-power listening is fixed because it ignores that the available energy of sensors is different in some situations, which leads to a high delay and low energy utilization. In this paper, a Maximum Listening Length MAC (MLL-MAC) protocol is proposed to fully utilize the energy in the sensor-based systems. The MLL-MAC protocol is an improvement of the Receiver-Initiated (RI) MAC protocol. The main advance is that the sensor node performs the following additional operations: (1) The sender sends a beacon when it wakes up and sends data, thus establishing a communication link with the receiver in the listening state; (2) The receiver keeps listening as long as possible to reduce the delay when it wakes up and listens to the channel, which is different from the previous strategy in which the node turns into a sleep state immediately without receiving data. Furthermore, the sensor node can dynamically determine whether to send beacons and prolong listening duration according to its available energy level. The MLL-MAC protocol is evaluated through theoretical analysis and experimental results. The results show that, compared with the RI-MAC protocol, the MLL-MAC protocol can reduce the average end-to-end delay by 41.4% and improve the energy utilization by 15.1%.     

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…     

EFFORT: energy‐efficient opportunistic routing technology in wireless sensor networks

The utilization of limited energy in wireless sensor networks (WSNs) is the critical concern, whereas the effectiveness of routing mechanisms substantially influence energy usage. We notice that two common issues in existing specific routing schemes for WSNs are that (i) a path may traverse through a specific set of sensors, draining out their energy quickly and (ii) packet retransmissions over unreliable links may consume energy significantly. In this paper, we develop an energy‐efficient routing scheme (called EFFORT) to maximize the amount of data gathered in WSNs before the end of network lifetime. By exploiting two natural advantages of opportunistic routing, that is, the path diversity and the improvement of transmission reliability, we propose a new metric that enables each sensor to determine a suitable set of forwarders as well as their relay priorities. We then present EFFORT, a routing protocol that utilizes energy efficiently and prolongs network lifetime based on the proposed routing metric. Simulation results show that EFFORT significantly outperforms other routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.