Abstract
As the number of applications and the support for ad hoc networks increases, so does the role and manufacturer heterogeneity of the nodes. This creates a valid concern for the network security, privacy and efficiency. We propose as solution a group-based anonymous routing protocol targeting low resource networks, where groups could contain nodes with similar hardware or trust levels. Distinctive features are the support for overlapping groups, the possibility of a sender restricting the route to a destination to one or more groups, and the existence of a node revocation mechanism. To achieve this, two main primitives are utilized: secret handshakes with key-agreement from pairing-based cryptography and private set intersection from pre-distributed keys. We analyze the effects of varying the group size on the network connectivity, on the average route length and on the network privacy. To validate the protocol’s efficiency, we measure its performance on resource-restricted TelosB motes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.: Secret Handshakes from Pairing-based Key Agreements. In: IEEE Symposium on Security and Privacy, pp. 180–196 (2003)
Boneh, D., Franklin, M.: Identity-based Encryption from the Weil Pairing. SIAM J. of Computing 32(3), 586–615 (2003)
Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)
Menezes, A.J., Vanstone, S.A., van Oorschot, P.C.: Handbook of Applied Cryptography. CRC Press (1996)
Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)
Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Onion Routing. Communications of the ACM 42(2), 39–41 (1999)
Kong, J., Hong, X.: ANODR: ANonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 291–302 (2003)
Moldovan, G., Ignat, A.: An Anonymous Efficient Private Set Intersection Protocol for Wireless Sensor Networks. In: Proceedings of the 25th International Conference on Architecture of Computing Systems - ARCS Workshops, pp. 39–49 (2012)
Perkins, C.E., Royer, E.M., Das, S.: Ad hoc On-Demand Distance Vector Routing. RFC3561 (2003)
Zhang, Y., Liu, W., Lou, W., Fang, Y.: MASK: Anonymous On-Demand Routing in Mobile Ad Hoc Networks. IEEE Transactions on Wireless Communications 5(9), 2376–2385 (2006)
Aranha, D.: F., Gouvêa, C.,P.,L.: RELIC is an Efficient LIbrary for Cryptography, http://code.google.com/p/relic-toolkit/
de Meulenaer, G., Gosset, F., Standaert, F., Pereira, O.: On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks. In: Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication, pp. 580–585 (2008)
Sweeney, L.: k-Anonymity: A Model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst., 557–570 (2002)
Bettstetter, C., Wagner, C.: The Spatial Node Distribution of the Random Waypoint Mobility Model. In: Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002, pp. 41–58 (2002)
Bettstetter, C.: On the Connectivity of Ad Hoc Networks. The Computer Journal, 557–570 (2004)
Liu, J., Kong., J., Hong., X., Gerla, M.: Performance evaluation of anonymous routing protocols in MANETs. In: Wireless Communications and Networking Conference WCNC, pp. 646–651 (2006)
Polastre, J., Szewczyk, R., Culler, D.: Telos: enabling ultra-low power wireless research. In: Fourth International Symposium on Information Processing in Sensor Networks, pp. 364–369 (2005)
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Navidi, W., Camp, T.: Stationary distributions for the random waypoint mobility model. IEEE Transactions on Mobile Computing 3(1), 99–108 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moldovan, G., Ignat, A., Gergeleit, M. (2013). Group-Based Anonymous On-Demand Routing Protocol for Resource-Restricted Mobile Ad Hoc Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)