Routing for information leakage reduction in multi-channel multi-hop ad-hoc social networks

Abstract

Abstract. This paper investigates the routing problem for information leakage reduction in multi-channel ad-hoc networks. In particular, we focus on two routing models: Trusted Group Multicast (TGM) and Con-fidential 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, we propose a routing algorithm to re-duce the information leakage. The performance of our design is evaluated through simulation studies.