On multipath routing in multihop wireless networks: security, performance, and their tradeoff

Authors:
Lin Chen;Jean Leneutre
Affiliations:
Department of Computer Science and Networking, LTCI, UMR, laboratory, CNRS, Telecom Paris Tech, Paris, France;Department of Computer Science and Networking, LTCI, UMR, laboratory, CNRS, Telecom Paris Tech, Paris, France
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network security
Year:
2009

Citing 9
Cited 2

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimax Models for Diverse Routing

INFORMS Journal on Computing
Optimal Physical Diversity Algorithms and Survivable Networks

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Generalized maximum flow algorithms

Generalized maximum flow algorithms
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
A new scheme on link quality prediction and its applications to metric-based routing

Proceedings of the 3rd international conference on Embedded networked sensor systems
Misbehavior resilient multi-path data transmission in mobile ad-hoc networks

Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Secure data communication in mobile ad hoc networks

IEEE Journal on Selected Areas in Communications

A survey on secure multipath routing protocols in WSNs

Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing amid malicious attackers in multihop wireless networks with unreliable links is a challenging task. In this paper, we address the fundamental problem of how to choose secure and reliable paths in such environments. We formulate the multipath routing problem as optimization problems and propose algorithms with polynomial complexity to solve them. Game theory is employed to solve and analyze the formulated multipath routing problem. We first propose the multipath routing solution minimizing the worst-case security risk (i.e., the percentage of packets captured by attackers in the worst case). While the obtained solution provides the most security routes, it may perform poorly given the unreliability of wireless links. Hence we then investigate the multipath routing solution maximizing the worst-case packet delivery ratio. As a natural extension, to achieve a tradeoff between the routing security and performance, we derive the multipath routing protocol maximizing the worst-case packet delivery ratio while limiting the worst-case security risk under given threshold. As another contribution, we establish the relationship between the worst-case security risk and packet delivery ratio, which gives the theoretical limit on the security-performance tradeoff of node-disjoint multipath routing in multihop wireless networks.