Pub Date : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683404
Youngmin Jeong, Hyundong Shin, M. Win
We analyze the performance of optimum combining in a general cochannel interference environment with thermal noise. Specifically, we consider multiple unequal-power interferers, each is spatially correlated across receiving antennas. We develop a new mathematical methodology to analyze the average symbol error probability (SEP) of optimum combining diversity systems in Rayleigh fading. The analysis resorts to the so-called Berezin's supermathematics that treats both commuting and Grassmann anticommuting variables on an equal footing. This superanalysis framework enables us to derive the exact SEP expression for an arbitrary number of interferers with spatial correlation and possibly different power levels. Our results therefore encompass all the previous analytical results, based on the theory of multivariate statistics relating to complex Wishart matrices, for equal-power and/or spatially-uncorrelated interferers. Connecting the powerful supermathematical framework to the analysis of wireless diversity systems with optimum combining, we quantify the interference effects in terms of the degree of power unbalance and the amount of spatial correlation.
{"title":"Superanalysis of the Interference Effect on Adaptive Antenna Systems","authors":"Youngmin Jeong, Hyundong Shin, M. Win","doi":"10.1109/GLOCOM.2010.5683404","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683404","url":null,"abstract":"We analyze the performance of optimum combining in a general cochannel interference environment with thermal noise. Specifically, we consider multiple unequal-power interferers, each is spatially correlated across receiving antennas. We develop a new mathematical methodology to analyze the average symbol error probability (SEP) of optimum combining diversity systems in Rayleigh fading. The analysis resorts to the so-called Berezin's supermathematics that treats both commuting and Grassmann anticommuting variables on an equal footing. This superanalysis framework enables us to derive the exact SEP expression for an arbitrary number of interferers with spatial correlation and possibly different power levels. Our results therefore encompass all the previous analytical results, based on the theory of multivariate statistics relating to complex Wishart matrices, for equal-power and/or spatially-uncorrelated interferers. Connecting the powerful supermathematical framework to the analysis of wireless diversity systems with optimum combining, we quantify the interference effects in terms of the degree of power unbalance and the amount of spatial correlation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75983051","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-12-01DOI: 10.1109/GLOCOM.2010.5683238
K. Zhu, D. Niyato, Ping Wang
Bandwidth allocation for different service classes in heterogeneous wireless networks is an important issue for service provider in terms of balancing service quality and profit. It is especially challenging when considering the dynamic competition both among service providers and among users. To address this problem, a two-level game framework is developed in this paper. The underlying dynamic service selection is modeled as an evolutionary game based on replicator dynamics. An upper bandwidth allocation differential game is formulated to model the competition among different service providers. The service selection distribution of the underlying evolutionary game describes the state of the upper differential game. An open-loop Nash equilibrium is considered to be the solution of this linear state differential game. The proposed framework can be implemented with minimum communication cost since no information broadcasting is required. Also, we observe that the selfish behavior of service providers can also maximize the social welfare.
{"title":"Optimal Bandwidth Allocation with Dynamic Service Selection in Heterogeneous Wireless Networks","authors":"K. Zhu, D. Niyato, Ping Wang","doi":"10.1109/GLOCOM.2010.5683238","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683238","url":null,"abstract":"Bandwidth allocation for different service classes in heterogeneous wireless networks is an important issue for service provider in terms of balancing service quality and profit. It is especially challenging when considering the dynamic competition both among service providers and among users. To address this problem, a two-level game framework is developed in this paper. The underlying dynamic service selection is modeled as an evolutionary game based on replicator dynamics. An upper bandwidth allocation differential game is formulated to model the competition among different service providers. The service selection distribution of the underlying evolutionary game describes the state of the upper differential game. An open-loop Nash equilibrium is considered to be the solution of this linear state differential game. The proposed framework can be implemented with minimum communication cost since no information broadcasting is required. Also, we observe that the selfish behavior of service providers can also maximize the social welfare.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"107 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87472602","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-12-01DOI: 10.1109/GLOCOM.2010.5684262
Suhua Tang, H. Yomo, T. Ueda, R. Miura, S. Obana
Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet length mismatch and rate mismatch. Although the former may be solved by re-framing, the latter remains a challenge and is likely to greatly degrade the efficiency of network coding. In this paper, we re-interpret network coding as a mapping of modulation constellation. On this basis, we extend such mapping to enable simultaneous use of different modulations by nesting the low-level constellation as a subset of the high level constellation. When relay links have different qualities, the messages of different flows are combined together in such a way that for each relay link its desired message is transmitted at its own highest rate. Compared with previous solutions to rate mismatch, the proposed scheme achieves the full rate of all relay links on the broadcast channel.
{"title":"Achieving Full Rate Network Coding with Constellation Compatible Modulation and Coding","authors":"Suhua Tang, H. Yomo, T. Ueda, R. Miura, S. Obana","doi":"10.1109/GLOCOM.2010.5684262","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684262","url":null,"abstract":"Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet length mismatch and rate mismatch. Although the former may be solved by re-framing, the latter remains a challenge and is likely to greatly degrade the efficiency of network coding. In this paper, we re-interpret network coding as a mapping of modulation constellation. On this basis, we extend such mapping to enable simultaneous use of different modulations by nesting the low-level constellation as a subset of the high level constellation. When relay links have different qualities, the messages of different flows are combined together in such a way that for each relay link its desired message is transmitted at its own highest rate. Compared with previous solutions to rate mismatch, the proposed scheme achieves the full rate of all relay links on the broadcast channel.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87852615","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-12-01DOI: 10.1109/GLOCOM.2010.5683537
M. Kolberg, J. Buford, K. Dhara, V. Krishnaswamy, Xiaotao Wu
Online collaboration platforms such as Google Wave provide basic tools for collaboration and communication as well as an interface to include external applications. Separately, we have defined a collaboration platform called ConnectedSpaces which extends these basic capabilities towards enterprise use. Using the ConnectedSpaces model, here we categorize, illustrate, and analyze new types of feature interactions for collaboration platforms. Furthermore, we discuss handling feature interactions which are caused by using ConnectedSpaces as a communication endpoint with enterprise communication platforms. The work in this paper is novel as it is the first investigation into feature interactions with collaboration platforms. Our approach uses a runtime feature interaction technique which can cope with features provided by different organizations.
{"title":"Feature Interaction Analysis for Collaboration Spaces with Communication Endpoints","authors":"M. Kolberg, J. Buford, K. Dhara, V. Krishnaswamy, Xiaotao Wu","doi":"10.1109/GLOCOM.2010.5683537","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683537","url":null,"abstract":"Online collaboration platforms such as Google Wave provide basic tools for collaboration and communication as well as an interface to include external applications. Separately, we have defined a collaboration platform called ConnectedSpaces which extends these basic capabilities towards enterprise use. Using the ConnectedSpaces model, here we categorize, illustrate, and analyze new types of feature interactions for collaboration platforms. Furthermore, we discuss handling feature interactions which are caused by using ConnectedSpaces as a communication endpoint with enterprise communication platforms. The work in this paper is novel as it is the first investigation into feature interactions with collaboration platforms. Our approach uses a runtime feature interaction technique which can cope with features provided by different organizations.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"24 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86830408","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-12-01DOI: 10.1109/GLOCOM.2010.5683827
Harpreet S. Dhillon, R. Buehrer
The problem of maximizing the sum-rate of a MIMO interference channel is investigated. Each receiver node is assumed to perform single user detection by treating interference from other users as Gaussian noise. It is assumed that all the users share a single frequency band and no pre-coding is performed over time. The sum-rate maximization in such a setup is a long-standing open problem due to its non-linear non-convex nature. The solution, to date, has only been approximated using the local optimization algorithms. In this paper, we couple the branch and bound strategy with the reformulation and linearization technique (BB/RLT) to develop a global optimization algorithm that finds a provably optimal solution. This problem is essentially an optimal power control problem over spatial channels and should not be confused with some recent developments such as Interference Alignment (IA) that typically require pre-coding over temporal, spectral or spatial dimensions. As a comparison with the state of the art, we compare the sum-rate achievable in the current system with the one predicted by IA and draw some interesting conclusions. It should be noted however, that even though the sum-rate achievable by IA can be predicted by assuming $N/2$ degrees of freedom in an $N$-user interference channel, the feasibility of IA over a limited number of signaling dimensions is an open problem.
{"title":"On the Sum-Rate of MIMO Interference Channel","authors":"Harpreet S. Dhillon, R. Buehrer","doi":"10.1109/GLOCOM.2010.5683827","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683827","url":null,"abstract":"The problem of maximizing the sum-rate of a MIMO interference channel is investigated. Each receiver node is assumed to perform single user detection by treating interference from other users as Gaussian noise. It is assumed that all the users share a single frequency band and no pre-coding is performed over time. The sum-rate maximization in such a setup is a long-standing open problem due to its non-linear non-convex nature. The solution, to date, has only been approximated using the local optimization algorithms. In this paper, we couple the branch and bound strategy with the reformulation and linearization technique (BB/RLT) to develop a global optimization algorithm that finds a provably optimal solution. This problem is essentially an optimal power control problem over spatial channels and should not be confused with some recent developments such as Interference Alignment (IA) that typically require pre-coding over temporal, spectral or spatial dimensions. As a comparison with the state of the art, we compare the sum-rate achievable in the current system with the one predicted by IA and draw some interesting conclusions. It should be noted however, that even though the sum-rate achievable by IA can be predicted by assuming $N/2$ degrees of freedom in an $N$-user interference channel, the feasibility of IA over a limited number of signaling dimensions is an open problem.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87108924","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-12-01DOI: 10.1109/GLOCOM.2010.5683310
Yanping Xiao, Chuang Lin, Yixin Jiang, Xiaowen Chu, Fangqin Liu
Cloud computing provides a novel computing paradigm for enterprises to store programs and data in the Cloud in a transparent manner, which poses the challenge of security and privacy. In this paper, based on homomorphic cryptography and Zero-Knowledge Proof, we present a novel privacy-preserving scheme for Cloud publish/subscribe service, which achieve efficient privacy-preserving authentication, data integrity, and publish-subscribe confidentiality. The performance evaluation and security analysis demonstrate the practice and validity of the proposed scheme.
{"title":"An Efficient Privacy-Preserving Publish-Subscribe Service Scheme for Cloud Computing","authors":"Yanping Xiao, Chuang Lin, Yixin Jiang, Xiaowen Chu, Fangqin Liu","doi":"10.1109/GLOCOM.2010.5683310","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683310","url":null,"abstract":"Cloud computing provides a novel computing paradigm for enterprises to store programs and data in the Cloud in a transparent manner, which poses the challenge of security and privacy. In this paper, based on homomorphic cryptography and Zero-Knowledge Proof, we present a novel privacy-preserving scheme for Cloud publish/subscribe service, which achieve efficient privacy-preserving authentication, data integrity, and publish-subscribe confidentiality. The performance evaluation and security analysis demonstrate the practice and validity of the proposed scheme.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"2 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87519574","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-12-01DOI: 10.1109/GLOCOM.2010.5683754
E. Zeydan, D. Kivanc-Tureli, U. Tureli
We present a distributed joint power control and transmit beamforming selection scheme for multiple antenna wireless ad hoc networks. Under the total network power minimization criterion, a joint iterative beamforming and power control algorithm is proposed to reduce mutual interference at each node. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise(SINR) at each receiver. First, transmit beamformers are selected from a predefined codebook to minimize the total power in a cooperative fashion. We also study the interference impaired network as a noncooperative beamforming game. By selecting transmit beamformers judiciously and performing power control, convergence of noncooperative beamformer games are guaranteed throughout the iterations. The noncooperative distributed algorithm is compared with centralized and cooperative solutions through simulation results.
{"title":"Iterative Beamforming and Power Control for MIMO Ad Hoc Networks","authors":"E. Zeydan, D. Kivanc-Tureli, U. Tureli","doi":"10.1109/GLOCOM.2010.5683754","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683754","url":null,"abstract":"We present a distributed joint power control and transmit beamforming selection scheme for multiple antenna wireless ad hoc networks. Under the total network power minimization criterion, a joint iterative beamforming and power control algorithm is proposed to reduce mutual interference at each node. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise(SINR) at each receiver. First, transmit beamformers are selected from a predefined codebook to minimize the total power in a cooperative fashion. We also study the interference impaired network as a noncooperative beamforming game. By selecting transmit beamformers judiciously and performing power control, convergence of noncooperative beamformer games are guaranteed throughout the iterations. The noncooperative distributed algorithm is compared with centralized and cooperative solutions through simulation results.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"17 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87580941","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-12-01DOI: 10.1109/GLOCOM.2010.5683811
Piergiuseppe Di Marco, P. Park, C. Fischione, K. Johansson
IEEE 802.15.4 multi-hop wireless networks are an important communication infrastructure for many applications, including industrial control, home automation, and smart grids. Existing analysis of the IEEE 802.15.4 medium access control (MAC) protocol are often based on assumptions of homogeneous traffic and ideal carrier sensing, which are far from the reality when predicting performance for multi-hop networks. In this paper, a generalized analysis of the unslotted IEEE 802.15.4 MAC is presented. The model considers heterogeneous traffic and hidden terminals due to limited carrier sensing capabilities, and allows us to investigate jointly IEEE 802.15.4 MAC and routing algorithms. The analysis is validated via Monte Carlo simulations, which show that routing over multi-hop networks is significantly influenced by the IEEE 802.15.4 MAC performance. Routing decisions based on packet loss probability may lead to an unbalanced distribution of the traffic load across paths, thus motivating the need of a joint optimization of routing and MAC.
{"title":"Analytical Modelling of IEEE 802.15.4 for Multi-Hop Networks with Heterogeneous Traffic and Hidden Terminals","authors":"Piergiuseppe Di Marco, P. Park, C. Fischione, K. Johansson","doi":"10.1109/GLOCOM.2010.5683811","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683811","url":null,"abstract":"IEEE 802.15.4 multi-hop wireless networks are an important communication infrastructure for many applications, including industrial control, home automation, and smart grids. Existing analysis of the IEEE 802.15.4 medium access control (MAC) protocol are often based on assumptions of homogeneous traffic and ideal carrier sensing, which are far from the reality when predicting performance for multi-hop networks. In this paper, a generalized analysis of the unslotted IEEE 802.15.4 MAC is presented. The model considers heterogeneous traffic and hidden terminals due to limited carrier sensing capabilities, and allows us to investigate jointly IEEE 802.15.4 MAC and routing algorithms. The analysis is validated via Monte Carlo simulations, which show that routing over multi-hop networks is significantly influenced by the IEEE 802.15.4 MAC performance. Routing decisions based on packet loss probability may lead to an unbalanced distribution of the traffic load across paths, thus motivating the need of a joint optimization of routing and MAC.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"105 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88035379","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-12-01DOI: 10.1109/GLOCOM.2010.5683623
Vinay Uday Prabhu, M. Rodrigues
In this paper, we consider secure communications between a single antenna transmitter and a single antenna receiver in the presence of a multiple antenna eavesdropper employing MRC or SDC reception. We show that an M-antenna eavesdropper performing SDC reception has precisely the same degrading effect on secrecy as M single antenna eavesdroppers under independent fading conditions. We also show that an M-antenna eavesdropper performing MRC reception causes greater secrecy degradation than an M-antenna eavesdropper performing SDC reception or M single antenna eavesdroppers. We also derive closed-form expressions for the asymptotic high SNR outage secrecy capacity for both the MRC and the SDC eavesdropper cases. Various numerical results are presented that corroborate the analysis.
{"title":"On Wireless Channels with M-Antenna Eavesdroppers: Characterization of the Outage Probability and Outage Secrecy Capacity","authors":"Vinay Uday Prabhu, M. Rodrigues","doi":"10.1109/GLOCOM.2010.5683623","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683623","url":null,"abstract":"In this paper, we consider secure communications between a single antenna transmitter and a single antenna receiver in the presence of a multiple antenna eavesdropper employing MRC or SDC reception. We show that an M-antenna eavesdropper performing SDC reception has precisely the same degrading effect on secrecy as M single antenna eavesdroppers under independent fading conditions. We also show that an M-antenna eavesdropper performing MRC reception causes greater secrecy degradation than an M-antenna eavesdropper performing SDC reception or M single antenna eavesdroppers. We also derive closed-form expressions for the asymptotic high SNR outage secrecy capacity for both the MRC and the SDC eavesdropper cases. Various numerical results are presented that corroborate the analysis.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"46 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88069506","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-12-01DOI: 10.1109/GLOCOM.2010.5683878
Yoshiki Kanda, K. Fukuda, T. Sugawara
Using traffic random projections (sketches) and Principal Component Analysis (PCA) for Internet traffic anomaly detection has become popular topics in the anomaly detection fields, but few studies have been undertaken on the subjective and quantitative comparison of multiple methods using the data traces open to the community. In this paper, we propose a new method that combines sketches and PCA to detect and identify the source IP addresses associated with the traffic anomalies in the backbone traces measured at a single link. We compare the results with those of a method incorporating sketches and multi-resolution gamma modeling using the trans-Pacific link traces. The comparison indicates that each method has its own advantages and disadvantages. Our method is good at detecting worm activities with many packets, whereas the gamma method is good at detecting scan activities for peer hosts with only a few packets, but it reports many false positives for traces of worm outbreaks. Therefore, their use in combination would be effective. We also examined the impact of adaptive decision making on a parameter (the number of normal subspaces in PCA) on the basis of the cumulative proportion of each sketched traffic and conclude that it performs at a higher level than the previous method deciding only on one specific value of the parameter for every divided traffics.
{"title":"Evaluation of Anomaly Detection Based on Sketch and PCA","authors":"Yoshiki Kanda, K. Fukuda, T. Sugawara","doi":"10.1109/GLOCOM.2010.5683878","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683878","url":null,"abstract":"Using traffic random projections (sketches) and Principal Component Analysis (PCA) for Internet traffic anomaly detection has become popular topics in the anomaly detection fields, but few studies have been undertaken on the subjective and quantitative comparison of multiple methods using the data traces open to the community. In this paper, we propose a new method that combines sketches and PCA to detect and identify the source IP addresses associated with the traffic anomalies in the backbone traces measured at a single link. We compare the results with those of a method incorporating sketches and multi-resolution gamma modeling using the trans-Pacific link traces. The comparison indicates that each method has its own advantages and disadvantages. Our method is good at detecting worm activities with many packets, whereas the gamma method is good at detecting scan activities for peer hosts with only a few packets, but it reports many false positives for traces of worm outbreaks. Therefore, their use in combination would be effective. We also examined the impact of adaptive decision making on a parameter (the number of normal subspaces in PCA) on the basis of the cumulative proportion of each sketched traffic and conclude that it performs at a higher level than the previous method deciding only on one specific value of the parameter for every divided traffics.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"40 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88420917","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
扫码关注我们
求助内容：
应助结果提醒方式：