Pub Date : 2014-08-28DOI: 10.1109/ICC.2014.6883687
S. Lakshminarayana, Tony Q. S. Quek
We consider the problem of maximizing the time average throughput in energy harvesting networks with dynamic channel state acquisition. Previous works on energy harvesting systems do not account for the energy consumed to acquire the channel state information(CSI). However, when the nodes have a limited capacity batteries and the energy available in the battery is time varying, it becomes crucial to account for the energy spent in acquiring the CSI. In such a scenario, the available energy in the battery must be optimally divided between CSI acquisition and transmission. We model the energy harvesting battery as an energy queue and use the technique of Lyapunov optimization combined with the idea of weight perturbation to jointly optimize the channel probing and transmission decisions. Since the optimization problem corresponding to the optimal CSI acquisition decision in each time slot is a combinatorial problem, we provide a low-complexity scheme to solve this in the special case ON-OFF fading channels with binary power allocation scheme, and prove that this algorithm is optimal. Finally, we provide numerical results and show that when the mean rate of the harvested energy is low, it becomes crucial to account for the energy consumed in acquiring the CSI.
{"title":"Throughput maximization with channel acquisition in energy harvesting systems","authors":"S. Lakshminarayana, Tony Q. S. Quek","doi":"10.1109/ICC.2014.6883687","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883687","url":null,"abstract":"We consider the problem of maximizing the time average throughput in energy harvesting networks with dynamic channel state acquisition. Previous works on energy harvesting systems do not account for the energy consumed to acquire the channel state information(CSI). However, when the nodes have a limited capacity batteries and the energy available in the battery is time varying, it becomes crucial to account for the energy spent in acquiring the CSI. In such a scenario, the available energy in the battery must be optimally divided between CSI acquisition and transmission. We model the energy harvesting battery as an energy queue and use the technique of Lyapunov optimization combined with the idea of weight perturbation to jointly optimize the channel probing and transmission decisions. Since the optimization problem corresponding to the optimal CSI acquisition decision in each time slot is a combinatorial problem, we provide a low-complexity scheme to solve this in the special case ON-OFF fading channels with binary power allocation scheme, and prove that this algorithm is optimal. Finally, we provide numerical results and show that when the mean rate of the harvested energy is low, it becomes crucial to account for the energy consumed in acquiring the CSI.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"125 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113940056","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883874
Yue Lu, Wei Wang, Lin Chen, Zhaoyang Zhang, Aiping Huang
Mobile relay-assisted forwarding can improve the network capacity, but meanwhile increase the energy consumption. In this paper, we propose two distance-based energy-efficient opportunistic forwarding (DEEOF) schemes in mobile delay tolerant networks (DTNs). The proposed schemes strike a balance between energy consumption and network performance by maximizing the energy efficiency while maintaining a high packet delivery ratio from two different angles. Specifically, in the developed algorithms, we introduce the forwarding equivalent energy-efficiency distance (FEED) to quantify the transmission distances achieving the same energy efficiency at different time instances. The expected energy efficiency can thus be estimated based on the FEED. Furthermore, the distribution of the greatest forwarding energy efficiency in the predicted period is investigated to provide more accurate prediction for the energy efficiency. The forwarding decision in the algorithms is made by comparing the current energy efficiency and the estimated future expectation. The performance improvement of the proposed algorithms is also demonstrated by simulation, especially for systems where the source has very limited battery reserves.
{"title":"Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks","authors":"Yue Lu, Wei Wang, Lin Chen, Zhaoyang Zhang, Aiping Huang","doi":"10.1109/ICC.2014.6883874","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883874","url":null,"abstract":"Mobile relay-assisted forwarding can improve the network capacity, but meanwhile increase the energy consumption. In this paper, we propose two distance-based energy-efficient opportunistic forwarding (DEEOF) schemes in mobile delay tolerant networks (DTNs). The proposed schemes strike a balance between energy consumption and network performance by maximizing the energy efficiency while maintaining a high packet delivery ratio from two different angles. Specifically, in the developed algorithms, we introduce the forwarding equivalent energy-efficiency distance (FEED) to quantify the transmission distances achieving the same energy efficiency at different time instances. The expected energy efficiency can thus be estimated based on the FEED. Furthermore, the distribution of the greatest forwarding energy efficiency in the predicted period is investigated to provide more accurate prediction for the energy efficiency. The forwarding decision in the algorithms is made by comparing the current energy efficiency and the estimated future expectation. The performance improvement of the proposed algorithms is also demonstrated by simulation, especially for systems where the source has very limited battery reserves.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121761674","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 : 2014-08-28DOI: 10.1109/ICC.2014.6884248
Y. Chen, X. Liu, W. Taylor, Jason H. Moore
Delay-tolerant networking effectively extends the network connectivity in the time domain, and endows communications devices with enhanced data transfer capabilities. Network coding on the other hand enables us to approach the information capacity of networks by allowing intermediate nodes to process data en route. Both of these were major principal breakthroughs in mobile and wireless communications in the past decade or so. As reported in this article, we are interested in how network coding battles such challenged networks as DTN from an experimental perspective. We conducted tests with both real smart mobile devices and computer simulation and found conditions where their results match. This would give us confidence of using computer simulation to study larger delay-tolerant networks with and without network coding at a much manageable cost.
{"title":"Delay-tolerant networks with network coding: How well can we simulate real devices?","authors":"Y. Chen, X. Liu, W. Taylor, Jason H. Moore","doi":"10.1109/ICC.2014.6884248","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884248","url":null,"abstract":"Delay-tolerant networking effectively extends the network connectivity in the time domain, and endows communications devices with enhanced data transfer capabilities. Network coding on the other hand enables us to approach the information capacity of networks by allowing intermediate nodes to process data en route. Both of these were major principal breakthroughs in mobile and wireless communications in the past decade or so. As reported in this article, we are interested in how network coding battles such challenged networks as DTN from an experimental perspective. We conducted tests with both real smart mobile devices and computer simulation and found conditions where their results match. This would give us confidence of using computer simulation to study larger delay-tolerant networks with and without network coding at a much manageable cost.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122517784","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 : 2014-08-21DOI: 10.1109/ICC.2014.6883598
Rick Fritschek, G. Wunder
The MAC-BC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we consider in this paper the linear deterministic cellular channel. In particular, we prove duality of a network with two interfering MACs in each cell and a network with two interfering BCs in each cell. The operational region is confined to the weak interference regime. First, achievable schemes as well as upper bounds will be provided. These bounds are the same for both channels. We will show, that for specific cases the upper bound corresponds to the achievable scheme and hence establishing a duality relationship between them.
{"title":"Upper bounds and duality relations of the linear deterministic sum capacity for cellular systems","authors":"Rick Fritschek, G. Wunder","doi":"10.1109/ICC.2014.6883598","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883598","url":null,"abstract":"The MAC-BC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we consider in this paper the linear deterministic cellular channel. In particular, we prove duality of a network with two interfering MACs in each cell and a network with two interfering BCs in each cell. The operational region is confined to the weak interference regime. First, achievable schemes as well as upper bounds will be provided. These bounds are the same for both channels. We will show, that for specific cases the upper bound corresponds to the achievable scheme and hence establishing a duality relationship between them.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122626761","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 : 2014-06-20DOI: 10.1109/ICC.2014.6883757
Shengfeng Xu, Gang Zhu, Chao Shen, B. Ai
With the rapid development of high-speed railway (HSR), how to provide the passengers with multimedia services has attracted increasing attention. A key issue is to develop an effective scheduling algorithm for multiple services with different quality of service (QoS) requirements. In this paper, we investigate the downlink service scheduling problem in HSR network taking account of end-to-end deadline constraints and successfully packet delivery ratio requirements. Firstly, by exploiting the deterministic high-speed train trajectory, we present a time-distance mapping in order to obtain the highly dynamic link capacity effectively. Next, a novel service model is developed for deadline constrained services with delivery ratio requirements, which enables us to turn the delivery ratio requirement into a single queue stability problem. Based on the Lyapunov drift, the optimal scheduling problem is formulated and the corresponding scheduling service algorithm is proposed by stochastic network optimization approach. Simulation results show that the proposed algorithm outperforms the conventional schemes in terms of QoS requirements.
{"title":"A QoS-aware scheduling algorithm for high-speed railway communication system","authors":"Shengfeng Xu, Gang Zhu, Chao Shen, B. Ai","doi":"10.1109/ICC.2014.6883757","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883757","url":null,"abstract":"With the rapid development of high-speed railway (HSR), how to provide the passengers with multimedia services has attracted increasing attention. A key issue is to develop an effective scheduling algorithm for multiple services with different quality of service (QoS) requirements. In this paper, we investigate the downlink service scheduling problem in HSR network taking account of end-to-end deadline constraints and successfully packet delivery ratio requirements. Firstly, by exploiting the deterministic high-speed train trajectory, we present a time-distance mapping in order to obtain the highly dynamic link capacity effectively. Next, a novel service model is developed for deadline constrained services with delivery ratio requirements, which enables us to turn the delivery ratio requirement into a single queue stability problem. Based on the Lyapunov drift, the optimal scheduling problem is formulated and the corresponding scheduling service algorithm is proposed by stochastic network optimization approach. Simulation results show that the proposed algorithm outperforms the conventional schemes in terms of QoS requirements.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121294918","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883356
I. Bennis, H. Fouchal, O. Zytoune, D. Aboutajdine
Wireless multimedia sensor networks (WMSNs) is one of the hotest topic nowadays which attracts more and more researchers as being an interdisciplinary research interest. Its cost decreases continuously due to advances in micro-electromechanical systems, and the proliferation and progression of wireless communications. However, the transmission of multimedia information must satisfy QoS criteria which increases energy consumption. This issue should be taken into consideration in the protocol design for WMSNs. In this paper, we propose an implementation and an evaluation of the TPGF routing protocol (Two Phase geographical Greedy Forwarding) over the network simulator NS2. The TPGF module over NS-2 is available for the research community. In this evaluation, we compare the TPGF performances with two other protocols: the well known AODV protocol and the EA-TPGF protocol (our previous work on an extension of the TPGF protocol which takes into account the remaining energy of nodes during the process of path identification). The performance metrics measured to evaluate the QoS of each protocol are: delay, PDR, remaining energy of each node at the end of the communication and the standard deviation of remaining energy. Simulations show promising results in terms of network life extension when TPGF is used.
{"title":"An evaluation of the TPGF protocol implementation over NS-2","authors":"I. Bennis, H. Fouchal, O. Zytoune, D. Aboutajdine","doi":"10.1109/ICC.2014.6883356","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883356","url":null,"abstract":"Wireless multimedia sensor networks (WMSNs) is one of the hotest topic nowadays which attracts more and more researchers as being an interdisciplinary research interest. Its cost decreases continuously due to advances in micro-electromechanical systems, and the proliferation and progression of wireless communications. However, the transmission of multimedia information must satisfy QoS criteria which increases energy consumption. This issue should be taken into consideration in the protocol design for WMSNs. In this paper, we propose an implementation and an evaluation of the TPGF routing protocol (Two Phase geographical Greedy Forwarding) over the network simulator NS2. The TPGF module over NS-2 is available for the research community. In this evaluation, we compare the TPGF performances with two other protocols: the well known AODV protocol and the EA-TPGF protocol (our previous work on an extension of the TPGF protocol which takes into account the remaining energy of nodes during the process of path identification). The performance metrics measured to evaluate the QoS of each protocol are: delay, PDR, remaining energy of each node at the end of the communication and the standard deviation of remaining energy. Simulations show promising results in terms of network life extension when TPGF is used.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114993545","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883961
Konstantin Avrachenkov, Mahmoud El Chamie, G. Neglia
Clustering of a graph is the task of grouping its nodes in such a way that the nodes within the same cluster are well connected, but they are less connected to nodes in different clusters. In this paper we propose a clustering metric based on the random walks' properties to evaluate the quality of a graph clustering. We also propose a randomized algorithm that identifies a locally optimal clustering of the graph according to the metric defined. The algorithm is intrinsically distributed and asynchronous. If the graph represents an actual network where nodes have computing capabilities, each node can determine its own cluster relying only on local communications. We show that the size of clusters can be adapted to the available processing capabilities to reduce the algorithm's complexity.
{"title":"Graph clustering based on mixing time of random walks","authors":"Konstantin Avrachenkov, Mahmoud El Chamie, G. Neglia","doi":"10.1109/ICC.2014.6883961","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883961","url":null,"abstract":"Clustering of a graph is the task of grouping its nodes in such a way that the nodes within the same cluster are well connected, but they are less connected to nodes in different clusters. In this paper we propose a clustering metric based on the random walks' properties to evaluate the quality of a graph clustering. We also propose a randomized algorithm that identifies a locally optimal clustering of the graph according to the metric defined. The algorithm is intrinsically distributed and asynchronous. If the graph represents an actual network where nodes have computing capabilities, each node can determine its own cluster relying only on local communications. We show that the size of clusters can be adapted to the available processing capabilities to reduce the algorithm's complexity.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115424139","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883706
Shiyu Ji, Tingting Chen
Mobile devices with sensing capabilities have enabled a new paradigm of mobile crowdsensing with a broad range of applications. A major challenge in achieving a stable crowdsensing system in a large scale is the incentive issue for each participant. Proper incentive mechanisms are necessary to keep the crowdsensing working. However, most existing incentive mechanisms for crowdsensing assume the system has infinite precisions in opposite of the fact that digital devices round the results to discrete floating numbers. In this paper, we show that finite precisions and rounding can make the existing crowdsensing incentive mechanisms invalid. To address this problem, we design an incentive mechanism for discrete crowdsensing that achieves Perfect Bayesian Equilibrium (PBE) and maximizes platform utility. Our mechanism is efficient since its computational complexity is linear to the number of users. We also consider the case that different participants have diverse precisions, and design another incentive mechanism to achieve mixed PBE and maximize platform utility in the statistical sense. Extensive simulations verify our mechanisms are efficient, individual-rational and system-optimal.
{"title":"Crowdsensing incentive mechanisms for mobile systems with finite precisions","authors":"Shiyu Ji, Tingting Chen","doi":"10.1109/ICC.2014.6883706","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883706","url":null,"abstract":"Mobile devices with sensing capabilities have enabled a new paradigm of mobile crowdsensing with a broad range of applications. A major challenge in achieving a stable crowdsensing system in a large scale is the incentive issue for each participant. Proper incentive mechanisms are necessary to keep the crowdsensing working. However, most existing incentive mechanisms for crowdsensing assume the system has infinite precisions in opposite of the fact that digital devices round the results to discrete floating numbers. In this paper, we show that finite precisions and rounding can make the existing crowdsensing incentive mechanisms invalid. To address this problem, we design an incentive mechanism for discrete crowdsensing that achieves Perfect Bayesian Equilibrium (PBE) and maximizes platform utility. Our mechanism is efficient since its computational complexity is linear to the number of users. We also consider the case that different participants have diverse precisions, and design another incentive mechanism to achieve mixed PBE and maximize platform utility in the statistical sense. Extensive simulations verify our mechanisms are efficient, individual-rational and system-optimal.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621984","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883609
Ranga Prasad, S. Bhashyam, A. Chockalingam
We study the Gaussian many-to-one interference network which is a special case of general interference network, where only one receiver experiences interference. We allow transmission of messages on all the links of the network. This communication model is different from the corresponding many-to-one interference channel. We formulate three transmission strategies for the above network, which involve using Gaussian codebooks and treating interference from a subset of the transmitters as noise. We use sum-rate as the criterion of optimality for evaluating the strategies. For the first two strategies, we characterize the sum-rate capacity under certain channel conditions, while for the other strategy, we derive a sum-rate outer bound and characterize the gap between the outer bound and the achievable sum-rate of the strategy. Finally, we illustrate the regions where the derived channel conditions are satisfied for each strategy.
{"title":"Optimum transmission strategies for the Gaussian many-to-one interference network","authors":"Ranga Prasad, S. Bhashyam, A. Chockalingam","doi":"10.1109/ICC.2014.6883609","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883609","url":null,"abstract":"We study the Gaussian many-to-one interference network which is a special case of general interference network, where only one receiver experiences interference. We allow transmission of messages on all the links of the network. This communication model is different from the corresponding many-to-one interference channel. We formulate three transmission strategies for the above network, which involve using Gaussian codebooks and treating interference from a subset of the transmitters as noise. We use sum-rate as the criterion of optimality for evaluating the strategies. For the first two strategies, we characterize the sum-rate capacity under certain channel conditions, while for the other strategy, we derive a sum-rate outer bound and characterize the gap between the outer bound and the achievable sum-rate of the strategy. Finally, we illustrate the regions where the derived channel conditions are satisfied for each strategy.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121811267","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 : 2014-06-10DOI: 10.1109/ICC.2014.6883385
Wenlin Han, Yang Xiao
Non-Technical Loss (NTL) fraud is a consistent problem harassing utility companies all over the world. Most of the previous researches on NTL depend fully on user behaviour monitoring, analysis, and feature extraction. In this paper, we propose a practical scheme, named NTL Fraud Detection (NFD), to detect NTL without knowing any extra information about customers. The proposed scheme differentiates tampered meters from normal meters using the approximated difference between the billing electricity and the actually consumed electricity.
{"title":"NFD: A practical scheme to detect non-technical loss fraud in smart grid","authors":"Wenlin Han, Yang Xiao","doi":"10.1109/ICC.2014.6883385","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883385","url":null,"abstract":"Non-Technical Loss (NTL) fraud is a consistent problem harassing utility companies all over the world. Most of the previous researches on NTL depend fully on user behaviour monitoring, analysis, and feature extraction. In this paper, we propose a practical scheme, named NTL Fraud Detection (NFD), to detect NTL without knowing any extra information about customers. The proposed scheme differentiates tampered meters from normal meters using the approximated difference between the billing electricity and the actually consumed electricity.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124269291","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
扫码关注我们
求助内容：
应助结果提醒方式：