Adapting to a reliable network path

Awerbuch, Baruch; Mansour, Yishay

doi:10.1145/872035.872090

Cited by 12 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Byzantine behavior causes such algorithms to collapse. Most recently, "ondemand" routing against an oblivious adversary was suggested in [3]. In this model, an adversary cannot cheat and the pattern of cheating and blocking is assumed to be oblivious, i.e., this work does not handle dynamic DOS attacks.…”

Section: Existing Work A) Algorithmic Workmentioning

confidence: 99%

“…The probability associated with a neighbor is a local estimate of the the relative likelihood of that neighbor forwarding and eventually delivering the packet to the destination. The algorithm is similar to the one in [3]; however its analysis is different.…”

Section: A Solution Outlinementioning

confidence: 99%

“…i) Quantitatively ranking the incoming edges: Once the source receives a NACK from a node, it views this as a positive ack from all edges prior to the node sending the NACK, and as a NACK from all the edges beyond this node. As in [3], the source ranks the edges based on the percentage of "luck" they bring. Luck is the ratio of positive ACK's from the edge, and the total number of ACK's (positive and negative) associated with this edge.…”

Section: B More Details Of Our Approachmentioning

confidence: 99%

“…Our algorithm is a variant of the algorithm in [3] for adapting to a reliable network path. We will use the following notations.…”

Section: Specification Of the Algorithmmentioning

confidence: 99%

“…For example, [1] considers a random fault pattern; [2] deals with a static fault pattern and [3] deals with an oblivious (non-adaptive) pattern.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Provably competitive adaptive routing

Awerbuch

Holmer

Rubens

et al.

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.

View full text Add to dashboard Cite

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. BACKGROUNDThe 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 protocols are susceptible to a wide variety of attacks. For example, a malicious node may perform a denial of service attack by selectively jamming some areas of the network.A great deal of work has been done in terms of guaranteeing practical security considerations in existing network protocols. In practice, adversarial attacks observed and documented in ad hoc networks might not be overly sophisticated. The ease of access to the medium has allowed extremely basic attacks to cause a great deal of damage. Consequently, such attacks can be thwarted by simple yet effective methods.Existing work in the literature considered a number of strong adversary models. For example, [1] considers a random fault pattern; [2] deals with a static fault pattern and [3] deals with an oblivious (non-adaptive) pattern.Our goal is to design routing protocols for networks that are provably tolerant of arbitrary adaptive DOS attacks. The adversary that we will consider selectively attacks packets on a given node or link. This adversary benefits from knowledge of the traffic pattern (including packet contents); this includes all current traffic and all past traffic history.As a result, the algorithms and analysis techniques used in the previous work will not apply. Existing methods that do not ignore sophisticated adaptive attacks either use brute force (flooding) or assume the existence of some trusted servers or routers. We do not wish to make such restrictive assumptions. As a result, the task of designing a throughput-competitive routing algorithm is much harder.It may appear that our adversarial routing model may lead to impractical algorithms in benign (non-adversarial) settings. However, routing algorithms similar to the one studied here were developed and tested in real network environments by British Telecomm and NTT for both wired and wireless networks with superior results Our contribution: We propose a new algorithm for adaptively selecting routing paths in a network with dynamic adversarial edge failures, and we give a rigorous mathematical analysis of...

show abstract

Section: Existing Work A) Algorithmic Workmentioning

confidence: 99%

Section: A Solution Outlinementioning

confidence: 99%

Section: B More Details Of Our Approachmentioning

confidence: 99%

“…Our algorithm is a variant of the algorithm in [3] for adapting to a reliable network path. We will use the following notations.…”

Section: Specification Of the Algorithmmentioning

confidence: 99%

“…For example, [1] considers a random fault pattern; [2] deals with a static fault pattern and [3] deals with an oblivious (non-adaptive) pattern.…”

Section: Introductionmentioning