Using Clique to Identify Access Points with High-Density Coverage in Different Locations

Basit Öğe Kaydı
dc.contributor.authorOztemiz, Furkan
dc.date.accessioned2026-04-04T13:18:59Z
dc.date.available2026-04-04T13:18:59Z
dc.date.issued2024
dc.departmentİnönü Üniversitesi
dc.description8th International Artificial Intelligence and Data Processing Symposium, IDAP 2024 -- 21 September 2024 through 22 September 2024 -- Malatya -- 203423
dc.description.abstractThis study aims to identify sensor network devices located in areas of high connection density within a network. By doing so, it will be possible to determine regions with dense and more comprehensive connectivity. The dataset used in this study is modeled as a disc graph representing a university's campus network. In the disc graph, overlapping areas are depicted as edges in the original graph, with the number of these edges indicating the extent of connectivity and coverage. To identify these dense edges in the designed network, the maximum clique approach has been applied. The members of the maximum clique have been determined using the Malatya independent set algorithm. The study aims to prevent the overlap of maximum cliques in the same area, focusing on identifying maximum clique members that are not directly connected to each other. The resulting data provides critical insights into the hub points of the network and the optimal placement of main routers. © 2024 IEEE.
dc.identifier.doi10.1109/IDAP64064.2024.10711000
dc.identifier.isbn979-833153149-2
dc.identifier.scopus2-s2.0-85207959343
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/IDAP64064.2024.10711000
dc.identifier.urihttps://hdl.handle.net/11616/108059
dc.indekslendigikaynakScopus
dc.institutionauthorOztemiz, Furkan
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof8th International Artificial Intelligence and Data Processing Symposium, IDAP 2024
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20250329
dc.subjectGraph Theory
dc.subjectMalatya Independent Set
dc.subjectMaximum clique
dc.subjectSpecial Network
dc.titleUsing Clique to Identify Access Points with High-Density Coverage in Different Locations
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu