一种基于分区的移动P2P网络路由算法  

A Partition-Based Routing Algorithm for Mobile P2P Network

作　　者：赵振东[1] 刘方爱[1] 

机构地区：[1]山东师范大学信息科学学院,山东济南250014

出　　处：《计算机技术与发展》2011年第9期47-50,共4页Computer Technology and Development

基　　金：国家自然科学基金资助项目(90612003)

摘　　要：校园内无线网络的普遍使用与移动设备性能的快速发展,使移动P2P技术得到了更多的关注。但当前对移动对等网络的研究还缺乏统一而明确的定义,还存在很多未能很好地解决的问题。文中的研究目的是如何有效组织移动节点,进行资源交换。针对校园无线网络环境,提出了一种基于分区模型的移动P2P网络结构。对节点历史行为统计,计算节点性能值。并利用分区网络模型和机会路由的思想提出了一种改进路由算法,实现区域内和区域间路由转发,降低了路由开销,提高了网络性能。With the widespread use of campus wireless network and the rapid development of mobile equipment performance,people pay more attention on the mobile P2P technology.But the current research on the mobile P2P network is short of an accurate definition and a great number of questions are still needed to be studied deeply.Purpose of this paper is how to effectively organize mobile node for the resource exchange.Aimming at the WLAN environment in the school,present a mobile P2P model based on partition model.Use historical performance statistics of the node to calculate the value of the node performance.And also using the partition model and the idea of opportunistic routing protocol propose an improved routing algorithm,achieve intra-regional and inter-regional routes forward,reduce the routing overhead and improve network performance.

关 键 词：移动对等网络 分区网络结构 路由算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]