Earticle

초록

영어

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, it does not provide a way to prevent an attacker from tampering the next hop or the destination field in route update. In this paper, we propose an I-SEAD protocol to solve the problem. A series of simulation experiments are conducted to evaluate the performance.

목차

Abstract
 1. Introduction
 2. Introduction of SEAD
  2.1. Second-order headings
  2.2. The SEAD Protocol
 3. The Proposed Protocol
  3.1. Some Problems Using the SEAD
  3.2. Our Enhancement on SEAD
  3.3. Secure Route Maintenance
 4. Performance Evaluation
  4.1. Simulation Setup
  4.2. Comparison of I-SEAD and SEAD
 5. Conclusions
 6. Acknowledgement
 7. References

저자

• Wei-Shen Lai [ Department of Information Management, Chienkuo Technology University, Taiwan ]
• Chu-Hsing Lin [ Department of Computer Science and Information Engineering, Tunghai University, Taiwan ]
• Jung-Chun Liu [ Department of Computer Science and Information Engineering, Tunghai University, Taiwan ]
• Yen-Lin Huang [ Department of Computer Science and Information Engineering, Tunghai University, Taiwan ]
• Mei-Chun Chou [ Department of Computer Science and Information Engineering, Tunghai University, Taiwan ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605