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

Wei Cheng*, Dengyuan Wu, Xiuzhen Cheng, Dechang Chen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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 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, we propose a routing algorithm to reduce the information leakage. The performance of our design is evaluated through simulation studies.

Original languageEnglish
Title of host publicationWireless Algorithms, Systems, and Applications - 7th International Conference, WASA 2012, Proceedings
Pages31-42
Number of pages12
DOIs
StatePublished - 2012
Externally publishedYes
Event7th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2012 - Yellow Mountains, China
Duration: 8 Aug 201210 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7405 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2012
Country/TerritoryChina
CityYellow Mountains
Period8/08/1210/08/12

Fingerprint

Dive into the research topics of 'Routing for information leakage reduction in multi-channel multi-hop ad-hoc social networks'. Together they form a unique fingerprint.

Cite this