Summary: | 碩士 === 逢甲大學 === 資訊電機工程碩士在職專班 === 97 === Mobile ad-hoc networks have wireless links and infrastructure-less nature. The wireless nodes operate both as communication end-points as well as routers, enabling multi-hop wireless communication. The wireless communication links can be eavesdropped on without noticeable effort and communication protocols on all layers are vulnerable to specific attacks. In contrast to wired networks, known attacks like masquerading, man-in-the middle, and replaying of messages can easily be carried out. Obviously, building the trusted relationship of the nodes is an important element for MANets. Some security schemes of key management have been proposed in MANets which use threshold cryptography schemes to protect a key file or certificate. Threshold cryptography is a method to divide a file into n secret slices. In such a way that the file can be easily reconstructed with any k secret slices. Those security schemes require simultaneous communication with group-subset nodes. Those security schemes need a location repository to collect address of service node and maintain an address list. Those schemes encounter some problems, including data freshness, cost of update and slow converge. The anycast-k technology allows a node to discover any k nodes of same anycast group without location repository. As far as we know, there is no implementation of IPv6-based threshold key management system using anycast-k scheme in MANets. Therefore, we design and implement a threshold key management system using anycast schemes in MANets. The experiment results show that anycast-k can effectively discover k services, reduce control overhead, and improve the rate of fault tolerant.
|