As one of the key concepts in the 5G network, MEC can support the latency-sensitive and compute-intensive services by widely deploying computing and storage capacity to the base stations at the network edge. Because these services are sensitive to latency, the joint optimization problem of task offloading and resource allocation needs to be solved in a short time. In this paper, we propose a Fast AI-assistant Solution for Task Offloading and Resource Allocation in MEC (FAST-RAM), which can directly solve the joint optimization problem leveraging a deep neural network. FAST-RAM can produce the offloading policy and resource allocation scheme in milliseconds. Meantime, our solution has near-optimal performance and sufficient feasibility under different network environments.
{"title":"FAST-RAM: A Fast AI-assistant Solution for Task Offloading and Resource Allocation in MEC","authors":"Tongyu Song, Wenyu Hu, Xuebin Tan, Jing Ren, Sheng Wang, Shizhong Xu","doi":"10.1109/GLOBECOM42002.2020.9322645","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322645","url":null,"abstract":"As one of the key concepts in the 5G network, MEC can support the latency-sensitive and compute-intensive services by widely deploying computing and storage capacity to the base stations at the network edge. Because these services are sensitive to latency, the joint optimization problem of task offloading and resource allocation needs to be solved in a short time. In this paper, we propose a Fast AI-assistant Solution for Task Offloading and Resource Allocation in MEC (FAST-RAM), which can directly solve the joint optimization problem leveraging a deep neural network. FAST-RAM can produce the offloading policy and resource allocation scheme in milliseconds. Meantime, our solution has near-optimal performance and sufficient feasibility under different network environments.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72647325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To further enhance the security of the wireless communication systems, an architecture of the cooperative jamming (CJ) assisted slow frequency-hopping (FH) systems is proposed in this paper. Then, after the CJ cancellation operation, the residual CJ raised from synchronization error is analyzed, where the inter-symbol interference (ISI) is employed to depict the time misalignment between the received signal and the local reference CJ at the receiver, and the inter-hop interference (IHI) is introduced to describe the frequency misalignment. In addition, the closed-form expression of the jamming cancellation ratio (JCR) is derived to evaluate the CJ cancellation performance. Theoretical analyses and simulation results show that in the slow FH systems, both the proportions of the ISI and IHI components in the residual CJ are jointly determined by the synchronization error and the hop length. Besides, the JCR increases with the increase of the hop length and the jamming-to-noise ratio (JNR), and decreases with the increase of the synchronization error.
{"title":"Impact of Imperfect Time Synchronization on Cooperative Jamming Assisted Slow FH Systems","authors":"Changqing Song, Wenbo Guo, Hongzhi Zhao, Youxi Tang","doi":"10.1109/GLOBECOM42002.2020.9322646","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322646","url":null,"abstract":"To further enhance the security of the wireless communication systems, an architecture of the cooperative jamming (CJ) assisted slow frequency-hopping (FH) systems is proposed in this paper. Then, after the CJ cancellation operation, the residual CJ raised from synchronization error is analyzed, where the inter-symbol interference (ISI) is employed to depict the time misalignment between the received signal and the local reference CJ at the receiver, and the inter-hop interference (IHI) is introduced to describe the frequency misalignment. In addition, the closed-form expression of the jamming cancellation ratio (JCR) is derived to evaluate the CJ cancellation performance. Theoretical analyses and simulation results show that in the slow FH systems, both the proportions of the ISI and IHI components in the residual CJ are jointly determined by the synchronization error and the hop length. Besides, the JCR increases with the increase of the hop length and the jamming-to-noise ratio (JNR), and decreases with the increase of the synchronization error.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74966128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322424
Yujie Yang, Yang Yang, Congcong Wang, Caili Guo, Hailun Xia
This paper proposes a hybrid dimming scheme based on joint design of transmit antenna selection and precoding (TASP-HD) for dimmable multi-cell multi-user multiple-input single-output visible light communications systems. In TASPHD, both the direct current bias and the number of activated light-emitting-diodes are dynamically adjusted to achieve efficient communications under the constraints of dimming level and illumination uniformity. With the goal of maximizing the sum-rate of users, a joint transmit antenna selection and precoding design problem is formulated. This problem is a non-convex, mixed integer problem, and thus it is non-deterministic polynomial time hard. To solve the problem, the original problem is seperated into two subproblems. The first subproblem is a mixed integer problem in terms of transmit antenna selection, which is solved by the branch-and-bound algorithm. With the obtained transmit antenna selection matrix, the second subproblem in terms of the precoding matrix is solved by the Lagrangian dual method. Finally, these two subproblems are iteratively solved to obtain a convergent solution. The simulation results verify that the proposed TASP-HD can achieve 6 dB signal-to-noise ratio gains over the analog dimming scheme when the dimming level is 70% for a target bit error rate of $10^{-3}$.
{"title":"Hybrid Dimming Scheme based on Transmit Antenna Selection and Precoding for MU MC VLC System","authors":"Yujie Yang, Yang Yang, Congcong Wang, Caili Guo, Hailun Xia","doi":"10.1109/GLOBECOM42002.2020.9322424","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322424","url":null,"abstract":"This paper proposes a hybrid dimming scheme based on joint design of transmit antenna selection and precoding (TASP-HD) for dimmable multi-cell multi-user multiple-input single-output visible light communications systems. In TASPHD, both the direct current bias and the number of activated light-emitting-diodes are dynamically adjusted to achieve efficient communications under the constraints of dimming level and illumination uniformity. With the goal of maximizing the sum-rate of users, a joint transmit antenna selection and precoding design problem is formulated. This problem is a non-convex, mixed integer problem, and thus it is non-deterministic polynomial time hard. To solve the problem, the original problem is seperated into two subproblems. The first subproblem is a mixed integer problem in terms of transmit antenna selection, which is solved by the branch-and-bound algorithm. With the obtained transmit antenna selection matrix, the second subproblem in terms of the precoding matrix is solved by the Lagrangian dual method. Finally, these two subproblems are iteratively solved to obtain a convergent solution. The simulation results verify that the proposed TASP-HD can achieve 6 dB signal-to-noise ratio gains over the analog dimming scheme when the dimming level is 70% for a target bit error rate of $10^{-3}$.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"82 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74997883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322131
Anirudh Paranjothi, Mohammed Atiquzzaman, Mohammad S. Khan
Vehicular ad hoc networks (VANETs) facilitate vehicles to broadcast beacon messages to ensure road safety. The rogue nodes in VANETs broadcast malicious information leading to potential hazards, including the collision of vehicles. Previous researchers used either cryptography, trust values, or past vehicle data to detect rogue nodes, but they suffer from high processing delay, overhead, and false-positive rate (FPR). We propose fog-based rogue nodes detection (F-RouND), a fog computing scheme, which dynamically creates a fog utilizing the on-board units (OBUs) of all vehicles in the region for rogue nodes detection. The novelty of F-RouND lies in providing low processing delays and FPR at high vehicle densities. The performance of our F-RouND framework was carried out with simulations using OMNET ++ and SUMO simulators. Results show that F-RouND ensures 45% lower processing delays, 12% lower overhead, and 36% lower FPR at high vehicle densities compared to existing rogue nodes detection schemes.
{"title":"F-RouND: Fog-based Rogue Nodes Detection in Vehicular Ad hoc Networks","authors":"Anirudh Paranjothi, Mohammed Atiquzzaman, Mohammad S. Khan","doi":"10.1109/GLOBECOM42002.2020.9322131","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322131","url":null,"abstract":"Vehicular ad hoc networks (VANETs) facilitate vehicles to broadcast beacon messages to ensure road safety. The rogue nodes in VANETs broadcast malicious information leading to potential hazards, including the collision of vehicles. Previous researchers used either cryptography, trust values, or past vehicle data to detect rogue nodes, but they suffer from high processing delay, overhead, and false-positive rate (FPR). We propose fog-based rogue nodes detection (F-RouND), a fog computing scheme, which dynamically creates a fog utilizing the on-board units (OBUs) of all vehicles in the region for rogue nodes detection. The novelty of F-RouND lies in providing low processing delays and FPR at high vehicle densities. The performance of our F-RouND framework was carried out with simulations using OMNET ++ and SUMO simulators. Results show that F-RouND ensures 45% lower processing delays, 12% lower overhead, and 36% lower FPR at high vehicle densities compared to existing rogue nodes detection schemes.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"152 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77525600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9348042
J. Fraire, Santiago M. Henn, F. Dovis, R. Garello, G. Taricco
A global Internet of Things is possible by embracing constellations of satellites acting as orbiting gateways in a Direct-to-Satellite IoT (DtS-IoT). By removing the dependency on ground gateways, DtS-IoT enables a direct service on the regions illuminated by the passing-by satellite. After an in-depth overview of relevant experiments and candidate technologies, we discover that specific configurations of the Long-Range (LoRa) network protocol specification are particularly appealing to realize the DtS-IoT vision. Specifically, we profit from the maximum clock drift permitted on LoRa devices to propose the sparse satellite constellations concept. This approach significantly reduces the in-orbit DtS-IoT infrastructure at the expense of latency anyway present in resource-constrained IoT networks. We then introduce a novel algorithm comprising specific heuristics to design quasi-optimal topologies for sparse IoT constellations. Obtained results show that LoRa-compatible DtS-IoT services can already be provided world-wide with 10% and 4% of the satellites required for a traditional dense constellation, in different configurations.
{"title":"Sparse Satellite Constellation Design for LoRa-based Direct-to-Satellite Internet of Things","authors":"J. Fraire, Santiago M. Henn, F. Dovis, R. Garello, G. Taricco","doi":"10.1109/GLOBECOM42002.2020.9348042","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9348042","url":null,"abstract":"A global Internet of Things is possible by embracing constellations of satellites acting as orbiting gateways in a Direct-to-Satellite IoT (DtS-IoT). By removing the dependency on ground gateways, DtS-IoT enables a direct service on the regions illuminated by the passing-by satellite. After an in-depth overview of relevant experiments and candidate technologies, we discover that specific configurations of the Long-Range (LoRa) network protocol specification are particularly appealing to realize the DtS-IoT vision. Specifically, we profit from the maximum clock drift permitted on LoRa devices to propose the sparse satellite constellations concept. This approach significantly reduces the in-orbit DtS-IoT infrastructure at the expense of latency anyway present in resource-constrained IoT networks. We then introduce a novel algorithm comprising specific heuristics to design quasi-optimal topologies for sparse IoT constellations. Obtained results show that LoRa-compatible DtS-IoT services can already be provided world-wide with 10% and 4% of the satellites required for a traditional dense constellation, in different configurations.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"66 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80231415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322551
R. Müller
This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. Deviating from Shannon’s 1959 solid angle argument, we project the problem into two dimensions and apply standard trigonometry. This enables us to also analyze Gaussian random codes in additive white Gaussian noise and binary random codes for the binary symmetric channel. We find that the Voronoi regions harden doubly-exponential in the blocklength and utilize that to propose the new median bound that outperforms Shannon’s 1959 sphere packing bound for the uniform spherical ensemble, whenever the code contains more than three codewords. Furthermore, we propose a very tight approximation to simplify computation of both exact error probability and the two bounds.
{"title":"On Approximation, Bounding & Exact Calculation of Block Error Probability for Random Codes","authors":"R. Müller","doi":"10.1109/GLOBECOM42002.2020.9322551","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322551","url":null,"abstract":"This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. Deviating from Shannon’s 1959 solid angle argument, we project the problem into two dimensions and apply standard trigonometry. This enables us to also analyze Gaussian random codes in additive white Gaussian noise and binary random codes for the binary symmetric channel. We find that the Voronoi regions harden doubly-exponential in the blocklength and utilize that to propose the new median bound that outperforms Shannon’s 1959 sphere packing bound for the uniform spherical ensemble, whenever the code contains more than three codewords. Furthermore, we propose a very tight approximation to simplify computation of both exact error probability and the two bounds.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"163 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80283145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9348121
Jiequ Ji, K. Zhu, Changyan Yi, Ran Wang, D. Niyato
Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is an appealing concept, where a fixed-wing UAV equipped with computing resources is used to help local resource-limited user devices (UDs) compute their tasks. In this paper, each UD has separable computing tasks to complete, which can be divided into two parts: one portion is processed locally and the other part is offloaded to the UAV. The UAV moves around above UDs and provides computing service in an orthogonal frequency division multiple access (OFDMA) manner. This paper aims to minimize the weighted sum energy consumption of the UAV and UDs by jointly optimizing resource allocation and UAV trajectory. The resulted optimization problem is nonconvex and challenging to solve directly. With that in mind, we develop an iterative algorithm for solving this problem based on the block coordinate descent method, which iteratively optimizes resource allocation variables and UAV trajectory variables till convergence. Simulation results show significant energy saving of our proposed solution compared to the benchmarks.
{"title":"Joint Resource Allocation and Trajectory Design for UAV-assisted Mobile Edge Computing Systems","authors":"Jiequ Ji, K. Zhu, Changyan Yi, Ran Wang, D. Niyato","doi":"10.1109/GLOBECOM42002.2020.9348121","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9348121","url":null,"abstract":"Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is an appealing concept, where a fixed-wing UAV equipped with computing resources is used to help local resource-limited user devices (UDs) compute their tasks. In this paper, each UD has separable computing tasks to complete, which can be divided into two parts: one portion is processed locally and the other part is offloaded to the UAV. The UAV moves around above UDs and provides computing service in an orthogonal frequency division multiple access (OFDMA) manner. This paper aims to minimize the weighted sum energy consumption of the UAV and UDs by jointly optimizing resource allocation and UAV trajectory. The resulted optimization problem is nonconvex and challenging to solve directly. With that in mind, we develop an iterative algorithm for solving this problem based on the block coordinate descent method, which iteratively optimizes resource allocation variables and UAV trajectory variables till convergence. Simulation results show significant energy saving of our proposed solution compared to the benchmarks.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"17 2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80403225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322308
Junwei Liang, M. Ma
Intrusion Detection Systems (IDS) is an important technology for cyber security, as it can mitigate both inner and outer threats in networks. However, a critical problem in IDSs is that the detection capacity is gradually decaying with the emergence of unknown attacks. To constantly retrain IDSs with a more extensive database is critical to make IDSs adaptive with the ever-changing network environment, but the security institutes usually lack the motivation to persistently update and maintain the database for public. Thus, in this paper, a blockchain-based database (bc-DB) is proposed, which is multilaterally maintained by the security institutes and universities using Data Coins (DCoins) as the incentives. In addition, a Lifetime Learning IDS (LL-IDS) is further designed as the supplement of the bc-DB for common IDS users. After being retrained by the latest bc-DB, the LL-IDS can detect the newly discovered attacks while uploading the suspect network packets to the database. Simulation experiments show that the proposed LL-IDS with the bc-DB are secure and effectiveness in attacks detection.
{"title":"Incremental Database Based on Distributed Ledger Technology for IDSs","authors":"Junwei Liang, M. Ma","doi":"10.1109/GLOBECOM42002.2020.9322308","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322308","url":null,"abstract":"Intrusion Detection Systems (IDS) is an important technology for cyber security, as it can mitigate both inner and outer threats in networks. However, a critical problem in IDSs is that the detection capacity is gradually decaying with the emergence of unknown attacks. To constantly retrain IDSs with a more extensive database is critical to make IDSs adaptive with the ever-changing network environment, but the security institutes usually lack the motivation to persistently update and maintain the database for public. Thus, in this paper, a blockchain-based database (bc-DB) is proposed, which is multilaterally maintained by the security institutes and universities using Data Coins (DCoins) as the incentives. In addition, a Lifetime Learning IDS (LL-IDS) is further designed as the supplement of the bc-DB for common IDS users. After being retrained by the latest bc-DB, the LL-IDS can detect the newly discovered attacks while uploading the suspect network packets to the database. Simulation experiments show that the proposed LL-IDS with the bc-DB are secure and effectiveness in attacks detection.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"102 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79430838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9348076
A. R. Khamesi, Riccardo Musmeci, S. Silvestri, Denise A. Baker
Smart Connected Communities (SCCs) is a novel paradigm that brings together multiple disciplines, including social-sciences, computer science, and engineering. Large-scale surveys are a fundamental tool to understand the needs and impact of new technologies to human populations, necessary to realize the SCC paradigm. However, there is a growing debate regarding the reproducibility of survey results. As an example, it has been shown that surveys may easily provide contradictory results, even if the subject populations are statistically equivalent from a demographic perspective. In this paper, we take the initial steps towards addressing the problem of reproducibility of survey results by providing formal methods to quantitatively justify apparently inconsistent results. Specifically, we define a new dissimilarity metric between two populations based on the users answers to non-demographic questions. To this purpose, we propose two algorithms based on submodular optimization and information theory, respectively, to select the most representative questions in a survey. Results show that our method effectively identifies and quantifies differences that are not evident from a purely demographic point of view.
{"title":"Reproducibility of Survey Results: A New Method to Quantify Similarity of Human Subject Pools","authors":"A. R. Khamesi, Riccardo Musmeci, S. Silvestri, Denise A. Baker","doi":"10.1109/GLOBECOM42002.2020.9348076","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9348076","url":null,"abstract":"Smart Connected Communities (SCCs) is a novel paradigm that brings together multiple disciplines, including social-sciences, computer science, and engineering. Large-scale surveys are a fundamental tool to understand the needs and impact of new technologies to human populations, necessary to realize the SCC paradigm. However, there is a growing debate regarding the reproducibility of survey results. As an example, it has been shown that surveys may easily provide contradictory results, even if the subject populations are statistically equivalent from a demographic perspective. In this paper, we take the initial steps towards addressing the problem of reproducibility of survey results by providing formal methods to quantitatively justify apparently inconsistent results. Specifically, we define a new dissimilarity metric between two populations based on the users answers to non-demographic questions. To this purpose, we propose two algorithms based on submodular optimization and information theory, respectively, to select the most representative questions in a survey. Results show that our method effectively identifies and quantifies differences that are not evident from a purely demographic point of view.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"171 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79455144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：