scholarly journals Performance Analysis of Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks

2013 ◽  
Vol 6 (3) ◽  
pp. 379-399
Author(s):  
Partha Pratim Bhattacharya ◽  
Neha Rathi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Stable Region ◽  
Time Interval ◽  
Heterogeneous Wireless Sensor Networks ◽  
Leach Protocol ◽  
Full Benefit

While wireless sensor networks are increasingly equipped to handle more complicated functions, these battery poweredsensors which used in network processing, use their constrained energy to enhance the lifetime of the network especially in a heterogeneous settings. Clustered techniques have since been employed to optimize energy consumption in this energy constrained wireless sensor networks. In Classical clustering protocols, equal energy is assigned to all nodes andthey cannot take full benefit of the presence of node heterogeneity. SEP, a heterogeneous-aware protocol is used to prolong the time interval before the death of the first node which is crucial for many applications where the feedback fromthe sensor network must be reliable. The performance of SEP in comparison to LEACH Protocol is analyzed in this paperwhose goal is to increase the stable region and as a result decrease the unstable region and improve the quality of thefeedback of wireless sensor network, in presence of heterogeneous nodes.

scholarly journals Performance metrics in wireless sensor networks :a survey and outlook

2018 ◽  
Vol 7 (2.26) ◽  
pp. 25
Author(s):  
E Ramya ◽  
R Gobinath
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Performance Metrics ◽  
Resource Constraints ◽  
Sensor Data ◽  
Wireless Sensor

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations. 

CHRONOLOGICAL TREE — A COMPRESSED STRUCTURE FOR MINING BEHAVIORAL PATTERNS FROM WIRELESS SENSOR NETWORKS

2008 ◽  
Vol 09 (03) ◽  
pp. 255-276 ◽  
Author(s):  
SAMER SAMARAH ◽  
AZZEDINE BOUKERCHE
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Time Interval ◽  
Behavioral Patterns ◽  
Data Mining Technique ◽  
Representation Structure ◽  
Definition Of

Wireless Sensor Networks (WSNs) have proven their success in a variety of applications for monitoring physical and critical environments. However, the streaming nature, limited resources, and the unreliability of wireless communication are among the factors that affect the Quality of Service (QoS) of WSNs. In this paper, we propose a data mining technique to extract behavioral patterns about the sensor nodes during their operation. The behavioral patterns, which we refer to as Chronological Patterns, can be thought of as tutorials that teach about the set of sensors that report on events within a defined time interval and the order in which the events were detected. Chronological Patterns can serve as a helpful tool for predicting behaviors in order to enhance the performance of the WSN and thus improve the overall QoS. The proposed technique consists of: a formal definition of the Chronological Patterns and a new representation structure, which we refer to as Chlorotical Tree (CT), that facilities the mining of these patterns. To report about the performance of the CT, several experiments have been conducted to evaluate the CT using different density factors.

scholarly journals Improve secure based multi-path routing to mitigate the intrusion endurance in heterogeneous wireless sensor networks

2018 ◽  
Vol 7 (4) ◽  
pp. 2746
Author(s):  
Dr. G. Murugan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Sensor Network ◽  
Network Lifetime ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Redundancy Management ◽  
Heterogeneous Wireless Sensor Networks ◽  
Heterogeneous Wireless Sensor Network

Wireless Sensor Networks (WSNs) have many potential applications. Multi-path routing is widely used in WSN to achieve reliability and perform Fault Tolerance. Multi-path routing determines and assigns multiple routes from a given sensor node to the sink. The transmission of data among the multi-path brings path redundancy, which increases the reliability and reduces the network congestion. In this research work, a dynamic redundancy management algorithm is proposed. To exploit multi-path routing in order to process the user request with existence of defective and malicious nodes. The objective of this work is to analyze the trade-off between energy consumption and Quality of Service (QoS) gain in security and reliability in order to increase the lifetime. The optimized redundancy level of multipath routing is determined dynamically which is used to improve the query response while extending the network lifetime and also for detecting intrusions and send alert to the system through Intrusion Detection System (IDS). Then, a voting-based distributed Intrusion Detection (ID) algorithm is proposed to detect and remove malicious nodes in a sensor network. The malicious node has been determined through number of voters using voting-based distributed ID algorithm. The efficient redundancy management of a clustered Heterogeneous Wireless Sensor Network (HWSN) is to increase the network lifetime in the presence of unreliable and malicious nodes. Therefore, the reliability improved dramatically.  

scholarly journals A Comparative Study of Routing Protocols of Heterogeneous Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Guangjie Han ◽  
Xu Jiang ◽  
Aihua Qian ◽  
Joel J. P. C. Rodrigues ◽  
Long Cheng
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Comparative Study ◽  
Sensor Network ◽  
Routing Protocols ◽  
Wireless Sensor ◽  
Stable Period ◽  
Heterogeneous Wireless Sensor Networks ◽  
Heterogeneous Wireless Sensor Network

Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently—EDFCM, MCR, and EEPCA—together with two previous classical routing protocols—LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols.

scholarly journals One-Tier versus Two-Tier Wireless Sensor Networks: Coverage Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Tarek Sheltami
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Analytical Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Wolfram Mathematica ◽  
Circular Model ◽  
Heterogeneous Wireless Sensor Networks

This paper tackles the coverage problem in homogenous and heterogeneous wireless sensor networks. The homogenous sensor network consists of sensor nodes and relays; however, the heterogeneous sensor network consists of sensor nodes, super nodes, and satellite nodes. In the latter network, super nodes and satellite nodes are utilized to demonstrate different scenarios. Super nodes consume huge amount of energy, compared to sensor nodes. To address this problem, the aim of this paper is to find the baseline when super nodes are used efficiently, despite the inherited high power consumption. Wolfram Mathematica is used to compare random independent deployment circular analytical model against a much simpler square analytical model. The achieved results showed that the simple square model is very close to circular model whenK-coverage is≤2.

Sign in / Sign up

Export Citation Format

Share Document