Provably competitive adaptive routing

Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermediary nodes. Routing in ad hoc networks is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. In addition, security is critical in these networks due to the accessibility of the shared wireless medium and the cooperative nature of ad hoc networks. However, none of the existing routing algorithms can withstand a dynamic proactive adversarial attack. The routing protocol presented in this work attempts to provide throughput-competitive route selection against an adaptive adversary. A proof of the convergence time of our algorithm is presented as well as preliminary simulation results. I. BACKGROUND The basic service offered by every node in an ad-hoc network is that of routing packets from their source to their ultimate destination. In general, routing protoco...

• Type: Conference
• Year: 2005
• Where: INFOCOM
• Authors: Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg
• Keywords: Ad Hoc Networks, Communications, INFOCOM 2005, Routing, Routing Protocols