首页 > 最新文献

2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)最新文献

英文 中文
Digital image processing in led visible light communications using mobile phone camera 手机摄像头在led可见光通信中的数字图像处理
Zongze Li, Zhenshan Zhang, Qiaozhi Yuan, Yaojun Qiao, Ke Liao, HaiHua Yu
Visible light communication (VLC) has recently emerged to become a promising wireless communication technology. It is attractive if the mobile phone camera can be used as the visible light communication receiver. In this paper, a feasible digital image processing scheme for the application of VLC using mobile phone camera as receiver is proposed. The camera for the signal reception captures the information in the form of light and dark stripes which are then decoded by the computer in the MATLAB and the received message is displayed. In order to mitigate the interferences of the LED facula and extend the VLC transmission distance, we utilize a lot of methods of digital image processing, which include grayscale conversion, removal of low grayscale and LED facula, histogram equalization and high pass filter. Through the image processing, the light and dark stripes are clearer and easier to be decoded. Then a second-order polynomial fitting is used to define the threshold and the binary result is obtained. The experimental results show that the robustness of system is obviously improved and the VLC system can resist interferences and background noise.
可见光通信(VLC)是近年来发展起来的一种很有前途的无线通信技术。如果手机摄像头可以作为可见光通信的接收器,这是很有吸引力的。本文提出了一种可行的以手机摄像头为接收机的VLC数字图像处理方案。用于信号接收的摄像机以明暗条纹的形式捕获信息,然后由MATLAB中的计算机解码并显示接收到的消息。为了减轻LED光斑的干扰,延长VLC的传输距离,我们使用了大量的数字图像处理方法,包括灰度转换、低灰度和LED光斑的去除、直方图均衡化和高通滤波。通过图像处理,明暗条纹更清晰,更容易解码。然后用二阶多项式拟合定义阈值,得到二值化结果。实验结果表明,VLC系统的鲁棒性明显提高,能够抵抗干扰和背景噪声。
{"title":"Digital image processing in led visible light communications using mobile phone camera","authors":"Zongze Li, Zhenshan Zhang, Qiaozhi Yuan, Yaojun Qiao, Ke Liao, HaiHua Yu","doi":"10.1109/ICNIDC.2016.7974572","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974572","url":null,"abstract":"Visible light communication (VLC) has recently emerged to become a promising wireless communication technology. It is attractive if the mobile phone camera can be used as the visible light communication receiver. In this paper, a feasible digital image processing scheme for the application of VLC using mobile phone camera as receiver is proposed. The camera for the signal reception captures the information in the form of light and dark stripes which are then decoded by the computer in the MATLAB and the received message is displayed. In order to mitigate the interferences of the LED facula and extend the VLC transmission distance, we utilize a lot of methods of digital image processing, which include grayscale conversion, removal of low grayscale and LED facula, histogram equalization and high pass filter. Through the image processing, the light and dark stripes are clearer and easier to be decoded. Then a second-order polynomial fitting is used to define the threshold and the binary result is obtained. The experimental results show that the robustness of system is obviously improved and the VLC system can resist interferences and background noise.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697888","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}
引用次数: 5
Automatic calculation model of large scale soil loss model based on csle model 基于csle模型的大比例尺土壤流失模型自动计算模型
K. Wang, Zhengqiu Yang, Jiapeng Xiu, Chen Liu
Based on the model of Chinese soil loss equation (CSLE), this paper puts forward a model to calculate the large scale data automatically. At present, the domestic use of this model to calculate the soil loss modulus methods are mostly used in the existing calculation tools, manual calculation of a basin or county soil erosion modulus. However, the data collected from the first national water resources survey about soil and water conservation work in our country, has not automatic calculation model to be applied. In this paper, we mainly study how to use the CSLE model to calculate the large range data by using the automatic method, and put forward the automatic calculation model.
在中国水土流失方程(CSLE)模型的基础上,提出了一种自动计算大尺度数据的模型。目前,国内使用该模型计算水土流失模数的方法大多采用现有的计算工具,人工计算一个流域或县的水土流失模数。然而,我国第一次全国水资源调查所收集的水土保持工作数据,还没有可应用的自动计算模型。本文主要研究了如何利用CSLE模型采用自动方法对大量程数据进行计算,并提出了自动计算模型。
{"title":"Automatic calculation model of large scale soil loss model based on csle model","authors":"K. Wang, Zhengqiu Yang, Jiapeng Xiu, Chen Liu","doi":"10.1109/ICNIDC.2016.7974562","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974562","url":null,"abstract":"Based on the model of Chinese soil loss equation (CSLE), this paper puts forward a model to calculate the large scale data automatically. At present, the domestic use of this model to calculate the soil loss modulus methods are mostly used in the existing calculation tools, manual calculation of a basin or county soil erosion modulus. However, the data collected from the first national water resources survey about soil and water conservation work in our country, has not automatic calculation model to be applied. In this paper, we mainly study how to use the CSLE model to calculate the large range data by using the automatic method, and put forward the automatic calculation model.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114755886","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}
引用次数: 0
Joint antenna and power allocation scheme for massive MIMO relaying network 大规模MIMO中继网络的联合天线和功率分配方案
Bowen Liu, Heli Zhang, Hong Ji, Victor C. M. Leung
Recently, the increasing number of antennas makes the resource allocations of the massive multi-input multi-output (MIMO) networks become more complicated, and diminish the advantages of higher space diversity. In this paper, we focus on antenna selection with the uplink feedback with the signaling overhead reduced, as well as the power allocation scheme aiming of the spectrum efficiency (SE) improving. It makes the complexity too high to regard the antenna selection and power allocation as one problem, so we divide the problem into two parts. And to solve the sub-problem, we present a joint antenna and power allocation (JAPA) scheme. By this approach, we reduce the feedback overhead and improve SE with lower complexity than conventional algorithms. SE of all the users with different number of antenna and node pairs are simulated, and the results demonstrate that our proposed scheme performs well in the total power consumption and SE with user scheduling participated.
近年来,天线数量的不断增加使得大规模多输入多输出(MIMO)网络的资源分配变得更加复杂,降低了高空间分集的优势。本文重点研究了基于上行反馈的天线选择和以提高频谱效率为目标的功率分配方案。将天线选择和功率分配作为一个问题来考虑会使问题的复杂性过高,因此我们将问题分为两个部分。为了解决子问题,我们提出了一种联合天线功率分配(JAPA)方案。通过这种方法,我们减少了反馈开销,并以较低的复杂度提高了SE。对不同天线个数和节点对的所有用户的SE进行了仿真,结果表明,在参与用户调度的情况下,我们提出的方案在总功耗和SE方面都有良好的性能。
{"title":"Joint antenna and power allocation scheme for massive MIMO relaying network","authors":"Bowen Liu, Heli Zhang, Hong Ji, Victor C. M. Leung","doi":"10.1109/ICNIDC.2016.7974576","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974576","url":null,"abstract":"Recently, the increasing number of antennas makes the resource allocations of the massive multi-input multi-output (MIMO) networks become more complicated, and diminish the advantages of higher space diversity. In this paper, we focus on antenna selection with the uplink feedback with the signaling overhead reduced, as well as the power allocation scheme aiming of the spectrum efficiency (SE) improving. It makes the complexity too high to regard the antenna selection and power allocation as one problem, so we divide the problem into two parts. And to solve the sub-problem, we present a joint antenna and power allocation (JAPA) scheme. By this approach, we reduce the feedback overhead and improve SE with lower complexity than conventional algorithms. SE of all the users with different number of antenna and node pairs are simulated, and the results demonstrate that our proposed scheme performs well in the total power consumption and SE with user scheduling participated.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117055744","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}
引用次数: 0
A depth cascade face detection algorithm based on adaboost 基于adaboost的深度级联人脸检测算法
Wen Yu, Jiapeng Xiu, Chen Liu, Zhengqiu Yang
In this paper, a face detection algorithm based on AdaBoost algorithm combined with Haar classifier depth cascade about OpenCV is proposed. In order to solve the problem that the training depth of AdaBoost algorithm is not enough and the Haar classifier is not accurate because of the lack of depth cascade classification. Before the face feature extraction, AdaBoost algorithm is used to train the face samples to train the strong classifier. Then using OpenCV Haar classifier to depth classification for these strong classifier, it equal to cascade the AdaBoost algorithm, using high efficiency characteristic matrix and integral image method to accelerate the extraction rate of image feature values of the Haar-like.
本文提出了一种基于AdaBoost算法结合Haar分类器深度级联的OpenCV人脸检测算法。为了解决AdaBoost算法由于缺乏深度级联分类而导致训练深度不够和Haar分类器不准确的问题。在人脸特征提取之前,采用AdaBoost算法对人脸样本进行训练,训练强分类器。然后利用OpenCV Haar分类器对这些强分类器进行深度分类,相当于级联AdaBoost算法,利用高效率的特征矩阵和积分图像方法来加快Haar类图像特征值的提取速度。
{"title":"A depth cascade face detection algorithm based on adaboost","authors":"Wen Yu, Jiapeng Xiu, Chen Liu, Zhengqiu Yang","doi":"10.1109/ICNIDC.2016.7974544","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974544","url":null,"abstract":"In this paper, a face detection algorithm based on AdaBoost algorithm combined with Haar classifier depth cascade about OpenCV is proposed. In order to solve the problem that the training depth of AdaBoost algorithm is not enough and the Haar classifier is not accurate because of the lack of depth cascade classification. Before the face feature extraction, AdaBoost algorithm is used to train the face samples to train the strong classifier. Then using OpenCV Haar classifier to depth classification for these strong classifier, it equal to cascade the AdaBoost algorithm, using high efficiency characteristic matrix and integral image method to accelerate the extraction rate of image feature values of the Haar-like.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581417","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}
引用次数: 4
Revealing functional regions via joint matrix factorization based model 基于联合矩阵分解模型揭示功能区
Shan Wang, Yajing Xu, Sheng Gao
Various functions in the region are emerging with the process of urbanizations, such as the residential, entertainment or hospital districts, which can be indicated during the urban planning. Recently, researchers try to discover the region functions with the human mobility data based on machine learning and statistical models. However, previous work always employs the single domain data like mobility information or district attributes to measure the functions. In this paper, we will address the problem by integrating multi-domain data, like human trajectories, base station information and Points-of-Interest attributes. For that, we propose a joint nonnegative matrix factorization model to combine the multi-source data and extract the function distribution of each urban region, then the dominated function among the regions can be uncovered based on the clustering process over the extracted distributions. We also evaluate the performance of our method on the real-world dataset to demonstrate the advantages of our proposed model over the baseline methods.
随着城市化进程的推进,区域内出现了多种功能,如居住区、娱乐区、医院区等,这些都可以在城市规划中体现出来。近年来,研究人员试图利用基于机器学习和统计模型的人类移动数据来发现区域功能。然而,以往的研究大多采用单一领域的数据,如流动性信息或地区属性来衡量其功能。在本文中,我们将通过整合多领域数据来解决这个问题,如人类轨迹、基站信息和兴趣点属性。为此,提出一种联合非负矩阵分解模型,结合多源数据提取各城市区域的函数分布,然后对提取的分布进行聚类处理,揭示各区域间的主导函数。我们还评估了我们的方法在真实数据集上的性能,以证明我们提出的模型优于基线方法。
{"title":"Revealing functional regions via joint matrix factorization based model","authors":"Shan Wang, Yajing Xu, Sheng Gao","doi":"10.1109/ICNIDC.2016.7974565","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974565","url":null,"abstract":"Various functions in the region are emerging with the process of urbanizations, such as the residential, entertainment or hospital districts, which can be indicated during the urban planning. Recently, researchers try to discover the region functions with the human mobility data based on machine learning and statistical models. However, previous work always employs the single domain data like mobility information or district attributes to measure the functions. In this paper, we will address the problem by integrating multi-domain data, like human trajectories, base station information and Points-of-Interest attributes. For that, we propose a joint nonnegative matrix factorization model to combine the multi-source data and extract the function distribution of each urban region, then the dominated function among the regions can be uncovered based on the clustering process over the extracted distributions. We also evaluate the performance of our method on the real-world dataset to demonstrate the advantages of our proposed model over the baseline methods.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123358929","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}
引用次数: 3
Full duplex multi-threshold cooperative sensing scheme based on phase difference 基于相位差的全双工多阈值协同传感方案
Tianwei Hou, Xiaodong Ji, Yong Li
A novel full-duplex (FD) multi-threshold cooperative sensing scheme based on phase difference (PD) is presented in this paper. Compared with single-threshold cooperative method, the novel multi-threshold cooperative method proposed in this paper can greatly improve the performance of the FD cognitive radio networks (CRNs). PD method is used in this paper since it is immune to the signal-to-noise ratio (SNR) level. Besides, two different kinds of weighing methods are presented in this paper, i.e., weighing based on the average of every secondary user's (SU) report and weighing based on Bias discriminant. Closed-form solutions for both non-cooperative case and weighing based on the average of SU's report are proposed in this paper. Simulation results justify that our closed-form solutions are correct, and our multi-threshold weighing cooperative method can improve the performance of the FD system.
提出了一种基于相位差的全双工(FD)多阈值协同传感方案。与单阈值协作方法相比,本文提出的多阈值协作方法可以大大提高FD认知无线网络的性能。由于PD方法不受信噪比(SNR)水平的影响,因此本文采用了PD方法。此外,本文还提出了两种不同的加权方法,即基于每个二级用户(SU)报告平均值的加权和基于Bias判别法的加权。本文提出了基于SU报告均值的非合作情况和加权情况的闭型解。仿真结果证明了所提出的封闭解是正确的,并且所提出的多阈值加权协同方法可以提高FD系统的性能。
{"title":"Full duplex multi-threshold cooperative sensing scheme based on phase difference","authors":"Tianwei Hou, Xiaodong Ji, Yong Li","doi":"10.1109/ICNIDC.2016.7974534","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974534","url":null,"abstract":"A novel full-duplex (FD) multi-threshold cooperative sensing scheme based on phase difference (PD) is presented in this paper. Compared with single-threshold cooperative method, the novel multi-threshold cooperative method proposed in this paper can greatly improve the performance of the FD cognitive radio networks (CRNs). PD method is used in this paper since it is immune to the signal-to-noise ratio (SNR) level. Besides, two different kinds of weighing methods are presented in this paper, i.e., weighing based on the average of every secondary user's (SU) report and weighing based on Bias discriminant. Closed-form solutions for both non-cooperative case and weighing based on the average of SU's report are proposed in this paper. Simulation results justify that our closed-form solutions are correct, and our multi-threshold weighing cooperative method can improve the performance of the FD system.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121220467","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}
引用次数: 1
An estimated QoE model for video telephone service 视频电话服务的QoE估计模型
Zhe Wang, Yitong Liu, Yuchen Li, Hongwen Yang, Dacheng Yang
It is of vital importance to make audiovisual quality assessment, as the growing demand on video telephone services. Users are more enjoying higher quality of video telephone, and their perceptions on video telephone service will directly influence the service provider's performance. So it is significant to study end users' subjective perception, named as Quality of Experience (QoE), on video telephone. In this paper, subjective tests have been conducted with participation from laboratories with ages ranging from 20 to 40, and we analyze the collected data and build a QoE model for evaluating video telephone services, considering different video telephone content types. The QoE model, named as Video-Telephone-Mean Opinion Score model, directly focuses on end-users' feeling. The key performance indicators (KPIs) are mapped to QoE score. The performance of model for QoE evaluation on video telephone quality has been verified via plenty subjective Mean Opinion Score (MOS) test, which includes 120 video telephone samples with 2760 valid votes. The Pearson Correlation Coefficient between VT MOS and MOS is 0.90, which indicates that this model can be used to evaluate users' perception on video telephone quality.
随着人们对视频电话业务的需求不断增长,对视频质量进行评估显得尤为重要。用户对视频电话质量的享受程度越来越高,用户对视频电话服务的感知将直接影响服务提供商的业绩。因此,研究终端用户对视频电话的主观感受即体验质量(QoE)具有重要意义。本文采用20 - 40岁的实验室参与的主观测试,对收集到的数据进行分析,并在考虑不同视频电话内容类型的情况下,构建了评价视频电话服务的QoE模型。QoE模型,即视频电话平均意见评分模型,直接关注终端用户的感受。将关键绩效指标(kpi)映射到QoE得分。通过对120个视频电话样本2760张有效投票的主观平均意见评分(Mean Opinion Score, MOS)检验,验证了QoE评价模型对视频电话质量的评价效果。VT MOS与MOS之间的Pearson相关系数为0.90,表明该模型可用于评价用户对视频电话质量的感知。
{"title":"An estimated QoE model for video telephone service","authors":"Zhe Wang, Yitong Liu, Yuchen Li, Hongwen Yang, Dacheng Yang","doi":"10.1109/ICNIDC.2016.7974579","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974579","url":null,"abstract":"It is of vital importance to make audiovisual quality assessment, as the growing demand on video telephone services. Users are more enjoying higher quality of video telephone, and their perceptions on video telephone service will directly influence the service provider's performance. So it is significant to study end users' subjective perception, named as Quality of Experience (QoE), on video telephone. In this paper, subjective tests have been conducted with participation from laboratories with ages ranging from 20 to 40, and we analyze the collected data and build a QoE model for evaluating video telephone services, considering different video telephone content types. The QoE model, named as Video-Telephone-Mean Opinion Score model, directly focuses on end-users' feeling. The key performance indicators (KPIs) are mapped to QoE score. The performance of model for QoE evaluation on video telephone quality has been verified via plenty subjective Mean Opinion Score (MOS) test, which includes 120 video telephone samples with 2760 valid votes. The Pearson Correlation Coefficient between VT MOS and MOS is 0.90, which indicates that this model can be used to evaluate users' perception on video telephone quality.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130289579","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}
引用次数: 0
An iterative beamforming scheme based on leakage sum-rate maximization criterion 基于泄漏和速率最大化准则的迭代波束形成方案
Jia-Ning Guo, K. Niu, Chao Dong
In this paper, we study an iterative beamforming scheme for downlink multiuser channels. The sum-rate of the system can be maximized by weighted sum-rate maximization method. However, the interference of leakage signal is not considered in this method. We propose a new metric named leakage sum-rate (LSR) to treat leakage interference. Then, the leakage sum-rate maximization is modeled by the power budget constraint of base stations. The optimization problem can be transformed to an equivalent weighted mean-square error minimization (WMMSE) problem and an iterative algorithm is proposed to solve it. In the algorithm, weighted factors, transmit and receive beamformers are updated iteratively. The proposed algorithm outperforms the SLNR maximizing algorithm in terms of the system sum-rate. Compared with the weighted sum-rate maximization scheme, the proposed algorithm can converge to a stationary point more quickly although the system performance is lower. Simulation results illustrate that the algorithm can make a good balance between system performance and complexity.
本文研究了一种用于下行多用户信道的迭代波束形成方案。采用加权和率最大化方法,使系统的和率最大化。但该方法未考虑泄漏信号的干扰。我们提出了一种新的度量,称为泄漏和率(LSR)来处理泄漏干扰。然后,根据基站的功率预算约束,建立泄漏和率最大化模型。将优化问题转化为等效加权均方误差最小化(WMMSE)问题,并提出了求解该问题的迭代算法。该算法迭代地更新加权因子、发射波束形成器和接收波束形成器。该算法在系统和速率方面优于SLNR最大化算法。与加权和速率最大化方案相比,该算法可以更快地收敛到一个平稳点,但系统性能较低。仿真结果表明,该算法能很好地平衡系统性能和复杂度。
{"title":"An iterative beamforming scheme based on leakage sum-rate maximization criterion","authors":"Jia-Ning Guo, K. Niu, Chao Dong","doi":"10.1109/ICNIDC.2016.7974571","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974571","url":null,"abstract":"In this paper, we study an iterative beamforming scheme for downlink multiuser channels. The sum-rate of the system can be maximized by weighted sum-rate maximization method. However, the interference of leakage signal is not considered in this method. We propose a new metric named leakage sum-rate (LSR) to treat leakage interference. Then, the leakage sum-rate maximization is modeled by the power budget constraint of base stations. The optimization problem can be transformed to an equivalent weighted mean-square error minimization (WMMSE) problem and an iterative algorithm is proposed to solve it. In the algorithm, weighted factors, transmit and receive beamformers are updated iteratively. The proposed algorithm outperforms the SLNR maximizing algorithm in terms of the system sum-rate. Compared with the weighted sum-rate maximization scheme, the proposed algorithm can converge to a stationary point more quickly although the system performance is lower. Simulation results illustrate that the algorithm can make a good balance between system performance and complexity.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"47 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123264446","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}
引用次数: 0
User interest based distributed cooperative caching and sharing in wireless networks 无线网络中基于用户兴趣的分布式协同缓存与共享
Zheng Guo, Hao Jin, Cheng-lin Zhao, D. Liang
Distributed cache is considered to be one of the key solutions to meet the explosively increasing demand for mobile data traffic. While plenty of related research is burgeoning, most of them mainly focus on caching at routing nodes or base stations, leaving the potential caching ability of the users' smart devices ignored. This paper proposes a cooperative caching and sharing scheme of users' smart devices, where the smart devices would prefer to cache contents the user is interested in and share their cached contents through D2D communication. We provide both the analytical and simulation results to show our scheme's efficiency.
分布式缓存被认为是满足移动数据流量爆炸式增长需求的关键解决方案之一。虽然相关研究大量涌现,但大多集中在路由节点或基站的缓存上,忽略了用户智能设备潜在的缓存能力。本文提出了一种用户智能设备的协同缓存与共享方案,智能设备优先缓存用户感兴趣的内容,并通过D2D通信共享其缓存的内容。分析和仿真结果表明了该方案的有效性。
{"title":"User interest based distributed cooperative caching and sharing in wireless networks","authors":"Zheng Guo, Hao Jin, Cheng-lin Zhao, D. Liang","doi":"10.1109/ICNIDC.2016.7974618","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974618","url":null,"abstract":"Distributed cache is considered to be one of the key solutions to meet the explosively increasing demand for mobile data traffic. While plenty of related research is burgeoning, most of them mainly focus on caching at routing nodes or base stations, leaving the potential caching ability of the users' smart devices ignored. This paper proposes a cooperative caching and sharing scheme of users' smart devices, where the smart devices would prefer to cache contents the user is interested in and share their cached contents through D2D communication. We provide both the analytical and simulation results to show our scheme's efficiency.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124821670","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}
引用次数: 0
A computing offloading algorithm for F-RAN with limited capacity fronthaul 有限容量前传的F-RAN计算卸载算法
Zexiang Wu, Ke Wang, Hong Ji, Victor C. M. Leung
In order to alleviate heavy burden on the capacity-limited fronthaul of C-RAN, a fog computing based C-RAN(F-RAN) architecture has been proposed in recent years. In F-RAN, RRH receives the signal from mobile devices and decides part of tasks to be processed in fog part for computing offloading. With the purpose of offloading sampling signal in fronthaul and separating tasks from cloud part to be processed in fog part, we formulate the problem as a congestion game. And we propose a discrete distribution computing offloading algorithm (DDCO) for F-RAN to solve this game. The DDCO algorithm decides the latency-sensitive mobile to be computed in the fog part such that the fronthaul can be offloaded and Quality of Service (QoS) can be improved. The DDCO algorithm can also balance load in fronthaul in order to improve performance. With the DDCO algorithm, the network get larger throughput and reduce the burden in fronthaul when it achieve a Nash Equilibrium. Finally, we analyze the feasibility of the algorithm. Numerical result corroborate that the DDCO algorithm can well improve throughput compared with the traditional C-RAN network.
为了减轻C-RAN(C-RAN)前传容量有限的沉重负担,近年来提出了一种基于雾计算的C-RAN(F-RAN)架构。在F-RAN中,RRH接收来自移动设备的信号,并决定在雾部分处理的部分任务,以计算卸载。为了在前传中卸载采样信号,并将云部分的任务分离到雾部分进行处理,我们将问题表述为一个拥塞博弈。针对这一问题,提出了一种离散分布计算卸载算法(DDCO)。DDCO算法决定在雾段计算延迟敏感移动,从而减轻前传,提高服务质量(QoS)。DDCO算法还可以平衡前传的负载,从而提高性能。采用DDCO算法,网络在达到纳什均衡时,可以获得更大的吞吐量,减少前传的负担。最后,对算法的可行性进行了分析。数值结果表明,与传统的C-RAN网络相比,DDCO算法可以很好地提高吞吐量。
{"title":"A computing offloading algorithm for F-RAN with limited capacity fronthaul","authors":"Zexiang Wu, Ke Wang, Hong Ji, Victor C. M. Leung","doi":"10.1109/ICNIDC.2016.7974539","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974539","url":null,"abstract":"In order to alleviate heavy burden on the capacity-limited fronthaul of C-RAN, a fog computing based C-RAN(F-RAN) architecture has been proposed in recent years. In F-RAN, RRH receives the signal from mobile devices and decides part of tasks to be processed in fog part for computing offloading. With the purpose of offloading sampling signal in fronthaul and separating tasks from cloud part to be processed in fog part, we formulate the problem as a congestion game. And we propose a discrete distribution computing offloading algorithm (DDCO) for F-RAN to solve this game. The DDCO algorithm decides the latency-sensitive mobile to be computed in the fog part such that the fronthaul can be offloaded and Quality of Service (QoS) can be improved. The DDCO algorithm can also balance load in fronthaul in order to improve performance. With the DDCO algorithm, the network get larger throughput and reduce the burden in fronthaul when it achieve a Nash Equilibrium. Finally, we analyze the feasibility of the algorithm. Numerical result corroborate that the DDCO algorithm can well improve throughput compared with the traditional C-RAN network.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129211478","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}
引用次数: 3
期刊
2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1