针对无线传感器网络的低能耗要求以及不同的应用需求,提出一种保障时延、能量高效的路由协议(DGEER).节点沿着最短路径发送时延敏感数据到目的节点,从而使其时延尽可能小;非时延敏感数据根据邻居节点的剩余能量、数据队列占空比和梯度...针对无线传感器网络的低能耗要求以及不同的应用需求,提出一种保障时延、能量高效的路由协议(DGEER).节点沿着最短路径发送时延敏感数据到目的节点,从而使其时延尽可能小;非时延敏感数据根据邻居节点的剩余能量、数据队列占空比和梯度关系来选择下一跳节点,能够在网络发生堵塞时避开网络热点以缓解拥塞.仿真结果表明:与传统的PRTR(potential based real-time routing)协议相比,DGEER协议能够在减小时延敏感数据网络延迟的前提下均衡网络能耗,延长网络生存周期.展开更多
The use of multicast transmission can efficiently reduce the consumption of network resources by jointly serving multiple destinations with a single source node. Currently, many multicast applications impose the const...The use of multicast transmission can efficiently reduce the consumption of network resources by jointly serving multiple destinations with a single source node. Currently, many multicast applications impose the constraint wherein multicast flows must be processed by a series of Virtual Network Functions(VNFs) before reaching their destinations. Given a multicast transmission, there are usually multiple server nodes, each of which is able to host all the required VNFs. Thus, the multicast flow should be initially steered to one or a few selected server nodes that act as pseudo sources, and the destinations will then retrieve new flow from any of these pseudo sources.In this paper, we model this kind of multicast as an uncertain multicast with multiple pseudo sources, whose routing structure is usually a forest consisting of multiple isolated trees. We then characterize and construct the Delay-guaranteed Minimum Cost Forest(D-MCF) such that each path from the source to the destination satisfies the end-to-end delay constraint. To tackle this NP-hard problem, we design two efficient methods, the Partition Algorithm(PA) and the Combination Algorithm(CA), to approximate the optimal solution. Theoretical analyses and evaluations indicate that these two methods can generate the desired routing forest for any multicast transfer.Moreover, the PA method achieves a better balance between performance and time consumption than the CA method. The evaluation results show that PA-(Ω+20) can reduce total cost by 49:02% while consuming 12:59% more time, thus significantly outperforming the CA-(Ω+20) method.展开更多
为了在保证无线传感器网络时延要求的同时最小化功率消耗,提出一种基于占空比控制和时延保证的传感器网络队列管理算法(DQC)。该算法根据不断变化的网络条件,为了更好地控制节点占空比和队列阈值,采用一种双向控制器,该控制器提供一种...为了在保证无线传感器网络时延要求的同时最小化功率消耗,提出一种基于占空比控制和时延保证的传感器网络队列管理算法(DQC)。该算法根据不断变化的网络条件,为了更好地控制节点占空比和队列阈值,采用一种双向控制器,该控制器提供一种延迟通知机制,可以根据应用需求和时变时延要求为每个节点确定一个适当的休眠时间和队列长度,并基于控制理论推导出双向控制器的稳定状态,获得了保证稳定状态的渐近稳定控制参数的条件。实验仿真结果表明,相比基于自适应占空比控制的算法和基于拥塞性能改进的队列管理机制,所提算法在端至端延迟时间上分别缩短了38.8%和36.0%的时间,平均功率消耗分别减少了46.5 m W和27.5 m W,在延迟时间的控制和能量效率的提升上表现出了更好的性能。展开更多
文摘针对无线传感器网络的低能耗要求以及不同的应用需求,提出一种保障时延、能量高效的路由协议(DGEER).节点沿着最短路径发送时延敏感数据到目的节点,从而使其时延尽可能小;非时延敏感数据根据邻居节点的剩余能量、数据队列占空比和梯度关系来选择下一跳节点,能够在网络发生堵塞时避开网络热点以缓解拥塞.仿真结果表明:与传统的PRTR(potential based real-time routing)协议相比,DGEER协议能够在减小时延敏感数据网络延迟的前提下均衡网络能耗,延长网络生存周期.
基金partially supported by the National Natural Science Foundation for Outstanding Excellent Young Scholars of China (No. 61422214)the National Natural Science Foundation of China (No. 61772544)+3 种基金the National Key Basic Research and Development (973) Program of China (No. 2014CB347800)the Hunan Provincial Natural Science Fund for Distinguished Young Scholars (No. 2016JJ1002)the Guangxi Cooperative Innovation Center of Cloud Computing and Big Data (Nos. YD16507 and YD17X11)he NUDT Research Plan (No. ZK17-03-50)
文摘The use of multicast transmission can efficiently reduce the consumption of network resources by jointly serving multiple destinations with a single source node. Currently, many multicast applications impose the constraint wherein multicast flows must be processed by a series of Virtual Network Functions(VNFs) before reaching their destinations. Given a multicast transmission, there are usually multiple server nodes, each of which is able to host all the required VNFs. Thus, the multicast flow should be initially steered to one or a few selected server nodes that act as pseudo sources, and the destinations will then retrieve new flow from any of these pseudo sources.In this paper, we model this kind of multicast as an uncertain multicast with multiple pseudo sources, whose routing structure is usually a forest consisting of multiple isolated trees. We then characterize and construct the Delay-guaranteed Minimum Cost Forest(D-MCF) such that each path from the source to the destination satisfies the end-to-end delay constraint. To tackle this NP-hard problem, we design two efficient methods, the Partition Algorithm(PA) and the Combination Algorithm(CA), to approximate the optimal solution. Theoretical analyses and evaluations indicate that these two methods can generate the desired routing forest for any multicast transfer.Moreover, the PA method achieves a better balance between performance and time consumption than the CA method. The evaluation results show that PA-(Ω+20) can reduce total cost by 49:02% while consuming 12:59% more time, thus significantly outperforming the CA-(Ω+20) method.
文摘为了在保证无线传感器网络时延要求的同时最小化功率消耗,提出一种基于占空比控制和时延保证的传感器网络队列管理算法(DQC)。该算法根据不断变化的网络条件,为了更好地控制节点占空比和队列阈值,采用一种双向控制器,该控制器提供一种延迟通知机制,可以根据应用需求和时变时延要求为每个节点确定一个适当的休眠时间和队列长度,并基于控制理论推导出双向控制器的稳定状态,获得了保证稳定状态的渐近稳定控制参数的条件。实验仿真结果表明,相比基于自适应占空比控制的算法和基于拥塞性能改进的队列管理机制,所提算法在端至端延迟时间上分别缩短了38.8%和36.0%的时间,平均功率消耗分别减少了46.5 m W和27.5 m W,在延迟时间的控制和能量效率的提升上表现出了更好的性能。
