首页 > 最新文献

2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)最新文献

英文 中文
Hybrid Beamformer Design with Low-Resolution Phase Shifters in MU-MISO SWIPT Systems MU-MISO SWIPT系统中低分辨率移相器混合波束形成器设计
Rang Liu, Hongyu Li, Yiqun Guo, Ming Li, Qian Liu
Simultaneous wireless information and power transfer (SWIPT) is considered as a promising solution to offer convenient energy supplies to wireless devices. On the other hand, analog/digital hybrid beamforming, which can dramatically reduce power consumption, has been deemed as an energy efficient transceiver architecture. This paper investigates the problem of hybrid beamforming design with low-resolution PSs to achieve an energy efficient multi-user multi-input single-output (MUMISO) SWIPT system. Particularly, a base-station (BS), which is equipped with multiple antennas and hybrid beamforming architecture, simultaneously transfers information to one singleantenna information receiver (IR) and power to K distributed single-antenna energy receivers (ERs). While the IR has a target signal-to-noise ratio (SNR) requirement to assure the quality of service (QoS) of transmission, the K ERs have certain thresholds of receive signal power to guarantee the energy harvesting. We propose a novel iterative hybrid beamforming design algorithm to find the analog beamformer with constant amplitude and lowresolution phase constraints and the digital beamformer which can minimize the transmit power under both IR and ERs' requirements. Simulation results validate the effectiveness of the proposed hybrid beamforming design algorithm in the MU-MISO SWIPT systems.
同时无线信息和电力传输(SWIPT)被认为是一种很有前途的解决方案,为无线设备提供方便的能源供应。另一方面,模拟/数字混合波束形成可以显著降低功耗,被认为是一种节能的收发器架构。为了实现高效节能的多用户多输入单输出(MUMISO) SWIPT系统,研究了低分辨率ps的混合波束形成设计问题。特别是,配备多天线和混合波束形成架构的基站(BS)同时将信息传输到一个单天线信息接收器(IR),并将功率传输到K个分布式单天线能量接收器(er)。红外有目标信噪比(SNR)要求以保证传输的服务质量(QoS),而K - er有一定的接收信号功率阈值以保证能量收集。我们提出了一种新的迭代混合波束形成设计算法,以寻找具有恒幅和低分辨率相位约束的模拟波束形成器和能够在红外和阻抗要求下最小化发射功率的数字波束形成器。仿真结果验证了所提出的混合波束形成设计算法在MU-MISO SWIPT系统中的有效性。
{"title":"Hybrid Beamformer Design with Low-Resolution Phase Shifters in MU-MISO SWIPT Systems","authors":"Rang Liu, Hongyu Li, Yiqun Guo, Ming Li, Qian Liu","doi":"10.1109/WCSP.2018.8555694","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555694","url":null,"abstract":"Simultaneous wireless information and power transfer (SWIPT) is considered as a promising solution to offer convenient energy supplies to wireless devices. On the other hand, analog/digital hybrid beamforming, which can dramatically reduce power consumption, has been deemed as an energy efficient transceiver architecture. This paper investigates the problem of hybrid beamforming design with low-resolution PSs to achieve an energy efficient multi-user multi-input single-output (MUMISO) SWIPT system. Particularly, a base-station (BS), which is equipped with multiple antennas and hybrid beamforming architecture, simultaneously transfers information to one singleantenna information receiver (IR) and power to K distributed single-antenna energy receivers (ERs). While the IR has a target signal-to-noise ratio (SNR) requirement to assure the quality of service (QoS) of transmission, the K ERs have certain thresholds of receive signal power to guarantee the energy harvesting. We propose a novel iterative hybrid beamforming design algorithm to find the analog beamformer with constant amplitude and lowresolution phase constraints and the digital beamformer which can minimize the transmit power under both IR and ERs' requirements. Simulation results validate the effectiveness of the proposed hybrid beamforming design algorithm in the MU-MISO SWIPT systems.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459238","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
Performance Modeling of LAA LBT with Random Backoff and a Variable Contention Window 具有随机回退和可变竞争窗口的LAA LBT性能建模
Jie Xiao, Jun Zheng, Liangyu Chu, Qilei Ren
This paper studies the performance modeling of an LTE LAA category-4 listen before talk (LBT) procedure for data transmission in an unlicensed spectrum band. A 3-D Markov model is developed to describe the category-4 LBT procedure of an LAA eNode B. This 3-D Markovmodel takes into account the frame synchronization problem ($mathrm{i}.mathrm{e}.$, the GAP period) and transmission priority in the category-4 LBT procedure, which are not consideredin all existing modeling of LTE LAA LBT procedures. Based on the 3-D Markov model, a performance model is further derived for investigating the steady-state transmission probability of an LAA eNodeB. The derived performance model is justified through simulation results. It is demonstrated that the existence of the GAP period has an impact on the performance of an LTE LAA system and an LAA category-4 LBT procedure with a reservation signal filling in the GAP period outperforms one without using a reservation signal.
本文研究了LTE LAA第4类先听后讲(LBT)过程在无许可频段的数据传输性能建模。建立了一个三维马尔可夫模型来描述LAA eNode b的4类LBT过程。该三维马尔可夫模型考虑了帧同步问题($ mathm {i}. mathm {e})。$, GAP期)和4类LBT过程中的传输优先级,这在所有现有的LTE LAA LBT过程建模中都没有考虑到。在三维马尔可夫模型的基础上,进一步推导了LAA eNodeB稳态传输概率的性能模型。仿真结果验证了所建立的性能模型的正确性。研究表明,GAP期的存在对LAA系统的性能有影响,在GAP期填充保留信号的LAA 4类LBT过程优于不使用保留信号的LBT过程。
{"title":"Performance Modeling of LAA LBT with Random Backoff and a Variable Contention Window","authors":"Jie Xiao, Jun Zheng, Liangyu Chu, Qilei Ren","doi":"10.1109/WCSP.2018.8555559","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555559","url":null,"abstract":"This paper studies the performance modeling of an LTE LAA category-4 listen before talk (LBT) procedure for data transmission in an unlicensed spectrum band. A 3-D Markov model is developed to describe the category-4 LBT procedure of an LAA eNode B. This 3-D Markovmodel takes into account the frame synchronization problem ($mathrm{i}.mathrm{e}.$, the GAP period) and transmission priority in the category-4 LBT procedure, which are not consideredin all existing modeling of LTE LAA LBT procedures. Based on the 3-D Markov model, a performance model is further derived for investigating the steady-state transmission probability of an LAA eNodeB. The derived performance model is justified through simulation results. It is demonstrated that the existence of the GAP period has an impact on the performance of an LTE LAA system and an LAA category-4 LBT procedure with a reservation signal filling in the GAP period outperforms one without using a reservation signal.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126530091","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}
引用次数: 7
Joint Time Allocation and Power Splitting Schemes for Amplify-and-forward Relaying Network over Log-normal Fading Channel 对数正常衰落信道上放大转发中继网络的联合时间分配和功率分割方案
Jianmei Shen, Yingting Liu, Hongwu Yang, Chun-man Yan
Wireless energy harvesting and power transfer in cooperative relaying networks is an efficient way to prolong the lifetime of energy-constrained nodes. Most of the existing works on this topic have been focused on Rayleigh fading channel which is used to study outdoor environments. In contrast, we propose a hybrid protocol (HP) which is a combination of the time-switching relaying (TSR) and power-splitting relaying (PSR). Two source nodes can exchange information with the help of an amplify-andforward (AF) relay node, the relay node is energy-constrained. The analytical expression of outage probability is derived. Numerical results also confirm that our proposed system can minimize the outage probability compared with the existing protocols and show that it is a green solution to improve system performance by reducing the threshold value. Furthermore, it is worth mentioning that the source transmit power can effectively change the system performance.
协作中继网络中的无线能量收集和能量传输是延长能量受限节点寿命的有效途径。现有的研究大多集中在瑞利衰落信道上,用于研究室外环境。相反,我们提出了一种混合协议(HP),它是时间交换中继(TSR)和功率分割中继(PSR)的组合。两个源节点可以通过放大转发(AF)中继节点交换信息,中继节点能量有限。导出了停电概率的解析表达式。数值结果表明,与现有协议相比,本文提出的系统可以最大限度地降低中断概率,并通过降低阈值来提高系统性能。此外,值得一提的是,源发射功率可以有效地改变系统的性能。
{"title":"Joint Time Allocation and Power Splitting Schemes for Amplify-and-forward Relaying Network over Log-normal Fading Channel","authors":"Jianmei Shen, Yingting Liu, Hongwu Yang, Chun-man Yan","doi":"10.1109/WCSP.2018.8555892","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555892","url":null,"abstract":"Wireless energy harvesting and power transfer in cooperative relaying networks is an efficient way to prolong the lifetime of energy-constrained nodes. Most of the existing works on this topic have been focused on Rayleigh fading channel which is used to study outdoor environments. In contrast, we propose a hybrid protocol (HP) which is a combination of the time-switching relaying (TSR) and power-splitting relaying (PSR). Two source nodes can exchange information with the help of an amplify-andforward (AF) relay node, the relay node is energy-constrained. The analytical expression of outage probability is derived. Numerical results also confirm that our proposed system can minimize the outage probability compared with the existing protocols and show that it is a green solution to improve system performance by reducing the threshold value. Furthermore, it is worth mentioning that the source transmit power can effectively change the system performance.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125963845","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
Joint optimization of Offloading and Resource Allocation in Vehicular Networks with Mobile Edge Computing 基于移动边缘计算的车载网络卸载与资源分配联合优化
Jie Zhou, Fan Wu, Ke Zhang, Y. Mao, S. Leng
As a typical application of the technology of Internet of Things (IoT), Internet of Vehicle (IoV) is facing the explosive computation demands and restrict delay constrains. Vehicular networks with mobile edge computing (MEC) is a promising approach to address this problem. In this paper, we focus on the problem of reducing the completion time of Virtual Reality (VR) applications for IoV. To this end, we propose a cooperative approach for parallel computing and transmission for VR. In our proposed scheme, a VR task is divided into two sub-tasks firstly. Then one of the two is offloaded to the vehicle via wireless transmission so that the two sub-tasks can be processed at the MEC server and the vehicle separately and simultaneously. We formulate the scheme as a nonlinear optimization problem to jointly determine computation offloading proportion, communication resource and computation resource allocation. Due to the NP-hard property of this problem, a joint offloading proportion and resource allocation optimization (JOPRAO) algorithm is designed to obtain the optimal solution. Simulation results demonstrate that latency of VR task completion time can be decreased significantly by offloading the task and resource allocation strategy reasonably.
作为物联网技术的典型应用,车联网面临着爆炸性的计算需求和受限的时延约束。具有移动边缘计算(MEC)的车载网络是解决这一问题的一种很有前途的方法。本文主要研究如何缩短车联网虚拟现实(VR)应用的完成时间。为此,我们提出了一种虚拟现实并行计算与传输的协作方法。在我们提出的方案中,首先将一个虚拟现实任务分成两个子任务。然后通过无线传输将其中一个任务卸载到车辆上,这样两个子任务就可以在MEC服务器和车辆上分别同时处理。我们将该方案表述为一个非线性优化问题,共同确定计算卸载比例、通信资源和计算资源分配。针对该问题的NP-hard特性,设计了一种联合卸载比例与资源分配优化算法(joint offloading proportion and resource allocation optimization, JOPRAO)来获得最优解。仿真结果表明,通过合理的任务卸载和资源分配策略,可以显著降低虚拟现实任务完成时间的延迟。
{"title":"Joint optimization of Offloading and Resource Allocation in Vehicular Networks with Mobile Edge Computing","authors":"Jie Zhou, Fan Wu, Ke Zhang, Y. Mao, S. Leng","doi":"10.1109/WCSP.2018.8555636","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555636","url":null,"abstract":"As a typical application of the technology of Internet of Things (IoT), Internet of Vehicle (IoV) is facing the explosive computation demands and restrict delay constrains. Vehicular networks with mobile edge computing (MEC) is a promising approach to address this problem. In this paper, we focus on the problem of reducing the completion time of Virtual Reality (VR) applications for IoV. To this end, we propose a cooperative approach for parallel computing and transmission for VR. In our proposed scheme, a VR task is divided into two sub-tasks firstly. Then one of the two is offloaded to the vehicle via wireless transmission so that the two sub-tasks can be processed at the MEC server and the vehicle separately and simultaneously. We formulate the scheme as a nonlinear optimization problem to jointly determine computation offloading proportion, communication resource and computation resource allocation. Due to the NP-hard property of this problem, a joint offloading proportion and resource allocation optimization (JOPRAO) algorithm is designed to obtain the optimal solution. Simulation results demonstrate that latency of VR task completion time can be decreased significantly by offloading the task and resource allocation strategy reasonably.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122254084","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}
引用次数: 25
Energy-Efficient Transceiver Design for Full-Duplex Cooperative NOMA Systems with SWIPT 基于SWIPT的全双工协同NOMA系统的节能收发器设计
Xiaojuan Yin, Wei Wu, Haibo Dai, Pei Li, Baoyun Wang
A downlink cooperative non-orthogonal multiple access (CNOMA) system is investigated, wherein the near user acts as a full-duplex (FD) relay to assist the far user. The energy efficiency is to be maximized subject to QoS requirement of the far user and power budget constraints of the base station and the near user. Since the formulated problem is highly nonconvex, it is computationally challenging to be addressed. A low-complexity path-following algorithm is proposed, which invokes only one convex quadratic problem at each iteration. Numerical results demonstrate that the proposed algorithm outperforms the conventional iterative method.
研究了一种下行链路协作非正交多址(CNOMA)系统,其中近端用户作为全双工(FD)中继来辅助远端用户。根据远端用户的QoS要求和基站与近端用户的功率预算约束,实现能源效率的最大化。由于公式化问题是高度非凸的,因此在计算上具有挑战性。提出了一种低复杂度的路径跟踪算法,每次迭代只调用一个凸二次问题。数值结果表明,该算法优于传统迭代法。
{"title":"Energy-Efficient Transceiver Design for Full-Duplex Cooperative NOMA Systems with SWIPT","authors":"Xiaojuan Yin, Wei Wu, Haibo Dai, Pei Li, Baoyun Wang","doi":"10.1109/WCSP.2018.8555913","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555913","url":null,"abstract":"A downlink cooperative non-orthogonal multiple access (CNOMA) system is investigated, wherein the near user acts as a full-duplex (FD) relay to assist the far user. The energy efficiency is to be maximized subject to QoS requirement of the far user and power budget constraints of the base station and the near user. Since the formulated problem is highly nonconvex, it is computationally challenging to be addressed. A low-complexity path-following algorithm is proposed, which invokes only one convex quadratic problem at each iteration. Numerical results demonstrate that the proposed algorithm outperforms the conventional iterative method.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134265429","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
A Physical-social-based Group Utility Maximization framework for Cooperative Caching in Mobile Networks 基于物理社会的移动网络协同缓存群体效用最大化框架
Hao Zhou, Lei Xu, Jiaojiao Zhang
Cooperative caching in the device-to-device (D2D) networks is an effective solution to the problem of offloading data traffic at peak times. However, one of the main challenges of cooperative caching is the selfish nature of the user, and some users only cache what they are interested in and don't care about other people's needs. In this paper, we investigate a physical-social-based cooperative caching framework, considering the physical-social tie as a non-monetary incentive to motivate the data cache and share between users by using D2D communication. Specifically, we first define a novel physical-social tie, combining the physical factors and social relationship. After that, we formulate two mathematical programming models with or without the consideration of indirect physical-social tie, to find an optimal caching strategy with the target of maximizing the social group utility. Moreover, we adopt Six Degrees of Separation to analyze the indirect physical-social tie between users when these social users with direct physical-social tie cannot meet the date request of the user, and then devise an indirect social group formation algorithm (ISGFA) to obtain the indirect social group of the user. Finally, simulation results shows that the caching scheme obtained from our model is efficient and outperforms other caching schemes that without considering the physical-social tie.
设备对设备(D2D)网络中的协作缓存是解决高峰时段数据流量分流问题的有效方法。然而,协作缓存的主要挑战之一是用户的自私性,一些用户只缓存他们感兴趣的内容,而不关心其他人的需求。在本文中,我们研究了一个基于物理-社会的合作缓存框架,将物理-社会关系作为一种非货币激励,通过使用D2D通信来激励用户之间的数据缓存和共享。具体来说,我们首先定义了一种新的生理-社会联系,将生理因素与社会关系结合起来。在此基础上,建立了考虑或不考虑间接物理-社会联系的数学规划模型,以寻求以社会群体效用最大化为目标的最优缓存策略。此外,我们采用六度分离的方法分析了当这些具有直接物理社会关系的社交用户不能满足用户的约会请求时,用户之间的间接物理社会关系,并设计了一个间接社会群体形成算法(ISGFA)来获得用户的间接社会群体。最后,仿真结果表明,基于该模型的缓存方案是高效的,并且优于其他不考虑物理-社会关系的缓存方案。
{"title":"A Physical-social-based Group Utility Maximization framework for Cooperative Caching in Mobile Networks","authors":"Hao Zhou, Lei Xu, Jiaojiao Zhang","doi":"10.1109/WCSP.2018.8555675","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555675","url":null,"abstract":"Cooperative caching in the device-to-device (D2D) networks is an effective solution to the problem of offloading data traffic at peak times. However, one of the main challenges of cooperative caching is the selfish nature of the user, and some users only cache what they are interested in and don't care about other people's needs. In this paper, we investigate a physical-social-based cooperative caching framework, considering the physical-social tie as a non-monetary incentive to motivate the data cache and share between users by using D2D communication. Specifically, we first define a novel physical-social tie, combining the physical factors and social relationship. After that, we formulate two mathematical programming models with or without the consideration of indirect physical-social tie, to find an optimal caching strategy with the target of maximizing the social group utility. Moreover, we adopt Six Degrees of Separation to analyze the indirect physical-social tie between users when these social users with direct physical-social tie cannot meet the date request of the user, and then devise an indirect social group formation algorithm (ISGFA) to obtain the indirect social group of the user. Finally, simulation results shows that the caching scheme obtained from our model is efficient and outperforms other caching schemes that without considering the physical-social tie.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133923986","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
Mode Filtering with a Small Horizontal Line Array* 模式过滤与一个小的水平线阵列*
Yifeng Zhang, Jinjin Wang, Guolong Liang, Zhibo Shi
Mode filtering is a key procedure in passive localization or source depth discrimination. Since the horizontal line array (HLA) lacks sampling of modes in depth direction, the orthogonality of modes can't be utilized in mode filtering with a HLA. Thus, the mode filtering with a HLA, especially with a small HLA is generally a difficult problem. In this paper, we focus on the mode filtering with a small HLA, which can be applied to the passive localization or source depth discrimination with a small HLA. Firstly, the pressure received on the HLA is describe by normal mode model, and several classical mode filters are introduced. Then considering the modal amplitudes are corresponding to the wavenumbers, we regard the mode filtering as generalized beamforming, which is performed in the wavenumber domain. Through constraining the maximum side lobe minimum, the modal amplitudes are beamformed. Finally, the performance of the proposed mode filter is evaluated relative to other methods in Monte Carlo simulation.
模式滤波是被动定位或源深度识别的关键步骤。由于水平线阵列(HLA)在深度方向上缺少模式采样,因此无法利用模式的正交性进行模式滤波。因此,HLA的模式过滤,特别是小HLA的模式过滤通常是一个难题。本文研究了小HLA的模式滤波方法,该方法可应用于小HLA的被动定位或源深度识别。首先,用正态模态模型描述了HLA上的压力,并介绍了几种经典的模态滤波器。然后考虑到模态幅值与波数对应,将模态滤波看作是在波数域中进行的广义波束形成。通过约束最大旁瓣最小值,对模态振幅进行波束形成。最后,在蒙特卡罗仿真中对该滤波器的性能进行了评价。
{"title":"Mode Filtering with a Small Horizontal Line Array*","authors":"Yifeng Zhang, Jinjin Wang, Guolong Liang, Zhibo Shi","doi":"10.1109/WCSP.2018.8555890","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555890","url":null,"abstract":"Mode filtering is a key procedure in passive localization or source depth discrimination. Since the horizontal line array (HLA) lacks sampling of modes in depth direction, the orthogonality of modes can't be utilized in mode filtering with a HLA. Thus, the mode filtering with a HLA, especially with a small HLA is generally a difficult problem. In this paper, we focus on the mode filtering with a small HLA, which can be applied to the passive localization or source depth discrimination with a small HLA. Firstly, the pressure received on the HLA is describe by normal mode model, and several classical mode filters are introduced. Then considering the modal amplitudes are corresponding to the wavenumbers, we regard the mode filtering as generalized beamforming, which is performed in the wavenumber domain. Through constraining the maximum side lobe minimum, the modal amplitudes are beamformed. Finally, the performance of the proposed mode filter is evaluated relative to other methods in Monte Carlo simulation.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131498060","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
Promoting and Balancing Resource Utilization via Integration by Exploiting the Time-varying Property of Resource Requirements 利用资源需求的时变特性,通过整合促进和平衡资源利用
Luyao Jin, Hongguang Sun, Min Sheng, Yan Shi, Jiandong Li
Virtualization technology improves the flexibility of a cloud data center network (CDCN) in resource allocation and leads to a dramatic increase in the resource utilization. Virtual network embedding or virtual machines placement refers to the problem of providing resources for tenants in CDCN. Most prior literature considers the conservative resource allocation strategy where the maximum resource requirement of virtual requests is always satisfied during their life time regardless of the resource requirement fluctuation. Such methods will definitely result in the resource wastage. By taking into account the time-varying resource requirement, we propose a novel virtual machine placement method, named MIE (Matching-based Integration for Embedding) in this paper. The key part of MIE is to enhance the resource utilization of physical machines (PM) and reduce their utilization fluctuation over time dimension by integrating the requirements with different variation tendencies. Our simulation experiments show that MIE can not only improve the resource utilization of physical machines, but also maintain the resource usage more stable. What's more, the number of active PMs is reduced and the acceptance ratio of virtual requests is enhanced.
虚拟化技术提高了云数据中心网络在资源分配方面的灵活性,极大地提高了资源的利用率。虚拟网络嵌入或虚拟机放置是指在CDCN中为租户提供资源的问题。以往的文献大多采用保守的资源分配策略,在虚拟请求的生命周期内,无论资源需求波动如何,都能满足虚拟请求的最大资源需求。这样的方法肯定会造成资源的浪费。考虑到资源需求随时间的变化,本文提出了一种新的虚拟机放置方法——基于匹配的嵌入集成(MIE)。MIE的关键是通过整合具有不同变化趋势的需求,提高物理机的资源利用率,降低物理机利用率随时间维度的波动。我们的仿真实验表明,MIE不仅可以提高物理机的资源利用率,而且可以保持资源的使用更加稳定。此外,还减少了活动pm的数量,提高了虚拟请求的接受率。
{"title":"Promoting and Balancing Resource Utilization via Integration by Exploiting the Time-varying Property of Resource Requirements","authors":"Luyao Jin, Hongguang Sun, Min Sheng, Yan Shi, Jiandong Li","doi":"10.1109/WCSP.2018.8555641","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555641","url":null,"abstract":"Virtualization technology improves the flexibility of a cloud data center network (CDCN) in resource allocation and leads to a dramatic increase in the resource utilization. Virtual network embedding or virtual machines placement refers to the problem of providing resources for tenants in CDCN. Most prior literature considers the conservative resource allocation strategy where the maximum resource requirement of virtual requests is always satisfied during their life time regardless of the resource requirement fluctuation. Such methods will definitely result in the resource wastage. By taking into account the time-varying resource requirement, we propose a novel virtual machine placement method, named MIE (Matching-based Integration for Embedding) in this paper. The key part of MIE is to enhance the resource utilization of physical machines (PM) and reduce their utilization fluctuation over time dimension by integrating the requirements with different variation tendencies. Our simulation experiments show that MIE can not only improve the resource utilization of physical machines, but also maintain the resource usage more stable. What's more, the number of active PMs is reduced and the acceptance ratio of virtual requests is enhanced.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131217626","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
Energy-efficient Optimization Scheme for SWIPT-based Distributed Antenna System 基于swipt的分布式天线系统节能优化方案
Junya Chu, Xiangbin Yu, He Li, Qiuming Zhu
In this paper, an energy efficient optimization scheme with low complexity for simultaneous wireless information and power transfer (SWIPT)-based distributed antenna system (DAS) is presented. The aim is to optimize energy efficiency (EE) with the constraints on maximum transmit power of each distributed antenna (DA) port and minimum harvested energy. By analyzing the structure of the objective problem, it is found that the EE optimization problem, which combines transmit power allocation (PA) with power splitting (PS) problem, can be predigested to an optimized one of PA. Based on this, utilizing Karush-Kuhn-Tucker (KKT) conditions and Lambert function, we can obtain the general form of optimal PA and corresponding closed-form solution. Finally, a low-complexity algorithm without iteration is put forward to attain the optimal number of valid DA ports and the homologous PA, as well as the power splitting ratio. Through Monte Carlo simulations, the validity of the proposed scheme and algorithm for SWIPT-based DAS are well verified.
提出了一种基于同步无线信息与功率传输(SWIPT)的分布式天线系统(DAS)的低复杂度节能优化方案。在每个分布式天线(DA)端口的最大发射功率和最小收获能量的约束下,优化能量效率(EE)。通过分析目标问题的结构,发现将发射功率分配(PA)问题与功率分割(PS)问题相结合的EE优化问题可以简化为功率分配的优化问题。在此基础上,利用Karush-Kuhn-Tucker (KKT)条件和Lambert函数,我们可以得到最优PA的一般形式和相应的闭型解。最后,提出了一种无需迭代的低复杂度算法,以获得最优的有效DA端口数和相应的PA,以及功率分割比。通过蒙特卡罗仿真,验证了该方案和算法在基于swipt的DAS中的有效性。
{"title":"Energy-efficient Optimization Scheme for SWIPT-based Distributed Antenna System","authors":"Junya Chu, Xiangbin Yu, He Li, Qiuming Zhu","doi":"10.1109/WCSP.2018.8555878","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555878","url":null,"abstract":"In this paper, an energy efficient optimization scheme with low complexity for simultaneous wireless information and power transfer (SWIPT)-based distributed antenna system (DAS) is presented. The aim is to optimize energy efficiency (EE) with the constraints on maximum transmit power of each distributed antenna (DA) port and minimum harvested energy. By analyzing the structure of the objective problem, it is found that the EE optimization problem, which combines transmit power allocation (PA) with power splitting (PS) problem, can be predigested to an optimized one of PA. Based on this, utilizing Karush-Kuhn-Tucker (KKT) conditions and Lambert function, we can obtain the general form of optimal PA and corresponding closed-form solution. Finally, a low-complexity algorithm without iteration is put forward to attain the optimal number of valid DA ports and the homologous PA, as well as the power splitting ratio. Through Monte Carlo simulations, the validity of the proposed scheme and algorithm for SWIPT-based DAS are well verified.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133707255","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
Delay Minimized Task Scheduling in Fog-Enabled IoT Networks 雾支持物联网网络中延迟最小化的任务调度
Guowei Zhang, Fei Shen, Yueyue Zhang, Rong Yang, Yang Yang, Eduard Axel Jorswieck
Through offloading the computing tasks of the terminal nodes (TNs) to the fog nodes (FNs) located at the network edge, fog computing is expected to address the unacceptable processing delay and heavy link burden existed in current cloud-based Internet of Things (IoT) networks. How to take full use of the computing resources deployed on the FNs is vital to provide high quality offloading services for delay-sensitive TN tasks in fog-enabled IoT networks. In this paper, we construct a general analytical model for the task offloading delay in a fog-enabled IoT network. The optimal solution including the subtask sizes and the TN transmission power are obtained by the proposed Delay-Minimized Task Offloading (DMTO) algorithm that minimizes the task offloading delay. Extensive simulations are carried out in a fog-enabled IoT network, and the numerical results indicate that the proposed algorithm can effectively provide the optimal offloading solutions for the delay-sensitive tasks.
通过将终端节点(tn)的计算任务卸载到位于网络边缘的雾节点(FNs),雾计算有望解决当前基于云的物联网(IoT)网络中存在的不可接受的处理延迟和沉重的链路负担。如何充分利用部署在FNs上的计算资源,对于在雾化物联网网络中为延迟敏感的TN任务提供高质量的卸载服务至关重要。在本文中,我们构建了一个雾蒙蒙的物联网网络中任务卸载延迟的通用分析模型。提出的DMTO (delay - minimattask Offloading)算法使任务卸载延迟最小化,得到了包括子任务大小和TN传输功率在内的最优解。在有雾的物联网网络中进行了大量的仿真,数值结果表明,该算法可以有效地为延迟敏感任务提供最优卸载方案。
{"title":"Delay Minimized Task Scheduling in Fog-Enabled IoT Networks","authors":"Guowei Zhang, Fei Shen, Yueyue Zhang, Rong Yang, Yang Yang, Eduard Axel Jorswieck","doi":"10.1109/WCSP.2018.8555532","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555532","url":null,"abstract":"Through offloading the computing tasks of the terminal nodes (TNs) to the fog nodes (FNs) located at the network edge, fog computing is expected to address the unacceptable processing delay and heavy link burden existed in current cloud-based Internet of Things (IoT) networks. How to take full use of the computing resources deployed on the FNs is vital to provide high quality offloading services for delay-sensitive TN tasks in fog-enabled IoT networks. In this paper, we construct a general analytical model for the task offloading delay in a fog-enabled IoT network. The optimal solution including the subtask sizes and the TN transmission power are obtained by the proposed Delay-Minimized Task Offloading (DMTO) algorithm that minimizes the task offloading delay. Extensive simulations are carried out in a fog-enabled IoT network, and the numerical results indicate that the proposed algorithm can effectively provide the optimal offloading solutions for the delay-sensitive tasks.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702217","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}
引用次数: 14
期刊
2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)
全部 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