Pub Date : 2016-05-22DOI: 10.1109/ICC.2016.7511412
Abhishek K. Gupta, M. Kulkarni, E. Visotsky, F. Vook, Amitava Ghosh, J. Andrews, R. Heath
In conventional applications of time division duplex (TDD) in cellular systems, the time resource split between uplink (UL) and downlink (DL) is fixed across all base stations (BSs) in the network. This leads to under utilization of BS resources when there is a mismatch between the expected and experienced UL/DL traffic in a given cell. A dynamic split that varies in each cell is desirable, but is challenging due to the high interference experienced by UL receivers in one cell from DL transmissions in adjacent cells. This paper analyzes the performance of UL users in dynamic TDD enabled next generation cellular networks using a stochastic geometry framework. The analysis highlights the trade-off between spectral efficiency and resource utilization for dynamic TDD. With appropriate interference mitigation, dynamic TDD offers a significant gain in data rates as compared to static TDD, which is higher when the BSs are lightly loaded and/or the fraction of UL users is low.
{"title":"Rate analysis and feasibility of dynamic TDD in 5G cellular systems","authors":"Abhishek K. Gupta, M. Kulkarni, E. Visotsky, F. Vook, Amitava Ghosh, J. Andrews, R. Heath","doi":"10.1109/ICC.2016.7511412","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511412","url":null,"abstract":"In conventional applications of time division duplex (TDD) in cellular systems, the time resource split between uplink (UL) and downlink (DL) is fixed across all base stations (BSs) in the network. This leads to under utilization of BS resources when there is a mismatch between the expected and experienced UL/DL traffic in a given cell. A dynamic split that varies in each cell is desirable, but is challenging due to the high interference experienced by UL receivers in one cell from DL transmissions in adjacent cells. This paper analyzes the performance of UL users in dynamic TDD enabled next generation cellular networks using a stochastic geometry framework. The analysis highlights the trade-off between spectral efficiency and resource utilization for dynamic TDD. With appropriate interference mitigation, dynamic TDD offers a significant gain in data rates as compared to static TDD, which is higher when the BSs are lightly loaded and/or the fraction of UL users is low.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747272","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511423
G. Shang, Peng Zhe, Xia Bin, Song Yubo
Energy efficient prefetching systems for smart-phones can greatly reduce energy consumption and data transmission, and maintain the timely response when information is prefetched. However, the proxy structure of the system can cause security problem to reveal private information to the third party. The end-to-end encryption (SSL) in traditional prefetching systems cannot solve the security problem in this new, complex energy efficient prefetching system. In this paper, we propose Secure and Energy Efficient Prefetching (SEEP) to meet the security requirement of HTTPS connections and to save smartphone's energy consumption and data transmission. The new design of SEEP includes two parts: the local proxy on the smartphone to verify the validity of prefetched responses, and the remote proxy (e.g. on the cloudlet) to store encrypted prefetched responses. SEEP is transparent to both smartphones and web servers, which does not need to change today's Browser/Server framework. Security analysis shows that SEEP protects the confidentiality of requests and responses, and is able to resist replay attack from malicious proxy. Experimental results show that the proposed system consumes 25% less energy and 95% less data when prefetching 10 outbound webpages than the traditional prefetching system in Wi-Fi networks.
高效节能的智能手机预取系统可以大大减少能耗和数据传输，并保持信息预取时的及时响应。但是，系统的代理结构会导致私有信息泄露给第三方的安全问题。传统预取系统中的端到端加密(SSL)无法解决这种新型复杂节能预取系统的安全问题。为了满足HTTPS连接的安全要求，节省智能手机的能耗和数据传输，本文提出了Secure and Energy Efficient prefetch (SEEP)。新的SEEP设计包括两部分:智能手机上的本地代理验证预取响应的有效性，远程代理(例如在cloudlet上)存储加密的预取响应。SEEP对智能手机和web服务器都是透明的，它不需要改变今天的浏览器/服务器框架。安全性分析表明，SEEP保护了请求和响应的机密性，能够抵御恶意代理的重放攻击。实验结果表明，在Wi-Fi网络中，与传统的预取系统相比，该系统在预取10个出站网页时，能耗降低25%，数据量减少95%。
{"title":"Secure and energy efficient prefetching design for smartphones","authors":"G. Shang, Peng Zhe, Xia Bin, Song Yubo","doi":"10.1109/ICC.2016.7511423","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511423","url":null,"abstract":"Energy efficient prefetching systems for smart-phones can greatly reduce energy consumption and data transmission, and maintain the timely response when information is prefetched. However, the proxy structure of the system can cause security problem to reveal private information to the third party. The end-to-end encryption (SSL) in traditional prefetching systems cannot solve the security problem in this new, complex energy efficient prefetching system. In this paper, we propose Secure and Energy Efficient Prefetching (SEEP) to meet the security requirement of HTTPS connections and to save smartphone's energy consumption and data transmission. The new design of SEEP includes two parts: the local proxy on the smartphone to verify the validity of prefetched responses, and the remote proxy (e.g. on the cloudlet) to store encrypted prefetched responses. SEEP is transparent to both smartphones and web servers, which does not need to change today's Browser/Server framework. Security analysis shows that SEEP protects the confidentiality of requests and responses, and is able to resist replay attack from malicious proxy. Experimental results show that the proposed system consumes 25% less energy and 95% less data when prefetching 10 outbound webpages than the traditional prefetching system in Wi-Fi networks.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115805336","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511484
Pallavi Meharia, D. Agrawal
Recent research in the performance of public key algorithms, such as Elliptic Curve Cryptography (ECC), have illustrated upon their practical applicability in sensor networks. With this research, we are proposing an optimization to one of the most critical operations in Public Key Cryptography (PKC)-authentication of the public key. Here, we provide a framework that proposes a resource-efficient, lightweight and scalable key management scheme for the network under consideration. The proposed scheme uses a one-way hash function to construct a hash tree (Merkle Tree) as an alternative to traditional public key authentication techniques. Security and privacy are two foundational pillars in the design of electronic health systems, with users demanding high confidentiality of their personal data. Without the right infrastructure it is difficult to secure the ecosystem of wearable devices. We envision that by harnessing the performance capabilities of traditional symmetric-key algorithms coupled with the inherent benefits of the PKC architecture, the proposed scheme will provide a more robust and efficient security solution for e-Health driven applications.
{"title":"A hybrid key management scheme for healthcare sensor networks","authors":"Pallavi Meharia, D. Agrawal","doi":"10.1109/ICC.2016.7511484","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511484","url":null,"abstract":"Recent research in the performance of public key algorithms, such as Elliptic Curve Cryptography (ECC), have illustrated upon their practical applicability in sensor networks. With this research, we are proposing an optimization to one of the most critical operations in Public Key Cryptography (PKC)-authentication of the public key. Here, we provide a framework that proposes a resource-efficient, lightweight and scalable key management scheme for the network under consideration. The proposed scheme uses a one-way hash function to construct a hash tree (Merkle Tree) as an alternative to traditional public key authentication techniques. Security and privacy are two foundational pillars in the design of electronic health systems, with users demanding high confidentiality of their personal data. Without the right infrastructure it is difficult to secure the ecosystem of wearable devices. We envision that by harnessing the performance capabilities of traditional symmetric-key algorithms coupled with the inherent benefits of the PKC architecture, the proposed scheme will provide a more robust and efficient security solution for e-Health driven applications.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115836149","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511128
A. Hisham, Wanlu Sun, E. Ström, F. Brannstrom
This paper investigates the power control problem for broadcast vehicular communications in the presence of adjacent carrier interference (ACI). First, we study the impact of ACI on vehicle-to-vehicle (V2V) communications and conclude that the ACI indeed significantly affects the reliability of V2V links. Second, we formulate a power control optimization problem for vehicles to reduce the negative influence of ACI, which is shown to be NP-hard. Furthermore, we propose two power control schemes where the first one solves the formulated problem by a branch and bound method and the second one considers a heuristic algorithm with much reduced complexity. Finally, simulations are presented which illustrate the necessity of power control when ACI exists and also show promising performance of the proposed algorithms.
{"title":"Power control for broadcast V2V communications with adjacent carrier interference effects","authors":"A. Hisham, Wanlu Sun, E. Ström, F. Brannstrom","doi":"10.1109/ICC.2016.7511128","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511128","url":null,"abstract":"This paper investigates the power control problem for broadcast vehicular communications in the presence of adjacent carrier interference (ACI). First, we study the impact of ACI on vehicle-to-vehicle (V2V) communications and conclude that the ACI indeed significantly affects the reliability of V2V links. Second, we formulate a power control optimization problem for vehicles to reduce the negative influence of ACI, which is shown to be NP-hard. Furthermore, we propose two power control schemes where the first one solves the formulated problem by a branch and bound method and the second one considers a heuristic algorithm with much reduced complexity. Finally, simulations are presented which illustrate the necessity of power control when ACI exists and also show promising performance of the proposed algorithms.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132053323","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511059
Hadi Sarieddeen, Mohammad M. Mansour
In this paper, optimum soft-output (SO) multiple-input multiple-output (MIMO) sphere detectors (SDs) are studied. Noting that ordering the channel matrix columns plays an important role in reducing the tree-search complexity of a SD, we propose an optimized layer-ordering scheme based on the minimum cumulative residual criterion. The proposed scheme is studied in the context of a 4 × 4 MIMO system, and a low-complexity dataflow architecture is proposed. The implementation employs a permutation-robust QR decomposition (PR-QRD) scheme, based on the modified Gram-Schmidt orthogonalization procedure. Simulations demonstrate that using the proposed scheme, the node count of a SO MIMO SD is reduced by one order of magnitude, while the QRD overhead is reduced by more than 25% in computations and 36% in time, without incurring any performance degradation.
研究了最优软输出多输入多输出(MIMO)球形探测器。考虑到信道矩阵列的排序对降低SD的树搜索复杂度起着重要作用，提出了一种基于最小累积残差准则的优化分层排序方案。在4 × 4 MIMO系统中对该方案进行了研究，提出了一种低复杂度的数据流架构。该算法采用基于改进的Gram-Schmidt正交化过程的置换鲁棒QR分解(PR-QRD)方案。仿真结果表明，采用该方案，SO MIMO SD的节点数减少了一个数量级，而QRD开销在计算上减少了25%以上，在时间上减少了36%，而性能没有任何下降。
{"title":"Enhanced low-complexity layer-ordering for MIMO sphere detectors","authors":"Hadi Sarieddeen, Mohammad M. Mansour","doi":"10.1109/ICC.2016.7511059","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511059","url":null,"abstract":"In this paper, optimum soft-output (SO) multiple-input multiple-output (MIMO) sphere detectors (SDs) are studied. Noting that ordering the channel matrix columns plays an important role in reducing the tree-search complexity of a SD, we propose an optimized layer-ordering scheme based on the minimum cumulative residual criterion. The proposed scheme is studied in the context of a 4 × 4 MIMO system, and a low-complexity dataflow architecture is proposed. The implementation employs a permutation-robust QR decomposition (PR-QRD) scheme, based on the modified Gram-Schmidt orthogonalization procedure. Simulations demonstrate that using the proposed scheme, the node count of a SO MIMO SD is reduced by one order of magnitude, while the QRD overhead is reduced by more than 25% in computations and 36% in time, without incurring any performance degradation.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"23 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132118512","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511034
A. Muqaddas, A. Bianco, P. Giaccone, G. Maier
In distributed SDN architectures, the network is controlled by a cluster of multiple controllers. This distributed approach permits to meet the scalability and reliability requirements of large operational networks. Despite that, a logical centralized view of the network state should be guaranteed, enabling the simple development of network applications. Achieving a consistent network state requires a consensus protocol, which generates control traffic among the controllers whose timely delivery is crucial for network performance. We focus on the state-of-art ONOS controller, designed to scale to large networks, based on a cluster of self-coordinating controllers, and concentrate on the inter-controller control traffic. Based on real traffic measurements, we develop a model to quantify the traffic exchanged among the controllers, which depends on the topology of the controlled network. This model is useful to design and dimension the control network interconnecting the controllers.
{"title":"Inter-controller traffic in ONOS clusters for SDN networks","authors":"A. Muqaddas, A. Bianco, P. Giaccone, G. Maier","doi":"10.1109/ICC.2016.7511034","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511034","url":null,"abstract":"In distributed SDN architectures, the network is controlled by a cluster of multiple controllers. This distributed approach permits to meet the scalability and reliability requirements of large operational networks. Despite that, a logical centralized view of the network state should be guaranteed, enabling the simple development of network applications. Achieving a consistent network state requires a consensus protocol, which generates control traffic among the controllers whose timely delivery is crucial for network performance. We focus on the state-of-art ONOS controller, designed to scale to large networks, based on a cluster of self-coordinating controllers, and concentrate on the inter-controller control traffic. Based on real traffic measurements, we develop a model to quantify the traffic exchanged among the controllers, which depends on the topology of the controlled network. This model is useful to design and dimension the control network interconnecting the controllers.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132382641","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510825
Md. Zoheb Hassan, Victor C. M. Leung, Md. Jahangir Hossain, Julian Cheng
In order to improve the energy efficiency of the optical wireless communications, a joint power allocation and relay selection scheme is proposed for a relay assisted non-line-of-sight optical wireless communication system employing coherent detection with a dual optical channel multiplexing technique. The proposed joint power allocation and relay selection scheme aims to improve energy efficiency of the optical wireless communication system by minimizing the total average transmit power, and provides the delay aware quality-of-service guarantee through maintaining a minimum required effective capacity over the atmospheric turbulence fading channels. The joint power allocation and relay selection problem is formulated as a non-convex and combinatorial optimization problem, and the solution of this optimization problem is obtained using a time-sharing relaxation technique. Subsequently, a fast-convergent algorithm is proposed for the joint power allocation and relay selection by considering the delay aware quality-of-service requirements of the services transmitted over the optical wireless communication channels. Numerical results demonstrate the advantages of the proposed joint power allocation and relay selection scheme in terms of the energy saving for different statistical delay constraints.
{"title":"QoS-aware joint power allocations and relay selection for NLOS coherent optical wireless communications","authors":"Md. Zoheb Hassan, Victor C. M. Leung, Md. Jahangir Hossain, Julian Cheng","doi":"10.1109/ICC.2016.7510825","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510825","url":null,"abstract":"In order to improve the energy efficiency of the optical wireless communications, a joint power allocation and relay selection scheme is proposed for a relay assisted non-line-of-sight optical wireless communication system employing coherent detection with a dual optical channel multiplexing technique. The proposed joint power allocation and relay selection scheme aims to improve energy efficiency of the optical wireless communication system by minimizing the total average transmit power, and provides the delay aware quality-of-service guarantee through maintaining a minimum required effective capacity over the atmospheric turbulence fading channels. The joint power allocation and relay selection problem is formulated as a non-convex and combinatorial optimization problem, and the solution of this optimization problem is obtained using a time-sharing relaxation technique. Subsequently, a fast-convergent algorithm is proposed for the joint power allocation and relay selection by considering the delay aware quality-of-service requirements of the services transmitted over the optical wireless communication channels. Numerical results demonstrate the advantages of the proposed joint power allocation and relay selection scheme in terms of the energy saving for different statistical delay constraints.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132417112","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510846
Umut Ugurlu, R. Wichman
We describe a new approach to improve the success rate of symbol decoding with very high-order modulations at receivers equipped with low-resolution analog-to-digital converters (ADC). The proposed method is based on generating self-inflicting pseudo-random white noise signal at the receiving antenna array in order to improve the performance of spatial oversampling. As the optimal amount of this artificially induced noise strongly depends on the ADC resolution, transmit symbol modulation, and the number of receive antennas, we design an adaptation mechanism to render an acceptable balance for successful decoding between the inner- and outer-region symbols of the constellation. Numerical findings demonstrate, for the first time, that the feasibility of high-order symbol modulations (e.g., 64/256-QAM) is within reach by low-resolution ADCs.
{"title":"Enabling low-resolution ADC with high-order modulations for millimeter-wave systems","authors":"Umut Ugurlu, R. Wichman","doi":"10.1109/ICC.2016.7510846","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510846","url":null,"abstract":"We describe a new approach to improve the success rate of symbol decoding with very high-order modulations at receivers equipped with low-resolution analog-to-digital converters (ADC). The proposed method is based on generating self-inflicting pseudo-random white noise signal at the receiving antenna array in order to improve the performance of spatial oversampling. As the optimal amount of this artificially induced noise strongly depends on the ADC resolution, transmit symbol modulation, and the number of receive antennas, we design an adaptation mechanism to render an acceptable balance for successful decoding between the inner- and outer-region symbols of the constellation. Numerical findings demonstrate, for the first time, that the feasibility of high-order symbol modulations (e.g., 64/256-QAM) is within reach by low-resolution ADCs.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130038665","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511323
Hao Ren, Hongwei Li, Hao Chen, Michael Y. Kpiebaareh, Lian Zhao
With the growing popularity of outsourcing data and services to the cloud, performing queries on encrypted data becomes a promising technique. Searchable encryption (SE) allows encryption while still enabling search for a variety of data. However, most of the existing arts focus on rectangular range query on common database. Query on encrypted spatial database has not been well studied. Moreover, as a vital type of geometric query on spatial data, the circular range search (CRS) is widely utilized in Location-Based Services (LBSs) and computational geometry. A recently proposed CRS scheme achieved security and privacy requirements. However, it exhibits low performance in terms of encryption and search efficiency. In this paper, we propose an Efficient Privacy-preserving CRS scheme (EP-CRS) on outsourced spatial data. Specifically, our scheme achieves CRS by leveraging an R-tree based SE scheme and adding a trusted-third party (TTP) to system. Security analysis indicates that EP-CRS can preserve data and query privacy. In addition, we conduct real experiments and compare EP-CRS with the existing one to show that the proposal is more efficient in terms of data encryption, token generation and search.
{"title":"Efficient privacy-preserving circular range search on outsourced spatial data","authors":"Hao Ren, Hongwei Li, Hao Chen, Michael Y. Kpiebaareh, Lian Zhao","doi":"10.1109/ICC.2016.7511323","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511323","url":null,"abstract":"With the growing popularity of outsourcing data and services to the cloud, performing queries on encrypted data becomes a promising technique. Searchable encryption (SE) allows encryption while still enabling search for a variety of data. However, most of the existing arts focus on rectangular range query on common database. Query on encrypted spatial database has not been well studied. Moreover, as a vital type of geometric query on spatial data, the circular range search (CRS) is widely utilized in Location-Based Services (LBSs) and computational geometry. A recently proposed CRS scheme achieved security and privacy requirements. However, it exhibits low performance in terms of encryption and search efficiency. In this paper, we propose an Efficient Privacy-preserving CRS scheme (EP-CRS) on outsourced spatial data. Specifically, our scheme achieves CRS by leveraging an R-tree based SE scheme and adding a trusted-third party (TTP) to system. Security analysis indicates that EP-CRS can preserve data and query privacy. In addition, we conduct real experiments and compare EP-CRS with the existing one to show that the proposal is more efficient in terms of data encryption, token generation and search.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162912","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511004
N. Hassan, C. Yuen, M. Atique
In this paper, we consider a small cognitive wireless network operator (SCWNO) that provides machine-to-machine (M2M) communications by utilizing TV white spaces (TVWS) and lease high priority channels (HPC) at a cost to achieve better quality-of-service (QoS). We study the economic viability of SCWNO by considering the cost of leasing HPC, delay in data transmission, and quality of data. When the free TVWS is congested, SCWNO may choose to purchase HPC, or delay the transmission, or reduce the data unit size by sacrificing the data quality. We develop offline and online algorithms for two optimization problems: SCWNO cost minimization subject to target delay and data quality constraints; and delay minimization subject to given total budget and data quality constraints. Simulation results show that considering data quality as an additional QoS dimension can aid SCWNO in meeting its QoS objectives while also maintaining its economic viability.
{"title":"Tradeoff in delay, cost, and quality in data transmission over TV white spaces","authors":"N. Hassan, C. Yuen, M. Atique","doi":"10.1109/ICC.2016.7511004","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511004","url":null,"abstract":"In this paper, we consider a small cognitive wireless network operator (SCWNO) that provides machine-to-machine (M2M) communications by utilizing TV white spaces (TVWS) and lease high priority channels (HPC) at a cost to achieve better quality-of-service (QoS). We study the economic viability of SCWNO by considering the cost of leasing HPC, delay in data transmission, and quality of data. When the free TVWS is congested, SCWNO may choose to purchase HPC, or delay the transmission, or reduce the data unit size by sacrificing the data quality. We develop offline and online algorithms for two optimization problems: SCWNO cost minimization subject to target delay and data quality constraints; and delay minimization subject to given total budget and data quality constraints. Simulation results show that considering data quality as an additional QoS dimension can aid SCWNO in meeting its QoS objectives while also maintaining its economic viability.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134029987","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
扫码关注我们
求助内容：
应助结果提醒方式：