scholarly journals Comparison between Flat and Hierarchical Routing Protocols in Wireless Sensor Network

Author(s):  
Ms Mamta

Wireless Sensor Network (WSN) has delivered the accessibility of small, tiny and low cost sensor nodes which are capable to sense various kinds of physical and environmental conditions, data processing, wireless communication and data gathering. In wireless sensor network routing protocols can be divided into two categories first is flat routing protocol and another is hierarchical routing protocol. In this paper flat and hierarchical routing protocols are evaluated and compared based on various performance parameters. In the last decade we have seen expanded enthusiasm for the potential utilization of remote wireless sensor systems (WSNs) in an extensive change of uses and it has turned into a unique research zone. So finally, in this research paper we are focusing on two different classes of routing protocols in WSN: flat routing and hierarchical or clustering routing.

Author(s):  
ER NEETIKA ◽  
SIMARPREET KAUR

The Wireless Sensor Network(WSN) has become an interesting field of research of the 21st century. It is a type of the wireless ad-hoc network. This has brought about developing low cost, low-power and multi-function sensor nodes. The network life for wireless sensor network plays an important role in survivability. Energy efficiency is one of the critical concerns for wireless sensor networks. Sensor nodes are strictly constrained in terms of storage, board energy and processing capacity. For these reasons, many new protocols have been proposed for the purpose of data routing in sensor networks. These protocols can be classified into three main categories: data-centric, location-based and hierarchical. This paper mainly deals with some of the major Energy-efficient hierarchical routing protocols for wireless sensor networks. First we will discuss the energy-efficient Hierarchical routing protocols in brief along with their important features, objectives, drawbacks and area of application. Finally, we provide a comparison of these various protocols.


Author(s):  
Tanya Pathak ◽  
Vinay Kumar Singh ◽  
Anurag Sharma

In the recent years, an efficient design of a Wireless Sensor Network has become important in the area of research. The major challenges in the design of Wireless Sensor Network is to improve the network lifetime. The main difficulty for sensor node is to survive in that monitoring area for the longer time that means there is a need to increase the lifetime of the sensor nodes by optimizing the energy and distance. There are various existing routing protocols in which optimal routing can be achieved like Data-Centric, Hierarchical and Location-based routing protocols. In this paper, new power efficient routing protocol is being proposed that not only select the shortest path between the source node and sink node for data transmission but also maximizes the lifetime of the participating nodes by selecting the best path for sending the data packet across the network. The main objective of this research is to develop a faster algorithm to find the energy efficient route for Wireless Sensor Network. Simulation results shows that this strategy achieves long network lifetime when compared to the other standard protocols.


Author(s):  
Mukhtiar Ahmed ◽  
Mazleena Salleh ◽  
M.Ibrahim Channa ◽  
Mohd Foad Rohani

<span>Underwater Wireless Sensor Network (UWSN) can enable many scientific, military, safety, commercial and environmental applications. Majority of the network models has been introduced for the deployment of sensor nodes through routing schemes and methodologies along with different algorithms but still the design of routing protocol for underwater environment is a challenging issue due to distinctive characteristics of underwater medium. The majority of the issues are also needed to fulfill the appropriate approach for the underwater medium like limited bandwidth, high bit error rates, propagation delay, and 3D deployment. This paper focuses the comparative analysis of the localization based routing protocols for UWSN. This comparative analysis plays a significant attention to construct a reliable routing protocol, which provides the effectual discovery of the route between the source node and the sink node. In addition this comparative analysis also focuses the data packets forwarding mechanism, the deployment of sensor nodes and location based routing for UWSN in different conditions.</span>


2020 ◽  
Vol 17 (6) ◽  
pp. 2678-2683
Author(s):  
Rani Poonam ◽  
Sharma Avinash

Wireless Sensor Network (WSN) consists of a network with huge quantity of sensors that are deployed to accomplish a particular task. These low cost sensors are proficient of aggregating and communicating the sensed information over the field. Evaluation of IoT and proliferation of sensors with other application results building a variety of gazettes. However, these nodes being powered by a battery are energy constrained. While operating, most of the vitality is spent during packet transmission. So an ardent care should be taken care of while developing the protocol. The protocols through which nodes communicate with each other is known as routing. Designing of appropriate routing protocol results in better lifetime of the protocol. This paper proposes a routing protocol based on cluster formation among same type of sensor nodes (SN) for gathering of data at intermediate nodes in the cluster and these intermediate nodes further transmits data to resource opulence sink.


2013 ◽  
Vol 347-350 ◽  
pp. 1738-1742 ◽  
Author(s):  
Xiao Wen Ma ◽  
Xiang Yu

Wireless sensor networks comprise of minor battery driven devices with restricted energy resources.Once installed,the minor sensor nodes are usually unapproachable to the operator, and thus auxiliary of the energy source is not practicable.Hence,energy proficiency is a vital design issue that needs to be boosted in order to increase the lifetime of the network. LEACH is a popular hierarchical routing protocol which efficiently maintains the energy storage of nodes in Wireless Sensor Network (WSN).The nodes using LEACH are divided into clusters.The advantage of LEACH is that each node has the equal probability to be a cluster head,which makes the energy dissipation of each node be relatively balanced. This paper studies LEACH protocol, and focuses on how to decide the next hop nodes more reasonable when the data are transmitted at the steady state. Simulation has been done in NS2 and the results show that the algorithm after improved is more energy-efficient than LEACH protocol.


2018 ◽  
Vol 7 (2.8) ◽  
pp. 216 ◽  
Author(s):  
Humera Khan

Wireless Sensor Network is a widely growing field and it comprises of tiny sensor nodes. These sensor nodes are distributed in the environment spatially. They are capable of sensing the environment, gathering the information and processing it. Each sensor node collaborate with other sensor nodes for processing the information. Sensor nodes have very limited resources available for their operation. For the purpose of consuming resources in an efficient way several routing algorithms are employed. Here the focus is mainly on hierarchical cluster based routing techniques. In this paper we provide an introduction for wireless sensor network, the requirement for reduction in energy consumption of sensor nodes and some of the already existing energy efficient routing protocols of wireless sensor network.


2014 ◽  
Vol 701-702 ◽  
pp. 1025-1028
Author(s):  
Yu Zhu Liang ◽  
Meng Jiao Wang ◽  
Yong Zhen Li

Clustering the sensor nodes and choosing the way for routing the data are two key elements that would affect the performance of a wireless sensor network (WSN). In this paper, a novel clustering method is proposed and a simple two-hop routing model is adopted for optimizing the network layer of the WSN. New protocol is characterized by simplicity and efficiency (SE). During the clustering stage, no information needs to be shared among the nodes and the position information is not required. Through adjustment of two parameters in SE, the network on any scale (varies from the area and the number of nodes) could obtain decent performance. This work also puts forward a new standard for the evaluation of the network performance—the uniformity of the nodes' death—which is a complement to merely taking the system lifetime into consideration. The combination of these two aspects provides a more comprehensive guideline for designing the clustering or routing protocols in WSN.


The emergence of sensor networks as one of the dominant technology trends in the coming decades has posed numerous unique challenges on their security to researchers. These networks are likely to be composed of thousands of tiny sensor nodes, which are low-cost devices equipped with limited memory, processing, radio, and in many cases, without access to renewable energy resources. While the set of challenges in sensor networks are diverse, we focus on security of Wireless Sensor Network in this paper. First, we propose some of the security goal for Wireless Sensor Network. To perform any task in WSN, the goal is to ensure the best possible utilization of sensor resources so that the network could be kept functional as long as possible. In contrast to this crucial objective of sensor network management, a Denial of Service (DoS) attack targets to degrade the efficient use of network resources and disrupts the essential services in the network. DoS attack could be considered as one of th


Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur

Wireless sensor networks (WSNs) consist of several sensor nodes (SNs) that are powered by battery, so their lifetime is limited, which ultimately affects the lifespan and hence performance of the overall networks. Till now many techniques have been developed to solve this problem of WSN. Clustering is among the effective technique used for increasing the network lifespan. In this chapter, analysis of multi-hop routing protocol based on grid clustering with different selection criteria is presented. For analysis, the network is divided into equal-sized grids where each grid corresponds to a cluster and is assigned with a grid head (GH) responsible for collecting data from each SN belonging to respective grid and transferring it to the base station (BS) using multi-hop routing. The performance of the network has been analyzed for different position of BS, different number of grids, and different number of SNs.


Sign in / Sign up

Export Citation Format

Share Document