A parallel prevention algorithm for black hole attacks in MANET
In this paper, we propose a parallel algorithm for MANETs that optimizes both routing discovery and security in an Ad Hoc On Demand Distance Vector (AODV). The new algorithm, termed as Parallel Grid Optimization by the Daddy Long-Legs Algorithm (PGO-DLLA), simulates the behavior of the biological s...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | http://repo.uum.edu.my/15595/1/PID158.pdf http://repo.uum.edu.my/15595/ http://www.icoci.cms.net.my/proceedings/2015/TOC.html |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | In this paper, we propose a parallel algorithm for MANETs that optimizes both routing discovery and security in an Ad Hoc On Demand Distance Vector (AODV). The new algorithm, termed as Parallel
Grid Optimization by the Daddy Long-Legs Algorithm (PGO-DLLA), simulates the behavior of the biological spiders known as daddy long-legs
spiders.Experiments were conducted on an NS2 simulator to demonstrate the efficiency and robustness of the proposed algorithm.The results indicate better performance than the AntNet algorithm with respect to all metrics that used in experiments such as packet delivery ratio (PDR), end-to-end delay (EtoE) and Packet loss (PL) except throughput, for which AntNet is the better
algorithm.In addition, the results show that PGO-DLLA outperforms the standard AODV algorithm in simulations of both a peaceful environment
and a hostile environment represented by a black hole attacks. |
|---|