Skip to main content

Routing for Information Leakage Reduction in Multi-channel Multi-hop Ad-Hoc Social Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7405))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  7. Johansson, T., Osipov, E., Carr-Motyčkovà, L.: Interference Aware Construction of Multi- and Convergecast Trees in Wireless Sensor Networks. In: Balandin, S., Moltchanov, D., Koucheryavy, Y. (eds.) NEW2AN 2008. LNCS, vol. 5174, pp. 72–87. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Liu, Y., Liang, W.: Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks. In: Harju, J., Heijenk, G., Langendörfer, P., Siris, V.A. (eds.) WWIC 2008. LNCS, vol. 5031, pp. 201–212. Springer, Heidelberg (2008)

    Chapter  Google 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 

  11. Ding, L., Melodia, T., Batalama, S., Matyjas, J., Medley, M.: Cross-layer routing and dynamic spectrum allocation in Cognitive Radio Ad hoc Networks. IEEE Transactions on Vehicular Technology 59(4), 1969–1979 (2010)

    Article  Google Scholar 

  12. Shih, C.F., Liao, W., Chao, H.L.: Joint routing and spectrum allocation for multi-hop cognitive radio networks with route robustness consideration. IEEE Transactions on Wireless Communications 10(9), 2940–2949 (2011)

    Article  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, W., Wu, D., Cheng, X., Chen, D. (2012). Routing for Information Leakage Reduction in Multi-channel Multi-hop Ad-Hoc Social Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31869-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31868-9

  • Online ISBN: 978-3-642-31869-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics