Research on Robustness of Typically Opportunistic Network Routing Algorithm under Flooding Attack

Geng Yu; Dong Fang Yuan; Yan Cui; Ying Dong Wang; Ping Zong

doi:10.4028/www.scientific.net/AMR.989-994.2227

Paper Titles

Maneuvering Target Tracking Algorithm Based on Particle PHD Filtering
p.2212

Applying Grey System Theory in an Ideological and Political Education Course
p.2216

Ideological and Political Education Linear Regression Theory
p.2220

An Improved Genetic Algorithm in Vehicle Dispactcher
p.2223

Research on Robustness of Typically Opportunistic Network Routing Algorithm under Flooding Attack
p.2227

A Localization Algorithm Research to Eliminate the Indoor NLOS Error
p.2232

Communication Network Alarm Correlation Based on the Confidence Fusion Algorithm
p.2237

A Purchase Prediction Based on Collaborative Filtering Algorithm
p.2241

K-Means Clustering Algorithm Method Based on Shuffled Frog Leaping Algorithm
p.2245

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 989-994Research on Robustness of Typically Opportunistic...

Research on Robustness of Typically Opportunistic Network Routing Algorithm under Flooding Attack

Abstract:

This paper designed the evaluation method and the index system. Through simulating behavior of pedestrian with mobile intelligent Bluetooth devices in the real city scene and did a quantitative analysis about the effects of flooding attacks to opportunity network in the three aspects of transmission capacity, transmission efficiency and energy consumption of nodes , in order to evaluate Direct Delivery, Spray and Wait and MaxProp the three opportunity network routing algorithm’s robustness under the flooding attack results showed that Direct Deliven algorithm robustness is best, it can withstand flooding attacks completely, robustness of the Spray and Wait algorithm is the worst, their performance will decline more than 80% in some scenarios, the performance of MaxProp algorithm under flood attacks will decrease remarkably.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2227-2231

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.989-994.2227

Citation:

Cite this paper

Online since:

July 2014

Authors:

Geng Yu*, Dong Fang Yuan, Yan Cui, Ying Dong Wang, Ping Zong

Keywords:

Flooding Attack, Malicious Nodes, Opportunity Network, Robustness, Routing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Huang C H，Lank C，Tsaic Z. A survey of opportunistic networks (2008)1672-1677.

Google Scholar

[2] Farrell S, Symington S，Weiss Het al. Delay-tolerant networkingSecurity overview draftirtfdtnrg-sec-overview-06[EB/OL]. http：/tools. ietf. org/html/draft-irtf-dtnrg-sec-overview-06.

Google Scholar

[3] Kate A，Zaverucha G M，Hengartner U. Anonymity and securityin delay tolerant networks （ 2007）504-513.

Google Scholar

[4] Asokan N，Kostianinen K，Ginzboorg P，et al. Towards securingDisruption-tolerant networking，Tech Rep NRC-TR-2007-007. (2007).

Google Scholar

[5] Burgess J，Bissias G D，Corner M D. Surviving attacks on disruption-tolerant networks without authentication (2007).

DOI: 10.1145/1288107.1288116

Google Scholar

[6] Fawal A，Boudec J Y，Salamatian K. Vulnerabilities in epidemicForwarding （2007）.

Google Scholar