A Mobile Offloading Game Against Smart Attacks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Mobile devices, such as smartphones, can offload applications and data to the cloud via access points or base stations to reduce energy consumption and improve user experience. However, mobile offloading is vulnerable to smart attackers that use smart and programmable radio devices, such as universal software radio peripherals, to perform multiple types of attacks, such as spoofing and jamming, based on the radio environment and offloading transmissions. In this paper, a mobile offloading game is investigated that consists of three players: a mobile device that chooses its offloading rate, a smart attacker that determines its attack mode, and a security agent that decides whether or not to initiate full protection for the serving access point during the offloading. Nash and Stackelberg equilibria of the offloading game are derived and their existence conditions are discussed. A Q-learning-based mobile offloading strategy is proposed for mobile devices that are unaware of system parameters, such as the channel conditions, in dynamic radio environments. Simulation results show that the proposed offloading strategy can improve the utility of the mobile device and reduce the attack rate of smart attackers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Comprehensive Survey of Multiagent Reinforcement Learning
Busoniu, L., Babuska, R., & De Schutter, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.913919 · Cited by 2,235 · cited 1×
“According to the ε-greedy policy [19], the offloading rate that maximizes the current quality function is chosen with a high probability 1 − ε, while the other L − 1 rates are taken with equal probability ε L−1 , i.”
BackgroundCloud computing for mobile users: can offloading computation save energy?
Kumar, K., & Lu, Y.-H. (2010) · Computer · doi:10.1109/mc.2010.98 · Cited by 1,493
Cited by
A Survey on IoT Security: Application Areas, Security Threats, and Solution Architectures
Hassija, V., Chamola, V., Saxena, V., Jain, D., Goyal, P., & Sikdar, B. (2019) · IEEE Access · doi:10.1109/access.2019.2924045 · Cited by 1,396
IoT Security Techniques Based on Machine Learning: How Do IoT Devices Use AI to Enhance Security?
Xiao, L., Wan, X., Lu, X., Zhang, Y., & Wu, D. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2825478 · Cited by 681
Self-citationLearning-Based Computation Offloading for IoT Devices With Energy Harvesting
Min, M., Xiao, L., Chen, Y., Cheng, P., Wu, D., & Zhuang, W. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2890685 · Cited by 560
Self-citationMachine learning based solutions for security of Internet of Things (IoT): A survey
Tahsien, S. M., Karimipour, H., & Spachos, P. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102630 · Cited by 470
Sharma, S. K., & Wang, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916177 · Cited by 427
Metadata
- Authors
- Xiao, L., Xie, C., Chen, T., Dai, H., & Poor, H. V.
- Venue
- IEEE Access
- Published
- 2016
- Volume
- 4
- Pages
- 2281-2291
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2347128811
- Cited by
- 118
- References
- 2
- FWCI
- 14.21
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.