Hierarchical energy efficient routing in Wireless Sensor Networks

Hierarchical routing in wireless sensor networks (WSNs) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of WSNs, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios. Finally, we put forward some open issues concerning the design of hierarchical WSNs. This survey aims to provide useful guidance for system designers on how to evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.

Wireless Sensor Networks (WSNs) is the vast area and developing very speedily now-a-days. This paper gives some of the major applications and critical limitations of WSNs like power and lifespan, communication bandwidth, memory size. Sensor nodes are working by node energy so the energy consumption is the essential issue in WSN. Routing in WSN consumes more energy than any other phase. Various routing techniques in WSNs are discussed and different routing protocols are illustrated. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the popular and feasible hierarchical clustering routing protocols in WSN. Working of LEACH is explained in brief. Furthermore, the descendants of LEACH e.g. LEACH-C (Centralized LEACH), LEACH-B (Balanced LEACH), LEACH-F, Multihop LEACH, MS-LEACH (Multihop and Single hop LEACH), MH-LEACH etc. are discussed in terms of the energy utilization. By analyzing the variants of LEACH, it is observed that the energy requirement in the cluster set up phase or data transmission phase is minimized to minimize the total energy consumption of the WSN. To elect the proper cluster head node, centralized approach is followed. Afterwards, data transmission will use the multihop communication technique. This will help to save some energy when base station is located far away from the cluster head node. Proposed protocol aims to decrease the energy overhead of the sensor nodes. The new approach is proposed entitled PV-LEACH which will save the energy consumption in cluster setup phase and also in data transmission phase of the conventional LEACH protocol. So, this will enhance the performance ratio in terms of energy consumption and life time of the sensor nodes.

Wireless Sensor Networks (WSNs) comprise of groups of tiny sensor nodes that are deployed for collaborative missions such as environmental monitoring, target tracking and surveillance. Due to the miniature size of the nodes, they are typically deployed in large numbers and communicate via multiple hops through a wireless shared communication channel. The successful implementation of such networks is dependent on the enabling technologies (such as digital electronics and wireless communications), as well as the provisioning of Quality of Service (QoS) in the network. While there have been many efforts in QoS provisioning in traditional networks such as the Internet and Mobile Ad Hoc Networks (MANETs), these networks have very different characteristics from that of WSNs. Consequently, the QoS models and protocols that have been designed for the Internet and MANETs cannot be directly applied to WSNs. In this paper, we look at some of the existing QoS mechanisms in the networking literature, and the inherent characteristics of WSNs which make it challenging to provision for QoS in the network. We then identify some key performance metrics for WSN QoS and outline some mechanisms to achieve QoS in the sensor network. Finally, we propose WISER - a framework to enhance QoS in WIreless SEnsoR networks.

Wireless sensor networks represent technology for networking of sensor devices, as well as for other devices in IoT systems. The hierarchical routing protocols have many advantages when these networks are used in monitoring applications, with the energy efficient hierarchical multi-hop routing proposed for large scale networks that assures reliable data gathering in the non-ideal connectivity conditions. We here propose a modification of our previously designed multi-hop routing concept by employing clustering algorithm from HEED protocol in order to achieve uniformly placed clusters. The conducted analysis for several multi-hop protocols showed good performance of here proposed solution for ideal and non-ideal network connectivity.

In this paper a new method, Optimal Path from Source to Sink Node (OPSSN), is proposed for achieving the Quality of Service (QoS) in terms of packet delivery reliability and better energy consumption in Wireless Sensor Networks (WSN). Routing in WSN has more expected node failures than the traditional networks; so to establish a routing protocol which supports QoS in WSN, requires considering the reasons for node failure to improve network performance. In case of failure (node failure or link failure), this method will offer automatic adaptation to dynamic linking and low processing overhead by choosing the default path through intensive nodes. This method increases the number of spare neighbors for original nodes which are preserved for data transmission through them, to be used in case of failure. This algorithm is simulated using MATLAB. Results showed that OPSSN achieved better performance compared to LEACH in terms of network life time, packets received at Base Station (BS), number of Cluster Heads (CH) per round, and total energy consumption.

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities.Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue.Routing protocols in WSNs might differ depending on the application and network architecture.In this article we present a survey of stateof-the-art routing techniques in WSNs.We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques.Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing.Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoSbased, and coherent-based depending on the protocol operation.We study the design trade-offs between energy and communication overhead savings in every routing paradigm.We also highlight the advantages and performance issues of each routing technique.The article concludes with possible future research areas.

Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm intelligence (SI) based metaheuristic can be applied for optimal routing of data, in an energy constraint WSNs environment. In this paper, we present BeeSwarm, a SI based energy-efficient hierarchical routing protocol for WSNs. Our protocol consists of three phases: (1) Set-up phase-BeeCluster, (2) Route discovery phase-BeeSearch and (3) Data transmission phase-BeeCarrier. Integration of three phases for clustering, data routing and transmission, is the key aspect of our proposed protocol, which ultimately contributes to its robustness. Evaluation of simulation results show that BeeSwarm perform better in terms of packet delivery, energy consumption and throughput with increased network life compared to other SI based hierarchical routing protocols.

Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing protocol have been specifically designed for WSNs. And energy awareness is an essential design issue. In this paper, We study the routing protocol of wireless sensor network and describe the ZigBee based wireless sensor network architecture, analyze the principles of tree-structured routing and AODV routing, and then apply Zigbee technology to intelligent parking system.

Wireless Sensor Networks (WSNs) are made up of small nodes which have the ability to sense, compute and communicate wirelessly. Essential design issue in WSN routing is energy awareness as the sensors are energy constrained. Various routing, power management and data dissemination protocols designed for WSNs are available in the literature. Energy awareness and reliable data transmissions are handled in Medium Access Control (MAC) and Network layers. Decisions to achieve data reliability and energy efficiency trade-off were considered in layers. This study considers mobility, energy and link qualities to ward off poor link connectivity which reduce retransmissions and prolong WSN life. To achieve this, a fuzzy based cross layer protocol is proposed using an enhanced MAC protocol to provide better contention during mobility of the node and a network layer protocol based on link quality and mobility is proposed. Input to the fuzzy system is link quality and mobility. Output is decision for cluster head selection.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

In case of sensor network, hierarchical routing has received a great magnitude of interest than flat routing for achieving energy efficiency. While the overhead of creating hierarchical control structure, should be kept reasonably low. Directed diffusion (DD) is one of the most prominent and widely accepted example of hierarchical data centric routing. Directed diffusion suffers from huge flooding problem and further improved using passive clustering to reduce flooding for interest propagation. Passive clustering technique is not energy efficient as it does not consider residual energy of nodes. Also it does not have any parameter to restrict the number of clusterheads and gateways. To achieve energy efficiency and prolonged network lifetime we introduce residual energy and distance based cluster creation. Energy conserving passive clustering technique will select better nodes as clusterhead and gateway in terms of residual energy and distance which will in turn reduce the overlapping region and number of gateway to conserve energy. At the same time we have applied periodic sleep and awake among cluster members to achieve prolonged lifetime. Our proposed algorithm will add some extra overhead for cluster creation and maintenance in compare to passive clustering but will perform better in terms of energy dissipation and enhanced lifetime of the network.

Wireless Sensor Network (WSN) is an emerging wireless communication networks to provide potential secure optimized data routing between source and destination. Presently the performance analysis of the Wireless Sensor Network routing technique and security protocols is the major research issues. A major issue in wireless sensor network (WSN) is the energy constraint in a node and its limited computing resources, which may pose an operational hazard or limitations on the network lifetime. Therefore, analyses of innovative secure routing techniques are required to utilize the resources of WSN to improve the life time of network in WSN. To design & develop any innovative wireless sensor network routing and security protocol, the network characteristics & its design issues are important consideration. The proposed spherical Grid Routing Protocol (SGRP) is designed and developed to enhance Quality of service to improve WSN performance using NS2 simulator compare to compared to modified LEACH techniques. The packet transmitted, packet received, average energy, throughput and packet delivery ratio are the main common performance measures that are used for performance analysis of proposed SGRP protocols.

An energy efficient routing protocol is the major concern in Wireless Sensor Networks (WSNs). In this survey paper, we present energy efficient hierarchical routing protocols, developed from conventional LEACH routing protocol. Main focus of our study is how these extended protocols work in order to increase the life time and how quality routing protocol are improved for WSNs. Furthermore, this paper also highlights some of the issues faced by LEACH and also explains how these issues are tackled by extended versions of LEACH. We compare the features and performance issues of the selected hierarchical routing protocols.

In hierarchical structures determined by traditional routing protocols of wireless sensor networks, clustering is not structured and the networks prone to generate scatters, leading to some nodes die quickly. So this paper presents a cluster head preferred hierarchical clustering routing protocol based on G-Means (GHPHC). It uses G-Means algorithm to detect each clustering structure, so that each cluster is Gaussian distribution and it avoids the generation of scatters. At the same time, the cluster head preferred algorithm proposed in this paper gives the corresponding weight for each node of all clusters, thus select a suitable cluster head node for every cluster. Experimental results show that compared to traditional routing protocols, the death rate of nodes in a wireless sensor network which uses GHPHC protocol is more slow, and has a longer life cycle.

The energy constraint bottleneck in the wireless sensor networks (WSN) exist objectively. To reduce energy consumption and ensure the Quality of Service (QoS) in data transmission, a method of solving the QoS multicast routing in WSN by quantum particle swarm optimization algorithm (QPSO). The algorithm is based on PSO, quantum-bit, principle of superposition and quantum gates. By the premise of avoiding local convergence and reducing the energy consumption, it can solving the QoS multicast routing rapidly, which help to prolong the network lifetime efficiently. The simulation results indicate that its feasibility and effectiveness.