There are increasing demands for mobile health applications. This paper reports the development of a mobile health profile which dedicates to mobile applications. The mobile health profile is developed in association ...There are increasing demands for mobile health applications. This paper reports the development of a mobile health profile which dedicates to mobile applications. The mobile health profile is developed in association with the ZigBee Health Care profile and the IEEE 11073 standard which is normally applied to non-mobile applications. Since mobile sensors have to be carried by patients, the mobile health profile must facilitate mobility. In this investigation, a ZigBee fixed-mobile network (ZFMN) is defined and developed to supplement the ZigBee Health Care Profile for patient monitoring. The mobility study of ZigBee is performed using a random waypoint OPNET simulation model. In a ZFMN, the critical issue of address shortage is identified and discussed. It is analyzed that the problematic address shortage in a ZFMN may generate a huge amount of orphaned end devices and thus the packet drop percentage may potentially rise to 70%, rendering the network unable to function properly. Without introducing additional governing schemes, it is evaluated that the communication of the entire ZigBee network may paralyze. Further vigorous test are performed (by OPNET) on the communication capability of ZFMN when devices are randomly moving and sending data in 1s. It is vital to point out that under the adverse condition of address shortage, the performance of a ZFMN is still encouraging as long as the packet drop percentage has been kept below 3% before running out of address. The conclusion drawn in this analysis is that the packet drop percentage should be kept below 3% to provide a satisfactory QoS for an effective mobile health application using ZFMN such as patient monitoring. Such finding is also important for other future mobile application design of ZigBee. The address shortage issue is left as an open problem that needs attention for a resolution.展开更多
In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industr...In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industry.However,existing architectures suffer from performance bottleneck due to slow updating of contexts and inadequate flexibility.This paper presents an H-tree based reconfiguration mechanism(HRM)with Huffman-coding-like and mask addressing method in a homogeneous processing element(PE)array,which supports both programmable and data-driven modes.The proposed HRM can transfer reconfiguration instructions/contexts to a particular PE or associated PEs simultaneously in one clock cycle in unicast,multicast and broadcast mode,and shut down the unnecessary PE/PEs according to the current configuration.To verify the correctness and efficiency,we implement it in RTL synthesis and FPGA prototype.Compared to prior works,the experiment results show that the HRM has improved the work frequency by an average of 23.4%,increased the updating speed by 2×,and reduced the area by 36.9%;HRM can also power off the unnecessary PEs which reduced 51%of dynamic power dissipation in certain application configuration.Furthermore,in the data-driven mode,the system frequency can reach 214 MHz,which is 1.68×higher compared with the programmable mode.展开更多
可变长地址是未来网络领域的重要研究内容之一。针对传统路由查找算法在面向可变长地址时查找效率低的问题,提出一种基于平衡二叉树AVL(Adelson-Velskii and Landis)树和Bloom过滤器的适用于可变长地址的高效路由查找算法,简称为AVL-Bl...可变长地址是未来网络领域的重要研究内容之一。针对传统路由查找算法在面向可变长地址时查找效率低的问题,提出一种基于平衡二叉树AVL(Adelson-Velskii and Landis)树和Bloom过滤器的适用于可变长地址的高效路由查找算法,简称为AVL-Bloom算法。首先,针对可变长地址灵活可变且无界的特点,利用多个片外哈希表分别存储前缀比特位数相同的路由条目及其下一跳信息,同时应用片上Bloom过滤器加速搜索可能匹配的路由前缀;其次,为了解决基于哈希技术的路由查找算法在查找最长前缀路由时需多次哈希对比的问题,引入AVL树技术,即通过AVL树组织每组路由前缀集合的Bloom过滤器及其哈希表,优化路由前缀长度的查询顺序,并减少哈希计算次数进而降低查询时间;最后,在3种不同的可变长地址数据集上将所提算法与METrie(Multi-Entrance-Trie)和COBF(Controlled prefix and One-hashing Bloom Filter)这两种传统路由查找算法进行对比实验。实验结果表明,AVL-Bloom算法的查询时间明显少于METrie和COBF算法,分别减少了将近83%和64%;同时,AVL-Bloom算法在路由表项数变化较大的情况下也能维持稳定的查找性能,适用于可变长地址的路由查找转发。展开更多
在IPv6物联网中,RPL路由模型已得到广泛的认可.然而对于规模较大的多跳网络结构,RPL面临着部分转发节点路由容量较大的问题.而且物联子网中扁平化的地址结构使得这一问题更为突出.设计了支持IPv6地址自动分配的轻量级树型转发模型TFAD(t...在IPv6物联网中,RPL路由模型已得到广泛的认可.然而对于规模较大的多跳网络结构,RPL面临着部分转发节点路由容量较大的问题.而且物联子网中扁平化的地址结构使得这一问题更为突出.设计了支持IPv6地址自动分配的轻量级树型转发模型TFAD(tree forwarding model with address automatically distributed),将物联子网中的节点构造成一棵层次转发树,树节点的IPv6地址在子树范围内高度聚合.各节点只需存储与其子节点数相当的转发项,即可完成TFAD模型的数据转发.此外,设计了TFAD模型的备份父节点机制,当网络出现故障时能够以子树为单位进行网络拓扑重构,实现物联子网的快速路由恢复.实验验证了TFAD模型的高效路由存储性能以及快速的路由学习能力和故障后路由恢复能力.展开更多
文摘There are increasing demands for mobile health applications. This paper reports the development of a mobile health profile which dedicates to mobile applications. The mobile health profile is developed in association with the ZigBee Health Care profile and the IEEE 11073 standard which is normally applied to non-mobile applications. Since mobile sensors have to be carried by patients, the mobile health profile must facilitate mobility. In this investigation, a ZigBee fixed-mobile network (ZFMN) is defined and developed to supplement the ZigBee Health Care Profile for patient monitoring. The mobility study of ZigBee is performed using a random waypoint OPNET simulation model. In a ZFMN, the critical issue of address shortage is identified and discussed. It is analyzed that the problematic address shortage in a ZFMN may generate a huge amount of orphaned end devices and thus the packet drop percentage may potentially rise to 70%, rendering the network unable to function properly. Without introducing additional governing schemes, it is evaluated that the communication of the entire ZigBee network may paralyze. Further vigorous test are performed (by OPNET) on the communication capability of ZFMN when devices are randomly moving and sending data in 1s. It is vital to point out that under the adverse condition of address shortage, the performance of a ZFMN is still encouraging as long as the packet drop percentage has been kept below 3% before running out of address. The conclusion drawn in this analysis is that the packet drop percentage should be kept below 3% to provide a satisfactory QoS for an effective mobile health application using ZFMN such as patient monitoring. Such finding is also important for other future mobile application design of ZigBee. The address shortage issue is left as an open problem that needs attention for a resolution.
基金supported by the National Natural Science Foundation of China (Nos. 61834005, 61602377, 61772417, 61802304, 61874087)the Shaanxi International Science and Technology Cooperation Program No. 2018KW-006+1 种基金Shaanxi Provincial Key R&D Plan under Grant No. 2017GY-060Shaanxi Province Co-ordination Innovation Project of Science and Technology under Grant No. 2016KTZDGY02-04-02
文摘In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industry.However,existing architectures suffer from performance bottleneck due to slow updating of contexts and inadequate flexibility.This paper presents an H-tree based reconfiguration mechanism(HRM)with Huffman-coding-like and mask addressing method in a homogeneous processing element(PE)array,which supports both programmable and data-driven modes.The proposed HRM can transfer reconfiguration instructions/contexts to a particular PE or associated PEs simultaneously in one clock cycle in unicast,multicast and broadcast mode,and shut down the unnecessary PE/PEs according to the current configuration.To verify the correctness and efficiency,we implement it in RTL synthesis and FPGA prototype.Compared to prior works,the experiment results show that the HRM has improved the work frequency by an average of 23.4%,increased the updating speed by 2×,and reduced the area by 36.9%;HRM can also power off the unnecessary PEs which reduced 51%of dynamic power dissipation in certain application configuration.Furthermore,in the data-driven mode,the system frequency can reach 214 MHz,which is 1.68×higher compared with the programmable mode.
文摘可变长地址是未来网络领域的重要研究内容之一。针对传统路由查找算法在面向可变长地址时查找效率低的问题,提出一种基于平衡二叉树AVL(Adelson-Velskii and Landis)树和Bloom过滤器的适用于可变长地址的高效路由查找算法,简称为AVL-Bloom算法。首先,针对可变长地址灵活可变且无界的特点,利用多个片外哈希表分别存储前缀比特位数相同的路由条目及其下一跳信息,同时应用片上Bloom过滤器加速搜索可能匹配的路由前缀;其次,为了解决基于哈希技术的路由查找算法在查找最长前缀路由时需多次哈希对比的问题,引入AVL树技术,即通过AVL树组织每组路由前缀集合的Bloom过滤器及其哈希表,优化路由前缀长度的查询顺序,并减少哈希计算次数进而降低查询时间;最后,在3种不同的可变长地址数据集上将所提算法与METrie(Multi-Entrance-Trie)和COBF(Controlled prefix and One-hashing Bloom Filter)这两种传统路由查找算法进行对比实验。实验结果表明,AVL-Bloom算法的查询时间明显少于METrie和COBF算法,分别减少了将近83%和64%;同时,AVL-Bloom算法在路由表项数变化较大的情况下也能维持稳定的查找性能,适用于可变长地址的路由查找转发。
文摘在IPv6物联网中,RPL路由模型已得到广泛的认可.然而对于规模较大的多跳网络结构,RPL面临着部分转发节点路由容量较大的问题.而且物联子网中扁平化的地址结构使得这一问题更为突出.设计了支持IPv6地址自动分配的轻量级树型转发模型TFAD(tree forwarding model with address automatically distributed),将物联子网中的节点构造成一棵层次转发树,树节点的IPv6地址在子树范围内高度聚合.各节点只需存储与其子节点数相当的转发项,即可完成TFAD模型的数据转发.此外,设计了TFAD模型的备份父节点机制,当网络出现故障时能够以子树为单位进行网络拓扑重构,实现物联子网的快速路由恢复.实验验证了TFAD模型的高效路由存储性能以及快速的路由学习能力和故障后路由恢复能力.
