Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN

Keisuke Arai, Shuichiro Haruta, Hiromu Asahina, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Delay Tolerant Network (DTN) is characterized by a lack of end-to-end connectivity. Due to this, detecting flooding attack in DTN is a challenging and important task. Among several schemes against flooding attack in DTN, the scheme using Encounter Record (ER) that consists of past transmission history of each node is gathering attention. Since ER entries are exchanged between nodes, a node can detect an attacker whose transmission rate is too much. Although an attacker may falsify entry to pretend that his/her transmission rate is less than the actual value, it can also be detected through the contradiction between a falsified entry and another entry. However, since a node sends all ER entries in its own buffer regardless of whether an entry is helpful to detect an attacker or not, the energy consumption increases as the number of entries increases. In this paper, we propose an ER reduction scheme based on theoretical contact probability for flooding attack mitigation. We focus on the fact that if the falsified entry does not exist, corresponding entries are not helpful to detect an attacker. Since the falsified entries are propagated over the network with the lapse of time, the probability that there is no contradicting entries over the network gets higher if a node has not received any contradicting entries for a sufficient time. By removing such entries, the energy consumption can be reduced while the effectiveness of ER is kept. By computer simulation, we demonstrate our scheme successfully reduce the energy consumption while the same level of performance is achieved.

Original languageEnglish
Title of host publication2018 24th Asia-Pacific Conference on Communications, APCC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages34-39
Number of pages6
ISBN (Electronic)9781538669280
DOIs
Publication statusPublished - 2019 Feb 1
Event24th Asia-Pacific Conference on Communications, APCC 2018 - Ningbo, China
Duration: 2018 Nov 122018 Nov 14

Publication series

Name2018 24th Asia-Pacific Conference on Communications, APCC 2018

Conference

Conference24th Asia-Pacific Conference on Communications, APCC 2018
CountryChina
CityNingbo
Period18/11/1218/11/14

Fingerprint

Delay tolerant networks
Energy utilization
contact
energy consumption
computer simulation
Computer simulation
lack
history
performance
Values

Keywords

  • Delay Tolerant Network
  • Flooding attack
  • Mitigation
  • Security

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Communication

Cite this

Arai, K., Haruta, S., Asahina, H., & Sasase, I. (2019). Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN. In 2018 24th Asia-Pacific Conference on Communications, APCC 2018 (pp. 34-39). [8633455] (2018 24th Asia-Pacific Conference on Communications, APCC 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/APCC.2018.8633455

Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN. / Arai, Keisuke; Haruta, Shuichiro; Asahina, Hiromu; Sasase, Iwao.

2018 24th Asia-Pacific Conference on Communications, APCC 2018. Institute of Electrical and Electronics Engineers Inc., 2019. p. 34-39 8633455 (2018 24th Asia-Pacific Conference on Communications, APCC 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Arai, K, Haruta, S, Asahina, H & Sasase, I 2019, Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN. in 2018 24th Asia-Pacific Conference on Communications, APCC 2018., 8633455, 2018 24th Asia-Pacific Conference on Communications, APCC 2018, Institute of Electrical and Electronics Engineers Inc., pp. 34-39, 24th Asia-Pacific Conference on Communications, APCC 2018, Ningbo, China, 18/11/12. https://doi.org/10.1109/APCC.2018.8633455
Arai K, Haruta S, Asahina H, Sasase I. Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN. In 2018 24th Asia-Pacific Conference on Communications, APCC 2018. Institute of Electrical and Electronics Engineers Inc. 2019. p. 34-39. 8633455. (2018 24th Asia-Pacific Conference on Communications, APCC 2018). https://doi.org/10.1109/APCC.2018.8633455
Arai, Keisuke ; Haruta, Shuichiro ; Asahina, Hiromu ; Sasase, Iwao. / Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN. 2018 24th Asia-Pacific Conference on Communications, APCC 2018. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 34-39 (2018 24th Asia-Pacific Conference on Communications, APCC 2018).
@inproceedings{77a7f96cef8441e8a51f0de8a7fb7f21,
title = "Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN",
abstract = "Delay Tolerant Network (DTN) is characterized by a lack of end-to-end connectivity. Due to this, detecting flooding attack in DTN is a challenging and important task. Among several schemes against flooding attack in DTN, the scheme using Encounter Record (ER) that consists of past transmission history of each node is gathering attention. Since ER entries are exchanged between nodes, a node can detect an attacker whose transmission rate is too much. Although an attacker may falsify entry to pretend that his/her transmission rate is less than the actual value, it can also be detected through the contradiction between a falsified entry and another entry. However, since a node sends all ER entries in its own buffer regardless of whether an entry is helpful to detect an attacker or not, the energy consumption increases as the number of entries increases. In this paper, we propose an ER reduction scheme based on theoretical contact probability for flooding attack mitigation. We focus on the fact that if the falsified entry does not exist, corresponding entries are not helpful to detect an attacker. Since the falsified entries are propagated over the network with the lapse of time, the probability that there is no contradicting entries over the network gets higher if a node has not received any contradicting entries for a sufficient time. By removing such entries, the energy consumption can be reduced while the effectiveness of ER is kept. By computer simulation, we demonstrate our scheme successfully reduce the energy consumption while the same level of performance is achieved.",
keywords = "Delay Tolerant Network, Flooding attack, Mitigation, Security",
author = "Keisuke Arai and Shuichiro Haruta and Hiromu Asahina and Iwao Sasase",
year = "2019",
month = "2",
day = "1",
doi = "10.1109/APCC.2018.8633455",
language = "English",
series = "2018 24th Asia-Pacific Conference on Communications, APCC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "34--39",
booktitle = "2018 24th Asia-Pacific Conference on Communications, APCC 2018",

}

TY - GEN

T1 - Encounter record reduction scheme based on theoretical contact probability for flooding attack mitigation in DTN

AU - Arai, Keisuke

AU - Haruta, Shuichiro

AU - Asahina, Hiromu

AU - Sasase, Iwao

PY - 2019/2/1

Y1 - 2019/2/1

N2 - Delay Tolerant Network (DTN) is characterized by a lack of end-to-end connectivity. Due to this, detecting flooding attack in DTN is a challenging and important task. Among several schemes against flooding attack in DTN, the scheme using Encounter Record (ER) that consists of past transmission history of each node is gathering attention. Since ER entries are exchanged between nodes, a node can detect an attacker whose transmission rate is too much. Although an attacker may falsify entry to pretend that his/her transmission rate is less than the actual value, it can also be detected through the contradiction between a falsified entry and another entry. However, since a node sends all ER entries in its own buffer regardless of whether an entry is helpful to detect an attacker or not, the energy consumption increases as the number of entries increases. In this paper, we propose an ER reduction scheme based on theoretical contact probability for flooding attack mitigation. We focus on the fact that if the falsified entry does not exist, corresponding entries are not helpful to detect an attacker. Since the falsified entries are propagated over the network with the lapse of time, the probability that there is no contradicting entries over the network gets higher if a node has not received any contradicting entries for a sufficient time. By removing such entries, the energy consumption can be reduced while the effectiveness of ER is kept. By computer simulation, we demonstrate our scheme successfully reduce the energy consumption while the same level of performance is achieved.

AB - Delay Tolerant Network (DTN) is characterized by a lack of end-to-end connectivity. Due to this, detecting flooding attack in DTN is a challenging and important task. Among several schemes against flooding attack in DTN, the scheme using Encounter Record (ER) that consists of past transmission history of each node is gathering attention. Since ER entries are exchanged between nodes, a node can detect an attacker whose transmission rate is too much. Although an attacker may falsify entry to pretend that his/her transmission rate is less than the actual value, it can also be detected through the contradiction between a falsified entry and another entry. However, since a node sends all ER entries in its own buffer regardless of whether an entry is helpful to detect an attacker or not, the energy consumption increases as the number of entries increases. In this paper, we propose an ER reduction scheme based on theoretical contact probability for flooding attack mitigation. We focus on the fact that if the falsified entry does not exist, corresponding entries are not helpful to detect an attacker. Since the falsified entries are propagated over the network with the lapse of time, the probability that there is no contradicting entries over the network gets higher if a node has not received any contradicting entries for a sufficient time. By removing such entries, the energy consumption can be reduced while the effectiveness of ER is kept. By computer simulation, we demonstrate our scheme successfully reduce the energy consumption while the same level of performance is achieved.

KW - Delay Tolerant Network

KW - Flooding attack

KW - Mitigation

KW - Security

UR - http://www.scopus.com/inward/record.url?scp=85062892481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062892481&partnerID=8YFLogxK

U2 - 10.1109/APCC.2018.8633455

DO - 10.1109/APCC.2018.8633455

M3 - Conference contribution

AN - SCOPUS:85062892481

T3 - 2018 24th Asia-Pacific Conference on Communications, APCC 2018

SP - 34

EP - 39

BT - 2018 24th Asia-Pacific Conference on Communications, APCC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -