咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Resource provisioning for comp... 收藏

Resource provisioning for computation and communication in multi-cell wireless networks

Resource provisioning for computation and communication in multi-cell wireless networks

作     者:Yang Xiumei Chen Huaxia Zhang Mengying 杨秀梅;Chen Huaxia;Zhang Mengying

作者机构:Shanghai Institute of Microsystem and Information TechnologyChinese Academy of SciencesShanghai 200050P.R.China Key Laboratory of Wireless Sensor Network and CommunicationsChinese Academy of SciencesShanghai 200050P.R.China 

出 版 物:《High Technology Letters》 (高技术通讯(英文版))

年 卷 期:2021年第27卷第2期

页      面:121-128页

核心收录:

学科分类:080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基  金:Supported by the Shanghai Sailing Program(No.18YF1427900) the National Natural Science Foundation of China(No.61471347) the Shanghai Pujiang Program(No.2020PJD081) 

主  题:resource provisioning computation and communication multi-cell wireless network network edge 

摘      要:The convergence of computation and communication at network edges plays a significant role in coping with computation-intensive and delay-critical *** the stage of network planning,the resource provisioning problem for edge nodes has to be investigated to provide prior information for future system *** work focuses on how to quantify the computation capabilities of access points at network edges when provisioning resources of computation and communication in multi-cell wireless *** problem is formulated as a discrete and non-convex minimization problem,where practical constraints including delay requirements,the inter-cell interference,and resource allocation strategies are *** iterative algorithm is also developed based on decomposition theory and fractional programming to solve this *** analysis shows that the necessary computation capability needed for certain delay guarantee depends on resource allocation strategies for delay-critical *** delay-tolerant tasks,it can be approximately estimated by a derived lower bound which ignores the scheduling *** efficiency of the proposed algorithm is demonstrated using numerical results.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分