Castor: Scalable Secure Routing for Ad Hoc Networks

Abstract

Abstract-Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: It does not use any control messages except simple packet acknowledgements, and each node makes routing decisions locally and independently without exchanging any routing state with other nodes. Its novel design makes Castor resilient to a wide range of attacks and allows the protocol to scale to large network sizes and to remain efficient under high mobility. We compare Castor against four representative protocols from the literature. Our protocol achieves up to two times higher packet delivery rates, particularly in large and highly volatile networks, while incurring no or only limited additional overhead. At the same time, Castor is able to survive more severe attacks and recovers from them faster.

Study on Homomorphic Linear Authenticator in Wireless Ad Hoc Networks

“…The second sub-category is based on reputation systems [5], [6], [7], [8]. Here the system depends on neighbour nodes to identify the malicious node.…”

Secure Approach for Transmitting Provenance Information About Data

“…The set of rule accomplishes more packet transfer rates. [4] In 2008 Hovav Shacham & Brent Waters discovered a proof-of-retrievability system; an information storage system should convey a friend that he put all of a client's information. The main test is to make frameworks that are each practical and verifiably secure those thought it to be achievable to remove the client information from any prove that passes a confirmation check.…”

Detecting Packet Dropping Attack in Wireless Ad Hoc Network

“…But when the attacker performs a selective dropping, it gets enough credits and can continue as a part of the network. The second sub category is based on reputation systems [4], [5], [6], [7]. In this mechanism the neighbour nodes monitor the activity of all nodes.…”