On optimizing compatible security policies in wireless networks

Scott C.-H. Huang; Kia Makki; Niki Pissinou

doi:10.1155/WCN/2006/23728

On optimizing compatible security policies in wireless networks

Scott C.-H. Huang
, Kia Makki
, Niki Pissinou

Department of Computer Science

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

3 Downloads (CityUHK Scholars)

Abstract

This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio 1+1/k for any integer k with complexity O( N k+1).
Copyright © 2006 Scott C.-H. Huang et al.

Original language	English
Article number	23728
Journal	Eurasip Journal on Wireless Communications and Networking
Volume	2006
DOIs	https://doi.org/10.1155/WCN/2006/23728
Publication status	Published - 2006

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Publisher's Copyright Statement

This full text is made available under CC-BY 2.0. https://creativecommons.org/licenses/by/2.0/

Access Output

10.1155/WCN/2006/23728

362382695.pdfFinal Published version, 361 KBLicence: CC BY

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{da72638e344843f0b7653481e6dd359f,

title = "On optimizing compatible security policies in wireless networks",

abstract = "This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio 1+1/k for any integer k with complexity O( N k+1). Copyright {\textcopyright} 2006 Scott C.-H. Huang et al. ",

author = "Huang, \{Scott C.-H.\} and Kia Makki and Niki Pissinou",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2006",

doi = "10.1155/WCN/2006/23728",

language = "English",

volume = "2006",

journal = "Eurasip Journal on Wireless Communications and Networking",

issn = "1687-1472",

publisher = "SpringerOpen",

}

TY - JOUR

T1 - On optimizing compatible security policies in wireless networks

AU - Huang, Scott C.-H.

AU - Makki, Kia

AU - Pissinou, Niki

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2006

Y1 - 2006

N2 - This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio 1+1/k for any integer k with complexity O( N k+1). Copyright © 2006 Scott C.-H. Huang et al.

AB - This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio 1+1/k for any integer k with complexity O( N k+1). Copyright © 2006 Scott C.-H. Huang et al.

UR - https://www.scopus.com/pages/publications/33746628556

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33746628556&origin=recordpage

U2 - 10.1155/WCN/2006/23728

DO - 10.1155/WCN/2006/23728

M3 - RGC 21 - Publication in refereed journal

SN - 1687-1472

VL - 2006

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

M1 - 23728

ER -

On optimizing compatible security policies in wireless networks

Abstract

Bibliographical note

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this