Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks

2010 ◽  
Author(s):  
Stefan Ruhrup ◽  
Ivan Stojmenovic
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Communication Overhead

scholarly journals An Improved Broadcast Authentication Protocol for Wireless Sensor Networks Based on the Self-Reinitializable Hash Chains

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Haiping Huang ◽  
Qinglong Huang ◽  
Fu Xiao ◽  
Wenming Wang ◽  
Qi Li ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Bloom Filter ◽  
Authentication Scheme ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Dos Attacks ◽  
Hash Chain ◽  
Security Properties ◽  
Broadcast Authentication

Broadcast authentication is a fundamental security primitive in wireless sensor networks (WSNs), which is a critical sensing component of IoT. Although symmetric-key-based μTESLA protocol has been proposed, some concerns about the difficulty of predicting the network lifecycle in advance and the security problems caused by an overlong long hash chain still remain. This paper presents a scalable broadcast authentication scheme named DH-μTESLA, which is an extension and improvement of μTESLA and Multilevel μTESLA, to achieve several vital properties, such as infinite lifecycle of hash chains, security authentication, scalability, and strong tolerance of message loss. The proposal consists of the t,n-threshold-based self-reinitializable hash chain scheme (SRHC-TD) and the d-left-counting-Bloom-filter-based authentication scheme (AdlCBF). In comparison to other broadcast authentication protocols, our proposal achieves more security properties such as fresh node’s participation and DoS resistance. Furthermore, the reinitializable hash chain constructed in SRHC-TD is proved to be secure and has less computation and communication overhead compared with typical solutions, and efficient storage is realized based on AdlCBF, which can also defend against DoS attacks.

scholarly journals A Replica Detection Scheme Based on the Deviation in Distance Traveled Sliding Window for Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Alekha Kumar Mishra ◽  
Asis Kumar Tripathy ◽  
Arun Kumar ◽  
Ashok Kumar Turuk
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sliding Window ◽  
Distributed Detection ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Detection Scheme ◽  
Time Distance ◽  
Replica Detection ◽  
Detection Schemes

Node replication attack possesses a high level of threat in wireless sensor networks (WSNs) and it is severe when the sensors are mobile. A limited number of replica detection schemes in mobile WSNs (MWSNs) have been reported till date, where most of them are centralized in nature. The centralized detection schemes use time-location claims and the base station (BS) is solely responsible for detecting replica. Therefore, these schemes are prone to single point of failure. There is also additional communication overhead associated with sending time-location claims to the BS. A distributed detection mechanism is always a preferred solution to the above kind of problems due to significantly lower communication overhead than their counterparts. In this paper, we propose a distributed replica detection scheme for MWSNs. In this scheme, the deviation in the distance traveled by a node and its replica is recorded by the observer nodes. Every node is an observer node for some nodes in the network. Observers are responsible for maintaining a sliding window of recent time-distance broadcast of the nodes. A replica is detected by an observer based on the degree of violation computed from the deviations recorded using the time-distance sliding window. The analysis and simulation results show that the proposed scheme is able to achieve higher detection probability compared to distributed replica detection schemes such as Efficient Distributed Detection (EDD) and Multi-Time-Location Storage and Diffusion (MTLSD).

scholarly journals COMPRO-MOTO: An efficient approach for identifying compromised nodes in wireless sensor networks.

2014 ◽  
Vol 13 (7) ◽  
pp. 4638-4646
Author(s):  
Vinayaka S.N ◽  
M Dakshayini
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection System ◽  
Scale Up ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Security Attacks ◽  
Detection Range ◽  
Secret Keys ◽  
Compromised Nodes

Wireless sensor networks (WSNs) are exposed and being attacked by opponents as they are randomly deployed in open environments. Opponents can extract confidential information like secret keys by inserting their own nodes as compromised nodes and uses them to introduce various security attacks. So detection of such nodes is being the major issue to be addressed. In this paper we present Compro-Moto – as an efficient intrusion detection system to detect compromised nodes in WSNs. Simulation results clearly shows the benefits of Compro-Moto :(i). It is not sensitive to any kind of security attacks (ii).It endows detection range up to 99.99%. (iii)It endows false detection rate less than 1%in WSNs.(iv).It endows less total overhead and less packet loss rate. These benefits are the  achievement of Compro-Moto system that requires little memory and less communication overhead and also it can scale up to millions of nodes.

scholarly journals Datacollection in Event-Driven Wireless Sensor Networks with Mobile Sinks

2010 ◽  
Vol 6 (1) ◽  
pp. 402680 ◽  
Author(s):  
Harshavardhan Sabbineni ◽  
Krishnendu Chakrabarty
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Energy Savings ◽  
Hash Table ◽  
Wireless Sensor ◽  
Distributed Hash Table ◽  
Communication Overhead ◽  
Mobile Sinks ◽  
Event Driven

We present a two-tier distributed hash table-based scheme for data-collection in event-driven wireless sensor networks. The proposed method leverages mobile sinks to significantly extend the lifetime of the sensor network. We propose localized algorithms using a distributed geographic hash-table mechanism that adds load balancing capabilities to the data-collection process. We address the hotspot problem by rehashing the locations of the mobile sinks periodically. The proposed mobility model moves the sink node only upon the occurrence of an event according to the evolution of current events, so as to minimize the energy consumption incurred by the multihop transmission of the event-data. Data is collected via single-hop routing between the sensor node and the mobile sink. Simulation results demonstrate significant gains in energy savings, while keeping the latency and the communication overhead at low levels for a variety of parameter values.

scholarly journals 1-Bit Compressive Data Gathering for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jiping Xiong ◽  
Qinghua Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Compressive Sensing ◽  
State Of The Art ◽  
Data Gathering ◽  
Reconstruction Algorithm ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Reconstruction Algorithms

Compressive sensing (CS) has been widely used in wireless sensor networks for the purpose of reducing the data gathering communication overhead in recent years. In this paper, we firstly apply 1-bit compressive sensing to wireless sensor networks to further reduce the communication overhead that each sensor needs to send. Furthermore, we propose a novel blind 1-bit CS reconstruction algorithm which outperforms other state-of-the-art blind 1-bit CS reconstruction algorithms under the settings of WSN. Experimental results on real sensor datasets demonstrate the efficiency of our method.

scholarly journals Hybrid Multi-Level Detection and Mitigation of Clone Attacks in Mobile Wireless Sensor Network (MWSN)

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2283
Author(s):  
Haafizah Rameeza Shaukat ◽  
Fazirulhisyam Hashim ◽  
Muhammad Arslan Shaukat ◽  
Kamal Ali Alezabi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Abnormal Behavior ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Method Performance ◽  
Mobile Wireless ◽  
Danger Theory ◽  
Multi Level ◽  
Mobile Wireless Sensor

Wireless sensor networks (WSNs) are often deployed in hostile environments, where an adversary can physically capture some of the sensor nodes. The adversary collects all the nodes’ important credentials and subsequently replicate the nodes, which may expose the network to a number of other security attacks, and eventually compromise the entire network. This harmful attack where a single or more nodes illegitimately claims an identity as replicas is known as the node replication attack. The problem of node replication attack can be further aggravated due to the mobile nature in WSN. In this paper, we propose an extended version of multi-level replica detection technique built on Danger Theory (DT), which utilizes a hybrid approach (centralized and distributed) to shield the mobile wireless sensor networks (MWSNs) from clone attacks. The danger theory concept depends on a multi-level of detections; first stage (highlights the danger zone (DZ) by checking the abnormal behavior of mobile nodes), second stage (battery check and random number) and third stage (inform about replica to other networks). The DT method performance is highlighted through security parameters such as false negative, energy, detection time, communication overhead and delay in detection. The proposed approach also demonstrates that the hybrid DT method is capable and successful in detecting and mitigating any malicious activities initiated by the replica. Nowadays, crimes are vastly increasing and it is crucial to modify the systems accordingly. Indeed, it is understood that the communication needs to be secured by keen observation at each level of detection. The simulation results show that the proposed approach overcomes the weaknesses of the previous and existing centralized and distributed approaches and enhances the performance of MWSN in terms of communication and memory overhead.

Covering Set-Based Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks

2013 ◽  
Vol 321-324 ◽  
pp. 592-595
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Reference Point ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Cluster Data ◽  
Aggregation Scheme ◽  
Covering Set

For reducing the communication overhead of data aggregation, authors proposed an covering set-based inner-cluster data aggregation scheme for wireless sensor networks. The network is clustered upon deployment; nodes achieve the inner-cluster neighbors’ identifiers by information exchanging and transmit the list of inner-cluster neighbors to the cluster head to help the cluster head deducing the inner-cluster covering set. Each node selects a neighbor form inner-cluster covering set as reference point and keeps silent if it has the same reading with reference point. Simulation shows that the proposed scheme lowers the communication overhead of data aggregation effectively.

Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 3945-3949
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo ◽  
De Li Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Location Information ◽  
Communication Overhead ◽  
Cluster Data ◽  
Aggregation Scheme

For reducing the communication overhead of data aggregation, authors proposed an inner-cluster data aggre-gation scheme for wireless sensor networks. Agent nodes are selected with assist of location information and only the nodes have different readings with agent nodes transmit their data to cluster head, thus reduce the inner-cluster transmissions. Analysis and experiments show that our scheme reduces inner-cluster transmissions effectively and lowers the communication overhead.

Sign in / Sign up

Export Citation Format

Share Document