检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:He Tengjiao Kwanwu Chin Wang Yishun Sieteng Soh
机构地区:[1]College of Information Science and Technology,Jinan University,Guangzhou,China [2]School of Electrical,Computer and Telecommunications Engineering,University of Wollongong,NSW,Australia [3]School of Electrical Engineering,Computing and Mathematical Sciences,Curtin University,WA,Australia
出 处:《China Communications》2024年第12期108-125,共18页中国通信(英文版)
基 金:This research is partially supported by Guangzhou Science and Technology Foundation Committee,Grant No.202201010394;the National Natural Science Foundation of China,Grant No.61902146。
摘 要:This paper considers link scheduling in a wireless network comprising of two types of nodes:(i)hybrid access points(HAPs)that harvest solar en-ergy,and(ii)devices that harvest radio frequency(RF)energy whenever HAPs transmit.Our aim is to de-rive the shortest possible link schedule that determines the transmission time of inter-HAPs links,and uplinks from devices to HAPs.We first outline a mixed in-teger linear program(MILP),which can be run by a central node to determine the optimal schedule and transmit power of HAPs and devices.We then out-line a game theory based protocol called Distributed Schedule Minimization Protocol(DSMP)that is run by HAPs and devices.Advantageously,it does not require causal energy arrivals and channel gains in-formation.Our results show that DSMP produces schedule lengths that are at most 1.99x longer than the schedule computed by MILP.
关 键 词:channel access finite battery mathemati-cal program renewable energy wireless power trans-fer
分 类 号:TM73[电气工程—电力系统及自动化] TN92[电子电信—通信与信息系统] O225[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.5.27