Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks

dc.contributor.authorNeumann, A.
dc.contributor.authorGounder, S.
dc.contributor.authorYan, X.
dc.contributor.authorSherman, G.
dc.contributor.authorCampbell, B.
dc.contributor.authorGuo, M.
dc.contributor.authorNeumann, F.
dc.contributor.conferenceGenetic and Evolutionary Computation Conference (GECCO) (15 Jul 2023 - 19 Jul 2023 : Lisbon, Portugal)
dc.contributor.editorPaquete, L.
dc.date.issued2023
dc.description.abstractIn recent years, computing diverse sets of high quality solutions for an optimization problem has become an important topic. The goal of computing diverse sets of high quality solutions is to provide a variety of options to decision makers, allowing them to choose the best solution for their particular problem. We consider the problem of constructing a wireless communication network for a given set of entities. Our goal is to minimize the area covered by the senders' transmissions while also avoiding adversaries that may observe the communication. We provide evolutionary diversity optimization (EDO) algorithms for this problem. We provide a formulation based on minimum spanning forests that are used as a representation and show how this formulation can be turned into a wireless communication network that avoids a given set of adversaries. We evaluate our EDO approach based on a number of benchmark instances and compare the diversity of the obtained populations in respect to the quality criterion of the given solutions as well as the chosen algorithm parameters. Our results demonstrate the effectiveness of our EDO approaches for the detection and concealment of communication networks both in terms of the quality and the diversity of the obtained solutions.
dc.description.statementofresponsibilityAneta Neumann, Sharlotte Gounder, Xiankun Yan, Gregory Sherman, Benjamin Campbell, Mingyu Guo, Frank Neumann
dc.identifier.citationProceedings of the Genetic and Evolutionary Computation Conference (GECCO '23), 2023 / Paquete, L. (ed./s), pp.1436-1444
dc.identifier.doi10.1145/3583131.3590405
dc.identifier.isbn9798400701191
dc.identifier.orcidNeumann, A. [0000-0002-0036-4782]
dc.identifier.orcidYan, X. [0000-0002-2309-8034]
dc.identifier.orcidGuo, M. [0000-0002-3478-9201]
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]
dc.identifier.urihttps://hdl.handle.net/2440/139310
dc.language.isoen
dc.publisherAssociation for Computing Machinery
dc.publisher.placeNew York, NY
dc.relation.granthttp://purl.org/au-research/grants/arc/DP190103894
dc.relation.granthttp://purl.org/au-research/grants/arc/FT200100536
dc.rights© 2023 by the Association for Computing Machinery, Inc. (ACM).
dc.source.urihttps://dl.acm.org/doi/proceedings/10.1145/3583131
dc.subjectEvolutionary Diversity Optimization; Quality Diversity; Minimum Area Spanning Tree; Low Probability Detection
dc.titleDiversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks
dc.typeConference paper
pubs.publication-statusPublished

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
hdl_139310.pdf
Size:
3.42 MB
Format:
Adobe Portable Document Format
Description:
Accepted version