On Multipath Routing in Multihop Wireless Networks: Security, Performance, and Their Tradeoff

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.

[1]  Panagiotis Papadimitratos,et al.  Secure link state routing for mobile ad hoc networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[2]  Éva Tardos,et al.  Generalized maximum flow algorithms , 1999 .

[3]  Ahmad Khonsari,et al.  Misbehavior resilient multi-path data transmission in mobile ad-hoc networks , 2006, SASN '06.

[4]  Alan Washburn,et al.  Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..

[5]  F. Schlenk.  Proof of Theorem 4 , 2005 .

[6]  Douglas R. Shier,et al.  Minimax Models for Diverse Routing , 2002, INFORMS J. Comput..

[7]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[8]  Murali S. Kodialam,et al.  Detecting network intrusions via sampling: a game theoretic approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  繁野 麻衣子,et al.  A survey of combinatorial maximum flow algorithms on a network with gains , 2003 .

[10]  Joao P. Hespanha,et al.  Preliminary results in routing games , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[11]  W. Mayeda,et al.  Properties of Lossy Communication Nets , 1965 .

[12]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[13]  Panagiotis Papadimitratos,et al.  Secure data communication in mobile ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

[14]  João Pedro Hespanha,et al.  Enhancing security via stochastic routing , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[15]  Vishal Misra,et al.  Distributed algorithms for secure multipath routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[18]  Ramesh Bhandari,et al.  Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[19]  Symeon Papavassiliou,et al.  Improving network security by multipath traffic dispersion , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[20]  Yuguang Fang,et al.  SPREAD: enhancing data confidentiality in mobile ad hoc networks , 2004, IEEE INFOCOM 2004.

[21]  Yong Wang,et al.  A new scheme on link quality prediction and its applications to metric-based routing , 2005, SenSys '05.