Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks
Wireless sensor networks (WSNs) are composed of numerous low-cost, low-power sensor nodes communicating at short distance through wireless links. Sensors are densely deployed to collect and transmit data of the physical world to one or few destinations called the sinks. Because of open deployment in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-04-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/745069 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832559146002546688 |
|---|---|
| author | Wassim Znaidi Marine Minier Stéphane Ubéda |
| author_facet | Wassim Znaidi Marine Minier Stéphane Ubéda |
| author_sort | Wassim Znaidi |
| collection | DOAJ |
| description | Wireless sensor networks (WSNs) are composed of numerous low-cost, low-power sensor nodes communicating at short distance through wireless links. Sensors are densely deployed to collect and transmit data of the physical world to one or few destinations called the sinks. Because of open deployment in hostile environment and the use of low-cost materials, powerful adversaries could capture them to extract sensitive information (encryption keys, identities, addresses, etc.). When nodes may be compromised, “beyond cryptography” algorithmic solutions must be envisaged to complement the cryptographic solutions. This paper addresses the problem of nodes replication; that is, an adversary captures one or several nodes and inserts duplicated nodes at any location in the network. If no specific detection mechanisms are established, the attacker could lead many insidious attacks. In this work, we first introduce a new hierarchical distributed algorithm for detecting node replication attacks using a Bloom filter mechanism and a cluster head selection (see also Znaidi et al. (2009)). We present a theoretical discussion on the bounds of our algorithm. We also perform extensive simulations of our algorithm for random topologies, and we compare those results with other proposals of the literature. Finally, we show the effectiveness of our algorithm and its energy efficiency. |
| format | Article |
| id | doaj-art-795dada9f286446ca944ee153240aab9 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-795dada9f286446ca944ee153240aab92025-02-03T01:30:43ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-04-01910.1155/2013/745069Hierarchical Node Replication Attacks Detection in Wireless Sensor NetworksWassim ZnaidiMarine MinierStéphane UbédaWireless sensor networks (WSNs) are composed of numerous low-cost, low-power sensor nodes communicating at short distance through wireless links. Sensors are densely deployed to collect and transmit data of the physical world to one or few destinations called the sinks. Because of open deployment in hostile environment and the use of low-cost materials, powerful adversaries could capture them to extract sensitive information (encryption keys, identities, addresses, etc.). When nodes may be compromised, “beyond cryptography” algorithmic solutions must be envisaged to complement the cryptographic solutions. This paper addresses the problem of nodes replication; that is, an adversary captures one or several nodes and inserts duplicated nodes at any location in the network. If no specific detection mechanisms are established, the attacker could lead many insidious attacks. In this work, we first introduce a new hierarchical distributed algorithm for detecting node replication attacks using a Bloom filter mechanism and a cluster head selection (see also Znaidi et al. (2009)). We present a theoretical discussion on the bounds of our algorithm. We also perform extensive simulations of our algorithm for random topologies, and we compare those results with other proposals of the literature. Finally, we show the effectiveness of our algorithm and its energy efficiency.https://doi.org/10.1155/2013/745069 |
| spellingShingle | Wassim Znaidi Marine Minier Stéphane Ubéda Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks |
| title_full | Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks |
| title_fullStr | Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks |
| title_full_unstemmed | Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks |
| title_short | Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks |
| title_sort | hierarchical node replication attacks detection in wireless sensor networks |
| url | https://doi.org/10.1155/2013/745069 |
| work_keys_str_mv | AT wassimznaidi hierarchicalnodereplicationattacksdetectioninwirelesssensornetworks AT marineminier hierarchicalnodereplicationattacksdetectioninwirelesssensornetworks AT stephaneubeda hierarchicalnodereplicationattacksdetectioninwirelesssensornetworks |