Optimal Pricing and Power Allocation for Collaborative Jamming with Full Channel Knowledge in Wireless Sensor Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, Dae-Kyo | - |
dc.contributor.author | Kim, Insook | - |
dc.contributor.author | Kim, Dongwoo | - |
dc.date.accessioned | 2021-06-22T13:23:48Z | - |
dc.date.available | 2021-06-22T13:23:48Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2017-11 | - |
dc.identifier.issn | 1424-8220 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/8559 | - |
dc.description.abstract | This paper presents a price-searching model in which a source node (Alice) seeks friendly jammers that prevent eavesdroppers (Eves) from snooping legitimate communications by generating interference or noise. Unlike existing models, the distributed jammers also have data to send to their respective destinations and are allowed to access Alice's channel if it can transmit sufficient jamming power, which is referred to as collaborative jamming in this paper. For the power used to deliver its own signal, the jammer should pay Alice. The price of the jammers' signal power is set by Alice and provides a tradeoff between the signal and the jamming power. This paper presents, in closed-form, an optimal price that maximizes Alice's benefit and the corresponding optimal power allocation from a jammers' perspective by assuming that the network-wide channel knowledge is shared by Alice and jammers. For a multiple-jammer scenario where Alice hardly has the channel knowledge, this paper provides a distributed and interactive price-searching procedure that geometrically converges to an optimal price and shows that Alice by a greedy selection policy achieves certain diversity gain, which increases log-linearly as the number of (potential) jammers grows. Various numerical examples are presented to illustrate the behavior of the proposed model. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Multidisciplinary Digital Publishing Institute (MDPI) | - |
dc.title | Optimal Pricing and Power Allocation for Collaborative Jamming with Full Channel Knowledge in Wireless Sensor Networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Dongwoo | - |
dc.identifier.doi | 10.3390/s17112697 | - |
dc.identifier.scopusid | 2-s2.0-85035077591 | - |
dc.identifier.wosid | 000416790500259 | - |
dc.identifier.bibliographicCitation | Sensors, v.17, no.11 | - |
dc.relation.isPartOf | Sensors | - |
dc.citation.title | Sensors | - |
dc.citation.volume | 17 | - |
dc.citation.number | 11 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Chemistry | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Instruments & Instrumentation | - |
dc.relation.journalWebOfScienceCategory | Chemistry, Analytical | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Instruments & Instrumentation | - |
dc.subject.keywordAuthor | optimal pricing | - |
dc.subject.keywordAuthor | secure capacity | - |
dc.subject.keywordAuthor | power allocation | - |
dc.subject.keywordAuthor | Stackelberg game | - |
dc.subject.keywordAuthor | distributed pricing | - |
dc.identifier.url | https://www.mdpi.com/1424-8220/17/11/2697 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.