Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440570
Zhiyi Zhou, Fei Teng, Jialing Liu, W. Xiao
As the traffic load in cellular networks grows exponentially, the capacity crunch is becoming more and more severe, partially due to the fact that the licensed spectrum is rather limited and dwarfed by the ever-increasing traffic demand. To alleviate this issue, the unlicensed spectrum has attracted significant attention as a piece of valuable resource for offloading and for best effort traffic. Therefore, operating cellular technologies with high spectral efficiency, mainly the Long Term Evolution (LTE), in the unlicensed band, is deemed promising. However, the coexistence of different wireless technologies such as LTE and WiFi deployed in the same frequency band is a challenging problem. In this paper, we study the coexistence between LTE and WiFi. Three schemes for coexistence are proposed, evaluated, and compared, based on which the impacts of the coexistence on WiFi performance and LTE performance are analyzed. This study can be useful for the standardization and deployment of LTE on the unlicensed band.
{"title":"Performance evaluation for coexistence of LTE and WiFi","authors":"Zhiyi Zhou, Fei Teng, Jialing Liu, W. Xiao","doi":"10.1109/ICCNC.2016.7440570","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440570","url":null,"abstract":"As the traffic load in cellular networks grows exponentially, the capacity crunch is becoming more and more severe, partially due to the fact that the licensed spectrum is rather limited and dwarfed by the ever-increasing traffic demand. To alleviate this issue, the unlicensed spectrum has attracted significant attention as a piece of valuable resource for offloading and for best effort traffic. Therefore, operating cellular technologies with high spectral efficiency, mainly the Long Term Evolution (LTE), in the unlicensed band, is deemed promising. However, the coexistence of different wireless technologies such as LTE and WiFi deployed in the same frequency band is a challenging problem. In this paper, we study the coexistence between LTE and WiFi. Three schemes for coexistence are proposed, evaluated, and compared, based on which the impacts of the coexistence on WiFi performance and LTE performance are analyzed. This study can be useful for the standardization and deployment of LTE on the unlicensed band.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116718464","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-03-24DOI: 10.1109/ICCNC.2016.7440572
S. Basloom, Amani Nazar, G. Aldabbagh, M. Abdullah, N. Dimitriou
"Anywhere" and "anytime" are the ultimate properties of wireless communications. To achieve these goals, frequency reuse is one of the most important concepts that has to be considered in high user density networks providing various broadband services. This paper proposes an efficient resource allocation algorithm called Group Based Graph Coloring (GBGC) that exploits unused spectrum areas (TV White Space-TVWS) to improve broadband services in densely populated areas. To achieve this, GBGC groups the users into blocks with each having a leader (Group Head) that connects its cluster members to the base station. The Group Head employs a graph-coloring algorithm to tether other users to the base station, through the available unlicensed TVWS band. The simulation results indicate that the proposed algorithm achieves a good performance/complexity tradeoff that provides a promising alternative to the case of having only direct communication between the cellular users and the base station.
{"title":"Resource allocation using graph coloring for dense cellular networks","authors":"S. Basloom, Amani Nazar, G. Aldabbagh, M. Abdullah, N. Dimitriou","doi":"10.1109/ICCNC.2016.7440572","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440572","url":null,"abstract":"\"Anywhere\" and \"anytime\" are the ultimate properties of wireless communications. To achieve these goals, frequency reuse is one of the most important concepts that has to be considered in high user density networks providing various broadband services. This paper proposes an efficient resource allocation algorithm called Group Based Graph Coloring (GBGC) that exploits unused spectrum areas (TV White Space-TVWS) to improve broadband services in densely populated areas. To achieve this, GBGC groups the users into blocks with each having a leader (Group Head) that connects its cluster members to the base station. The Group Head employs a graph-coloring algorithm to tether other users to the base station, through the available unlicensed TVWS band. The simulation results indicate that the proposed algorithm achieves a good performance/complexity tradeoff that provides a promising alternative to the case of having only direct communication between the cellular users and the base station.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116721608","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-03-24DOI: 10.1109/ICCNC.2016.7440593
M. Nader, John Q. Liu
This paper presents the hardware design procedures of the modulator and demodulator for the in-vehicle system (IVS) of the 3GPP eCall system. The modules are designed, synthesized and simulated in Xilinx ISE tool as a step of developing all modules of the IVS on a single chip. The designed modules are implemented on a Field Programmable Gate Array (FPGA) and the design is optimized to reduce the processing time for the IVS modem on a single chip. The simulated and generated waveforms and results are shown and analyzed for a complete set of input signals to the modules. Multiple clock frequencies are used to test and verify the modules. The verified range of clock frequencies does not only give flexibility of the inter interface between the modules of the IVS modem but also optimizes the processing time of the modules.
{"title":"Developing modulator and demodulator for the EU eCall in-vehicle system in FPGAs","authors":"M. Nader, John Q. Liu","doi":"10.1109/ICCNC.2016.7440593","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440593","url":null,"abstract":"This paper presents the hardware design procedures of the modulator and demodulator for the in-vehicle system (IVS) of the 3GPP eCall system. The modules are designed, synthesized and simulated in Xilinx ISE tool as a step of developing all modules of the IVS on a single chip. The designed modules are implemented on a Field Programmable Gate Array (FPGA) and the design is optimized to reduce the processing time for the IVS modem on a single chip. The simulated and generated waveforms and results are shown and analyzed for a complete set of input signals to the modules. Multiple clock frequencies are used to test and verify the modules. The verified range of clock frequencies does not only give flexibility of the inter interface between the modules of the IVS modem but also optimizes the processing time of the modules.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948191","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-03-24DOI: 10.1109/ICCNC.2016.7440686
E. Gelenbe, O. Abdelrahman, Gökçe Görbil
Mobile Networks are subject to "signaling storms" launched by malware or apps, which overload the the bandwidth at the cell, the backbone signaling servers, and Cloud servers, and may also deplete the battery power of mobile devices. This paper reviews the subject and discusses a novel technique to detect and mitigate such signaling storms. Through a mathematical analysis we introduce a technique based on tracking time-out transitions in the signaling system that can substantially reduce both the number of misbehaving mobiles and the signaling overload in the backbone.
{"title":"Detection and mitigation of signaling storms in mobile networks","authors":"E. Gelenbe, O. Abdelrahman, Gökçe Görbil","doi":"10.1109/ICCNC.2016.7440686","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440686","url":null,"abstract":"Mobile Networks are subject to \"signaling storms\" launched by malware or apps, which overload the the bandwidth at the cell, the backbone signaling servers, and Cloud servers, and may also deplete the battery power of mobile devices. This paper reviews the subject and discusses a novel technique to detect and mitigate such signaling storms. Through a mathematical analysis we introduce a technique based on tracking time-out transitions in the signaling system that can substantially reduce both the number of misbehaving mobiles and the signaling overload in the backbone.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132575326","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-03-24DOI: 10.1109/ICCNC.2016.7440546
M. Roccetti, P. Salomoni, M. Loiseau, Monica Masperi, V. Zampa, A. Ceccherelli, C. Cervini, A. Valva
The use of game-based apps in e-learning has become a relevant trend with the diffusion of smart mobile devices. This is particularly true in language learning, where new captivating word games become a mean to enlarge vocabulary and improve the lexical accuracy of the user. This work presents MagicWord, a game based on widely known game mechanisms, but specifically designed and developed in order to support beginners learning Italian through an A1 level e-learning course. The paper presents the design and implementation of a demo version of MagicWord, through the main challenges encountered during its creation.
{"title":"On the design of a word game to enhance Italian language learning","authors":"M. Roccetti, P. Salomoni, M. Loiseau, Monica Masperi, V. Zampa, A. Ceccherelli, C. Cervini, A. Valva","doi":"10.1109/ICCNC.2016.7440546","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440546","url":null,"abstract":"The use of game-based apps in e-learning has become a relevant trend with the diffusion of smart mobile devices. This is particularly true in language learning, where new captivating word games become a mean to enlarge vocabulary and improve the lexical accuracy of the user. This work presents MagicWord, a game based on widely known game mechanisms, but specifically designed and developed in order to support beginners learning Italian through an A1 level e-learning course. The paper presents the design and implementation of a demo version of MagicWord, through the main challenges encountered during its creation.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133356426","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-03-24DOI: 10.1109/ICCNC.2016.7440675
Tongxing Zheng, Huiming Wang, Rui Huang, Pengcheng Mu
This paper investigates the parameter design and optimization on the artificial-noise-aided multi-antenna transmission in the presence of randomly located eavesdroppers. Our objective is to maximize the secrecy throughput subject to a secrecy outage constraint. We propose an on-off strategy in which the transmitter decides when to start transmissions according to the instantaneous channel state information of the main channel. System parameters, including the wiretap code rates, the transmission threshold of the on-off strategy, and the power allocation between information signals and artificial noises, are optimized based on the statistic channel state information of both the legitimate channel and the wiretap channels. The whole optimization procedure is performed off-line. We formulate the optimization problem and provide explicit solutions on the optimal parameters. Numerical results are demonstrated to verify our theoretical analysis and show the effectiveness of our design.
{"title":"Secrecy-throughput-optimal artificial noise design against randomly located eavesdroppers","authors":"Tongxing Zheng, Huiming Wang, Rui Huang, Pengcheng Mu","doi":"10.1109/ICCNC.2016.7440675","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440675","url":null,"abstract":"This paper investigates the parameter design and optimization on the artificial-noise-aided multi-antenna transmission in the presence of randomly located eavesdroppers. Our objective is to maximize the secrecy throughput subject to a secrecy outage constraint. We propose an on-off strategy in which the transmitter decides when to start transmissions according to the instantaneous channel state information of the main channel. System parameters, including the wiretap code rates, the transmission threshold of the on-off strategy, and the power allocation between information signals and artificial noises, are optimized based on the statistic channel state information of both the legitimate channel and the wiretap channels. The whole optimization procedure is performed off-line. We formulate the optimization problem and provide explicit solutions on the optimal parameters. Numerical results are demonstrated to verify our theoretical analysis and show the effectiveness of our design.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128506385","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-03-24DOI: 10.1109/ICCNC.2016.7440655
Dong Li, Lin Zhang, Zhiqiang Liu, Zhiqiang Wu, Zhiping Zhang
Signal detection and RF parameter estimation have received strong interest in recent years due to the need of spectrum sensing in rapidly growing cognitive radio network research. In most of existing work, the target signal is often assumed to be a single primary user signal without overlap in spectrum with other signals. However, in a spectrally congested environment such as cognitive radio network, or in a spectrally contested environment such as a battlefield, multiple signals are often mixed together with significant overlap in spectrum. In our previous work, we have demonstrated the feasibility of using second order spectrum correlation function (SCF) cyclostationary feature to perform mixed signal detection. In this paper, we extend our work to employ a robust algorithm to detect mixed signals and estimate their carrier frequencies via spectral coherence function (SOF) features. We also evaluate the detection and estimation performances of the proposed algorithm in various channel conditions and signal mixture scenarios. Simulation results confirm the effectiveness of the proposed scheme.
{"title":"Mixed signal detection and carrier frequency estimation based on spectral coherent features","authors":"Dong Li, Lin Zhang, Zhiqiang Liu, Zhiqiang Wu, Zhiping Zhang","doi":"10.1109/ICCNC.2016.7440655","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440655","url":null,"abstract":"Signal detection and RF parameter estimation have received strong interest in recent years due to the need of spectrum sensing in rapidly growing cognitive radio network research. In most of existing work, the target signal is often assumed to be a single primary user signal without overlap in spectrum with other signals. However, in a spectrally congested environment such as cognitive radio network, or in a spectrally contested environment such as a battlefield, multiple signals are often mixed together with significant overlap in spectrum. In our previous work, we have demonstrated the feasibility of using second order spectrum correlation function (SCF) cyclostationary feature to perform mixed signal detection. In this paper, we extend our work to employ a robust algorithm to detect mixed signals and estimate their carrier frequencies via spectral coherence function (SOF) features. We also evaluate the detection and estimation performances of the proposed algorithm in various channel conditions and signal mixture scenarios. Simulation results confirm the effectiveness of the proposed scheme.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114801299","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-03-24DOI: 10.1109/ICCNC.2016.7440577
Tomoya Usami, T. Nishimura, T. Ohgane, Y. Ogawa
A massive multiple-input multiple-output (MIMO) system using a couple of hundred antenna elements has been arising as an important technology to keep the communication range in higher frequency bands. A further enhancement to increase the number of both transmit and receive antennas will be the next step. It requires the complexity proportional to at least the third power of the number of antenna elements to detect spatially-multiplexed signals in general. However, the belief propagation (BP)-based detector is implementable with lower complexity, i.e., the order of square of the number of elements, and achieves very good BER performance in a QPSK modulated massive MIMO system. In this paper, we apply the BP algorithm to a 16-QAM modulated massive MIMO system and propose a sequential reliability update to exploit a difference in error tolerance. The BER evaluation results have shown that the BP works well for a 16-QAM signal detection and that the sequential update is effective to the M-QAM modulated systems.
{"title":"BP-based detection of spatially multiplexed 16-QAM signals in a fully massive MIMO system","authors":"Tomoya Usami, T. Nishimura, T. Ohgane, Y. Ogawa","doi":"10.1109/ICCNC.2016.7440577","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440577","url":null,"abstract":"A massive multiple-input multiple-output (MIMO) system using a couple of hundred antenna elements has been arising as an important technology to keep the communication range in higher frequency bands. A further enhancement to increase the number of both transmit and receive antennas will be the next step. It requires the complexity proportional to at least the third power of the number of antenna elements to detect spatially-multiplexed signals in general. However, the belief propagation (BP)-based detector is implementable with lower complexity, i.e., the order of square of the number of elements, and achieves very good BER performance in a QPSK modulated massive MIMO system. In this paper, we apply the BP algorithm to a 16-QAM modulated massive MIMO system and propose a sequential reliability update to exploit a difference in error tolerance. The BER evaluation results have shown that the BP works well for a 16-QAM signal detection and that the sequential update is effective to the M-QAM modulated systems.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121778405","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-03-24DOI: 10.1109/ICCNC.2016.7440619
Toshiki Takeda, Takuya Yoshihiro
Although Wireless Mesh Networks using CSMA MAC protocol (CSMA-driven WMNs) have been extensively studied, severe collisions mainly due to hidden terminals prevent us from realizing practical networks. In this paper, we propose a new distributed scheduling scheme for CSMA-driven WMNs that significantly reduce collision caused by hidden terminals. In our scheduling, we propagate queue-length information within two-hop neighborhood via data and Ack frames, and avoid collision by allowing transmission to only the node that has the longest queue length among its two-hop neighbors. Our scheduling scheme is fully distributed and requires low overhead so that it works within the framework of CSMA. Through evaluation, we found that the proposed scheduling mechanism significantly reduces the number of collisions, resulting in significant improvement of communication quality of CSMA-driven WMNs.
{"title":"A queue-length based distributed scheduling for CSMA-driven Wireless Mesh Networks","authors":"Toshiki Takeda, Takuya Yoshihiro","doi":"10.1109/ICCNC.2016.7440619","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440619","url":null,"abstract":"Although Wireless Mesh Networks using CSMA MAC protocol (CSMA-driven WMNs) have been extensively studied, severe collisions mainly due to hidden terminals prevent us from realizing practical networks. In this paper, we propose a new distributed scheduling scheme for CSMA-driven WMNs that significantly reduce collision caused by hidden terminals. In our scheduling, we propagate queue-length information within two-hop neighborhood via data and Ack frames, and avoid collision by allowing transmission to only the node that has the longest queue length among its two-hop neighbors. Our scheduling scheme is fully distributed and requires low overhead so that it works within the framework of CSMA. Through evaluation, we found that the proposed scheduling mechanism significantly reduces the number of collisions, resulting in significant improvement of communication quality of CSMA-driven WMNs.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114943543","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-03-24DOI: 10.1109/ICCNC.2016.7440630
Fenghua Li, Yuanyuan He, Ben Niu, Hui Li, Hanyi Wang
Although Proximity-based Mobile Social Networks (PMSNs) bring mobile users novel ways to discover their similarities, they enjoy this kind of conveniences at the cost of user privacy and system overhead etc. To address these problems, we propose Match-MORE, which employs the concept of friends-of-friends to find some ones in common from friends and thus design a private matching scheme. Specifically, Match-MORE exploits a novel similarity function with considering social strength between users and similarity coefficient of the corresponding profiles, simultaneously. It provides users more opportunities to know other potential friends based on the recommendations from existing friends with tunable accuracy, and without disclosing too much private information to each other. The Bloom filter-based common-attributes estimation reduces the system overhead significantly. The security and performance are thoroughly analyzed and evaluated via detailed simulations.
{"title":"Match-MORE: An efficient private matching scheme using friends-of-friends' recommendation","authors":"Fenghua Li, Yuanyuan He, Ben Niu, Hui Li, Hanyi Wang","doi":"10.1109/ICCNC.2016.7440630","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440630","url":null,"abstract":"Although Proximity-based Mobile Social Networks (PMSNs) bring mobile users novel ways to discover their similarities, they enjoy this kind of conveniences at the cost of user privacy and system overhead etc. To address these problems, we propose Match-MORE, which employs the concept of friends-of-friends to find some ones in common from friends and thus design a private matching scheme. Specifically, Match-MORE exploits a novel similarity function with considering social strength between users and similarity coefficient of the corresponding profiles, simultaneously. It provides users more opportunities to know other potential friends based on the recommendations from existing friends with tunable accuracy, and without disclosing too much private information to each other. The Bloom filter-based common-attributes estimation reduces the system overhead significantly. The security and performance are thoroughly analyzed and evaluated via detailed simulations.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129322701","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
扫码关注我们
求助内容：
应助结果提醒方式：