Securely Deliver Data by Multi-path Routing Scheme in Wireless Mesh Networks

Wireless Mesh Networks with static Transit Access Points (TAPs) have many advantages to connect different kinds of networks. While Mobile Ad hoc Networks still have many challenges to improve because of dynamic topology and security vulnerabilities, WMNs are the best solution for wireless communication recently. To utilize the characteristics of WMN's topology, in this paper, we propose an algorithm to preserve privacy for routing. This idea comes from the fact that if we can separate data traffic into more than one path, the probability to capture all traffic from intermediate node is very small. It means it is very difficult to launch traffic analysis attacks because of traffic confidentiality. In addition, to hide securely the real source and destination addresses a new technique is proposed along with an Adaptive Key Agreement Scheme. We apply Information Entropy to model our routing traffic and highlight the robustness of the algorithm. We also present a detail traffic evaluation observed from neighboring nodes to show the availability of our proposal in term of robustness, loop free and computational overhead.

[1]  Yuan Xue,et al.  Preserving traffic privacy in wireless mesh networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[2]  Roger Karrer,et al.  Enabling large-scale wireless broadband , 2004, Comput. Commun. Rev..

[3]  Nitin H. Vaidya,et al.  Preventing traffic analysis in packet radio networks , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[4]  Choong Seon Hong,et al.  Adaptive Algorithms to Enhance Routing and Security for Wireless PAN Mesh Networks , 2006, OTM Workshops.

[5]  Jean-Pierre Hubaux,et al.  Securing wireless mesh networks , 2006, IEEE Wireless Communications.

[6]  Bharat K. Bhargava,et al.  AO2P: ad hoc on-demand position-based private routing protocol , 2005, IEEE Transactions on Mobile Computing.

[7]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[8]  Paul Syverson,et al.  Onion Routing for Anonymous and Private Internet Connections , 1999 .

[9]  N. Asokan,et al.  Key agreement in ad hoc networks , 2000, Comput. Commun..

[10]  Srdjan Capkun,et al.  Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks , 2004 .

[11]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[12]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).

[13]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[14]  Victor C. M. Leung,et al.  Secure Routing for Mobile Ad Hoc Networks , 2006 .

[15]  Zahir Tari,et al.  On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops , 2003, Lecture Notes in Computer Science.

[16]  Paul F. Syverson,et al.  Onion routing , 1999, CACM.