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 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…     

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...     

Integration of geographic and hierarchical routing protocols for energy saving in wireless sensor networks with mobile sink

Wireless Networks - Wireless sensor networks (WSNs) is used for the internet of things, and Pervasive/Ubiquitous computing. These networks consist of intelligent nodes which sense data and forward...     

A survey on routing protocols for wireless sensor networks

Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues.     

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.     

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

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

Correction to: Integration of geographic and hierarchical routing protocols for energy saving in wireless sensor networks with mobile sink

Wireless Networks - The original version of this article unfortunately contained an error in the author’s affiliation.     

基于簇结构的无线传感器网络路由研究综述

介绍了典型分簇无线传感器网络路由协议的分类,总结了分簇路由协议的研究进展。针对无线传感器网络从同构型网络向异构型网络发展的趋势和特点,指出了路由协议向节点间相互协作的发展方向,并且在设计路由协作算法时可采用与无线传感器网络极为相似的多Agent系统模型。     

Topology control of tactical wireless sensor networks using energy efficient zone routing

The US Department of Defense (DoD) routinely uses wireless sensor networks (WSNs) for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE), Low Energy Adaptive Cluster Head routing (LEACH), and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.     

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 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...     

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

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

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

RETT-gen: A globally efficient routing protocol for wireless sensor networks by equalising sensor energy and avoiding energy holes

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. Once deployed, the sensor nodes are usually inaccessible to the user, and thus replacement of the energy resource 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 entire network. Several routing protocols have been proposed to improve the effective lifetime of the network with limited energy supply. In this paper, we propose routing based on energy–temperature transformation, RETT-gen, a scalable energy-efficient clustering and routing protocol designed for wireless sensor networks. The main goal of RETT-gen is to evenly distribute the energy load among all the sensor nodes in the network so that there are no overly-utilized sensor nodes that will run out of energy before the others. To achieve this goal, RETT-gen uses heat conductivity as a metaphor and uses the heat dissipation difference equations. In RETT-gen, we transform the expected lifetime of each sensor node to an equivalent temperature, and then by using the heat dissipation equations, we find the hottest path for sending data to the base station, which will not always be the shortest path. We evaluate the performance of the RETT-gen protocol via simulations, and compare it to the performance of well-known routing protocols (i.e. LEACH [W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in: Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS’00), 2000.] and EEUC [C. Li, M. Ye, G. Chen, J. Wu, An energy-efficient unequal clustering mechanism for wireless sensor networks, in: Proceedings of the International IEEE Conference on Mobile Adhoc and Sensor Systems (MASS), 2005.]). Simulation results show that by equalizing the sensor nodes energy, RETT-gen insures that the lifetime of the entire sensor network is maximized, the connectivity in a sensor network is maintained for as long as possible, and that the residual energy of the entire network is of the same order.     

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.     

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.

     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply

Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance. Kai Zeng received his B.E. degree in Communication Engineering and M.E. degree in Communication and Information System both from Huazhong University of Science and Technology, China, in 2001 and 2004, respectively. He is currently a Ph.D. student in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. His research interests are in the areas of wireless ad hoc and sensor networks with emphases on energy-efficient protocol, cross-layer design, routing, and network security. Kui Ren received his B. Eng. and M. Eng. both from Zhejiang University, China, in 1998 and 2001, respectively. He worked as a research assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences from March 2001 to January 2003, at Institute for Infocomm Research, Singapore from January 2003 to August 2003, and at Information and Communications University, South Korea from September 2003 to June 2004. Currently he is a PhD candidate in the ECE department at Worcester Polytechnic Institute. His research interests include ad hoc/sensor network security, wireless mesh network security, Internet security, and security and privacy in ubiquitous computing environments. Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained her Ph.D. degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc. degree from Nanyang Technological University, Singapore, in 1998, the M.E. degree and the B.E. degree in Computer Science and Engineering from Xi’an Jiaotong University, China, in 1996 and 1993 respectively. From December 1997 to July 1999, she worked as a Research Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the areas of ad hoc and sensor networks, with emphases on network and system security and routing. Patrick J. Moran received his MSEE from Carnegie Mellon University, 1993. He is currently the CTO and Founder of AirSprite Technologies Inc, and is driving the company to utilize advanced networking protocols for low-power wireless network systems. His interests include architecture, protocols and high performance implementation of emerging communication technologies. Patrick has been involved in deployment of communication and signal processing technologies since graduating from the University of Minn. in 1986. He holds several patents and publications relating to storage, medical and data processing information systems. He is a member of the IEEE.