基于移动模型相似度评价机制(MMSE,movement model similarity evaluation scheme),提出一种面向移动范围转发动态多副本车载时延容忍网络路由协议(MROFDM,movement range oriented forwarding and dynamicmulti-copies routing protoc...基于移动模型相似度评价机制(MMSE,movement model similarity evaluation scheme),提出一种面向移动范围转发动态多副本车载时延容忍网络路由协议(MROFDM,movement range oriented forwarding and dynamicmulti-copies routing protocol)。该协议利用移动模型间的相似度和车辆的本地实时信息,将数据向目的节点的移动范围转发,同时采用副本均衡策略,动态调整不同类型数据分组的副本数目。通过仿真实验对比现有多副本协议,验证了MROFDM在性能上的优越性以及在不同比例移动模型下的适应性。展开更多
区块链的本质是节点矿权竞争,网络的实时连通性是前提和保障,但尚存在具有数据传输时延的容迟网络,使得其中的节点在区块链活动中完全处于劣势。为了解决容迟网络难以部署区块链系统的问题,构建了基于附块和离散令牌协商的区块链交易架...区块链的本质是节点矿权竞争,网络的实时连通性是前提和保障,但尚存在具有数据传输时延的容迟网络,使得其中的节点在区块链活动中完全处于劣势。为了解决容迟网络难以部署区块链系统的问题,构建了基于附块和离散令牌协商的区块链交易架构,为非持续连通网络中的节点参与区块链活动提供服务支撑。首先构造了命名为附块的辅助区块,用以作为区分联网和断网时生成的新区块的依据。其次以矿工身份标识和若干随机数为参数,生成具有唯一性和可验证性的离散令牌,用于获取挖矿资质。在此基础上,设计了基于离散令牌的挖矿资质归属算法和分支处理算法,前者避免了PoS(proof of stake)和DPoS(delegated proof of stake)首富作恶问题,后者保证了断网时生成的附链以均等概率追加到主链上。最后设计了附链二次共识方案,解决了断网时生成区块内可能存在的虚假和重复交易问题。理论证明和实验分析表明,提出的架构在可靠性、接受性、交易吞吐量、交易确认时间和分支率等指标上具有一定的优势。展开更多
根据车载自组织网络的特点,提出了一种对喷射等待路由进行优化设计得到的容迟网络路由算法:运动感知的喷射搜索(motion-aware spray and seek,MASS)路由,对其优化和改进的原理以及算法的实现步骤进行了阐释.对MASS以及多种经典DTN路由...根据车载自组织网络的特点,提出了一种对喷射等待路由进行优化设计得到的容迟网络路由算法:运动感知的喷射搜索(motion-aware spray and seek,MASS)路由,对其优化和改进的原理以及算法的实现步骤进行了阐释.对MASS以及多种经典DTN路由算法在ONE平台上进行模拟仿真,通过参数绘图对比分析多种路由算法的性能及其差异,得到VANET环境下各个路由算法的性能对比结果,进而证明了本文所提出的MASS算法在DTN网络环境中的有效性以及可靠性.展开更多
Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social ne...Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people＇s movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing（SONR） was proposed which brings an adapted discrete Markov chain into nodes＇ mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.展开更多
文摘基于移动模型相似度评价机制(MMSE,movement model similarity evaluation scheme),提出一种面向移动范围转发动态多副本车载时延容忍网络路由协议(MROFDM,movement range oriented forwarding and dynamicmulti-copies routing protocol)。该协议利用移动模型间的相似度和车辆的本地实时信息,将数据向目的节点的移动范围转发,同时采用副本均衡策略,动态调整不同类型数据分组的副本数目。通过仿真实验对比现有多副本协议,验证了MROFDM在性能上的优越性以及在不同比例移动模型下的适应性。
文摘区块链的本质是节点矿权竞争,网络的实时连通性是前提和保障,但尚存在具有数据传输时延的容迟网络,使得其中的节点在区块链活动中完全处于劣势。为了解决容迟网络难以部署区块链系统的问题,构建了基于附块和离散令牌协商的区块链交易架构,为非持续连通网络中的节点参与区块链活动提供服务支撑。首先构造了命名为附块的辅助区块,用以作为区分联网和断网时生成的新区块的依据。其次以矿工身份标识和若干随机数为参数,生成具有唯一性和可验证性的离散令牌,用于获取挖矿资质。在此基础上,设计了基于离散令牌的挖矿资质归属算法和分支处理算法,前者避免了PoS(proof of stake)和DPoS(delegated proof of stake)首富作恶问题,后者保证了断网时生成的附链以均等概率追加到主链上。最后设计了附链二次共识方案,解决了断网时生成区块内可能存在的虚假和重复交易问题。理论证明和实验分析表明,提出的架构在可靠性、接受性、交易吞吐量、交易确认时间和分支率等指标上具有一定的优势。
文摘根据车载自组织网络的特点,提出了一种对喷射等待路由进行优化设计得到的容迟网络路由算法:运动感知的喷射搜索(motion-aware spray and seek,MASS)路由,对其优化和改进的原理以及算法的实现步骤进行了阐释.对MASS以及多种经典DTN路由算法在ONE平台上进行模拟仿真,通过参数绘图对比分析多种路由算法的性能及其差异,得到VANET环境下各个路由算法的性能对比结果,进而证明了本文所提出的MASS算法在DTN网络环境中的有效性以及可靠性.
基金supported by the National Natural Science Foundation of China(61171097)the State Major Science and Technology Special Projects(2012ZX03004001)
文摘Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people＇s movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing（SONR） was proposed which brings an adapted discrete Markov chain into nodes＇ mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing.
