Pub Date : 2010-08-01DOI: 10.1109/MWC.2010.5547918
Alfred Asterjadhi, M. Zorzi
In this paper we address the problem of neighbor discovery in cognitive radio networks. Cognitive radios operate in a particularly challenging wireless environment. In such an environment, besides the strict requirements imposed by the opportunistic co-existence with licensed users, cognitive radios may have to deal with other concurrent (either malicious or selfish) cognitive radios which aim at gaining access to most of the available spectrum resources with no regards to fairness or other behavioral etiquettes. By taking advantage of their highly flexible radio devices, they are able to mimic licensed users behavior or simply to jam a given channel with high power. This way these concurrent users (jammers) are capable of interrupting or delaying the neighbor discovery process initiated by a normal cognitive radio network which is interested in using a portion of the available spectrum for its own data communications. To solve this problem we propose a Jamming Evasive Network-coding Neighbor-discovery Algorithm (JENNA) which assures complete neighbor discovery for a cognitive radio network in a distributed and asynchronous way. We compare the proposed algorithm with baseline schemes that represent existing solutions, and validate its feasibility in a single hop cognitive radio network.
{"title":"JENNA: A Jamming Evasive Network-Coding Neighbor-Discovery Algorithm for Cognitive Radio Networks","authors":"Alfred Asterjadhi, M. Zorzi","doi":"10.1109/MWC.2010.5547918","DOIUrl":"https://doi.org/10.1109/MWC.2010.5547918","url":null,"abstract":"In this paper we address the problem of neighbor discovery in cognitive radio networks. Cognitive radios operate in a particularly challenging wireless environment. In such an environment, besides the strict requirements imposed by the opportunistic co-existence with licensed users, cognitive radios may have to deal with other concurrent (either malicious or selfish) cognitive radios which aim at gaining access to most of the available spectrum resources with no regards to fairness or other behavioral etiquettes. By taking advantage of their highly flexible radio devices, they are able to mimic licensed users behavior or simply to jam a given channel with high power. This way these concurrent users (jammers) are capable of interrupting or delaying the neighbor discovery process initiated by a normal cognitive radio network which is interested in using a portion of the available spectrum for its own data communications. To solve this problem we propose a Jamming Evasive Network-coding Neighbor-discovery Algorithm (JENNA) which assures complete neighbor discovery for a cognitive radio network in a distributed and asynchronous way. We compare the proposed algorithm with baseline schemes that represent existing solutions, and validate its feasibility in a single hop cognitive radio network.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129273620","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503953
Ao Zhan, Chen He, Ling-ge Jiang
An amplified-and-forward network coded protocol (ANCP) is proved to achieve excellent network performance [6]. In this paper, we first drive the closed-form expression of the system outage probability in the high SNR regime, based on ANCP protocol in a classical butterfly wireless network. However the complex expression is a bottleneck of developing power allocation. Then we approximate the expression with a simplified version and propose power allocation strategies with a closed form, only requiring statistical channel state information (CSI). Finally, it is shown that the closed-form expression almost overlap the curve of the system outage probability by Monte Carlo simulation in the high SNR regime and the simplified version is very close to the simulation curve. Moreover, it is validated that the proposed power allocation strategies achieve a large signal-noise ratio (SNR) gain over the system without power allocation strategies.
{"title":"A Channel Statistic Based Power Allocation in a Butterfly Wireless Network with Network Coding","authors":"Ao Zhan, Chen He, Ling-ge Jiang","doi":"10.1109/ICCW.2010.5503953","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503953","url":null,"abstract":"An amplified-and-forward network coded protocol (ANCP) is proved to achieve excellent network performance [6]. In this paper, we first drive the closed-form expression of the system outage probability in the high SNR regime, based on ANCP protocol in a classical butterfly wireless network. However the complex expression is a bottleneck of developing power allocation. Then we approximate the expression with a simplified version and propose power allocation strategies with a closed form, only requiring statistical channel state information (CSI). Finally, it is shown that the closed-form expression almost overlap the curve of the system outage probability by Monte Carlo simulation in the high SNR regime and the simplified version is very close to the simulation curve. Moreover, it is validated that the proposed power allocation strategies achieve a large signal-noise ratio (SNR) gain over the system without power allocation strategies.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127327721","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503928
Hazer Inaltekin, N. E. Ozgencil, Hao Xu, M. Chiang, H. Poor
This paper introduces an operational monetary system, the Sharing Mart system, for online content trading, and discusses what it can do with a toy experiment. Sharing Mart is a virtual-money-based file sharing system in which different digital rights (e.g., view only, download and resell rights) of various file types (e.g., video, audio, graphics and documents) can be traded by means of different transaction styles (e.g., marked price transactions and S-Mart auctions). Sharing Mart is the content equivalent of stock exchange markets, eBay and Amazon. The fully operational version has been used by 250 students in the School of Engineering and Applied Science at Princeton University. After a quick introduction to Sharing Mart, its capabilities as a testbed are illustrated by means of a multiple-winner content auction experiment. Empirical data indicate that revenue earned by selling content and probability of winning an auction are maximized as seller/buyer strategies approach the Nash equilibrium. Content sellers and buyers lacking of strategic thinking lead to revenue reductions and reductions in the success rate to win an auction, respectively.
{"title":"Online Content Trading: Sharing Mart System and Auction Experiments","authors":"Hazer Inaltekin, N. E. Ozgencil, Hao Xu, M. Chiang, H. Poor","doi":"10.1109/ICCW.2010.5503928","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503928","url":null,"abstract":"This paper introduces an operational monetary system, the Sharing Mart system, for online content trading, and discusses what it can do with a toy experiment. Sharing Mart is a virtual-money-based file sharing system in which different digital rights (e.g., view only, download and resell rights) of various file types (e.g., video, audio, graphics and documents) can be traded by means of different transaction styles (e.g., marked price transactions and S-Mart auctions). Sharing Mart is the content equivalent of stock exchange markets, eBay and Amazon. The fully operational version has been used by 250 students in the School of Engineering and Applied Science at Princeton University. After a quick introduction to Sharing Mart, its capabilities as a testbed are illustrated by means of a multiple-winner content auction experiment. Empirical data indicate that revenue earned by selling content and probability of winning an auction are maximized as seller/buyer strategies approach the Nash equilibrium. Content sellers and buyers lacking of strategic thinking lead to revenue reductions and reductions in the success rate to win an auction, respectively.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347640","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503897
G. Lioudakis, C. Papagianni, A. Salden, D. Kaklamani, I. Venieris
Road traffic congestion constitutes a parameter that significantly affects quality of life in modern cities, while it has a direct impact on the environmental pollution. Optimizing the traffic flows would bring considerable and multi-aspect gains. In this light, this paper proposes an intelligent traffic management system for the provision of a dynamic, in real-time fleet navigation service at large scale. The framework collects all available contextual information generated "on the road" and uses a multi-layer, distributed, hierarchical middleware, for optimizing traffic flows in a cellular fashion. The framework enables also the provision of other value-added services, while it puts special care on the issue of protecting personal privacy.
{"title":"An Intelligent Traffic Management System for the Eco-Optimization of Urban Traffic Flows","authors":"G. Lioudakis, C. Papagianni, A. Salden, D. Kaklamani, I. Venieris","doi":"10.1109/ICCW.2010.5503897","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503897","url":null,"abstract":"Road traffic congestion constitutes a parameter that significantly affects quality of life in modern cities, while it has a direct impact on the environmental pollution. Optimizing the traffic flows would bring considerable and multi-aspect gains. In this light, this paper proposes an intelligent traffic management system for the provision of a dynamic, in real-time fleet navigation service at large scale. The framework collects all available contextual information generated \"on the road\" and uses a multi-layer, distributed, hierarchical middleware, for optimizing traffic flows in a cellular fashion. The framework enables also the provision of other value-added services, while it puts special care on the issue of protecting personal privacy.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114387472","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503908
Ricardo M. Silva, J. Sá Silva, F. Boavida
The potential of wireless sensor networks (WSN) for a wide range of scenarios has led to some experiments which explore their use in critical applications, such as soldier health monitoring, fire rescue or healthcare. Nevertheless, many obstacles to the effective use of WSNs in these scenarios exist, mainly due to stringent requirements on mobility, losses, latency and reliability. In this paper we propose a novel paradigm for WSN mobility, which successfully satisfies all of these requirements. The proposed approach - named Sensor Mobility Proxy, SMP - has been prototyped and is being studied in a scenario of wearable physiological monitoring in hazardous industrial areas, in the scope of the GINSENG European project. This paper presents the proof-of-concept and some of its first results.
{"title":"A Proxy-Based Mobility Solution for Critical WSN Applications","authors":"Ricardo M. Silva, J. Sá Silva, F. Boavida","doi":"10.1109/ICCW.2010.5503908","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503908","url":null,"abstract":"The potential of wireless sensor networks (WSN) for a wide range of scenarios has led to some experiments which explore their use in critical applications, such as soldier health monitoring, fire rescue or healthcare. Nevertheless, many obstacles to the effective use of WSNs in these scenarios exist, mainly due to stringent requirements on mobility, losses, latency and reliability. In this paper we propose a novel paradigm for WSN mobility, which successfully satisfies all of these requirements. The proposed approach - named Sensor Mobility Proxy, SMP - has been prototyped and is being studied in a scenario of wearable physiological monitoring in hazardous industrial areas, in the scope of the GINSENG European project. This paper presents the proof-of-concept and some of its first results.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117256500","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503963
Zhang Tao, K. Lu, A. Jafari, Shengli Fu, Y. Qian
Physical-layer network coding (PLNC) is an emerging technique that may substantially improve the throughput capacity. In the literature, most existing studies in PLNC focus on a three-node communication system, in which two source nodes exchange information with the help of a common relay node. In this paper, we study the impact of PLNC in a large-scale random wireless network. Specifically, we address the throughput capacity of a random extended network, in which all nodes are located in a w x w square area, where w = sqrt(n). Our analysis is based on a generalized physical model, in which the transmission rate of PLNC depends on the signal to noise and interference ratio(SINR). To investigate the impact of PLNC on the capacity bounds of networks, we construct a novel wireless highway system to provide connectivity in the network. Our study shows that, PLNC can improve the throughput capacity of wireless network by a certain factor, which is greater than 1, depending on the path loss exponent, and the level of noise.
{"title":"On the Capacity Bounds of Large-Scale Wireless Network with Physical-Layer Network Coding under the Generalized Physical Model","authors":"Zhang Tao, K. Lu, A. Jafari, Shengli Fu, Y. Qian","doi":"10.1109/ICCW.2010.5503963","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503963","url":null,"abstract":"Physical-layer network coding (PLNC) is an emerging technique that may substantially improve the throughput capacity. In the literature, most existing studies in PLNC focus on a three-node communication system, in which two source nodes exchange information with the help of a common relay node. In this paper, we study the impact of PLNC in a large-scale random wireless network. Specifically, we address the throughput capacity of a random extended network, in which all nodes are located in a w x w square area, where w = sqrt(n). Our analysis is based on a generalized physical model, in which the transmission rate of PLNC depends on the signal to noise and interference ratio(SINR). To investigate the impact of PLNC on the capacity bounds of networks, we construct a novel wireless highway system to provide connectivity in the network. Our study shows that, PLNC can improve the throughput capacity of wireless network by a certain factor, which is greater than 1, depending on the path loss exponent, and the level of noise.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569639","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503907
H. Le, M. Kuttel, G. Chandran
To address the issue of increasing health care costs and overcrowded care giving institutions, there is an increasing focus on the use of mobile technology and biological sensors in developing better Tele-health systems. Remote monitoring of cardiac activity is a central endeavor of Telemedicine. This article describes the implementation and evaluation of the performance of an electronic health ECG monitoring system utilizing mobile phones and Bluetooth-enabled ECG sensors.
{"title":"An Electronic Health Care - Cardiac Monitoring System","authors":"H. Le, M. Kuttel, G. Chandran","doi":"10.1109/ICCW.2010.5503907","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503907","url":null,"abstract":"To address the issue of increasing health care costs and overcrowded care giving institutions, there is an increasing focus on the use of mobile technology and biological sensors in developing better Tele-health systems. Remote monitoring of cardiac activity is a central endeavor of Telemedicine. This article describes the implementation and evaluation of the performance of an electronic health ECG monitoring system utilizing mobile phones and Bluetooth-enabled ECG sensors.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116293283","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503969
Xiaoyu Qiao, Z. Tan, Shaoyi Xu, Jiajun Li
The primary-secondary user combined power allocation problem is considered in this paper. The problem is addressed in cognitive radio-based relay-assisted networks, where the primary user and the secondary user coexist and influent on each other, and the relays are expected to undertake partial tasks of collecting channel information, computing the optimal power allocation strategy, and informing the users about the obtained transmit power results. The power allocation for primary and secondary user is modeled as a noncooperative game. The existence of the Nash equilibrium of the game is established, as well as its uniqueness. A relay-assisted iterative algorithm, which can be performed through the cooperation of the base station and the relays, is proposed to efficiently reach the Nash equilibrium. Numerical results demonstrate the convergence of the proposed iterative algorithm, and also the performance improvement of the power allocation.
{"title":"Combined Power Allocation in Cognitive Radio-Based Relay-Assisted Networks","authors":"Xiaoyu Qiao, Z. Tan, Shaoyi Xu, Jiajun Li","doi":"10.1109/ICCW.2010.5503969","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503969","url":null,"abstract":"The primary-secondary user combined power allocation problem is considered in this paper. The problem is addressed in cognitive radio-based relay-assisted networks, where the primary user and the secondary user coexist and influent on each other, and the relays are expected to undertake partial tasks of collecting channel information, computing the optimal power allocation strategy, and informing the users about the obtained transmit power results. The power allocation for primary and secondary user is modeled as a noncooperative game. The existence of the Nash equilibrium of the game is established, as well as its uniqueness. A relay-assisted iterative algorithm, which can be performed through the cooperation of the base station and the relays, is proposed to efficiently reach the Nash equilibrium. Numerical results demonstrate the convergence of the proposed iterative algorithm, and also the performance improvement of the power allocation.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130143686","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503934
A. Paier, R. Tresch, A. Alonso, D. Smely, P. Meckel, Yi Zhou, N. Czink
For the launch of intelligent transport systems (ITS), it is necessary to have detailed understanding of their performance. The draft standard IEEE 802.11p is the physical and medium access control layer (PHY/MAC) standard extension for wireless access in vehicular communications to IEEE 802.11. In order to evaluate its performance, we carried out an infrastructure-to-vehicle trial on a highway using an IEEE 802.11p prototype. This paper presents evaluation results of the average downstream performance of the PHY. Shadowing effects mainly caused by trucks lead to a strongly fluctuating performance of the link quality, especially for settings with long packet lengths and high vehicle speeds. The maximum achievable range, where the frame-success-ratio is continuously larger than 0.25, is about 700m. The maximum data volume that can be transmitted when a vehicle drives by a roadside unit is achieved at low data rates of 6 and 9Mbit/s.
{"title":"Average Downstream Performance of Measured IEEE 802.11p Infrastructure-to-Vehicle Links","authors":"A. Paier, R. Tresch, A. Alonso, D. Smely, P. Meckel, Yi Zhou, N. Czink","doi":"10.1109/ICCW.2010.5503934","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503934","url":null,"abstract":"For the launch of intelligent transport systems (ITS), it is necessary to have detailed understanding of their performance. The draft standard IEEE 802.11p is the physical and medium access control layer (PHY/MAC) standard extension for wireless access in vehicular communications to IEEE 802.11. In order to evaluate its performance, we carried out an infrastructure-to-vehicle trial on a highway using an IEEE 802.11p prototype. This paper presents evaluation results of the average downstream performance of the PHY. Shadowing effects mainly caused by trucks lead to a strongly fluctuating performance of the link quality, especially for settings with long packet lengths and high vehicle speeds. The maximum achievable range, where the frame-success-ratio is continuously larger than 0.25, is about 700m. The maximum data volume that can be transmitted when a vehicle drives by a roadside unit is achieved at low data rates of 6 and 9Mbit/s.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133229154","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 : 2010-05-23DOI: 10.1109/ICCW.2010.5503916
J. Bohli, Christoph Sorge, Osman Ugus
Electricity suppliers have started replacing traditional electricity meters with so-called smart meters, which can transmit current power consumption levels to the supplier within short intervals. Though this is advantageous for the electricity suppliers' planning purposes, and also allows the customers a more detailed look at their usage behavior, it means a considerable risk for privacy. The detailed information can be used to judge whether persons are in the household, when they come home, which electric devices they use (e.g. when they watch TV), and so forth. In this work, we introduce the "smart metering privacy model" for measuring the degree of privacy that a smart metering application can provide. Moreover, we present two design solutions both with and without involvement of trusted third parties. We show that the solution with trusted party can provide "perfect privacy" under certain conditions.
{"title":"A Privacy Model for Smart Metering","authors":"J. Bohli, Christoph Sorge, Osman Ugus","doi":"10.1109/ICCW.2010.5503916","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503916","url":null,"abstract":"Electricity suppliers have started replacing traditional electricity meters with so-called smart meters, which can transmit current power consumption levels to the supplier within short intervals. Though this is advantageous for the electricity suppliers' planning purposes, and also allows the customers a more detailed look at their usage behavior, it means a considerable risk for privacy. The detailed information can be used to judge whether persons are in the household, when they come home, which electric devices they use (e.g. when they watch TV), and so forth. In this work, we introduce the \"smart metering privacy model\" for measuring the degree of privacy that a smart metering application can provide. Moreover, we present two design solutions both with and without involvement of trusted third parties. We show that the solution with trusted party can provide \"perfect privacy\" under certain conditions.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114971057","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
扫码关注我们
求助内容：
应助结果提醒方式：