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, 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.
KeywordsWireless Sensor Network Cognitive Radio Steiner Tree Cognitive Radio Network Relay Selection
Unable to display preview. Download preview PDF.
- 1.Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1997)Google Scholar
- 2.Karlof, C., Wagner, D.: Secure routing in wireless sensor networks: attacks and countermeasures. In: Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, pp. 113–127 (May 2003)Google Scholar
- 3.Li, Y., Wang, P., Niyato, D., Zhuang, W.: A dynamic relay selection scheme for mobile users in wireless relay networks. In: INFOCOM, 2011 Proceedings IEEE, pp. 256–260 (April 2011)Google Scholar
- 4.Wu, S., Candan, K.S.: Gmp: Distributed geographic multicast routing in wireless sensor networks. In: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006. IEEE Computer Society, Washington, DC (2006)Google Scholar
- 5.Sanchez, J., Ruiz, P., Stojmnenovic, I.: Gmr: Geographic multicast routing for wireless sensor networks. In: 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, SECON 2006, vol. 1, pp. 20–29 (September 2006)Google Scholar
- 6.Frey, H., Ingelrest, F., Simplot-Ryl, D.: Localized minimum spanning tree based multicast routing with energy-efficient guaranteed delivery in ad hoc and sensor networks. In: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2008, pp. 1–8. IEEE Computer Society, Washington, DC (2008)CrossRefGoogle Scholar
- 9.Xin, C., Xie, B., Shen, C.C.: A novel layered graph model for topology formation and routing in dynamic spectrum access networks. In: 2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2005, pp. 308–317 (November 2005)Google Scholar
- 10.Pefkianakis, I., Wong, S., Lu, S.: Samer: spectrum aware mesh routing in cognitive radio networks. In: Cognitive Radio Networks, 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2008, pp. 1–5 (2008)Google Scholar
- 13.Abbagnale, A., Cuomo, F.: Gymkhana: A connectivity-based routing scheme for cognitive radio ad hoc networks. In: INFOCOM IEEE Conference on Computer Communications Workshops, pp. 1–5 (March 2010)Google Scholar