scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Flooding in secure wireless sensor networks: Student contribution

TL;DR: Simulations of a flooding algorithm in Sensor Networks secured by a Random Key Pre-distribution model are presented and a demonstration of the robustness of the network through a random black hole attack is demonstrated.
Abstract: The flooding algorithm remains one of the simplest and most effective ways to quickly disseminate information across all nodes in a Wireless Sensor Network. Though fast, this algorithm remains unsecure as the packets can be intercepted by malice agents to reveal the information. In this paper, simulations of a flooding algorithm in Sensor Networks secured by a Random Key Pre-distribution model are presented. We conducted these simulations on ns-3 over a theoretical Peer-to-peer and a standard based IEEE 802.15.4 network. This is followed by a demonstration of the robustness of the network through a random black hole attack.
Citations
More filters
Proceedings Article
22 Mar 2007
TL;DR: In this article, a peer-to-peer (P2P)-based code propagation (GCP) algorithm is proposed for mobile WSNs, which is based on gossip-based protocols.
Abstract: Wireless sensor networks (WSN) are in a plentiful expansion. They are expected to be deployed for long periods of time, and the nodes are likely to need software updates during their lifetime. Updating the software code automatically on a huge number of sensors is a tremendous task, which is infeasible "by hand" when all participating sensor are moving. In this work, we are interested in an automatic software update of devices in sensor-based applications where sensors are mobile and no localisation mechanism is available. We consider the use of a peer-to-peer cooperation paradigm into the WSN architecture as a way to provide the entire network with the ability to find a good tradeoff between reliability and scalability of code propagation. Effectively, P2P systems are fully decentralized, self-organized where each node may act both as client and server. Especially, gossip-based protocols, based on continuous information exchange between participating nodes, is a very promising candidate for propagating information in WSNs. In this work, we present the design and the evaluation of GCP ({\it Gossip-based Code Propagation}), a distributed software update algorithm. To the best of our knowledge, tackling code propagation in {\it mobile} WSN has not been considered so far. Leveraging works both on epidemic protocols and, on similarities and differences between P2P systems and mobile WSN, {\it Gossip-based Code Propagation} algorithm tends to outperforms classical dissemination algorithms, with only a small overhead by adding little extra informations on sensor nodes and in beacon messages. GCP uses information about sensors and their dynamic neighbourhood to improve significantly the load balancing without sacrificing the propagation speed. We compare GCP against two different dissemination algorithms: one ideal in speed convergence but requiring a large number of software send messages and, therefore, a very high power consumption, and a second one trying to optimize on load balancing. In order to evaluate our contribution, we developed SeNSim, a software simulator implemented for mobile wireless sensor-based applications' simulation. Several simulated experimentation were conducted: eight synthetic and one realistic\footnote{We used the mit/reality data set from CRAWDAD for the analysis. This realistic workload has been collected from a one year long-experimentation at MIT over the course of the 2004-2005 academic year. } scenarios have been simulated. Simulation results based on both synthetic and realistic workloads, show that GCP allows ideal convergence speed and evenly balances the load between sensors in the system. For each of these algorithms, GCP outperforms the other candidate approach accordingly to the few overhead informations. With a clearly load balance on the system, GCP can disseminate the new software with almost the same propagation speed than the ideal one. One of this work perspectives consists in including the {\it Delay Tolerant Networks} (DTN) paradigm into GCP in order to take into account and optimize the free receptions of the software due to the omnidirectionnal wireless transmission.

11 citations

Proceedings ArticleDOI
03 Jan 2023
TL;DR: In this paper , the authors derive a simple lightweight strategy based on Synchronous-Transmission to enable every node in an IoT-edge to gain knowledge about the zone it belongs to and identify its surrounding zones in real-time.
Abstract: With the advancement in hardware technology, IoT-edge systems are getting well-equipped with a variety of types of sensing devices. The massive decentralized sensing capability of IoT-edge can be used not only for monitoring purposes but also for automated detection and even prediction of anomalous behavior in the area covered by the IoT-edge. However, as a prerequisite to anomaly detection, what is very essential is a clear understanding of the usual nature of the region where the IoT -edge system is deployed. The existing solutions in this direction mostly take the help of the cloud to serve the purpose. We endeavor to carry out the task of understanding the characteristics of the zones/regions in the edge itself through in-network distributed computing. In this work, we derive a simple lightweight strategy based on Synchronous-Transmission to enable every node in an IoT-edge to gain knowledge about the zone it belongs to and identify its surrounding zones in real-time. Through extensive simulation and testbed-based study, we show that our proposed solution can accomplish the goals quite accurately and up to 12.5 times faster than the traditional strategy.
References
More filters
Journal ArticleDOI
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.

17,936 citations


"Flooding in secure wireless sensor ..." refers background in this paper

  • ...Since the number of nodes is high, packets are propagated through the network using multiple hops by employing routing protocols [4, 9]....

    [...]

Proceedings ArticleDOI
18 Nov 2002
TL;DR: A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.
Abstract: Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.

3,900 citations


"Flooding in secure wireless sensor ..." refers methods in this paper

  • ...The purpose of this student contribution was to demonstrate the implementation feasibility of the flooding algorithm on a network based on the IEEE 802.15.4 standard which was secured by the Random Key Pre-distribution model proposed by Eschenauer and Gligor....

    [...]

  • ...The purpose of this paper is to establish a proof of feasibility for implementing the flooding algorithm secured by the Random Key Pre-distribution model proposed by Eschenauer and Gligor [8] in a network based on the IEEE 802.15.4 standard....

    [...]

  • ...The purpose of this paper is to establish a proof of feasibility for implementing the flooding algorithm secured by the Random Key Pre-distribution model proposed by Eschenauer and Gligor [8] in a network based on the IEEE 802....

    [...]

Book
03 Jul 2003
TL;DR: This chapter discusses probabilistic ingredients, the largest component for a binomial process, and connectedivity and the number of components in a graph-like model.
Abstract: 1. Introduction 2. Probabilistic ingredients 3. Subgraph and component counts 4. Typical vertex degrees 5. Geometrical ingredients 6. Maximum degree, cliques and colourings 7. Minimum degree: laws of large numbers 8. Minimum degree: convergence in distribution 9. Percolative ingredients 10. Percolation and the largest component 11. The largest component for a binomial process 12. Ordering and partitioning problems 13. Connectivity and the number of components References Index

2,271 citations

Journal ArticleDOI
TL;DR: They are susceptible to a variety of attacks, including node capture, physical tampering, and denial of service, while prompting a range of fundamental research challenges.
Abstract: They are susceptible to a variety of attacks, including node capture, physical tampering, and denial of service, while prompting a range of fundamental research challenges.

1,443 citations