مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

1,552
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

PRESENTING A NEW ALGORITHM WITH AIMING TO IMPROVE SECURITY AND PERFORMANCE OF AODV PROTOCOL IN AD HOC NETWORK

Pages

  69-80

Abstract

AD HOC NETWORKs include some wireless nodes which do not need any pre-existing network’s substructure. The nodes communicate to each other without any infrastructure. Because of some specifications such as dynamic changes of network’s structure, presumptions trust each other and ignore the nodes' actions, AD HOC NETWORKs are not protected against attacks of destructive nodes. In this study, a new method has been represented by combining a safe route detection method and an opposition method to destructive nodes to BLACK HOLE ATTACK countermeasure in AODV ROUTING PROTOCOL. At the first step, the source node confirms the validity of the route reply packet sender's node by finding more than one route to the destination. When a route reply packet arrives to a source node, then that node extracts the complete route to destruction and waits for other packs of route reply. The idea of this solution is waiting to receive route reply packet from more than two nodes. In the next step, according to nodes’ manner in the network, a voting from neighboring nodes has been done and by use of predefined rules, destructive nodes are identified and destroyed. Simulations results of OMNet++simulator show some improvements of the proposed algorithm to the original AODV protocol which has been attacked by the black hole.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    SHAHABI RABORI, S., & GHAZVINI, M.. (2018). PRESENTING A NEW ALGORITHM WITH AIMING TO IMPROVE SECURITY AND PERFORMANCE OF AODV PROTOCOL IN AD HOC NETWORK. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 5(4 (20) ), 69-80. SID. https://sid.ir/paper/243122/en

    Vancouver: Copy

    SHAHABI RABORI S., GHAZVINI M.. PRESENTING A NEW ALGORITHM WITH AIMING TO IMPROVE SECURITY AND PERFORMANCE OF AODV PROTOCOL IN AD HOC NETWORK. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2018;5(4 (20) ):69-80. Available from: https://sid.ir/paper/243122/en

    IEEE: Copy

    S. SHAHABI RABORI, and M. GHAZVINI, “PRESENTING A NEW ALGORITHM WITH AIMING TO IMPROVE SECURITY AND PERFORMANCE OF AODV PROTOCOL IN AD HOC NETWORK,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 5, no. 4 (20) , pp. 69–80, 2018, [Online]. Available: https://sid.ir/paper/243122/en

    Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button