Communications of the ACM
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Enabling large-scale wireless broadband: the case for TAPs
ACM SIGCOMM Computer Communication Review
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Preserving Traffic Privacy in Wireless Mesh Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Adaptive algorithms to enhance routing and security for wireless PAN mesh networks
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
Securing wireless mesh networks
IEEE Wireless Communications
Key agreement in ad hoc networks
Computer Communications
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.03 |
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.