Densification of Wi-Fi networks has led to the possibility for a station to choose between several access points (APs). On the other hand, the densification of APs generates interference, contention and decreases the global throughput as APs have to share a limited number of channels. Optimizing the association step between APs and stations can alleviate this problem and increase the overall throughput and fairness between stations. In this paper, we propose an original solution to this optimization problem based on two contributions. First, we present a mathematical model for the association optimization problem based on a realistic share of the medium between APs and stations and among APs when using the 802.11 DCF (Distributed Coordination Function) mode. Then, we introduce a local search algorithm to solve this problem through a suitable neighborhood structure. This approach has the benefit to be tuned according to the CPU and time constraints of the WLAN controller. Our evaluation, based on simulations, shows that the proposed solution improves the overall throughput and the fairness of the network.
{"title":"Association Optimization in Wi-Fi Networks: Use of an Access-based Fairness","authors":"Mohammed Amer, A. Busson, I. G. Lassous","doi":"10.1145/2988287.2989153","DOIUrl":"https://doi.org/10.1145/2988287.2989153","url":null,"abstract":"Densification of Wi-Fi networks has led to the possibility for a station to choose between several access points (APs). On the other hand, the densification of APs generates interference, contention and decreases the global throughput as APs have to share a limited number of channels. Optimizing the association step between APs and stations can alleviate this problem and increase the overall throughput and fairness between stations. In this paper, we propose an original solution to this optimization problem based on two contributions. First, we present a mathematical model for the association optimization problem based on a realistic share of the medium between APs and stations and among APs when using the 802.11 DCF (Distributed Coordination Function) mode. Then, we introduce a local search algorithm to solve this problem through a suitable neighborhood structure. This approach has the benefit to be tuned according to the CPU and time constraints of the WLAN controller. Our evaluation, based on simulations, shows that the proposed solution improves the overall throughput and the fairness of the network.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292364","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}
In the literature, numerous works have modeled user activity on smartphones and the effects on battery life. Power-saving modes prolong battery life by saving energy, but application performance is limited as a result. We investigate performance-energy trade-offs of smartphone applications by investigating three strategies: first, we propose an M/M/1 discriminatory processor sharing queue to act as a smartphone server and measure delays of Android applications; secondly, we form a performance-energy trade-off that takes into account cellular radio transfers using an objective cost function incorporating mean delay and power consumption; and thirdly, we build an online HMM to act as a power consumption model that predicts battery life given recent data transfers. For all three strategies, we obtain logged smartphone activity of over 750 users via an open-source smartphone data-collection application. Hence, we obtain three hypotheses from our strategies: first, delay of applications is approximated well using the beta prime distribution; secondly, power consumption increases as mean delay decreases with battery life prolonged if adjustments are made to cellular radio usage; and thirdly, burstiness is captured by HMMs in both data transfers and rates of power consumption.
{"title":"Performance-Energy Trade-offs in Smartphones","authors":"Tiberiu S. Chis, P. Harrison","doi":"10.1145/2988287.2989140","DOIUrl":"https://doi.org/10.1145/2988287.2989140","url":null,"abstract":"In the literature, numerous works have modeled user activity on smartphones and the effects on battery life. Power-saving modes prolong battery life by saving energy, but application performance is limited as a result. We investigate performance-energy trade-offs of smartphone applications by investigating three strategies: first, we propose an M/M/1 discriminatory processor sharing queue to act as a smartphone server and measure delays of Android applications; secondly, we form a performance-energy trade-off that takes into account cellular radio transfers using an objective cost function incorporating mean delay and power consumption; and thirdly, we build an online HMM to act as a power consumption model that predicts battery life given recent data transfers. For all three strategies, we obtain logged smartphone activity of over 750 users via an open-source smartphone data-collection application. Hence, we obtain three hypotheses from our strategies: first, delay of applications is approximated well using the beta prime distribution; secondly, power consumption increases as mean delay decreases with battery life prolonged if adjustments are made to cellular radio usage; and thirdly, burstiness is captured by HMMs in both data transfers and rates of power consumption.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125657264","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}
J. Baranda, M. Miozzo, P. Dini, José Núñez-Martínez, J. Mangues‐Bafalluy
Future dense mobile networks will imply much higher costs both in access and backhaul. This paper analyzes the effect on wireless mesh backhaul routing performance when energy saving policies are present at the radio access network (RAN). We consider an heterogeneous two-tier network where small cells (SC) with energy harvesting capabilities extend the capacity of the macro base stations (MBS), and can autonomously switch on-off in order to increase the energy efficiency of the network based on a Q-learning (QL) algorithm. Instead of calculating new routes for each SCs activation pattern, we propose to agnostically adapt to the RAN traffic demands using a non-route-based backpressure routing policy for the wireless mesh backhaul to even the network resource usage amongst SCs. We used the ns-3 simulator to integrate the different mobile network segments: RAN, wireless mesh backhaul, and evolved packet core (EPC). Simulation results show an achieved reduction of the %37% of the RAN energy consumption while satisfying traffic demands with an improvement of up to a factor of 10 of delay performance in the backhaul during peak hours.
{"title":"Backhaul Routing and Base Station Sleep Mode Engagement in Energy Harvesting Cellular Networks","authors":"J. Baranda, M. Miozzo, P. Dini, José Núñez-Martínez, J. Mangues‐Bafalluy","doi":"10.1145/2988287.2989175","DOIUrl":"https://doi.org/10.1145/2988287.2989175","url":null,"abstract":"Future dense mobile networks will imply much higher costs both in access and backhaul. This paper analyzes the effect on wireless mesh backhaul routing performance when energy saving policies are present at the radio access network (RAN). We consider an heterogeneous two-tier network where small cells (SC) with energy harvesting capabilities extend the capacity of the macro base stations (MBS), and can autonomously switch on-off in order to increase the energy efficiency of the network based on a Q-learning (QL) algorithm. Instead of calculating new routes for each SCs activation pattern, we propose to agnostically adapt to the RAN traffic demands using a non-route-based backpressure routing policy for the wireless mesh backhaul to even the network resource usage amongst SCs. We used the ns-3 simulator to integrate the different mobile network segments: RAN, wireless mesh backhaul, and evolved packet core (EPC). Simulation results show an achieved reduction of the %37% of the RAN energy consumption while satisfying traffic demands with an improvement of up to a factor of 10 of delay performance in the backhaul during peak hours.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133809598","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}
Florian Kauer, M. Köstler, Tobias Lübkert, V. Turau
Providing dependability is still a major issue for wireless mesh networks, which restrains their application in industrial contexts. The widespread CSMA/CA medium access can provide high throughput and low latency, but can not prevent packet loss due to collisions, especially in very large and dense networks. Time slotted medium access techniques together with a distributed slot management, as proposed by the Distributed Synchronous Multi-channel Extension (DSME) of the IEEE 802.15.4 standard, are promising to provide low packet loss, high scalability and bounded end-to-end delays. However, our implementation, openDSME, exposed some weaknesses. While the allocated slots allow for reliable data transmission, the slot management itself is conducted via CSMA/CA and is thus vulnerable to packet loss, eventually leading to an inconsistent slot allocation. This paper uses the UPPAAL framework for formal analysis and verification of the slot management process. The analysis identifies weaknesses of the slot allocation process under communication and node failures. However, it is shown that inconsistencies are eventually resolved and improvements to the procedure are proposed that reduce the negative impact of failed slot allocation procedures significantly.
{"title":"Formal Analysis and Verification of the IEEE 802.15.4 DSME Slot Allocation","authors":"Florian Kauer, M. Köstler, Tobias Lübkert, V. Turau","doi":"10.1145/2988287.2989148","DOIUrl":"https://doi.org/10.1145/2988287.2989148","url":null,"abstract":"Providing dependability is still a major issue for wireless mesh networks, which restrains their application in industrial contexts. The widespread CSMA/CA medium access can provide high throughput and low latency, but can not prevent packet loss due to collisions, especially in very large and dense networks. Time slotted medium access techniques together with a distributed slot management, as proposed by the Distributed Synchronous Multi-channel Extension (DSME) of the IEEE 802.15.4 standard, are promising to provide low packet loss, high scalability and bounded end-to-end delays. However, our implementation, openDSME, exposed some weaknesses. While the allocated slots allow for reliable data transmission, the slot management itself is conducted via CSMA/CA and is thus vulnerable to packet loss, eventually leading to an inconsistent slot allocation. This paper uses the UPPAAL framework for formal analysis and verification of the slot management process. The analysis identifies weaknesses of the slot allocation process under communication and node failures. However, it is shown that inconsistencies are eventually resolved and improvements to the procedure are proposed that reduce the negative impact of failed slot allocation procedures significantly.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116389114","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}
Rodolfo W. L. Coutinho, A. Boukerche, L. Vieira, A. Loureiro
In underwater sensor networks, the design of energy efficient and reliable data collection protocols is a daunting challenge. In this context, topology control and opportunistic routing are promising techniques for improving reliability and conserve energy. However, due to the challenges of the underwater acoustic channel, the vast knowledge acquired and the solution proposed so far in the context of terrestrial wireless ad hoc sensor networks cannot be applied directly to underwater acoustic sensor networks. In this work, we shed light on network topology modeling from a routing viewpoint. We model the probabilistic multipath routing behavior driven by opportunistic routing protocols in underwater sensor networks. Afterward, we propose the PCen centrality metric to measure the importance of underwater sensor nodes to the data delivery task through opportunistic routing protocols. PCen is aimed to identify critical nodes that can be used to guide topology control solutions. Our simulation results consider different network densities and reveal the presence of a few number of nodes with high PCen centrality value that will have a high rate of carried traffic, being critical for the network performance.
{"title":"A Novel Centrality Metric for Topology Control in Underwater Sensor Networks","authors":"Rodolfo W. L. Coutinho, A. Boukerche, L. Vieira, A. Loureiro","doi":"10.1145/2988287.2989162","DOIUrl":"https://doi.org/10.1145/2988287.2989162","url":null,"abstract":"In underwater sensor networks, the design of energy efficient and reliable data collection protocols is a daunting challenge. In this context, topology control and opportunistic routing are promising techniques for improving reliability and conserve energy. However, due to the challenges of the underwater acoustic channel, the vast knowledge acquired and the solution proposed so far in the context of terrestrial wireless ad hoc sensor networks cannot be applied directly to underwater acoustic sensor networks. In this work, we shed light on network topology modeling from a routing viewpoint. We model the probabilistic multipath routing behavior driven by opportunistic routing protocols in underwater sensor networks. Afterward, we propose the PCen centrality metric to measure the importance of underwater sensor nodes to the data delivery task through opportunistic routing protocols. PCen is aimed to identify critical nodes that can be used to guide topology control solutions. Our simulation results consider different network densities and reveal the presence of a few number of nodes with high PCen centrality value that will have a high rate of carried traffic, being critical for the network performance.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799686","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}
Qiankun Su, K. Jaffrès-Runser, G. Jakllari, C. Poulliat
With the world population becoming increasingly urban and the multiplication of mega cities, urban leaders have responded with plans calling for so called smart cities relying on instantaneous access to information using mobile devices for an intelligent management of resources. Coupled with the advent of the smartphone as the main platform for accessing the Internet, this has created the conditions for the looming wireless bandwidth crunch. This paper presents a content delivery infrastructure relying on off-the-shelf technology and the public transportation network (PTN) aimed at relieving the wireless bandwidth crunch in urban centers. Our solution proposes installing WiFi access points on selected public bus stations and buses and using the latter as data mules, creating a delay tolerant network capable of carrying content users can access while using the public transportation. Building such an infrastructure poses several challenges, including congestion points in major hubs and the cost of additional hardware necessary for secure communications. To address these challenges we propose a 3-Tier architecture that guarantees end-to-end delivery and minimizes hardware cost. Trace-based simulations from three major European cities of Paris, Helsinki and Toulouse demonstrate the viability of our design choices. In particular, the 3-Tier architecture is shown to guarantee end-to-end connectivity and reduce the deployment cost by several times while delivering at least as many packets as a baseline architecture.
{"title":"An Efficient Content Delivery Infrastructure Leveraging the Public Transportation Network","authors":"Qiankun Su, K. Jaffrès-Runser, G. Jakllari, C. Poulliat","doi":"10.1145/2988287.2989152","DOIUrl":"https://doi.org/10.1145/2988287.2989152","url":null,"abstract":"With the world population becoming increasingly urban and the multiplication of mega cities, urban leaders have responded with plans calling for so called smart cities relying on instantaneous access to information using mobile devices for an intelligent management of resources. Coupled with the advent of the smartphone as the main platform for accessing the Internet, this has created the conditions for the looming wireless bandwidth crunch. This paper presents a content delivery infrastructure relying on off-the-shelf technology and the public transportation network (PTN) aimed at relieving the wireless bandwidth crunch in urban centers. Our solution proposes installing WiFi access points on selected public bus stations and buses and using the latter as data mules, creating a delay tolerant network capable of carrying content users can access while using the public transportation. Building such an infrastructure poses several challenges, including congestion points in major hubs and the cost of additional hardware necessary for secure communications. To address these challenges we propose a 3-Tier architecture that guarantees end-to-end delivery and minimizes hardware cost. Trace-based simulations from three major European cities of Paris, Helsinki and Toulouse demonstrate the viability of our design choices. In particular, the 3-Tier architecture is shown to guarantee end-to-end connectivity and reduce the deployment cost by several times while delivering at least as many packets as a baseline architecture.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131140509","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}
Shimin Gong, Sissi Xiaoxiao Wu, A. M. So, Xiaoxia Huang
We consider a wireless network with densely deployed user devices (e.g., a device-to-device or wireless sensor network) underlaying a cellular system, in which some user devices act as relays to facilitate data transmissions between a distant transceiver pair under imperfect channel information. Motivated by the observation that most of the channel distributions are unimodal, we formulate a novel distributionally robust beamforming problem, in which the random channel coefficient follows a class of unimodal distribution with known first- and second-order moments. Our design objective is to maximize the worst-case signal-to-noise ratio (SNR) at the dedicated user device while satisfying a probabilistic interference constraint at the cellular user equipment (CUE). Though such a unimodal distributionally robust (UDR) beamforming problem is non-convex, we show that an approximate solution can be computed efficiently using semidefinite programming. Our simulation results show that under mild conditions, the UDR model yields significant beamforming performance improvement over conventional robust models that merely rely on first- and second-order moments of the channel distribution.
{"title":"Distributionally Robust Relay Beamforming in Wireless Communications","authors":"Shimin Gong, Sissi Xiaoxiao Wu, A. M. So, Xiaoxia Huang","doi":"10.1145/2988287.2989137","DOIUrl":"https://doi.org/10.1145/2988287.2989137","url":null,"abstract":"We consider a wireless network with densely deployed user devices (e.g., a device-to-device or wireless sensor network) underlaying a cellular system, in which some user devices act as relays to facilitate data transmissions between a distant transceiver pair under imperfect channel information. Motivated by the observation that most of the channel distributions are unimodal, we formulate a novel distributionally robust beamforming problem, in which the random channel coefficient follows a class of unimodal distribution with known first- and second-order moments. Our design objective is to maximize the worst-case signal-to-noise ratio (SNR) at the dedicated user device while satisfying a probabilistic interference constraint at the cellular user equipment (CUE). Though such a unimodal distributionally robust (UDR) beamforming problem is non-convex, we show that an approximate solution can be computed efficiently using semidefinite programming. Our simulation results show that under mild conditions, the UDR model yields significant beamforming performance improvement over conventional robust models that merely rely on first- and second-order moments of the channel distribution.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130817162","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}
In recent years, the number of vehicles has increased faster than the available infrastructure. Consequently, traffic congestion has become a daily problem affecting several aspects of modern society, including regional economic development. In this way, Traffic Management System (TMS) have been proposed to improve the traffic efficient and minimize traffic congestion problems. These systems rely on gather traffic-related data in a central entity to identify congestion and suggest alternative routes. However such approach adds load in communication channel depending on the traffic density. In this way, this paper introduces FASTER, a fully-distributed TMS to improve the overall vehicle traffic efficiency that does not overloads the communication channel, providing a suitable distributed solution. Simulation results indicate that our FASTER outperforms the assessed solutions in different scenarios and in different key requirements of TMS.
{"title":"A Fully-distributed Traffic Management System to Improve the Overall Traffic Efficiency","authors":"A. M. Souza, L. Villas","doi":"10.1145/2988287.2989167","DOIUrl":"https://doi.org/10.1145/2988287.2989167","url":null,"abstract":"In recent years, the number of vehicles has increased faster than the available infrastructure. Consequently, traffic congestion has become a daily problem affecting several aspects of modern society, including regional economic development. In this way, Traffic Management System (TMS) have been proposed to improve the traffic efficient and minimize traffic congestion problems. These systems rely on gather traffic-related data in a central entity to identify congestion and suggest alternative routes. However such approach adds load in communication channel depending on the traffic density. In this way, this paper introduces FASTER, a fully-distributed TMS to improve the overall vehicle traffic efficiency that does not overloads the communication channel, providing a suitable distributed solution. Simulation results indicate that our FASTER outperforms the assessed solutions in different scenarios and in different key requirements of TMS.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126732418","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}
Oladiran G. Olaleye, M. Iqbal, Ahmed Aly, D. Perkins, M. Bayoumi
For improved spectrum utilization, the key technique for acquiring spectrum situational awareness (SSA) -- spectrum sensing -- is greatly improved by cooperation among the active spectrum users, as network size increases. However, the many cooperative spectrum sensing (CSS) schemes that have been proposed are based on the assumptions of accurate noise power estimates, characterizable variation in noise level and absence of false or malicious users. As part of a series of SSA research projects, in this research work, we propose a novel scheme for minimizing the effects of noise power estimation error (NPEE) and received signal power falsification (RSPF) by energy-based reliability evaluation. The scheme adopts the Voting rule for fusing multiple spectrum sensing data. Based on simulation results, the proposed scheme yields significant improvement, 68.2 - 88.8%, over the conventional CSS schemes, when compared on the basis of the schemes' stability to uncertainties in noise and signal power.
{"title":"An Energy-Detection-Based Cooperative Spectrum Sensing Scheme for Minimizing the Effects of NPEE and RSPF","authors":"Oladiran G. Olaleye, M. Iqbal, Ahmed Aly, D. Perkins, M. Bayoumi","doi":"10.1145/2988287.2989169","DOIUrl":"https://doi.org/10.1145/2988287.2989169","url":null,"abstract":"For improved spectrum utilization, the key technique for acquiring spectrum situational awareness (SSA) -- spectrum sensing -- is greatly improved by cooperation among the active spectrum users, as network size increases. However, the many cooperative spectrum sensing (CSS) schemes that have been proposed are based on the assumptions of accurate noise power estimates, characterizable variation in noise level and absence of false or malicious users. As part of a series of SSA research projects, in this research work, we propose a novel scheme for minimizing the effects of noise power estimation error (NPEE) and received signal power falsification (RSPF) by energy-based reliability evaluation. The scheme adopts the Voting rule for fusing multiple spectrum sensing data. Based on simulation results, the proposed scheme yields significant improvement, 68.2 - 88.8%, over the conventional CSS schemes, when compared on the basis of the schemes' stability to uncertainties in noise and signal power.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133738844","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}
This last decade has witnessed a wide adoption of connected mobile devices able to capture the context of their owners from embedded sensors (GPS, Wi-Fi, Bluetooth, accelerometers). The advent of mobile and pervasive computing has enabled rich social and contextual applications, but the use of such technologies raises severe privacy issues and challenges. The privacy threats come from diverse adversaries, ranging from curious service providers and other users of the same service to eavesdroppers and curious applications running on the device. The information that can be collected from mobile device owners includes their locations, their social relationships, and their current activity. All of this, once analyzed and combined together through inference, can be very telling about the users' private lives. In this talk, we will describe privacy threats in mobile and pervasive networks. We will also show how to quantify the privacy of the users of such networks and explain how information on co-location can be taken into account. We will describe the role that privacy enhancing technologies (PETs) can play and describe some of them. We will also explain how to prevent apps from sifting too many personal data under Android. We will conclude by mentioning the privacy and security challenges raised by the quantified self and digital medicine
{"title":"Privacy Challenges in Mobile and Pervasive Networks","authors":"J. Hubaux","doi":"10.1145/2988287.2998439","DOIUrl":"https://doi.org/10.1145/2988287.2998439","url":null,"abstract":"This last decade has witnessed a wide adoption of connected mobile devices able to capture the context of their owners from embedded sensors (GPS, Wi-Fi, Bluetooth, accelerometers). The advent of mobile and pervasive computing has enabled rich social and contextual applications, but the use of such technologies raises severe privacy issues and challenges. The privacy threats come from diverse adversaries, ranging from curious service providers and other users of the same service to eavesdroppers and curious applications running on the device. The information that can be collected from mobile device owners includes their locations, their social relationships, and their current activity. All of this, once analyzed and combined together through inference, can be very telling about the users' private lives. In this talk, we will describe privacy threats in mobile and pervasive networks. We will also show how to quantify the privacy of the users of such networks and explain how information on co-location can be taken into account. We will describe the role that privacy enhancing technologies (PETs) can play and describe some of them. We will also explain how to prevent apps from sifting too many personal data under Android. We will conclude by mentioning the privacy and security challenges raised by the quantified self and digital medicine","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295889","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
扫码关注我们
求助内容：
应助结果提醒方式：