Dynamic energy efficient routing protocol in wireless sensor networks

Wireless Networks - Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support...     

Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network (WSN). Although the hierarchical routing protocol can effectively cope with large-scale application scenarios, how to elect a secure cluster head and balance the network load becomes an enormous challenge. In this paper, a Trust Management-based and ​Low Energy Adaptive Clustering Hierarchy protocol (LEACH-TM) is proposed. In LEACH-TM, by using the number of dynamic decision cluster head nodes, residual energy and density of neighbor nodes, the size of the cluster can be better constrained to improve energy efficiency, and avoid excessive energy consumption of a node. Simultaneously, the trust management scheme is introduced into LEACH-TM to defend against internal attacks. The simulation results show that, compared with LEACH-SWDN protocol and LEACH protocol, LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption, and can effectively mitigate the influence of malicious nodes on cluster head selection, which can greatly guarantee the security of the overall network.     

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.     

A dual-mode energy efficient encryption protocol for wireless sensor networks

This paper presents a novel link-layer encryption protocol for wireless sensor networks. The protocol design aims to reduce energy consumption by reducing security related communication overhead. This is done by merging security related data of consecutive packets. The merging (or combining packets) based on simple mathematical operations helps to reduce energy consumption by eliminating the requirement to send security related fields in headers and trailers. We name our protocol as the Compact Security Protocol referred to as C-Sec. In addition to energy savings, the C-Sec protocol also includes a unique security feature of hiding the packet header information. This feature makes it more difficult to trace the flow of wireless communication, and helps to minimize the cost of defending against replay attacks. We performed rigorous testing of the C-Sec protocol and compared it with well-known protocols including TinySec, MiniSec, SNEP and Zigbee. Our performance evaluation demonstrates that the C-Sec protocol outperforms other protocols in terms of energy savings. We also evaluated our protocol with respect to other performance metrics including queuing delay and error probability.     

A stable energy efficient clustering protocol for wireless sensor networks

Sensor networks comprise of sensor nodes with limited battery power that are deployed at different geographical locations to monitor physical events. Information gathering is a typical but an important operation in many applications of wireless sensor networks (WSNs). It is necessary to operate the sensor network for longer period of time in an energy efficient manner for gathering information. One of the popular WSN protocol, named low energy adaptive clustering hierarchy (LEACH) and its variants, aim to prolong the network lifetime using energy efficient clustering approach. These protocols increase the network lifetime at the expense of reduced stability period (the time span before the first node dies). The reduction in stability period is because of the high energy variance of nodes. Stability period is an essential aspect to preserve coverage properties of the network. Higher is the stability period, more reliable is the network. Higher energy variance of nodes leads to load unbalancing among nodes and therefore lowers the stability period. Hence, it is perpetually attractive to design clustering algorithms that provides higher stability, lower energy variance and are energy efficient. In this paper to overcome the shortcomings of existing clustering protocols, a protocol named stable energy efficient clustering protocol is proposed. It balances the load among nodes using energy-aware heuristics and hence ensures higher stability period. The results demonstrate that the proposed protocol significantly outperforms LEACH and its variants in terms of energy variance and stability period.     

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

     

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…     

Reliable and energy aware query-driven routing protocol for wireless sensor networks

Wireless sensor networks become very attractive in the research community, due to their applications in diverse fields such as military tracking, civilian applications and medical research, and more generally in systems of systems. Routing is an important issue in wireless sensor networks due to the use of computationally and resource limited sensor nodes. Any routing protocol designed for use in wireless sensor networks should be energy efficient and should increase the network lifetime. In this paper, we propose an efficient and highly reliable query-driven routing protocol for wireless sensor networks. Our protocol provides the best theoretical energy aware routes to reach any node in the network and routes the request and reply packets with a lightweight overhead. We perform an overall evaluation of our protocol through simulations with comparison to other routing protocols. The results demonstrate the efficiency of our protocol in terms of energy consumption, load balancing of routes, and network lifetime.     

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.     

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.     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

A novel efficient clustering protocol for energy harvesting in wireless sensor networks

Wireless Networks - The utilization of wireless sensor networks (WSNs) is proliferating in our daily life. It depends on the environmental monitoring such as weather tracking, battled field, etc....     

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.     

无线传感器网络中的安全GEAR路由协议

GEAR路由是无线传感器网络中一种高效的位置和能量感知的地理路由协议，在抵御路由攻击方面有较好的特性，但是GEAR路由不能抵御虚假路由、女巫、选择性转发等攻击。针对该问题，提出了一种适合无线传感器网络特征的、基于位置密钥对引导模型的安全GEAR路由协议SGEAR，并对该协议进行了性能分析，分析显示在较小的系统开销下，SGEAR能有效抑制上述攻击及DoS攻击。     

Trust-aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.     

基于最小跳数的无线传感器网络路由协议

在分析了最小跳数路由算法局限性的基础上对该算法进行了改进,充分考虑了无线传感器网络的跳数、能量、负载均衡等问题。改进后的算法使得传感器的某些节点不会因为频繁使用而迅速死亡,数据包可以沿着最优的路径向网关节点发送。仿真结果显示,改进后的算法可以有效地提高无线传感器网络的可靠性和稳定性,延长了网络的通信时间。     

A distributed algorithm for energy efficient and fault tolerant routing in wireless sensor networks

Wireless Networks - Energy conservation and fault tolerance are the most two important challenging issues for the development of large scale wireless sensor networks (WSNs). Failure of cluster...     

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.