Original article: Approximation algorithm for estimating failure probability of multipath transmission

Authors:
Sheng Zhong;Yuan Zhang
Affiliations:
Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, NY 14260, USA;Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, NY 14260, USA
Venue:
Mathematics and Computers in Simulation
Year:
2011

Citing 2
Cited 0

Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a computer network where nodes can fail, multipath transmission can be used to increase the probability of successful transmission. However, even multipath transmission has a probability of failure, which depends on the selected paths. Hence, estimating this probability of failure is of great importance for designing good multipath routing algorithms. In this paper, we show that it is NP-hard to compute the failure probability of multipath transmission. Therefore, we design a polynomial-time approximation algorithm for estimating this failure probability and give analysis of its error bounds. We also compare the results of our approximation algorithm with the results of Matlab simulations.