scholarly journals Probability Model for Data Redundancy Detection in Sensor Networks

2009 ◽  
Vol 5 (2) ◽  
pp. 195-204 ◽  
Author(s):  
Suman Kumar ◽  
Seung-Jong Park
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
Probability Model ◽  
Poisson Processes ◽  
Sensor Nodes ◽  
Data Redundancy ◽  
Share Data ◽  
Degree Of Confidence ◽  
Redundancy Detection ◽  
Bivariate Poisson Process

Sensor networks are made of autonomous devices that are able to collect, store, process and share data with other devices. Large sensor networks are often redundant in the sense that the measurements of some nodes can be substituted by other nodes with a certain degree of confidence. This spatial correlation results in wastage of link bandwidth and energy. In this paper, a model for two associated Poisson processes, through which sensors are distributed in a plane, is derived. A probability condition is established for data redundancy among closely located sensor nodes. The model generates a spatial bivariate Poisson process whose parameters depend on the parameters of the two individual Poisson processes and on the distance between the associated points. The proposed model helps in building efficient algorithms for data dissemination in the sensor network. A numerical example is provided investigating the advantage of this model.

ADAPTIVE DATA DISSEMINATION IN MOBILE SENSOR NETWORKS

2009 ◽  
Vol 10 (04) ◽  
pp. 435-457
Author(s):  
ATHANASIOS KINALIS ◽  
SOTIRIS NIKOLETSEAS
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
High Mobility ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Inhibition Mechanism ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Parameter ◽  
Trade Offs

Motivated by emerging applications, we consider sensor networks where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios characterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accurately takes into account both the spatial and speed characteristics of motion. We then propose adaptive data dissemination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g. the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissemination schemes are enhanced by a distance-sensitive probabilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e. adaptation increases the success rate and reduces latency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher message delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2016 ◽  
pp. 79-114
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2020 ◽  
pp. 372-399
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

An Adaptive Data Dissemination Strategy for Wireless Sensor Networks

2007 ◽  
Vol 3 (1) ◽  
pp. 23-40 ◽  
Author(s):  
S. Selvakennedy ◽  
S. Sinnappan
Keyword(s):  
Sensor Networks ◽  
Energy Dissipation ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Data Dissemination ◽  
Discrete Event ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Energy Awareness ◽  
Communication Task

Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. However, the nodes are typically highly resource-constrained. Since the communication task is a significant power consumer, various attempts have been made to introduce energy-awareness at different levels within the communication stack. Clustering is one such attempt to control energy dissipation for sensor data dissemination in a multihop fashion. The Time-Controlled Clustering Algorithm (TCCA) is proposed to realize a network-wide energy reduction. A realistic energy dissipation model is derived probabilistically to quantify the sensor network's energy consumption using the proposed clustering algorithm. A discrete-event simulator is developed to verify the mathematical model and to further investigate TCCA in other scenarios. The simulator is also extended to include the rest of the communication stack to allow a comprehensive evaluation of the proposed algorithm.

Security Issues on Outlier Detection and Countermeasure for Distributed Hierarchical Wireless Sensor Networks

2011 ◽  
pp. 182-210
Author(s):  
Yiying Zhang ◽  
Lin He ◽  
Lei Shu ◽  
Takahiro Hara ◽  
Shojiro Nishio
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Outlier Detection ◽  
Data Dissemination ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Issues ◽  
Supervision Mechanism ◽  
Local Range ◽  
Cryptographic Techniques

Outliers in wireless sensor networks (WSNs) are sensor nodes that launch attacks by abnormal behaviors and fake message dissemination. However, existing cryptographic techniques have difficulty in detecting these outliers, which makes outlier recognition a critical and challenging issue for reliable and secure data dissemination when outliers exist in WSNs. This chapter is concerned about detection and elimination problems of outlier. To efficiently identify and isolate outliers, we present a novel “Outlier Detection and Countermeasure Scheme” (ODCS), which consists of three mechanisms: (1) An abnormal event observation mechanism (AEOM) for network surveillance; (2) An exceptional message supervision mechanism (EMSM) for distinguishing fake messages by exploiting spatiotemporal correlation and consistency; (3) An abnormal frequency supervision mechanism (AFSM) for the evaluation of node behavior. The chapter also provides a heuristic methodology which does not need the knowledge of normal or malicious sensors in advance. This property makes the ODCS not only to distinguish and deal with various dynamic attacks automatically without advance learning but also reduces the requirement of capability for constrained nodes. In our solution, the communication is limited to a local range, such as one-hop or a cluster, which can reduce the communication frequency and circumscribe the session range further. Moreover, the chapter also provides countermeasures for different types of attacks, such as the rerouting scheme and the rekey security scheme, which can separate outliers from normal sensors and enhance the robustness of network, even when some nodes are compromised by adversary. Simulation results indicate that our approach can effectively detect and defend the outlier attack.

scholarly journals DIEER: Delay-Intolerant Energy-Efficient Routing with Sink Mobility in Underwater Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3467
Author(s):  
Kamran Latif ◽  
Nadeem Javaid ◽  
Imdad Ullah ◽  
Zeeshan Kaleem ◽  
Zafar Abbas Malik ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Dissemination ◽  
Propagation Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Routing ◽  
Packet Delivery

Underwater Wireless Sensor Networks (UWSNs) are an enabling technology for many applications in commercial, military, and scientific domains. In some emergency response applications of UWSN, data dissemination is more important, therefore these applications are handled differently as compared to energy-focused approaches, which is only possible when propagation delay is minimized and packet delivery at surface sinks is assured. Packet delivery underwater is a serious concern because of harsh underwater environments and the dense deployment of nodes, which causes collisions and packet loss. Resultantly, re-transmission causes energy loss and increases end-to-end delay ( D E 2 E ). In this work, we devise a framework for the joint optimization of sink mobility, hold and forward mechanisms, adoptive depth threshold ( d t h ) and data aggregation with pattern matching for reducing nodal propagation delay, maximizing throughput, improving network lifetime, and minimizing energy consumption. To evaluate our technique, we simulate the three-dimensional (3-D) underwater network environment with mobile sink and dense deployments of sensor nodes with varying communication radii. We carry out scalability analysis of the proposed framework in terms of network lifetime, throughput, and packet drop. We also compare our framework to existing techniques, i.e., Mobicast and iAMCTD protocols. We note that adapting varying d t h based on node density in a range of network deployment scenarios results in a reduced number of re-transmissions, good energy conservation, and enhanced throughput. Furthermore, results from extensive simulations show that our proposed framework achieves better performance over existing approaches for real-time delay-intolerant applications.

Lifetime Maximization in Wireless Sensor Networks

2011 ◽  
Vol 1 (2) ◽  
pp. 16-29
Author(s):  
Vivek Katiyar ◽  
Narottam Chand ◽  
Surender Soni
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Status ◽  
Adaptive Clustering ◽  
Map Construction ◽  
Clustering Data

One of the fundamental requirements in wireless sensor networks (WSNs) is to prolong the lifetime of sensor nodes by minimizing the energy consumption. The information about the energy status of sensor nodes can be used to notify the base station about energy depletion in any part of the network. An energy map of WSN can be constructed with available remaining energy at sensor nodes. The energy map can increase the lifetime of sensor networks by adaptive clustering, energy centric routing, data aggregation, and so forth. In this paper, the authors describe use of energy map techniques for WSNs and summarize the applications in routing, aggregation, clustering, data dissemination, and so forth. The authors also present an energy map construction algorithm that is based on prediction.

Security Issues on Outlier Detection and Countermeasure for Distributed Hierarchical Wireless Sensor Networks

2013 ◽  
pp. 1099-1126
Author(s):  
Yiying Zhang ◽  
Lin He ◽  
Lei Shu ◽  
Takahiro Hara ◽  
Shojiro Nishio
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Outlier Detection ◽  
Data Dissemination ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Issues ◽  
Supervision Mechanism ◽  
Local Range ◽  
Cryptographic Techniques

Outliers in wireless sensor networks (WSNs) are sensor nodes that launch attacks by abnormal behaviors and fake message dissemination. However, existing cryptographic techniques have difficulty in detecting these outliers, which makes outlier recognition a critical and challenging issue for reliable and secure data dissemination when outliers exist in WSNs. This chapter is concerned about detection and elimination problems of outlier. To efficiently identify and isolate outliers, we present a novel “Outlier Detection and Countermeasure Scheme” (ODCS), which consists of three mechanisms: (1) An abnormal event observation mechanism (AEOM) for network surveillance; (2) An exceptional message supervision mechanism (EMSM) for distinguishing fake messages by exploiting spatiotemporal correlation and consistency; (3) An abnormal frequency supervision mechanism (AFSM) for the evaluation of node behavior. The chapter also provides a heuristic methodology which does not need the knowledge of normal or malicious sensors in advance. This property makes the ODCS not only to distinguish and deal with various dynamic attacks automatically without advance learning but also reduces the requirement of capability for constrained nodes. In our solution, the communication is limited to a local range, such as one-hop or a cluster, which can reduce the communication frequency and circumscribe the session range further. Moreover, the chapter also provides countermeasures for different types of attacks, such as the rerouting scheme and the rekey security scheme, which can separate outliers from normal sensors and enhance the robustness of network, even when some nodes are compromised by adversary. Simulation results indicate that our approach can effectively detect and defend the outlier attack.

Lifetime Maximization in Wireless Sensor Networks

2013 ◽  
pp. 107-120
Author(s):  
Vivek Katiyar ◽  
Narottam Chand ◽  
Surender Soni
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Status ◽  
Adaptive Clustering ◽  
Map Construction ◽  
Clustering Data

One of the fundamental requirements in wireless sensor networks (WSNs) is to prolong the lifetime of sensor nodes by minimizing the energy consumption. The information about the energy status of sensor nodes can be used to notify the base station about energy depletion in any part of the network. An energy map of WSN can be constructed with available remaining energy at sensor nodes. The energy map can increase the lifetime of sensor networks by adaptive clustering, energy centric routing, data aggregation, and so forth. In this paper, the authors describe use of energy map techniques for WSNs and summarize the applications in routing, aggregation, clustering, data dissemination, and so forth. The authors also present an energy map construction algorithm that is based on prediction.

scholarly journals Analyzing the Performance of Data Dissemination Algorithms to Application Requirements in Wireless Sensor Network

2011 ◽  
pp. 143-150
Author(s):  
Sukant Kishoro Bisoyi ◽  
Mohit Ranjan Panda ◽  
Sangeeta Mishra
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Dissemination ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Application Performance ◽  
Directed Diffusion ◽  
Node Placement ◽  
Application Requirements

A Wireless Sensor Network (WSN) is a collection of thousands of tiny sensor nodes having the capability of wireless communication, limited computation and sensing. Many data dissemination protocols have been proposed for multi-hop communication in sensor networks, each evaluated in some scenario. Many protocols are designed to exploit application requirements, then no one protocol can be optimized for all applications. Directed diffusion is a prominent example of data-centric routing in sensor networks, since it is based on application layer data and purely local interactions. However; its functioning relies heavily on expensive operations, like network-wide flooding. The purpose of this paper is to explore different directed diffusion protocols and their performance as the number of sinks and sources increases, the traffic rate and node placement varies, and with and without geographic proximity in node placement. We present the simulation-based performance evaluation using NS2 and tuning of data dissemination in wireless sensor networks. Hope our result would be useful to match dissemination algorithms to application performance requirements.

Sign in / Sign up

Export Citation Format

Share Document