检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《西安交通大学学报》2016年第12期136-141,共6页Journal of Xi'an Jiaotong University
基 金:国家自然科学基金资助项目(61202380);天津市自然科学基金资助项目(12JCQNJC00300)
摘 要:结合了传递概率与社会网络分析的路由设计,可以充分利用网络中节点的运动特性增强端到端的消息传输质量。通过对节点进行相遇历史信息分析和社会关系分析,提出了基于传递概率与社会网络分析的延迟容忍网络路由(RPRSA)。相遇历史信息分析是通过节点在相遇时进行独立概率计算和彼此概率信息交换,使得节点可以预测它在短期内的移动特性;社会关系分析是通过节点在长期内的移动所形成的关系亲疏程度,使得节点可以预测它的长期运动规律。仿真结果表明,该路由算法能够很好地利用节点的运动特性,保证弱社会关系节点和孤立节点有更好的消息传输质量,更好地提高节点端到端的消息传输质量。Routing designs that combine with relay probability and social network analysis can fully utilize movement characteristic of nodes and enhance quality of message transmission from end to end. A delay-tolerant network routing based on probability of relay and social network analysis (RPRSA) is proposed based on the analyses of historical information of nodes encounters and social relationship. The analysis of historical information is to forecast short-run movement characteristic by independent probability computation and probability information exchange with each other when nodes encounter, and the analysis of social relation is to forecast long-run movement law by the degree of intimacy among nodes formed in long-run movements. Simulation results show that the proposed routing makes full use of movement features among nodes, guarantees the quality of messages transmission among the nodes with weak social relation and the isolate nodes, and enhances the quality of messages transmission from end to end.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222