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.     

基于LEACH协议的无线传感器网络路由算法的改进与仿真

针对无线传感器网络中传感器能量有限的问题,从路由算法的角度出发,提出LEACH协议的低功耗改进方案.本文采用划定区域的方式对LEACH协议中的簇头选举进行改进,从而减少网络中节点分布不均匀的情况对簇头节点能量损耗所造成的影响,并使用NS-2进行协议改进前后的仿真.仿真实验结果表明,协议改进后网络生存期有效增长,能量消耗...     

Fuzzy Logic Based Distance and Energy-Aware Routing Protocol in Delay-Tolerant Mobile Sensor Networks

In challenged networks such as Wireless Sensor Networks, limitations such as nodes mobility, short radio range and sparse network density can prevent communications among nodes. Consequently, it can result in long delays in exchanging messages among nodes. Designing Delay-Tolerant Networks is considered to be an approach for dealing with lengthy breakdown of communication between nodes. Using multi-replica methods seems rational for these networks. However, a majority of these methods inject a large amount of replications of a message in the network so as to enhance message delivery probability which consequently leads to the loss of energy and reduction of network efficiency. Two major issues should be considered to achieve data delivery in such challenging networking environments: a routing strategy for the network and a buffer management policy. This study proposes a new routing protocol called Fuzzy-Logic based Distance and Energy Aware Routing protocol (FLDEAR) in delay tolerant mobile sensor network. A FLDEAR is a distance and energy aware protocol that reduces the number of message replications and uses two fuzzy inference systems in routing and buffer management. The results of conducted simulations indicated that this routing algorithm can be used for enhancing data packet delivery ratios and reducing data transmission overhead than several current Delay-Tolerant Mobile Sensor Networks routing protocols.     

Increasing network lifetime by balancing node energy consumption in heterogeneous sensor networks

Sensor nodes are powered by battery and have severe energy constraints. The typical many‐to‐one traffic pattern causes uneven energy consumption among sensor nodes, that is, sensor nodes near the base station or a cluster head have much heavier traffic burden and run out of power much faster than other nodes. The uneven node energy dissipation dramatically reduces sensor network lifetime. In a previous work, we presented the chessboard clustering scheme to increase network lifetime by balancing node energy consumption. To achieve good performance and scalability, we propose to form a heterogeneous sensor network by deploying a few powerful high‐end sensors in addition to a large number of low‐end sensors. In this paper, we design an efficient routing protocol based on the chessboard clustering scheme, and we compute the minimum node density for satisfying a given lifetime constraint. Simulation experiments show that the chessboard clustering‐based routing protocol balances node energy consumption very well and dramatically increases network lifetime, and it performs much better than two other clustering‐based schemes. Copyright © 2006 John Wiley & Sons, Ltd.     

基于拓扑感知的水下传感网络路由

由于水下传感网络的高时延、低带宽和高能耗等特性,建立路由协议仍存在挑战。为此,提出基于拓扑感知的水下传感网络路由(TAR)。TAR路由先通过交互Beacon包,使每个节点获取网络拓扑信息,并建立邻居信息表。再依据节点剩余能量和链路的可靠性,择优选择下一跳转发节点,进而提高路由的稳定性,平衡节点间能耗。仿真结果表明,提出的TAR路由增强了路由稳定性,并减少了节点的能耗。     

Energy-Aware Data Aggregation for Grid-Based Wireless Sensor Networks with a Mobile Sink

Wireless sensor networks (WSNs) are made up of many small and highly sensitive nodes that have the ability to react quickly. In WSNs, sink mobility brings new challenges to large-scale sensor networks. Almost all of the energy-aware routing protocols that have been proposed for WSNs aim at optimizing network performance while relaying data to a stationary gateway (sink). However, through such contemporary protocols, mobility of the sink can make established routes unstable and non-optimal. The use of mobile sinks introduces a trade-off between the need for frequent rerouting to ensure optimal network operation and the desire to minimize the overhead of topology management. In this paper, in order to reduce energy consumption and minimize the overhead of rerouting frequency, we propose an energy-aware data aggregation scheme (EADA) for grid-based wireless sensor networks with a mobile sink. In the proposed scheme, each sensor node with location information and limited energy is considered. Our approach utilizes location information and selects a special gateway in each area of a grid responsible for forwarding messages. We restrict the flooding region to decrease the overhead for route decision by utilizing local information. We conducted simulations to show that the proposed routing scheme outperforms the coordination-based data dissemination scheme (CODE) (Xuan, H. L., & Lee, S. Proceedings of the Sensor Networks and Information Processing Conference, pp. 13–18, 2004).     

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.     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

Unequal Clustering Protocols for Wireless Sensor Networks—Taxonomy,Comparison and Simulation

Wireless Sensor Network (WSN) consists of randomly distributed sensor nodes which can collect, process, route and transmit data from their respective environment. Most of the research on WSN is oriented towards optimizing utilization of finite resources of Sensor Nodes to increase the overall network operative time. Recent literature on WSNs reveals that hierarchical routing unequal clustering methodologies are gaining popularity due to energy efficiency, load balancing and scalability. In literature, numerous surveys on clustering methodologies are available which address different equal clustering methods. The unequal clustering protocols, which have their own attributes viz. balance load distribution, hot spot mitigation and energy efficiency, are comparatively less explored. This motivated us to undertake the present study on the taxonomy, comparison and simulation analysis of different methodologies pertaining to less explored unequal clustering protocols. Our base metrics for comparison of different unequal clustering protocols are scalability, energy efficiency & load balancing capability of the resulting network. A comprehensive discussion has also been presented to highlight the various advantages and disadvantages of different unequal clustering protocols. Further, we have summarized the study of unequal clustering protocols in the tabular form.

     

Overlapping particle swarms for energy-efficient routing in sensor networks

Sensor networks are traditionally built using battery-powered, collaborative devices. These sensor nodes do not rely on dedicated infrastructure services (e.g., routers) to relay data. Rather, a communal effort is employed where the sensor nodes both generate data as well as forward data for other nodes. A routing protocol is needed in order for the sensors to determine viable paths through the network, but routing protocols designed for wired networks and even ad hoc networks are not sufficient given the energy overhead needed to operate them. We propose an energy-aware routing protocol, based on overlapping swarms of particles, that offers reliable path selection while reducing the energy consumption for the route selection process. Our particle-based routing with overlapping swarms for energy-efficiency algorithm shows promise in extending the life of battery-powered networks while still providing robust routing functionality to maintain network reliability.     

Design of routing protocol for multi-sink based wireless sensor networks

Wireless Networks - An efficient routing protocol for a wireless sensor network (WSN) with multiple sinks is proposed. Sensor nodes containing three-sector antennas are deployed randomly in a...     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

Routing in mobile wireless sensor network: a survey

The Mobile Wireless Sensor Network (MWSN) is an emerging technology with significant applications. The MWSN allows the sensor nodes to move freely and they are able to communicate with each other without the need for a fixed infrastructure. These networks are capable of out-performing static wireless sensor networks as they tend to increase the network lifetime, reduce the power consumption, provide more channel capacity and perform better targeting. Usually routing process in a mobile network is very complex and it becomes even more complicated in MWSN as the sensor nodes are low power, cost effective mobile devices with minimum resources. Recent research works have led to the design of many efficient routing protocols for MWSN but still there are many unresolved problems like retaining the network connectivity, reducing the energy cost, maintaining adequate sensing coverage etc. This paper addresses the various issues in routing and presents the state of the art routing protocols in MWSN. The routing protocols are categorized based on their network structure, state of information, energy efficiency and mobility. The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.     

A load balancing energy efficient clustering algorithm for MANETs

Nodes in mobile ad hoc Networks (MANETs) are characterized by their limited resources. Hence, the concept of clustering was introduced to allow spacial reuse of bandwidth and to minimize routing overhead. However, node mobility perturbs the stability of the network and affects the performance of other protocols such as scheduling, routing, and resource allocation, which makes re‐clustering the network to maintain up‐to‐date information at each node unavoidable. Consequently, clustering models for MANETS should be carefully designed while taking into consideration the fact that mobile nodes are energy constrained. In this paper, we propose a dynamic energy‐efficient clustering algorithm that prolongs the network lifetime by electing cluster‐heads taking into consideration, in addition to other parameters such as mobility, their residual energies and making them dynamically monitor their energy consumption to either diminish the number of their cluster‐members or relinquish their roles. We have evaluated the performance of the proposed clustering model and compared it with other related clustering approaches found in the literature. Obtained results show the efficiency of the proposed algorithm. Copyright © 2010 John Wiley & Sons, Ltd.     

Secure and Energy-Efficient Traffic-Aware Key Management Scheme for Wireless Sensor Network

In Wireless Sensor Network (WSN), a sensor node may communicate with a small set of neighbor sensor nodes. Existing key management schemes, did not consider this communication between these nodes. They establish shared keys for all pairs of neighbor sensor nodes. When the number of sensor nodes in WSN is augmented, large number of keys is to be loaded in each sensor node, which in turn causes supplementary energy consumption. If any two close sensor nodes are seldom in the active-state the assignment of shared keys may be gratuitous, since they may be hardly exploited.In this paper, based on this information, secure and Energy-Efficient Traffic Aware key Management (EETKM) is developed for WSN. This determines shared keys for active sensors which takes part in the direct communication. In order to broadcast keys without retransmission or acknowledgements, the proposed scheme gives an efficient Re-keying mechanism. The proposed scheme attains high connectivity which is shown through numerical results. The proposed scheme is applied for various routing protocols and the simulation results shows the stronger resilience, low energy consumption and increased delivery ratio.     

Lightweight distributed geographical: a lightweight distributed protocol for virtual clustering in geographical forwarding cognitive radio sensor networks

Recent literature characterizes future wireless sensor networks (WSN) with dynamic spectrum capabilities. When cognitive radio is introduced as a main component of a network, a network management protocol is needed to ensure network connectivity and stability especially in highly dynamic environments. Implementing such protocols in WSN opens more challenges because of the resource constraints in sensor networks. We propose a distributed lightweight solution that fulfills this need for WSN. With this protocol, a node in a multichannel environment is quickly able to establish a control channel with neighboring nodes. Lightweight distributed geographical either increases or reduces the coverage area of the control channel based on perceived interference and adequately takes care of intersecting nodes with minimal overhead. By identifying local minima nodes, it also has the potentiality of reducing route failure by 70% further reducing the time and energy overhead incurred by switching to angle routing or maximum power transmission schemes usually used to solve the local minima issue. The work shows best operating values in terms of duty cycle and signal to noise ratio threshold frequencies and the lightweight nature of lightweight distributed geographical in terms of energy and communication overhead, which suits network management protocols for cognitive radio sensor networks. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

ROTEE: Remora Optimization and Tunicate swarm algorithm-based Energy-Efficient cluster-based routing for EH-enabled heterogeneous WSNs

Since the development of Wireless Sensor Networks (WSNs), the limited battery of the sensor nodes has been an unavoidable concern. Hence, to keep the WSNs operational for a longer possible duration, the recharging of node's battery through harvesting the ambient energy from surroundings (for an example, solar energy) has been proposed. In this work, we focus not only on utilizing the energy harvesting (EH)-enabled sensor nodes for routing purposes but also introduce a novel hybrid optimization ROATSA that uses Remora Optimization Algorithm (ROA) and Tunicate Swarm Algorithm (TSA) for energy-efficient cluster-based routing. The proposed work is termed as ROA and TSA-based Energy-Efficient Cluster-based Routing for EH-enabled WSN (ROTEE). Hybrid ROATSA is chosen due to enhanced convergence and exploitation capabilities. To reduce the financial burden on the network, we use only four EH-enabled nodes and locate them at each periphery of the network, equidistant to each other and the other nodes are 3-level energy heterogeneous sensor nodes. The selection of cluster head (CH) is optimized through ROATSA by considering profile index of each node by evaluating them at energy, distance, load balancing, node density, the delay involved, and network's average energy. The proposed work ROTEE shows supreme performance against the recently proposed clustering techniques.     

一种分簇无线传感器网络中的分布式信源编码算法

针对密集型无线传感器网络中信息存在大量冗余的问题,该文提出了一种适用于分簇无线传感网络的分布式信源编码算法.该算法以边信息作为初始参考信源,利用信源间的相关性来决定各信源的编码顺序和参考信源,然后由各信源相对于参考信源进行相关编码,接收端则根据编码顺序和参考信源进行相关译码.该文同时针对模值编码的方式,给出了一种低复杂度的译码算法.理论分析和仿真结果表明,将该算法应用于分簇路由协议中可以有效地降低节点的发送比特数,从而降低网络的能耗以延长网络寿命.     

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.