DocumentCode
2334220
Title
Castor: Scalable Secure Routing for Ad Hoc Networks
Author
Galuba, Wojciech ; Papadimitratos, Panos ; Poturalski, Marcin ; Aberer, Karl ; Despotovic, Zoran ; Kellerer, Wolfgang
Author_Institution
Ecole Polytech. Fed. de Lausanne (EPFL), Lausanne, France
fYear
2010
fDate
14-19 March 2010
Firstpage
1
Lastpage
9
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 acknowledgments, 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.
Keywords
routing protocols; telecommunication network reliability; telecommunication security; wireless mesh networks; Castor; control messages; scalable secure routing; wireless ad hoc networks; Ad hoc networks; Communication system control; Communications Society; Data communication; Feedback; Mobile communication; Peer to peer computing; Protocols; Routing; Telecommunication network reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2010 Proceedings IEEE
Conference_Location
San Diego, CA
ISSN
0743-166X
Print_ISBN
978-1-4244-5836-3
Type
conf
DOI
10.1109/INFCOM.2010.5462115
Filename
5462115
Link To Document