你真的在收费吗?

Chi Lin, Ziwei Yang, Jiankang Ren, Lei Wang, Wei Zhong, Guowei Wu, Qiang Zhang
{"title":"你真的在收费吗?","authors":"Chi Lin, Ziwei Yang, Jiankang Ren, Lei Wang, Wei Zhong, Guowei Wu, Qiang Zhang","doi":"10.1109/ICDCS54860.2022.00075","DOIUrl":null,"url":null,"abstract":"Wireless rechargeable sensor networks (WRSNs), which benefit from recent breakthroughs in Wireless Power Transfer (WPT) technology, emerge as very promising for network lifetime extension. Traditional methods concentrate on system performance improvement while little attention has been paid to security, making them vulnerable to novel attacks. In this paper, we develop a novel Charging Spoofing Attack (CSA), in which a mobile charger (MC) is charging a node intuitively. Nevertheless, it is launching an attack based on the nonlinear superposition principle of electromagnetic waves, causing the target node to be unable to receive any energy and finally exhausted in vain. First, we explain and model the nonlinear superposition effect through experiments, which points out the potential of launching such a novel attack. Second, we formalize the attacking problem as a charging uTility optImization problem with key noDe timE window constraints (TIDE). Then, we propose an approximation algorithm termed CSA to solve the TIDE problem with a bounded performance guarantee. Theoretical analyses are presented to exploit the feature of CSA. Finally, to demonstrate the outperformed features of our scheme, extensive simulations and test-bed experiments are conducted, revealing that CSA can exhaust at least 80% of key nodes without being detected.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"74 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Are You Really Charging Me?\",\"authors\":\"Chi Lin, Ziwei Yang, Jiankang Ren, Lei Wang, Wei Zhong, Guowei Wu, Qiang Zhang\",\"doi\":\"10.1109/ICDCS54860.2022.00075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless rechargeable sensor networks (WRSNs), which benefit from recent breakthroughs in Wireless Power Transfer (WPT) technology, emerge as very promising for network lifetime extension. Traditional methods concentrate on system performance improvement while little attention has been paid to security, making them vulnerable to novel attacks. In this paper, we develop a novel Charging Spoofing Attack (CSA), in which a mobile charger (MC) is charging a node intuitively. Nevertheless, it is launching an attack based on the nonlinear superposition principle of electromagnetic waves, causing the target node to be unable to receive any energy and finally exhausted in vain. First, we explain and model the nonlinear superposition effect through experiments, which points out the potential of launching such a novel attack. Second, we formalize the attacking problem as a charging uTility optImization problem with key noDe timE window constraints (TIDE). Then, we propose an approximation algorithm termed CSA to solve the TIDE problem with a bounded performance guarantee. Theoretical analyses are presented to exploit the feature of CSA. Finally, to demonstrate the outperformed features of our scheme, extensive simulations and test-bed experiments are conducted, revealing that CSA can exhaust at least 80% of key nodes without being detected.\",\"PeriodicalId\":225883,\"journal\":{\"name\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"volume\":\"74 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS54860.2022.00075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS54860.2022.00075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

无线充电传感器网络(WRSNs)得益于无线能量传输(WPT)技术的最新突破,在延长网络寿命方面具有很大的前景。传统的方法主要关注系统性能的提高,而对安全性的关注较少,容易受到新的攻击。本文提出了一种新的充电欺骗攻击(CSA)方法,利用移动充电器对节点进行直观的充电。然而,它是基于电磁波的非线性叠加原理发动攻击,导致目标节点无法接收任何能量,最终徒劳地耗尽。首先,我们通过实验对非线性叠加效应进行了解释和建模,指出了发起这种新型攻击的潜力。其次,我们将攻击问题形式化为具有关键节点时间窗口约束(TIDE)的充电效用优化问题。然后,我们提出了一种称为CSA的近似算法来解决具有有界性能保证的TIDE问题。对CSA的特点进行了理论分析。最后,为了证明我们方案的优越特性,进行了大量的模拟和试验台实验,表明CSA可以在不被检测到的情况下耗尽至少80%的关键节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Are You Really Charging Me?
Wireless rechargeable sensor networks (WRSNs), which benefit from recent breakthroughs in Wireless Power Transfer (WPT) technology, emerge as very promising for network lifetime extension. Traditional methods concentrate on system performance improvement while little attention has been paid to security, making them vulnerable to novel attacks. In this paper, we develop a novel Charging Spoofing Attack (CSA), in which a mobile charger (MC) is charging a node intuitively. Nevertheless, it is launching an attack based on the nonlinear superposition principle of electromagnetic waves, causing the target node to be unable to receive any energy and finally exhausted in vain. First, we explain and model the nonlinear superposition effect through experiments, which points out the potential of launching such a novel attack. Second, we formalize the attacking problem as a charging uTility optImization problem with key noDe timE window constraints (TIDE). Then, we propose an approximation algorithm termed CSA to solve the TIDE problem with a bounded performance guarantee. Theoretical analyses are presented to exploit the feature of CSA. Finally, to demonstrate the outperformed features of our scheme, extensive simulations and test-bed experiments are conducted, revealing that CSA can exhaust at least 80% of key nodes without being detected.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信