Routing for Information Leakage Reduction in Multi-Channel Multi-Hop Ad-Hoc Social Networks
This paper investigates the routing problem for information leakage reduction in multi-channel ad-hoc networks. In particular, the authors focus on two routing models: Trusted Group Multicast (TGM) and Confidential Unicast (CU). In TGM, a group member shares the information with all other group members; while in CU, a group member may only want to share the information with a few selected group members. In both cases, the sender would like to transmit the information through a route with a minimal probability of being overheard by non-destination users. To achieve this objective, they propose a routing algorithm to reduce the information leakage. The performance of their design is evaluated through simulation studies.