Wireless Sensor Networks

Author(s):  
Sonam ◽  
Manju Khari

This chapter describes how as world is switching from wired communication to wireless communication, the need of a wireless sensor network (WSN) is increasing. WSNs became very popular due to its wide applications. A WSN is a network of small-in-size sensor nodes which are densely deployed for monitoring a chosen environment. In WSNs, each sensor node detects data and sends it to the base station. These sensor nodes have four basic duties, consisting of sensing, computation, transmission and power. Due to the small size, these sensor nodes are more constrained in terms of computational energy and storage resources. Energy awareness is also an essential design issue for routing protocols in WSNs. The focus of this chapter is to provide an overview of WSNs. In addition, this chapter describes the components of WSNs, its challenges and the classifications of WSNs. This chapter compares the results of LEACH, SEP and TEEN protocols.

Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.


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.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohammadjavad Abbasi ◽  
Muhammad Shafie Bin Abd Latiff ◽  
Hassan Chizari

Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and addresses various area detection and coverage problems in sensor network. This paper organizes many scenarios for applying sensor node movement for improving network coverage based on bioinspired evolutionary algorithm and explains the concern and objective of controlling sensor node coverage. We discuss area coverage and target detection model by evolutionary algorithm.


Author(s):  
Monjul Saikia

The wireless sensor network is a collection of sensor nodes that operate collectively to gather sensitive data from a target area. In the process of data collection the location of sensor nodes from where data is originated matters for taking any decision at the base station. Location i.e. the coordinates of a sensor node need to be shared among other nodes in many circumstances such as in key distribution phase, during routing of packets and many more. Secrecy of the location of every sensor node is important in any such cases. Therefore, there must be a location sharing scheme that facilitates the sharing of location among sensor nodes securely. In this paper, we have proposed a novel secure and robust mechanism for location sharing scheme using 2-threshold secret sharing scheme. The implementation process of the proposed model is shown here along with results and analysis.


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Asis Kumar Tripathy ◽  
Suchismita Chinara

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.


21st century is considered as the era of communication, and Wireless Sensor Networks (WSN) have assumed an extremely essential job in the correspondence period. A wireless sensor network is defined as a homogeneous or heterogeneous system contains a large number of sensors, namely called nodes used to monitor different environments in cooperatives. WSN is composed of sensor nodes (S.N.), base stations (B.S.), and cluster head (C.H.). The popularity of wireless sensor networks has been increased day by day exponentially because of its wide scope of utilizations. The applications of wireless sensor networks are air traffic control, healthcare systems, home services, military services, industrial & building automation, network communications, VAN, etc. Thus the wide range of applications attracts attackers. To secure from different types of attacks, mainly intruder, intrusion detection based on dynamic state context and hierarchical trust in WSNs (IDSHT) is proposed. The trust evaluation is carried out in hierarchical way. The trust of sensor nodes is evaluated by cluster head (C.H.), whereas the trust of the cluster head is evaluated by a neighbor cluster head or base station. Hence the content trust, honest trust, and interactive trust are put forward by combining direct evaluation and feedback based evaluation in the fixed hop range. In this way, the complexity of trust management is carried in a hierarchical manner, and trust evaluation overhead is minimized.


Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.


2021 ◽  
Vol 13 (0203) ◽  
pp. 124-128
Author(s):  
Suneela Kallakunta ◽  
Alluri Sreenivas

Wireless sensor networks (WSNs) are a new kind of wireless networks that are becoming very popular with a large number of civilian and military applications. A wireless sensor network (WSN) is a wireless network that contains distributed independent sensor devices that are meant to monitor physical or environmental conditions. AWireless Sensor Network consists of a set of connected tiny sensor nodes, which communicate with each other we can also interchange information and data. These nodes obtain information on the environment such as temperature, pressure, or humidity and this information is stored in a base station. The latter sends the info to a wired network or activates an alarm or an action, depending on the type of data being monitored.


Author(s):  
S. JERUSHA ◽  
K. KULOTHUNGAN ◽  
A Kannan

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic.


2019 ◽  
Vol 8 (4) ◽  
pp. 2440-2448

Wireless sensor networks have a lot of sensor nodes that are small, cheap and resource-constraints, but are often used to perform various monitoring operations in unmanned and demanding environments. Networks are vulnerable to different application-based and application-independent attacks. We examine node replication attacks, which are typical threats in the sensor network. In this attack, the enemy generates its own sensor node using stealing sensor from network. The attacker physically occupies the node, takes his secret credentials, and duplicates a large number of nodes with some controlled counterparts. The defense against clone node attacks has become an important research element in the safety of the sensor network. In this study, we classify and examine the different proposals in each category. We also compare the memory and communication cost of different clone node detection approach.


Sign in / Sign up

Export Citation Format

Share Document