Hierarchical Routing Protocols in Wireless Sensor Networks: A Survey and its Comparison

In Wireless Sensor Networks (WSN), profound research articles are presented to address the hierarchical routing protocols which reduce the energy consumption of sensor nodes and also prolong the life of the network. The state of art of this research article focus on the survey of different hierarchical routing protocols which is utilized to efficiently deliver the sensed data from source to sink node. This article presents a detailed survey on major clustering techniques LEACH, SEP, PEGASIS, and TEEN. Also, this article strongly examines about the advantages and limitations of each hierarchical routing protocol with its recent research issues. Finally, the paper concludes with some of the research issues in hierarchical routing protocols of wireless sensor networks

Attacks on Geographic Routing Protocols for Wireless Sensor Network

With the increase in the military and several other applications of Wireless Sensor Network, provisions must be made for secure transmission of sensitive information throughout the network. Most of the routing protocols proposed for ad-hoc networks and sensor networks are not designed with security as a goal. Hence, many routing protocols are vulnerable to an attack by an adversary who can disrupt the network or harness valuable information from the network. Routing Protocols for wireless sensor networks are classified into three types depending on their network structure as Flat routing protocols, Hierarchical routing protocol and Geographic routing protocols. Large number of nodes in a wireless sensor network , limited battery power and their data centric nature make routing in wireless sensor network a challenging problem. We mainly concentrate on location-based or geographic routing protocol like Greedy Perimeter Stateless Routing Protocol. Sybil attack and Selective forwarding attack are the two attacks feasible in GPSR. These attacks are implemented in GPSR and their losses caused to the network are analysed

Increase the Alive Nodes based on the Cluster Head Selection Algorithm for Heterogeneous Wireless Sensor Networks

The use of Wireless Sensor Networks WSNs is estimated to bring enormous changes in data gathering processing and distribution for different environments and applications However a WSN is a powerful controlled system since nodes run on limited power batteries Prolong the lifetime of sensor networks depends on efficient management of sensing node of energy Hierarchical routing protocols are best known in regard to energy efficient By using a clustering technique hierarchical routing protocol greatly minimize the energy consumed in collecting and distributing the data The proposed protocol focuses on reducing the energy consumption and increasing the energy efficiency and also increasing the number of alive nodes of wireless sensor networks better than exiting protoco

Simulating and Analysing the Impact of Routing Protocols on Different Parameters of WSNs

Energy efficiency of Wireless Sensor Networks has become an essential requirement and is the main issue for researchers. Various routing, data dissemination and energy efficient protocols have been designed for Wireless Sensor Networks where energy issue has been given more stress. Sensors in wireless sensor networks work on battery and have limited energy. Hence, network has limited lifetime. Routing protocol plays a major role in deciding for how much time a network will survive. All routing algorithms tend to increase the lifetime of WSN while maintaining factors like successful and real-time delivery of a message. This paper aims towards studying different categories of routing protocols and finally four hierarchical routing protocols LEACH, EHRP, SEP and FAIR have been simulated. The performance of each routing protocol has been measured on some performance metrics like network lifetime, packets transferred to BS, number of dead nodes etc and finally concluded that how a routing protocol can impact the network lifetime

Parameterized Affect of Transmission-Range on Lost of Network Connectivity (LNC) of Wireless Sensor Networks

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nanotechnology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, the network lifetime increases as the number of clusters decreases

An energy-efficient hierarchical multiple-choice routing path protocol for wireless sensor networks

[[abstract]]The energy efficiency is a substantial key design issues in such networks. An efficient routing protocol is critical to prolong the life of sensor nodes. This work presents a hierarchical multiple-choice routing path protocol (HMRP) for wireless sensor networks. According to HMRP, the wireless sensor network is initially constructed as a layered network. Based on the layered network, sensor nodes have multipath routes to the sink node through candidate parent nodes. The simulation results indicate that the proposed HMRP can increase the lifetime of sensor networks better than other clustering or tree-based protocols[[conferencetype]]國際[[conferencedate]]20060605~20060607[[booktype]]紙本[[conferencelocation]]Taichung, Taiwa

Wireless Sensor Network Infrastructure: Construction and Evaluation

International audienceLarge area wireless sensor deployments rely on multi-hop communications. Efficient packet transmissions and virtual topologies, which structure sensor networks, are two main features for efficient energy management in wireless sensor networks. This paper aims to present a distributed and low-cost topology construction algorithm for wireless sensor networks, addressing the following issues: large-scale, random network deployment, energy efficiency and small overhead. We propose structuring nodes in zones, meant to reduce the global view of the network to a local one. This zone-based architecture is the infrastructure used by our hierarchical routing protocol. The experimental results show that the proposed algorithm has low overhead and is scalable