A Lightweight and Energy Efficient Secrecy Outage Probability-Based Friendly Jamming
| dc.contributor.author | Yaman, Okan | |
| dc.contributor.author | Ayav, Tolga | |
| dc.contributor.author | Erten, Yusuf Murat | |
| dc.date.accessioned | 2023-07-27T19:51:16Z | |
| dc.date.available | 2023-07-27T19:51:16Z | |
| dc.date.issued | 2023 | |
| dc.description | 11th International Symposium on Digital Forensics and Security, ISDFS 2023 -- 11 May 2023 through 12 May 2023 | en_US |
| dc.description.abstract | Third parties and legitimate entities can reach and process users' private data through most wireless networks. However, attackers such as intruders and eavesdroppers may also try to exploit this property in communication. Hence, wireless networks are intrinsically more vulnerable to threats, unlike their wired alternatives. Cryptographic techniques are the conventional approaches to deal with that weakness. Nevertheless, they still need to meet the requirements of contemporary technologies, including IoT nodes with energy and processing power constraints. In that respect, friendly jamming (FJ) is one of the encouraging countermeasures to overcome the mentioned susceptibility since it has an energy-efficient and computation-friendly nature. However, that promising approach brings another challenge, applicability. Although various models exist against this issue, a lightweight scheme compliant with novel technologies is needed. Hence, we propose a more straightforward FJ model evaluated on cellular network-based simulations in this study. Moreover, introducing a lightweight secrecy outage probability definition increases robustness and energy efficiency. © 2023 IEEE. | en_US |
| dc.identifier.doi | 10.1109/ISDFS58141.2023.10131740 | |
| dc.identifier.isbn | 9798350336986 | |
| dc.identifier.scopus | 2-s2.0-85163120475 | |
| dc.identifier.uri | https://doi.org/10.1109/ISDFS58141.2023.10131740 | |
| dc.identifier.uri | https://hdl.handle.net/11147/13690 | |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.relation.ispartof | ISDFS 2023 - 11th International Symposium on Digital Forensics and Security | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Friendly jamming | en_US |
| dc.subject | Physical layer security | en_US |
| dc.subject | Secrecy outage probability | en_US |
| dc.subject | Energy efficiency | en_US |
| dc.subject | Network layers | en_US |
| dc.title | A Lightweight and Energy Efficient Secrecy Outage Probability-Based Friendly Jamming | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 57200543556 | |
| gdc.author.scopusid | 13408184500 | |
| gdc.author.scopusid | 55665216700 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 5 | |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 1 | |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W4378364052 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.7044118E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 3.5291523E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.1658839 | |
| gdc.openalex.normalizedpercentile | 0.42 | |
| gdc.opencitations.count | 1 | |
| gdc.plumx.mendeley | 1 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.scopus.citedcount | 1 | |
| relation.isAuthorOfPublication.latestForDiscovery | 812c2ad4-527f-4a21-8b84-f7497a71f3ce | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4014-8abe-a4dfe192da5e |
Files
Original bundle
1 - 1 of 1
