| Summary: | 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 93 === Because the vantage of conveniences and costs, there are more and more people involved in the area of research in Ad Hoc networks. However, because the efficiency was concerned first at the initial time of the protocol design, leads to the lack of security inborn. Although there are many security schemes can be applied to those protocols, the security is still not enough.
The node in Ad Hoc networks plays both the role of routers and terminals. This leads to the difference of the secure design between Ad Hoc networks and wired networks. Moreover, the routing path in Ad Hoc networks is dynamic; it is not fixed as in wired networks. Therefore, some secure mechanisms used in wired networks can not simply be applied to the protocols in Ad Hoc networks.
After analyzing various types of attack against Ad Hoc networks, we will propose a secure scheme for the famous routing protocol, AODV. Fist, we divide routing information (the content of routing packets) into two parts. They are static and dynamic fields. For the static part, the messages transmitted between two end nodes are fixed, so it is suitable to use the digital signature to protect this part. Furthermore, because of the problem for the public key distribution, we use the ID-based digital signature with our method to achieve the security. For the dynamic part, the messages transmitted between two end nodes are mutable, so it is not suitable to use the above method to protect this part. We use the one-way function with the property of homomorphism through our method to guarantee the security. Furthermore, we use NS2 (Network Simulator) to simulate our scheme and discuss how well the efficiency is from the simulation results. Finally, we try to achieve the simple implementation to ensure the feasibility.
|
|---|
