检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学宽带泛在接入技术研究所,重庆400065
出 处:《北京邮电大学学报》2013年第6期64-68,共5页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61001105;61371097)
摘 要:中继节点的选择将直接影响机会网络的数据转发性能.对此提出一种带有投递概率感知的低开销机会网络路由机制.利用节点间的间接相遇时间间隔估计间接相遇概率,并结合直接相遇概率预测节点间的综合相遇概率,进而合理地选择中继节点,以极低开销的方式转发数据.结果表明,在数据传输过程中,所提出机制的负载率平均降低了64.9%.The selection of relay node will directly affect the data forwarding performance of opportunity network. Therefore the cost-efficient routing mechanism with delivery probability perception (DPP- CERM) in opportunistic networks is proposed. The probability of comprehensive encounter between nodes by combining the probability of direct encounter and indirect encounter is estimated and evaluated by in- direct inter-meeting time between nodes. The relay node reasonably and forward data with very lower cost were chosen thereafter. It is shown that DPP-CERM can reduce the average overhead ratio of data for- warding at least 64.9%.
分 类 号:TP393.04[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28