Pub Date : 2013-04-14DOI: 10.1109/INFCOM.2013.6566824
Yu Zhao, Yunhuai Liu, T. He, A. Vasilakos, Chuanping Hu
Radio Signal Strength (RSS) based ranging is attractive by the low cost and easy deployment. In real environments, its accuracy is severely affected by the multipath effect and the external radio interference. The well-known fingerprint approaches can deal with the issues but introduce too much overhead in dynamic environments. In this paper, we attempt to address the issue along a completely different direction. We propose a new ranging framework called Fredi that exploits the frequency diversity to overcome the multi-path effect solely based on RSS measurements. We design a Discrete Fourier Transformation based algorithm and prove that it has the optimal solution under ideal cases. We further revise the algorithm to be robust to the measurement noises in practice. We implement Fredi on top of the USRP-2 platform and conduct extensive real environments in indoor environments. Experimental results show the superiority performance compared with the traditional methods.
{"title":"FREDI: Robust RSS-based ranging with multipath effect and radio interference","authors":"Yu Zhao, Yunhuai Liu, T. He, A. Vasilakos, Chuanping Hu","doi":"10.1109/INFCOM.2013.6566824","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566824","url":null,"abstract":"Radio Signal Strength (RSS) based ranging is attractive by the low cost and easy deployment. In real environments, its accuracy is severely affected by the multipath effect and the external radio interference. The well-known fingerprint approaches can deal with the issues but introduce too much overhead in dynamic environments. In this paper, we attempt to address the issue along a completely different direction. We propose a new ranging framework called Fredi that exploits the frequency diversity to overcome the multi-path effect solely based on RSS measurements. We design a Discrete Fourier Transformation based algorithm and prove that it has the optimal solution under ideal cases. We further revise the algorithm to be robust to the measurement noises in practice. We implement Fredi on top of the USRP-2 platform and conduct extensive real environments in indoor environments. Experimental results show the superiority performance compared with the traditional methods.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122569801","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6567167
S. Trajanovski, F. Kuipers, P. Mieghem
It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - that is, a part of the network that can be enclosed by a given elementary figure (a circle, ellipse, rectangle, square, or equilateral triangle) with a predetermined size - whose removal would lead to the highest network disruption. We determine that there is a polynomial number of non-trivial positions for such a figure that need to be considered and, subsequently, we propose a polynomial-time algorithm for the problem. Simulations on realistic networks illustrate that different figures with equal area result in different critical regions in a network.
{"title":"Finding critical regions in a network","authors":"S. Trajanovski, F. Kuipers, P. Mieghem","doi":"10.1109/INFCOM.2013.6567167","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567167","url":null,"abstract":"It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - that is, a part of the network that can be enclosed by a given elementary figure (a circle, ellipse, rectangle, square, or equilateral triangle) with a predetermined size - whose removal would lead to the highest network disruption. We determine that there is a polynomial number of non-trivial positions for such a figure that need to be considered and, subsequently, we propose a polynomial-time algorithm for the problem. Simulations on realistic networks illustrate that different figures with equal area result in different critical regions in a network.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900046","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6566978
Guanyu Tian, Z. Duan, Todd Baumeister, Yingfei Dong
Freenet is a popular peer to peer anonymous network, with the objective to provide the anonymity of both content publishers and retrievers. Despite more than a decade of active development and deployment and the adoption of well-established cryptographic algorithms in Freenet, it remains unanswered how well the anonymity objective of the initial Freenet design has been met. In this paper we develop a traceback attack on Freenet, and show that the originating machine of a content request message in Freenet can be identified; that is, the anonymity of a content retriever can be broken, even if a single request message has been issued by the retriever. We present the design of the traceback attack, and perform Emulab-based experiments to confirm the feasibility and effectiveness of the attack. With randomly chosen content requesters (and random contents stored in the Freenet testbed), the experiments show that, for 24% to 43% of the content request messages, we can identify their originating machines. We also briefly discuss potential solutions to address the developed traceback attack. Despite being developed specifically on Freenet, the basic principles of the traceback attack and solutions have important security implications for similar anonymous content sharing systems.
{"title":"A traceback attack on Freenet","authors":"Guanyu Tian, Z. Duan, Todd Baumeister, Yingfei Dong","doi":"10.1109/INFCOM.2013.6566978","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566978","url":null,"abstract":"Freenet is a popular peer to peer anonymous network, with the objective to provide the anonymity of both content publishers and retrievers. Despite more than a decade of active development and deployment and the adoption of well-established cryptographic algorithms in Freenet, it remains unanswered how well the anonymity objective of the initial Freenet design has been met. In this paper we develop a traceback attack on Freenet, and show that the originating machine of a content request message in Freenet can be identified; that is, the anonymity of a content retriever can be broken, even if a single request message has been issued by the retriever. We present the design of the traceback attack, and perform Emulab-based experiments to confirm the feasibility and effectiveness of the attack. With randomly chosen content requesters (and random contents stored in the Freenet testbed), the experiments show that, for 24% to 43% of the content request messages, we can identify their originating machines. We also briefly discuss potential solutions to address the developed traceback attack. Despite being developed specifically on Freenet, the basic principles of the traceback attack and solutions have important security implications for similar anonymous content sharing systems.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114297953","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6566901
R. Karthik, A. Chakrapani
In this paper, we consider wireless communication systems where user equipments (UEs) monitor packet-data traffic characteristics and adopt Discontinuous Reception (DRX) to conserve battery power. With DRX, the receiver circuitry is configured to toggle between on (active) and off (inactive) states for specified durations, depending on the packet arrival process. Arriving at an appropriate DRX configuration remains a challenging research issue, especially when multiple applications generate traffic. Our objective in this work is to provide a practical mechanism for selecting a suitable DRX configuration. First, we derive an analytical expression for the expected maximum time (delay) required for a packet arriving during the offduration to be serviced for any arrival process. Second, we obtain an estimate for the on-duration, Ton* for which the expected delay is below a certain threshold. Using Ton*, we compute the active duration, Tactive in each DRX cycle by considering the timers specified in 3rd Generation Partnership Project (3GPP) Release 10 and for a given interarrival time distribution between packets. Finally, using our analysis, we propose a pragmatic algorithm and show how to select an appropriate DRX configuration which will lead to high power efficiency with acceptable buffer requirements. Through extensive analysis and simulations both with general arrival processes and real-time traces, we show that our algorithm can lead to significant extension in battery life at the UE.
{"title":"Practical algorithm for power efficient DRX configuration in next generation mobiles","authors":"R. Karthik, A. Chakrapani","doi":"10.1109/INFCOM.2013.6566901","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566901","url":null,"abstract":"In this paper, we consider wireless communication systems where user equipments (UEs) monitor packet-data traffic characteristics and adopt Discontinuous Reception (DRX) to conserve battery power. With DRX, the receiver circuitry is configured to toggle between on (active) and off (inactive) states for specified durations, depending on the packet arrival process. Arriving at an appropriate DRX configuration remains a challenging research issue, especially when multiple applications generate traffic. Our objective in this work is to provide a practical mechanism for selecting a suitable DRX configuration. First, we derive an analytical expression for the expected maximum time (delay) required for a packet arriving during the offduration to be serviced for any arrival process. Second, we obtain an estimate for the on-duration, Ton* for which the expected delay is below a certain threshold. Using Ton*, we compute the active duration, Tactive in each DRX cycle by considering the timers specified in 3rd Generation Partnership Project (3GPP) Release 10 and for a given interarrival time distribution between packets. Finally, using our analysis, we propose a pragmatic algorithm and show how to select an appropriate DRX configuration which will lead to high power efficiency with acceptable buffer requirements. Through extensive analysis and simulations both with general arrival processes and real-time traces, we show that our algorithm can lead to significant extension in battery life at the UE.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114404172","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6567059
Rui Zhang, Jinxue Zhang, Yanchao Zhang, Chi Zhang
Cooperative (spectrum) sensing is a key function for dynamic spectrum access and is essential for avoiding interference with licensed primary users and identifying spectrum holes. A promising approach for effective cooperative sensing over a large geographic region is to rely on special spectrum-sensing providers (SSPs), which outsource spectrum-sensing tasks to distributed mobile users. Its feasibility is deeply rooted in the ubiquitous penetration of mobile devices into everyday life. Crowdsourcing-based cooperative spectrum sensing is, however, vulnerable to malicious sensing data injection attack, in which a malicious CR users submit false sensing reports containing power measurements much larger (or smaller) than the true value to inflate (or deflate) the final average, in which case the SSP may falsely determine that the channel is busy (or vacant). In this paper, we propose a novel scheme to enable secure crowdsourcing-based cooperative spectrum sensing by jointly considering the instantaneous trustworthiness of mobile detectors in combination with their reputation scores during data fusion. Our scheme can enable robust cooperative sensing even if the malicious CR users are the majority. The efficacy and efficiency of our scheme have been confirmed by extensive simulation studies.
{"title":"Secure crowdsourcing-based cooperative pectrum sensing","authors":"Rui Zhang, Jinxue Zhang, Yanchao Zhang, Chi Zhang","doi":"10.1109/INFCOM.2013.6567059","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567059","url":null,"abstract":"Cooperative (spectrum) sensing is a key function for dynamic spectrum access and is essential for avoiding interference with licensed primary users and identifying spectrum holes. A promising approach for effective cooperative sensing over a large geographic region is to rely on special spectrum-sensing providers (SSPs), which outsource spectrum-sensing tasks to distributed mobile users. Its feasibility is deeply rooted in the ubiquitous penetration of mobile devices into everyday life. Crowdsourcing-based cooperative spectrum sensing is, however, vulnerable to malicious sensing data injection attack, in which a malicious CR users submit false sensing reports containing power measurements much larger (or smaller) than the true value to inflate (or deflate) the final average, in which case the SSP may falsely determine that the channel is busy (or vacant). In this paper, we propose a novel scheme to enable secure crowdsourcing-based cooperative spectrum sensing by jointly considering the instantaneous trustworthiness of mobile detectors in combination with their reputation scores during data fusion. Our scheme can enable robust cooperative sensing even if the malicious CR users are the majority. The efficacy and efficiency of our scheme have been confirmed by extensive simulation studies.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114462769","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6566914
Layong Luo, Gaogang Xie, Kave Salamatian, S. Uhlig, L. Mathy, Yingke Xie
Virtual routers are increasingly being studied, as an important building block to enable network virtualization. In a virtual router platform, multiple virtual router instances coexist, each having its own FIB (Forwarding Information Base). In this context, memory scalability and route updates are two major challenges. Existing approaches addressed one of these challenges but not both. In this paper, we present a trie merging approach, which compactly represents multiple FIBs by a merged trie and a table of next-hop-pointer arrays to achieve good memory scalability, while supporting fast incremental updates by avoiding the use of leaf pushing during merging. Experimental results show that storing the merged trie requires limited memory space, e.g., we only need 10MB memory space to store the merged trie for 14 full FIBs from IPv4 core routers, achieving a memory reduction by 87% when compared to the total size of the individual tries. We implement our approach in an SRAM (Static Random Access Memory)-based lookup pipeline. Using our approach, an on-chip SRAM-based lookup pipeline with 5 external stages is sufficient to store the 14 full IPv4 FIBs. Furthermore, our approach can guarantee a minimum update overhead of one write bubble per update, as well as a high lookup throughput of one lookup per clock cycle, which corresponds to a throughput of 251 million lookups per second in the implementation.
虚拟路由器作为实现网络虚拟化的重要组成部分，正受到越来越多的研究。在一个虚拟路由器平台中，多个虚拟路由器实例共存，每个实例都有自己的FIB (Forwarding Information Base)。在这种情况下，内存可伸缩性和路由更新是两个主要挑战。现有的方法解决了其中一个挑战，但不能同时解决这两个挑战。在本文中，我们提出了一种三树合并方法，该方法通过合并的三树和下一跳指针数组表紧凑地表示多个fib，以实现良好的内存可伸缩性，同时通过避免在合并过程中使用叶推来支持快速增量更新。实验结果表明，存储合并树需要有限的内存空间，例如，我们只需要10MB的内存空间来存储来自IPv4核心路由器的14个完整FIBs的合并树，与单个尝试的总大小相比，实现了87%的内存减少。我们在基于SRAM(静态随机存取存储器)的查找管道中实现我们的方法。使用我们的方法，带有5个外部阶段的基于sram的片上查找管道足以存储14个完整的IPv4 fib。此外，我们的方法可以保证每次更新一个写泡的最小更新开销，以及每个时钟周期一次查找的高查找吞吐量，这相当于实现中每秒2.51亿次查找的吞吐量。
{"title":"A trie merging approach with incremental updates for virtual routers","authors":"Layong Luo, Gaogang Xie, Kave Salamatian, S. Uhlig, L. Mathy, Yingke Xie","doi":"10.1109/INFCOM.2013.6566914","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566914","url":null,"abstract":"Virtual routers are increasingly being studied, as an important building block to enable network virtualization. In a virtual router platform, multiple virtual router instances coexist, each having its own FIB (Forwarding Information Base). In this context, memory scalability and route updates are two major challenges. Existing approaches addressed one of these challenges but not both. In this paper, we present a trie merging approach, which compactly represents multiple FIBs by a merged trie and a table of next-hop-pointer arrays to achieve good memory scalability, while supporting fast incremental updates by avoiding the use of leaf pushing during merging. Experimental results show that storing the merged trie requires limited memory space, e.g., we only need 10MB memory space to store the merged trie for 14 full FIBs from IPv4 core routers, achieving a memory reduction by 87% when compared to the total size of the individual tries. We implement our approach in an SRAM (Static Random Access Memory)-based lookup pipeline. Using our approach, an on-chip SRAM-based lookup pipeline with 5 external stages is sufficient to store the 14 full IPv4 FIBs. Furthermore, our approach can guarantee a minimum update overhead of one write bubble per update, as well as a high lookup throughput of one lookup per clock cycle, which corresponds to a throughput of 251 million lookups per second in the implementation.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121921166","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 : 2013-04-14DOI: 10.1109/INFCOMW.2013.6562905
Sören Finster, I. Baumgart
The deployment of smart metering provides an immense amount of data for power grid operators and energy providers. By using this data, a more efficient and flexible power grid can be realized. However, this data also raises privacy concerns since it contains very sensitive information about customers. In this paper, we present Elderberry, a peer-to-peer protocol that enables near real-time smart metering while preserving the customer's privacy. By forming small groups of cooperating smart meters, their consumption traces are anonymized before being aggregated and sent to the grid operator. Through aggregation, Elderberry realizes efficient monitoring of large numbers of smart meters. It reaches this goal without computationally complex cryptography and adds only little communication overhead.
{"title":"Elderberry: A peer-to-peer, privacy-aware smart metering protocol","authors":"Sören Finster, I. Baumgart","doi":"10.1109/INFCOMW.2013.6562905","DOIUrl":"https://doi.org/10.1109/INFCOMW.2013.6562905","url":null,"abstract":"The deployment of smart metering provides an immense amount of data for power grid operators and energy providers. By using this data, a more efficient and flexible power grid can be realized. However, this data also raises privacy concerns since it contains very sensitive information about customers. In this paper, we present Elderberry, a peer-to-peer protocol that enables near real-time smart metering while preserving the customer's privacy. By forming small groups of cooperating smart meters, their consumption traces are anonymized before being aggregated and sent to the grid operator. Through aggregation, Elderberry realizes efficient monitoring of large numbers of smart meters. It reaches this goal without computationally complex cryptography and adds only little communication overhead.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129806985","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6567120
Wei Cheng, K. Tan, Victor Omwando, Jindan Zhu, P. Mohapatra
RSS (Received Signal Strength) has been widely utilized in wireless applications. It is, however, susceptible to environmental unknowns from both temporal and spatial domains. As a result, the fluctuation of RSS may degrade performance of RSS based applications. In this work, we propose a novel RSS processing method at the receiver for three antenna based systems. The output of our approach is `RSS-Ratio', which eliminates the environmental unknowns and thus is a more stable variable compared to RSS itself. To validate the efficacy of the proposed method, we conduct a series of experiments in a range of wireless scenarios, including indoor laptop based measurement, indoor software defined radio - WARP based measurement, and outdoor wireless measurement. In addition, we also give an analysis to the relationship between the location of transmitter and the value of RSS-Ratio, and examine the accuracy of the estimated RSS-Ratio value via both simulations and experiments. All the experimental, analytical, and simulated results demonstrate that RSS-Ratio will be a better replacement for RSS to improve the performance of RSS based applications.
{"title":"RSS-Ratio for enhancing performance of RSS-based applications","authors":"Wei Cheng, K. Tan, Victor Omwando, Jindan Zhu, P. Mohapatra","doi":"10.1109/INFCOM.2013.6567120","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567120","url":null,"abstract":"RSS (Received Signal Strength) has been widely utilized in wireless applications. It is, however, susceptible to environmental unknowns from both temporal and spatial domains. As a result, the fluctuation of RSS may degrade performance of RSS based applications. In this work, we propose a novel RSS processing method at the receiver for three antenna based systems. The output of our approach is `RSS-Ratio', which eliminates the environmental unknowns and thus is a more stable variable compared to RSS itself. To validate the efficacy of the proposed method, we conduct a series of experiments in a range of wireless scenarios, including indoor laptop based measurement, indoor software defined radio - WARP based measurement, and outdoor wireless measurement. In addition, we also give an analysis to the relationship between the location of transmitter and the value of RSS-Ratio, and examine the accuracy of the estimated RSS-Ratio value via both simulations and experiments. All the experimental, analytical, and simulated results demonstrate that RSS-Ratio will be a better replacement for RSS to improve the performance of RSS based applications.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129062417","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6567116
Kai Xing, Z. Wan, Pengfei Hu, Haojin Zhu, Yuepeng Wang, X. Chen, Yang Wang, Liusheng Huang
As the advancement of sensing and networking technologies, participatory sensing has raised more and more attention as it provides a promising way enabling public and professional users to gather and analyze private data to understand the world. However, in these participatory sensing applications both data at the individuals and analysis results obtained at the users are usually private and sensitive to be disclosed, e.g., locations, salaries, utility usage, consumptions, behaviors, etc. A natural question, also an important but challenging problem is how to keep both participants and users data privacy while still producing the best analysis to explain a phenomenon. In this paper, we have addressed this issue and proposed M-PERM, a mutual privacy preserving regression modeling approach. Particularly, we launch a series of data transformation and aggregation operations at the participatory nodes, the clusters, and the user. During regression model fitting, we provide a new way for model fitting without any need of the original private data or the exact knowledge of the model expression. To evaluate our approach, we conduct both theoretical analysis and simulation study. The evaluation results show that the proposed approach produces exactly the same best model as if the original private data were used without leakage of the fitted model to any participatory nodes, which is a significant advance compared with the existing approaches [1-5]. It is also shown that the data gathering design is able to reach maximum privacy protection under certain conditions and be robust against collusion attack. Furthermore, compared with existing works under the same context (e.g., [1-5]), to our best knowledge it is the first work showing that not only the model coefficients estimation but also a series of regression analysis and model selection methods are reachable in mutual privacy preserving data analysis scenarios such as participatory sensing.
{"title":"Mutual privacy-preserving regression modeling in participatory sensing","authors":"Kai Xing, Z. Wan, Pengfei Hu, Haojin Zhu, Yuepeng Wang, X. Chen, Yang Wang, Liusheng Huang","doi":"10.1109/INFCOM.2013.6567116","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567116","url":null,"abstract":"As the advancement of sensing and networking technologies, participatory sensing has raised more and more attention as it provides a promising way enabling public and professional users to gather and analyze private data to understand the world. However, in these participatory sensing applications both data at the individuals and analysis results obtained at the users are usually private and sensitive to be disclosed, e.g., locations, salaries, utility usage, consumptions, behaviors, etc. A natural question, also an important but challenging problem is how to keep both participants and users data privacy while still producing the best analysis to explain a phenomenon. In this paper, we have addressed this issue and proposed M-PERM, a mutual privacy preserving regression modeling approach. Particularly, we launch a series of data transformation and aggregation operations at the participatory nodes, the clusters, and the user. During regression model fitting, we provide a new way for model fitting without any need of the original private data or the exact knowledge of the model expression. To evaluate our approach, we conduct both theoretical analysis and simulation study. The evaluation results show that the proposed approach produces exactly the same best model as if the original private data were used without leakage of the fitted model to any participatory nodes, which is a significant advance compared with the existing approaches [1-5]. It is also shown that the data gathering design is able to reach maximum privacy protection under certain conditions and be robust against collusion attack. Furthermore, compared with existing works under the same context (e.g., [1-5]), to our best knowledge it is the first work showing that not only the model coefficients estimation but also a series of regression analysis and model selection methods are reachable in mutual privacy preserving data analysis scenarios such as participatory sensing.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255258","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 : 2013-04-14DOI: 10.1109/INFCOM.2013.6567084
Zhaoyu Gao, Haojin Zhu, Yao Liu, M. Li, Z. Cao
Cognitive Radio Network (CRN) is regarded as a promising way to address the increasing demand for wireless channel resources. It solves the channel resource shortage problem by allowing a Secondary User (SU) to access the channel of a Primary User (PU) when the channel is not occupied by the PU. The latest FCC's rule in May 2012 enforces database-driven CRNs, in which an SU queries a database to obtain spectrum availability information by submitting a location based query. However, one concern about database-driven CRNs is that the queries sent by SUs will inevitably leak the location information. In this study, we identify a new kind of attack against location privacy of database-drive CRNs. Instead of directly learning the SUs' locations from their queries, our discovered attacks can infer an SU's location through his used channels. We propose Spectrum Utilization based Location Inferring Algorithm that enables the attacker to geo-locate an SU. To thwart location privacy leaking from query process, we propose a novel Private Spectrum Availability Information Retrieval scheme that utilizes a blind factor to hide the location of the SU. To defend against the discovered attack, we propose a novel prediction based Private Channel Utilization protocol that reduces the possibilities of location privacy leaking by choosing the most stable channels. We implement our discovered attack and proposed scheme on the data extracted from Google Earth Coverage Maps released by FCC. Experiment results show that the proposed protocols can significantly improve the location privacy.
{"title":"Location privacy in database-driven Cognitive Radio Networks: Attacks and countermeasures","authors":"Zhaoyu Gao, Haojin Zhu, Yao Liu, M. Li, Z. Cao","doi":"10.1109/INFCOM.2013.6567084","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567084","url":null,"abstract":"Cognitive Radio Network (CRN) is regarded as a promising way to address the increasing demand for wireless channel resources. It solves the channel resource shortage problem by allowing a Secondary User (SU) to access the channel of a Primary User (PU) when the channel is not occupied by the PU. The latest FCC's rule in May 2012 enforces database-driven CRNs, in which an SU queries a database to obtain spectrum availability information by submitting a location based query. However, one concern about database-driven CRNs is that the queries sent by SUs will inevitably leak the location information. In this study, we identify a new kind of attack against location privacy of database-drive CRNs. Instead of directly learning the SUs' locations from their queries, our discovered attacks can infer an SU's location through his used channels. We propose Spectrum Utilization based Location Inferring Algorithm that enables the attacker to geo-locate an SU. To thwart location privacy leaking from query process, we propose a novel Private Spectrum Availability Information Retrieval scheme that utilizes a blind factor to hide the location of the SU. To defend against the discovered attack, we propose a novel prediction based Private Channel Utilization protocol that reduces the possibilities of location privacy leaking by choosing the most stable channels. We implement our discovered attack and proposed scheme on the data extracted from Google Earth Coverage Maps released by FCC. Experiment results show that the proposed protocols can significantly improve the location privacy.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129915718","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
扫码关注我们
求助内容：
应助结果提醒方式：