Abstract
We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We prove that both problems are NP-hard and MAX-SNP (i.e., it is NP-hard to approximate them within a factor of 1 + ε for ε > 0) with a reduction to MAX3SAT problem.
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.
Similar content being viewed by others
References
Zhang, J., Varadharajan, V.: Wireles ssensor network key management survey and taxonomy. J. Netw. and Com. App. 33 (2010)
Camtepe, S.A., Yener, B.: Key Management. In: Wireless Sensor Network Security. Cryptology and Information Security Series. IOS Press (2008)
Santi, P., Maheshwari, R., Resta, G., Das, S., Blough, D.M.: Wireless link scheduling under a graded sinr interference model. In: ACM FOWANC (2009)
Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric sinr. In: ACM MobiHoc (2007)
Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets sinr: the scheduling complexity of arbitrary topologies. In: ACM MobiHoc (2006)
Bhandari, V., Vaidya, N.H.: Secure capacity of multi-hop wireless networks with random key pre-distribution. In: IEEE MCN (2008)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: ACM CCS (2002)
Liu, D., Ning, P., Du, W.: Group-based key predistribution for wireless sensor networks. ACM TOSN 4(2) (2008)
Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1997)
Naor, D., Gusfield, D., Martel, C.: A fast algorithm for optimally increasing the edge connectivity. SIAM J. of Comp. 26(4) (1997)
Nagamochi, H., Ibaraki, T.: Augmenting edge-connectivity over the entire range in o(nm) time. J. Alg. 30(2) (1999)
Benczúr, A.A., Karger, D.R.: Augmenting undirected edge connectivity in (n 2) time. In: ACM-SIAM SODA (1998)
Savas, O., Alanyali, M., Yener, B.: Joint route and power assignment in asynchronous multi-hop wireless networks. In: MedHocNet (2004)
Costa, M.C., Létocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: a survey. Elsevier J. of Op. Res. 162 (2005)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comp. and Sys. Sci. 43(3) (1991)
Camtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM TON 15(2) (2007)
Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
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
Camtepe, S.A. (2013). Complexity of Increasing the Secure Connectivity in Wireless Ad Hoc Networks. In: Boyd, C., Simpson, L. (eds) Information Security and Privacy. ACISP 2013. Lecture Notes in Computer Science, vol 7959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39059-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-39059-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39058-6
Online ISBN: 978-3-642-39059-3
eBook Packages: Computer ScienceComputer Science (R0)