Pub Date : 2015-06-08DOI: 10.1109/ICCW.2015.7247173
N. Le, P. Martins, L. Decreusefond, A. Vergne
Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a robust one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation. The simulated annealing algorithm gives a solution that approaches the global optimal one. The robust algorithm gives a local optimal solution. Our simulations show that this local optimal solution also approaches the global optimal one. Our algorithms can save at most 65% of system's maximal consumption power in polynomial time. The probability density function of the optimized radii of cells is also analyzed and discussed.
{"title":"Simplicial homology based energy saving algorithms for wireless networks","authors":"N. Le, P. Martins, L. Decreusefond, A. Vergne","doi":"10.1109/ICCW.2015.7247173","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247173","url":null,"abstract":"Energy saving is one of the most investigated problems in wireless networks. In this paper, we introduce two homology based algorithms: a simulated annealing one and a robust one. These algorithms optimize the energy consumption at network level while maintaining the maximal coverage. By using simplicial homology, the complex geometrical calculation of the coverage is reduced to simple matrix computation. The simulated annealing algorithm gives a solution that approaches the global optimal one. The robust algorithm gives a local optimal solution. Our simulations show that this local optimal solution also approaches the global optimal one. Our algorithms can save at most 65% of system's maximal consumption power in polynomial time. The probability density function of the optimized radii of cells is also analyzed and discussed.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89364998","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247193
Krasimir Tonchev, Strahil Sokolov, Yuliyan Velchev, Georgi R. Balabanov, V. Poulkov
Capturing the type of physical activity a person is performing thorough his daily life, can inspire the development of new and innovative applications. Examples include monitoring patients' health and physical activity performance, reasoning upon the observed activity to recommend better training strategy, new therapeutic programs, etc. In this work we propose an algorithm for Human Activity Recognition based on the application of a geometrically motivated feature selection method. We test the algorithm on a standard data set and validate its performance by comparing it with the existing results of other known algorithms.
{"title":"Recognition of Human daily activities","authors":"Krasimir Tonchev, Strahil Sokolov, Yuliyan Velchev, Georgi R. Balabanov, V. Poulkov","doi":"10.1109/ICCW.2015.7247193","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247193","url":null,"abstract":"Capturing the type of physical activity a person is performing thorough his daily life, can inspire the development of new and innovative applications. Examples include monitoring patients' health and physical activity performance, reasoning upon the observed activity to recommend better training strategy, new therapeutic programs, etc. In this work we propose an algorithm for Human Activity Recognition based on the application of a geometrically motivated feature selection method. We test the algorithm on a standard data set and validate its performance by comparing it with the existing results of other known algorithms.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87353919","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247343
Q. Li, H. Shirani-Mehr, Tommaso Balercia, Huaning Niu, A. Papathanassiou, Geng Wu
In order to exploit millimeter wave (mmWave) bands for 5G communications, challenges mainly due to blockage and strong dependency on beamforming operation need to be overcome. In this work, we address some of the fundamental issues related to the use of mmWave bands for 5G communications, from propagation channel characteristics and modeling to the implications on system and network architecture design. A statistical mmWave channel model considering cluster-level spatial/temporal correlation is proposed. System-level simulation results based on the proposed model demonstrate the channel characteristics and system performance. Following that, key techniques in enabling mmWave system operation are discussed. Although we believe that mmWave bands can be utilized in 5G networks, significant efforts and time are needed in order to complete the air interface, device and network design which is shown to be quite different from the existing cellular design.
{"title":"Millimeter wave channel model and system design considerations","authors":"Q. Li, H. Shirani-Mehr, Tommaso Balercia, Huaning Niu, A. Papathanassiou, Geng Wu","doi":"10.1109/ICCW.2015.7247343","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247343","url":null,"abstract":"In order to exploit millimeter wave (mmWave) bands for 5G communications, challenges mainly due to blockage and strong dependency on beamforming operation need to be overcome. In this work, we address some of the fundamental issues related to the use of mmWave bands for 5G communications, from propagation channel characteristics and modeling to the implications on system and network architecture design. A statistical mmWave channel model considering cluster-level spatial/temporal correlation is proposed. System-level simulation results based on the proposed model demonstrate the channel characteristics and system performance. Following that, key techniques in enabling mmWave system operation are discussed. Although we believe that mmWave bands can be utilized in 5G networks, significant efforts and time are needed in order to complete the air interface, device and network design which is shown to be quite different from the existing cellular design.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88350985","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247580
Kentaroh Toyoda, I. Sasase
The realtime identification of missing items, e.g., valuables or confidential documents in shops and warehouses, is one of the most important system. Although many RFID-based schemes that quickly identify missing tag-attached items are proposed, most of the schemes overlooks the possibility of the internal crime. If a person controls an untrusted reader, he/she can freely forge responses from tags and steal items without being detected. In this paper, we propose a secure and fast missing tags identification against both the internal and external attackers. Our scheme first identifies tags stolen by an external attacker with a channel estimation based scheme. Then, our scheme lets tags send cryptographically generated responses, which are socalled MAC (Message Authentication Code), and verifies them to identify stolen tags by an internal attacker. In order to shorten the time to collect responses, our scheme lets multiple tags transmit responses simultaneously and decodes them by leveraging the estimated channels. By the security analysis and the computer simulation, we show the effectiveness of our scheme.
{"title":"Secure and fast missing RFID tags identification with lightweight MAC and rateless coding","authors":"Kentaroh Toyoda, I. Sasase","doi":"10.1109/ICCW.2015.7247580","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247580","url":null,"abstract":"The realtime identification of missing items, e.g., valuables or confidential documents in shops and warehouses, is one of the most important system. Although many RFID-based schemes that quickly identify missing tag-attached items are proposed, most of the schemes overlooks the possibility of the internal crime. If a person controls an untrusted reader, he/she can freely forge responses from tags and steal items without being detected. In this paper, we propose a secure and fast missing tags identification against both the internal and external attackers. Our scheme first identifies tags stolen by an external attacker with a channel estimation based scheme. Then, our scheme lets tags send cryptographically generated responses, which are socalled MAC (Message Authentication Code), and verifies them to identify stolen tags by an internal attacker. In order to shorten the time to collect responses, our scheme lets multiple tags transmit responses simultaneously and decodes them by leveraging the estimated channels. By the security analysis and the computer simulation, we show the effectiveness of our scheme.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86598702","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247486
Giovanni Interdonato, S. Pfletschinger, F. V. Gallego, J. Alonso-Zarate, G. Araniti
ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of the shared channel. One of the reasons is the occurrence of collisions when more than one packet is transmitted at the same time. These packets cannot be decoded and retransmissions are necessary. However, it has been recently shown that it is possible to apply signal processing techniques with these collided packets so that useful information can be decoded. This was recently proposed in the Irregular Repetition Slotted ALOHA (IRSA), achieving a throughput T ≃ 0.97 for very large MAC frame lengths as long as the number of active users is smaller than the number of slots per frame. In this paper, we extend the operation of IRSA with i) an iterative physical layer decoding processing that exploits the capture effect and ii) a Successive Interference Cancellation (SIC) processing at the slot-level, named intra-slot SIC, to decode more than one colliding packet per slot. We evaluate the performance of the proposed scheme, referred to as Extended IRSA (E-IRSA), in terms of throughput and channel capacity. Computer-based simulation results show that E-IRSA protocol allows to reach the maximum theoretical achievable throughput even in scenarios where the number of active users is higher than the number of slots per frame. Results also show that E-IRSA protocol significantly improves the performance even for small MAC frame lengths used in practical scenarios.
{"title":"Intra-slot Interference Cancellation for collision resolution in Irregular Repetition Slotted ALOHA","authors":"Giovanni Interdonato, S. Pfletschinger, F. V. Gallego, J. Alonso-Zarate, G. Araniti","doi":"10.1109/ICCW.2015.7247486","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247486","url":null,"abstract":"ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of the shared channel. One of the reasons is the occurrence of collisions when more than one packet is transmitted at the same time. These packets cannot be decoded and retransmissions are necessary. However, it has been recently shown that it is possible to apply signal processing techniques with these collided packets so that useful information can be decoded. This was recently proposed in the Irregular Repetition Slotted ALOHA (IRSA), achieving a throughput T ≃ 0.97 for very large MAC frame lengths as long as the number of active users is smaller than the number of slots per frame. In this paper, we extend the operation of IRSA with i) an iterative physical layer decoding processing that exploits the capture effect and ii) a Successive Interference Cancellation (SIC) processing at the slot-level, named intra-slot SIC, to decode more than one colliding packet per slot. We evaluate the performance of the proposed scheme, referred to as Extended IRSA (E-IRSA), in terms of throughput and channel capacity. Computer-based simulation results show that E-IRSA protocol allows to reach the maximum theoretical achievable throughput even in scenarios where the number of active users is higher than the number of slots per frame. Results also show that E-IRSA protocol significantly improves the performance even for small MAC frame lengths used in practical scenarios.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86772480","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247364
M. Ijaz, D. Tsonev, J. McKendry, E. Xie, S. Rajbhandari, H. Chun, G. Faulkner, E. Gu, M. Dawson, D. O’brien, H. Haas
This paper investigates experimentally the performance of optical spatial modulation (OSM) with orthogonal frequency division multiplexing (OFDM) in a multiple-input and multiple-output (MIMO) based visible light communication (VLC) system. Gallium nitride based micro light emitting diodes (μLEDs) are considered as a transmitter unit. A two transmitter and two optical receiver based MIMO setup is used. The performance of OSM-OFDM system is experimentally analysed by varying the semi-angle at half power, θ½ of the μLEDs. The optical cross-talk in the MIMO channel is quantified and its effect on the achievable data rate and bit error rate (BER) performance is analysed. The experimental results show that OSM-OFDM achieves higher data rates than single-input and single-output (SISO)-OFDM for all the ranges of θ½ of the μLEDs under study. However, the BER performance of OSM-OFDM is worse than in the case of SISO-OFDM. The maximum achievable data rate in OSM-OFDM is 1.34 Gb/s and 1.17 Gb/s in SISO-OFDM for θ½ of 2.27° at a link distance of 1 m using adaptive data loading. The experimental results also show that due to the strongly correlated channels, the system performance is highly dependent on the θ½ of the μLEDs.
{"title":"Experimental proof-of-concept of optical spatial modulation OFDM using micro LEDs","authors":"M. Ijaz, D. Tsonev, J. McKendry, E. Xie, S. Rajbhandari, H. Chun, G. Faulkner, E. Gu, M. Dawson, D. O’brien, H. Haas","doi":"10.1109/ICCW.2015.7247364","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247364","url":null,"abstract":"This paper investigates experimentally the performance of optical spatial modulation (OSM) with orthogonal frequency division multiplexing (OFDM) in a multiple-input and multiple-output (MIMO) based visible light communication (VLC) system. Gallium nitride based micro light emitting diodes (μLEDs) are considered as a transmitter unit. A two transmitter and two optical receiver based MIMO setup is used. The performance of OSM-OFDM system is experimentally analysed by varying the semi-angle at half power, θ½ of the μLEDs. The optical cross-talk in the MIMO channel is quantified and its effect on the achievable data rate and bit error rate (BER) performance is analysed. The experimental results show that OSM-OFDM achieves higher data rates than single-input and single-output (SISO)-OFDM for all the ranges of θ½ of the μLEDs under study. However, the BER performance of OSM-OFDM is worse than in the case of SISO-OFDM. The maximum achievable data rate in OSM-OFDM is 1.34 Gb/s and 1.17 Gb/s in SISO-OFDM for θ½ of 2.27° at a link distance of 1 m using adaptive data loading. The experimental results also show that due to the strongly correlated channels, the system performance is highly dependent on the θ½ of the μLEDs.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86990300","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247336
R. Krishnan, M. Khanzadi, N. Krishnan, Yongpeng Wu, A. G. Amat, T. Eriksson, R. Schober
We study the impact of phase noise on the downlink performance of a multi-user multiple-input multiple-output system, where the base station (BS) employs a large number of transmit antennas M. We consider a setup where the BS employs Mosc free-running oscillators, and M/Mosc antennas are connected to each oscillator. For this configuration, we analyze the impact of phase noise on the performance of regularized zero-forcing (RZF) precoding, when M and the number of users K are asymptotically large, while the ratio M/K = β is fixed. We analytically show that the impact of phase noise on the signal-to-interference-plus-noise ratio (SINR) can be quantified as an effective reduction in the quality of the channel state information available at the BS when compared to a system without phase noise. As a consequence, we observe that as Mosc increases, the SINR of the RZF precoder degrades as the interference power increases, and the desired signal power decreases. On the other hand, the variance of the random phase variations caused by the BS oscillators reduces with increasing Mosc. Through simulations, we verify our analytical results, and study the performance of the RZF precoder for different phase noise and channel noise variances.
{"title":"Large-scale analysis of linear massive MIMO Precoders in the Presence of Phase Noise","authors":"R. Krishnan, M. Khanzadi, N. Krishnan, Yongpeng Wu, A. G. Amat, T. Eriksson, R. Schober","doi":"10.1109/ICCW.2015.7247336","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247336","url":null,"abstract":"We study the impact of phase noise on the downlink performance of a multi-user multiple-input multiple-output system, where the base station (BS) employs a large number of transmit antennas M. We consider a setup where the BS employs Mosc free-running oscillators, and M/Mosc antennas are connected to each oscillator. For this configuration, we analyze the impact of phase noise on the performance of regularized zero-forcing (RZF) precoding, when M and the number of users K are asymptotically large, while the ratio M/K = β is fixed. We analytically show that the impact of phase noise on the signal-to-interference-plus-noise ratio (SINR) can be quantified as an effective reduction in the quality of the channel state information available at the BS when compared to a system without phase noise. As a consequence, we observe that as Mosc increases, the SINR of the RZF precoder degrades as the interference power increases, and the desired signal power decreases. On the other hand, the variance of the random phase variations caused by the BS oscillators reduces with increasing Mosc. Through simulations, we verify our analytical results, and study the performance of the RZF precoder for different phase noise and channel noise variances.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86848866","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247583
P. Porambage, An Braeken, Pardeep Kumar, A. Gurtov, M. Ylianttila
The Internet of Things (IoT) drives the world towards an always connected paradigm by interconnecting wide ranges of network devices irrespective of their resource capabilities and local networks. This would inevitably enhance the requirements of constructing dynamic and secure end-to-end (E2E)connections among the heterogenous network devices with imbalanced resource profiles and less or no previous knowledge about each other. The device constraints and the dynamic link creations make it challenging to use pre-shared keys for every secure E2E communication scenario in IoT. We propose a proxy-based key establishment protocol for the IoT, which enables any two unknown high resource constrained devices to initiate secure E2E communication. The high constrained devices should be legitimate and maintain secured connections with the neighbouring less constrained devices in the local networks, in which they are deployed. The less constrained devices are performing as the proxies and collaboratively advocate the expensive cryptographic operations during the session key computation. Finally, we demonstrate the applicability of our solution in constrained IoT devices by providing performance and security analysis.
{"title":"Proxy-based end-to-end key establishment protocol for the Internet of Things","authors":"P. Porambage, An Braeken, Pardeep Kumar, A. Gurtov, M. Ylianttila","doi":"10.1109/ICCW.2015.7247583","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247583","url":null,"abstract":"The Internet of Things (IoT) drives the world towards an always connected paradigm by interconnecting wide ranges of network devices irrespective of their resource capabilities and local networks. This would inevitably enhance the requirements of constructing dynamic and secure end-to-end (E2E)connections among the heterogenous network devices with imbalanced resource profiles and less or no previous knowledge about each other. The device constraints and the dynamic link creations make it challenging to use pre-shared keys for every secure E2E communication scenario in IoT. We propose a proxy-based key establishment protocol for the IoT, which enables any two unknown high resource constrained devices to initiate secure E2E communication. The high constrained devices should be legitimate and maintain secured connections with the neighbouring less constrained devices in the local networks, in which they are deployed. The less constrained devices are performing as the proxies and collaboratively advocate the expensive cryptographic operations during the session key computation. Finally, we demonstrate the applicability of our solution in constrained IoT devices by providing performance and security analysis.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87045272","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247531
A. Sadek, T. Kadous, Kai Tang, Heechoon Lee, M. Fan
Innovations enabling efficient spectrum utilization is a key element to optimize user experience with growing data demand. This paper discusses the approach of extending enhancements in cellular technology like LTE to unlicensed band for higher spectral efficiency and better user experience. A key challenge for such extension is the coexistence with legacy technology such as Wi-Fi. The description herein highlights techniques for effective coexistence. The results include evaluation and lab data that demonstrate how the technology provide benefit to surrounding Wi-Fi deployment and contribute towards enhancing spectral efficiency of the unlicensed band.
{"title":"Extending LTE to unlicensed band - Merit and coexistence","authors":"A. Sadek, T. Kadous, Kai Tang, Heechoon Lee, M. Fan","doi":"10.1109/ICCW.2015.7247531","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247531","url":null,"abstract":"Innovations enabling efficient spectrum utilization is a key element to optimize user experience with growing data demand. This paper discusses the approach of extending enhancements in cellular technology like LTE to unlicensed band for higher spectral efficiency and better user experience. A key challenge for such extension is the coexistence with legacy technology such as Wi-Fi. The description herein highlights techniques for effective coexistence. The results include evaluation and lab data that demonstrate how the technology provide benefit to surrounding Wi-Fi deployment and contribute towards enhancing spectral efficiency of the unlicensed band.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86508753","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247445
Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian
Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.
{"title":"Efficient and secure data forwarding for erasure-code-based cloud storage","authors":"Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian","doi":"10.1109/ICCW.2015.7247445","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247445","url":null,"abstract":"Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77728970","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
扫码关注我们
求助内容：
应助结果提醒方式：