Complexity of increasing the secure connectivity in wireless ad hoc networks

Camtepe, Seyit A. (2013) Complexity of increasing the secure connectivity in wireless ad hoc networks. Lecture Notes in Computer Science : Information Security and Privacy, 7959, pp. 363-378.

View at publisher

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 with a reduction to MAX3SAT problem.

Impact and interest:

0 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

166 since deposited on 02 May 2013
3 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 59426
Item Type: Journal Article
Refereed: Yes
Additional Information: Proceedings of the 18th Australasian Conference on
Information Security and Privacy, Brisbane, Australia, 1-3 July 2013.
Keywords: Wireless sensor networks, key pre-distribution, complexity of key establishment
DOI: 10.1007/978-3-642-39059-3_25
ISSN: 1611-3349
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTER SOFTWARE (080300) > Computer System Security (080303)
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Past > Institutes > Information Security Institute
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2013 Springer
Copyright Statement: The original publication is available at SpringerLink http://www/springerlink.com
Deposited On: 02 May 2013 00:00
Last Modified: 22 Aug 2013 22:10

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page