Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364189
M. R. Nakhai, Aimal Khan Yousafzai
Recent results on interference alignment (IA) in a K-user n × n MIMO interference channel, have shown that the ratio of total degrees of freedom d̂ to the single user degrees of freedom varies from d̂/n <; 2 in the case of arbitrary MIMO channels (i.e., channels with no structure) to K/2 in the case of channels with diagonal structure (i.e., channels with time or frequency varying coefficients). These results confirm that the information theoretic upper bound on degrees of freedom with no channel extension can only be achieved for K ≤ 3 with an overwhelming overhead of the global channel knowledge or an extensive number of back-and-forth iterations between the transmitting and the receiving nodes [3]. In this paper, we show that this limit on the number of users can be extended to K ≤ 5 as a result of introducing a partial cooperation into the interference channel. This partial cooperation is such that the message of the kth transmitter or base station (BS) is known to the [k - 1)th transmitter (mod K) and each receiver or user is simultaneously served by two transmitters. We introduce a one-shot algorithm that utilizes the reciprocity of wireless network to achieve interference alignment with no iterations between the transmitting and the receiving nodes when d̂/n ≤ 2. Monte-Carlo simulation results show that the proposed partial cooperation used with the one-shot algorithm can considerably enhance the sum rate in an interference channel system at practical SNR levels as a result of improved spatial multiplexing gain.
最近关于k用户n × n MIMO干扰通道中干扰对准(IA)的研究结果表明，总自由度d³与单用户自由度的比值d³/n <;在任意MIMO信道(即无结构信道)情况下为2，到对角结构信道(即时变或变频系数信道)情况下为K/2。这些结果证实，在没有信道扩展的情况下，只有当K≤3时，全局信道知识的开销过大，或者在发送和接收节点之间进行大量的来回迭代时，才能实现自由度的信息理论上限[3]。在本文中，我们证明了通过在干扰信道中引入部分合作，可以将用户数量的限制扩展到K≤5。这种部分合作使得第k个发射机或基站(BS)的消息为第k - 1个发射机(mod k)所知，并且每个接收器或用户同时由两个发射机服务。本文介绍了一种利用无线网络互易性的一次性算法，在d /n≤2时，实现了发射节点与接收节点之间不迭代的干扰对准。蒙特卡罗仿真结果表明，在实际信噪比水平的干扰信道系统中，由于提高了空间复用增益，所提出的局部协作与单次算法相结合可以显著提高和速率。
{"title":"Interference alignment with cyclic unidirectional cooperation","authors":"M. R. Nakhai, Aimal Khan Yousafzai","doi":"10.1109/ICC.2012.6364189","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364189","url":null,"abstract":"Recent results on interference alignment (IA) in a K-user n × n MIMO interference channel, have shown that the ratio of total degrees of freedom d̂ to the single user degrees of freedom varies from d̂/n <; 2 in the case of arbitrary MIMO channels (i.e., channels with no structure) to K/2 in the case of channels with diagonal structure (i.e., channels with time or frequency varying coefficients). These results confirm that the information theoretic upper bound on degrees of freedom with no channel extension can only be achieved for K ≤ 3 with an overwhelming overhead of the global channel knowledge or an extensive number of back-and-forth iterations between the transmitting and the receiving nodes [3]. In this paper, we show that this limit on the number of users can be extended to K ≤ 5 as a result of introducing a partial cooperation into the interference channel. This partial cooperation is such that the message of the kth transmitter or base station (BS) is known to the [k - 1)th transmitter (mod K) and each receiver or user is simultaneously served by two transmitters. We introduce a one-shot algorithm that utilizes the reciprocity of wireless network to achieve interference alignment with no iterations between the transmitting and the receiving nodes when d̂/n ≤ 2. Monte-Carlo simulation results show that the proposed partial cooperation used with the one-shot algorithm can considerably enhance the sum rate in an interference channel system at practical SNR levels as a result of improved spatial multiplexing gain.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126029142","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 : 2012-11-29DOI: 10.1109/ICC.2012.6363702
Wei Guan, K. Liu
In this work, we study the error performances of the multiple access system using analog network coding (ANC), where all the users broadcast their data to the relays and destination simultaneously in the first phase, and the relays forward the source messages that have been mixed in the air in the second phase. Depending on the type of relay power constraint, both the variable gain relaying and fixed gain relaying are considered. We show that the error rates of both schemes scale as O(log P/P2) at high signal-to-noise ratio (SNR), where P is the transmitted power. We also show that the error performance is dominated by the relay-destination channel, thus the best relay position should be close to the destination. We also demonstrate that ANC may be outperformed by the conventional amplify-and-forward scheme when the data rate is low and the user number is not large. Finally, we propose a relay selection strategy based on Min-Max criterion that can achieve full diversity when there are multiple relays.
{"title":"Error performances of multiple access system using analog network coding","authors":"Wei Guan, K. Liu","doi":"10.1109/ICC.2012.6363702","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363702","url":null,"abstract":"In this work, we study the error performances of the multiple access system using analog network coding (ANC), where all the users broadcast their data to the relays and destination simultaneously in the first phase, and the relays forward the source messages that have been mixed in the air in the second phase. Depending on the type of relay power constraint, both the variable gain relaying and fixed gain relaying are considered. We show that the error rates of both schemes scale as O(log P/P2) at high signal-to-noise ratio (SNR), where P is the transmitted power. We also show that the error performance is dominated by the relay-destination channel, thus the best relay position should be close to the destination. We also demonstrate that ANC may be outperformed by the conventional amplify-and-forward scheme when the data rate is low and the user number is not large. Finally, we propose a relay selection strategy based on Min-Max criterion that can achieve full diversity when there are multiple relays.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120934013","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364674
Jan Stanek, L. Kencl
As Voice-over-IP becomes a commonly used technology, the need to keep it secure and reliable has grown. Session Initiation Protocol (SIP) is most often used to deploy VoIP and therefore SIP servers, the base components of SIP, are the most obvious targets of potential attacks. It has been demonstrated, that SIP servers are highly prone to DDoS flood attacks, yet no generally accepted defense solution mitigating these attacks is available. We propose a novel defense architecture against SIP DDoS floods, based upon a redirection mechanism and a combination of source and destination traffic filtering, exploiting the combined advantage of all the three techniques. We show that the proposed solution effectively mitigates various types of SIP DDoS flood attacks, discuss its strengths and weaknesses and propose its potential usability for other protocols. We also provide results of performance evaluation of the defense solution deployed in a SIP testbed.
{"title":"SIP Protector: Defense architecture mitigating DDoS flood attacks against SIP servers","authors":"Jan Stanek, L. Kencl","doi":"10.1109/ICC.2012.6364674","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364674","url":null,"abstract":"As Voice-over-IP becomes a commonly used technology, the need to keep it secure and reliable has grown. Session Initiation Protocol (SIP) is most often used to deploy VoIP and therefore SIP servers, the base components of SIP, are the most obvious targets of potential attacks. It has been demonstrated, that SIP servers are highly prone to DDoS flood attacks, yet no generally accepted defense solution mitigating these attacks is available. We propose a novel defense architecture against SIP DDoS floods, based upon a redirection mechanism and a combination of source and destination traffic filtering, exploiting the combined advantage of all the three techniques. We show that the proposed solution effectively mitigates various types of SIP DDoS flood attacks, discuss its strengths and weaknesses and propose its potential usability for other protocols. We also provide results of performance evaluation of the defense solution deployed in a SIP testbed.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114137072","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364306
M. E. Ahmed, Ju Bin Song, Nam Tuan Nguyen, Zhu Han
In cognitive radio networks, a secondary user needs to estimate the primary users' traffic patterns so as to optimize its transmission strategy. In this paper, we propose a nonparametric Bayesian method for identifying traffic applications, since the traffic applications have their own distinctive patterns. In the proposed algorithm, the collapsed Gibbs sampler is applied to cluster the traffic applications using the infinite Gaussian mixture model over the feature space of the packet length, the packet inter-arrival time, and the variance of packet lengths. We analyze the effectiveness of our proposed technique by extensive simulation using the measured data obtained from the WiMax networks.
{"title":"Nonparametric Bayesian identification of primary users' payloads in cognitive radio networks","authors":"M. E. Ahmed, Ju Bin Song, Nam Tuan Nguyen, Zhu Han","doi":"10.1109/ICC.2012.6364306","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364306","url":null,"abstract":"In cognitive radio networks, a secondary user needs to estimate the primary users' traffic patterns so as to optimize its transmission strategy. In this paper, we propose a nonparametric Bayesian method for identifying traffic applications, since the traffic applications have their own distinctive patterns. In the proposed algorithm, the collapsed Gibbs sampler is applied to cluster the traffic applications using the infinite Gaussian mixture model over the feature space of the packet length, the packet inter-arrival time, and the variance of packet lengths. We analyze the effectiveness of our proposed technique by extensive simulation using the measured data obtained from the WiMax networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126811657","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364177
G. Riva, J. Finochietto
The use of wireless sensor networks for information discovery and monitoring of continuous physical fields has emerged as a novel and efficient solution. To this end, a sink node disseminates a query message through the network to fetch data from sensor nodes. As several applications only require a limited subset of the available data in the network, the query could be ideally routed to obtain only relevant information, hence minimizing energy consumption. In this work, we apply computational intelligence algorithms to adapt the query process to the characteristics of the network in order to direct queries to relevant nodes, thus, limiting the routing space. This proposal is validated by extensive simulations which show that the routing cost can be reduced by approximately 60% over flooding with an error less than 5%.
{"title":"A parallel and adaptative query routing scheme for wireless sensor networks","authors":"G. Riva, J. Finochietto","doi":"10.1109/ICC.2012.6364177","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364177","url":null,"abstract":"The use of wireless sensor networks for information discovery and monitoring of continuous physical fields has emerged as a novel and efficient solution. To this end, a sink node disseminates a query message through the network to fetch data from sensor nodes. As several applications only require a limited subset of the available data in the network, the query could be ideally routed to obtain only relevant information, hence minimizing energy consumption. In this work, we apply computational intelligence algorithms to adapt the query process to the characteristics of the network in order to direct queries to relevant nodes, thus, limiting the routing space. This proposal is validated by extensive simulations which show that the routing cost can be reduced by approximately 60% over flooding with an error less than 5%.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127885318","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364346
Chia Wei Lim, M. Wakin
The theory of Compressive Sensing (CS) has enabled the efficient acquisition of high-bandwidth (but sparse) signals via nonuniform low-rate sampling protocols. While most work in CS has focused on reconstructing the high-bandwidth signals from nonuniform low-rate samples, in this work, we consider the task of inferring the modulation of a communications signal directly in the compressed domain, without requiring signal reconstruction. We show that the Nth power nonlinear features used for Automatic Modulation Recognition (AMR) are compressible in the Fourier domain, and hence, that AMR of M-ary Phase-Shift-Keying (MPSK) modulated signals is possible by applying the same nonlinear transformation on nonuniform compressive samples. We provide analytical support for the accurate approximation of AMR features from nonuniform samples, present practical rules for classification of modulation type using these samples, and validate our proposed rules on simulated data.
{"title":"Automatic modulation recognition for spectrum sensing using nonuniform compressive samples","authors":"Chia Wei Lim, M. Wakin","doi":"10.1109/ICC.2012.6364346","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364346","url":null,"abstract":"The theory of Compressive Sensing (CS) has enabled the efficient acquisition of high-bandwidth (but sparse) signals via nonuniform low-rate sampling protocols. While most work in CS has focused on reconstructing the high-bandwidth signals from nonuniform low-rate samples, in this work, we consider the task of inferring the modulation of a communications signal directly in the compressed domain, without requiring signal reconstruction. We show that the Nth power nonlinear features used for Automatic Modulation Recognition (AMR) are compressible in the Fourier domain, and hence, that AMR of M-ary Phase-Shift-Keying (MPSK) modulated signals is possible by applying the same nonlinear transformation on nonuniform compressive samples. We provide analytical support for the accurate approximation of AMR features from nonuniform samples, present practical rules for classification of modulation type using these samples, and validate our proposed rules on simulated data.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114750107","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364086
A. Khanafer, Teng Joon Lim, R. Doostnejad, Taiwen Tang
This paper tackles the downlink user scheduling and transmit beamforming problems in MIMO-OFDMA by extending a recent algorithm that maximizes the weighted sum rate (WSR) to all users in MIMO flat fading channels. The proposed method has a complexity that is proportional to the number of OFDMA subcarriers, which makes it practically attractive. Having assigned users to each subcarrier and designed beamformers for each user in each subcarrier, it remains to find the best, in terms of rate maximization, adaptive modulation and coding (AMC) mode to use for each data stream. The latter problem is solved in the second half of the paper through viewing the channel from the base station to the k-th receiver as a multiple access channel (MAC) with Nk “users”, where Nk is the number of antennas at receiver k. The proposed method maps the available AMC modes to the space of allowed theoretical rates, using the signal-to-noise ratio (SNR) gap to capacity concept, and selects the operating point with the largest sum-rate.
{"title":"MIMO-OFDMA rate allocation and beamformer design using a multi-access channel framework","authors":"A. Khanafer, Teng Joon Lim, R. Doostnejad, Taiwen Tang","doi":"10.1109/ICC.2012.6364086","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364086","url":null,"abstract":"This paper tackles the downlink user scheduling and transmit beamforming problems in MIMO-OFDMA by extending a recent algorithm that maximizes the weighted sum rate (WSR) to all users in MIMO flat fading channels. The proposed method has a complexity that is proportional to the number of OFDMA subcarriers, which makes it practically attractive. Having assigned users to each subcarrier and designed beamformers for each user in each subcarrier, it remains to find the best, in terms of rate maximization, adaptive modulation and coding (AMC) mode to use for each data stream. The latter problem is solved in the second half of the paper through viewing the channel from the base station to the k-th receiver as a multiple access channel (MAC) with Nk “users”, where Nk is the number of antennas at receiver k. The proposed method maps the available AMC modes to the space of allowed theoretical rates, using the signal-to-noise ratio (SNR) gap to capacity concept, and selects the operating point with the largest sum-rate.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738319","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 : 2012-11-29DOI: 10.1109/ICC.2012.6363714
Kevin Dorling, G. Messier, S. Magierowski, S. Valentin
Deploying wireless sensor networks (WSNs) from unmanned aerial vehicles (UAVs) can reduce the cost of large rollouts and make it safer to deploy sensors in disaster areas. However, aerial deployment can lead to nodes with arbitrary orientations and, thus, to misaligned antennas. While this problem was observed during experiments, it has not been systematically studied so far. This paper considers an aerially deployed network that utilizes routing designed to minimize latency and improve reliability. A new antenna model is used to demonstrate the performance degradation caused by aerial deployment. By mitigating a large share of this degradation, cooperative relaying substantially reduces the energy consumption of the network.
{"title":"Improving aerially deployed sensor networks using cooperative communications","authors":"Kevin Dorling, G. Messier, S. Magierowski, S. Valentin","doi":"10.1109/ICC.2012.6363714","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363714","url":null,"abstract":"Deploying wireless sensor networks (WSNs) from unmanned aerial vehicles (UAVs) can reduce the cost of large rollouts and make it safer to deploy sensors in disaster areas. However, aerial deployment can lead to nodes with arbitrary orientations and, thus, to misaligned antennas. While this problem was observed during experiments, it has not been systematically studied so far. This paper considers an aerially deployed network that utilizes routing designed to minimize latency and improve reliability. A new antenna model is used to demonstrate the performance degradation caused by aerial deployment. By mitigating a large share of this degradation, cooperative relaying substantially reduces the energy consumption of the network.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133480674","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 : 2012-11-29DOI: 10.1109/ICC.2012.6364637
Rongpeng Li, Zhifeng Zhao, Yan Wei, Xuan Zhou, Honggang Zhang
In cellular networks, the base station power consumption is not simply proportional to the traffic loads of its coverage. As the traffic load fluctuates spatially and temporally, the base stations consequently suffer from heavy energy wastage when the traffic loads of their coverage are low. In this paper, we propose a grid-based energy saving scheme over predicted traffic loads. We firstly take advantage of the spatial-temporal pattern of traffic loads and employ the compressed sensing method to predict the future traffic loads. Then, we propose a grid-based energy saving scheme to improve the energy efficiency through turning some base stations into sleeping mode while ensuring the quality of service. Results of the simulation with real traffic loads1 finally show the accuracy of the traffic load prediction and large energy efficiency improvement.
{"title":"GM-PAB: A grid-based energy saving scheme with predicted traffic load guidance for cellular networks","authors":"Rongpeng Li, Zhifeng Zhao, Yan Wei, Xuan Zhou, Honggang Zhang","doi":"10.1109/ICC.2012.6364637","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364637","url":null,"abstract":"In cellular networks, the base station power consumption is not simply proportional to the traffic loads of its coverage. As the traffic load fluctuates spatially and temporally, the base stations consequently suffer from heavy energy wastage when the traffic loads of their coverage are low. In this paper, we propose a grid-based energy saving scheme over predicted traffic loads. We firstly take advantage of the spatial-temporal pattern of traffic loads and employ the compressed sensing method to predict the future traffic loads. Then, we propose a grid-based energy saving scheme to improve the energy efficiency through turning some base stations into sleeping mode while ensuring the quality of service. Results of the simulation with real traffic loads1 finally show the accuracy of the traffic load prediction and large energy efficiency improvement.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130270311","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 : 2012-11-29DOI: 10.1109/ICC.2012.6363814
Ze Wang, M. Ma
Secure group communication for large wireless sensor networks sparkles the research on efficient key distribution and key management mechanism. By a self-healing key distribution scheme, even if during a certain session, some broadcast messages are lost due to network faults, the users are capable of recovering the lost session keys on their own without requesting additional information exchange with the group manager. However, some self-healing key distribution schemes are unable to prevent collusion attacks effectively. In this paper, a general self-healing session key distribution approach is devised to thwart collusion attacks. Furthermore, an effective collusion resilient key distribution scheme is proposed for the secure group communication in wireless sensor networks.
{"title":"A collusion-resilient self-healing key distribution scheme for wireless sensor networks","authors":"Ze Wang, M. Ma","doi":"10.1109/ICC.2012.6363814","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363814","url":null,"abstract":"Secure group communication for large wireless sensor networks sparkles the research on efficient key distribution and key management mechanism. By a self-healing key distribution scheme, even if during a certain session, some broadcast messages are lost due to network faults, the users are capable of recovering the lost session keys on their own without requesting additional information exchange with the group manager. However, some self-healing key distribution schemes are unable to prevent collusion attacks effectively. In this paper, a general self-healing session key distribution approach is devised to thwart collusion attacks. Furthermore, an effective collusion resilient key distribution scheme is proposed for the secure group communication in wireless sensor networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115750246","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
扫码关注我们
求助内容：
应助结果提醒方式：