SEAD-FHC: Secure Efficient Distance Vector Routing with Fixed Hash Chain length

§ Basaveswara Institute Of Information Technology, Hyd...

Send Message

To: Author

SEAD-FHC: Secure Efficient Distance Vector Routing with Fixed Hash Chain length

Article Fingerprint

ReserarchID

CSTO5XN5

SEAD-FHC: Secure Efficient Distance Vector Routing with Fixed Hash Chain length Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of a centralized access point. Secure Efficient Ad hoc Distance Vector (SEAD) is a proactive routing protocol, based on the design of Destination Sequenced Distance Vector routing protocol (DSDV). SEAD provides a robust protocol against attackers trying to create incorrect routing state in the other node. However, the computational cost creating and evaluating hash chain increases if number of hops in routing path increased. In this paper, we propose Secure Efficient Ad hoc Distance Vector with fixed hash chain length in short SEAD-FHC protocol to minimize and stabilize the computational complexity that leads minimization in delay time and maximization in throughput. A series of simulation experiments are conducted to evaluate the performance.

References

38 Cites in Article
  1. C Perkins,E Royer (1999). Ad-hoc on-demand distance vector routing.
  2. A Wood,J Stankovic (2002). Denial of service in sensor networks.
  3. Perlman (1998). Network Layer Protocols with Byzantine Robustness.
  4. (2002). Secure Routing for Mobile Ad Hoc Networks.
  5. (2002). The Keyed-Hash Message Authentication Code (HMAC).
  6. Dahill (2001). A Secure Routing Protocol for Ad Hoc Networks.
  7. Manel Zapata (2002). Secure ad hoc on-demand distance vector routing.
  8. Rivest (1978). A method for obtaining Digital Signatures and Public Key Cryptosystems.
  9. Cheung (1997). An Efficient Message Authentication Scheme for Link State Routing.
  10. R Hauser,T Przygienda,G Tsudik (1997). Reducing the cost of security in link-state routing.
  11. Hu (1981). Password Authentication with Insecure Communication.
  12. Lamport (1979). Constructing Digital Signature Based on a Conventional Encryption Function.
  13. Y Hu,D Johnson,A Perrig (2003). SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks.
  14. Perrig (2001). Efficient and Secure Source Authentication for Multicast.
  15. Sergio Marti,T Giuli,Kevin Lai,Mary Baker (2000). Mitigating routing misbehavior in mobile ad hoc networks.
  16. Awerbuch (2002). An On-Demand Secure Routing Protocol Resilient to Byzantine Failures.
  17. Amir Herzberg,Shay Kutten (2000). Early Detection of Message Forwarding Faults.
  18. Avramopoulos (2003). A Routing Protocol with Byzantine Robustness.
  19. Johnson (1996). Dynamic Source Routing in Ad Hoc Wireless Networks.
  20. Benjamin Arazi (2009). Message Authentication in Computationally Constrained Environments.
  21. B Bellur,R Ogier (1999). A reliable, efficient topology broadcast protocol for dynamic networks.
  22. R Boppana,S Konduru (2001). An adaptive distance vector routing algorithm for mobile, ad hoc networks.
  23. T Clausen,P Jacquet,A Laouiti,P Minet,P Muhlethaler,A Qayyum,L Viennot (2001). Optimized Link State Routing Protocol.
  24. J Garcia-Luna-Aceves,C Fullmer,E Madruga,D Beyer,T Frivold (1997). Wireless Internet Gateways (WINGS).
  25. (2011). Unknown Title.
  26. J Jubin,J Tornow (1987). The DARPA packet radio network protocols.
  27. Shree Murthy,J Garcia-Luna-Aceves (1996). An efficient routing protocol for wireless networks.
  28. C Perkins,P Bhagwat (1994). Highly Dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers.
  29. D Johnson,D Maltz (1996). Dynamic source routing in ad hoc wireless networks.
  30. V Park,M Corson (1997). A highly adaptive distributed routing algorithm for mobile wireless networks.
  31. Z Haas (1997). A routing protocol for the reconfigurable wireless network.
  32. C Hedrick (1988). Routing Information Protocol.
  33. G Malkin (1994). RIP Version 2 Protocol Applicability Statement.
  34. G Malkin (1998). RIP Version 2.
  35. Norman Abramson (1970). THE ALOHA SYSTEM.
  36. F Baker,R Atkinson (1997). RIP-2 MD5 Authentication, RFC.
  37. S Basagni,K Herrin,E Rosti,D Bruschi (2001). Secure Pebblenets.
  38. Josh Broch,David Maltz,David Johnson,Yih-Chun Hu,Jorjeta Jetcheva (1998). A performance comparison of multi-hop wireless ad hoc network routing protocols.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Mrs. Prasuna V G. 1970. "SEAD-FHC: Secure Efficient Distance Vector Routing with Fixed Hash Chain length". Global Journal of Computer Science and Technology GJCST Volume 11 (GJCST Volume 11 Issue 20).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST Classification E.2
E.3
Version of record

v1.2

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 5.2K
Total Downloads: 412
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

SEAD-FHC: Secure Efficient Distance Vector Routing with Fixed Hash Chain length

Mrs. G
Mrs. G Basaveswara Institute Of Information Technology, Hyderabad,India