首页 | 本学科首页   官方微博 | 高级检索  
     

基于代理按需生成机制的Buddy优化算法
引用本文:陶洋,陈力云.基于代理按需生成机制的Buddy优化算法[J].计算机工程,2010,36(12):133-135.
作者姓名:陶洋  陈力云
作者单位:重庆邮电大学软件技术中心,重庆,400065
基金项目:重庆市教委科技计划基金资助项目(KJ090516)
摘    要:针对移动自组网中Buddy算法的通信节点开销过大问题,设计代理按需生成机制优化Buddy算法。该机制将网络节点分为代理节点和普通客户节点,根据性能参数CV值选择性能较优的节点作为代理节点。NS2仿真结果表明,优化后的算法在保证地址快速配置的前提下能优化代理节点数、位置和性能,减少网络中节点同步的通信开销与提高代理节点的通信能力,从而提高整个网络的效率和健壮性。

关 键 词:移动自组网  代理按需生成机  动态编址

Buddy Optimized Algorithm Based on Agent On-demand Generation Mechanism
TAO Yang,CHEN Li-yun.Buddy Optimized Algorithm Based on Agent On-demand Generation Mechanism[J].Computer Engineering,2010,36(12):133-135.
Authors:TAO Yang  CHEN Li-yun
Affiliation:(Center of Software Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065)
Abstract:Aiming at the problem of communication node cost oversize for Buddy algorithm in Mobile Ad hoc NETwork(MANET), this paper designs agent on-demand generation mechanism to optimize Buddy algorithm. This mechanism divides network nodes into agent node and normal client node, it can choose the agent node by comparison of performance parameter of CV value. NS2 simulation result show that optimized algorithm can ensure deploy address rapidly to optimize node number, location and performance of agents reasonably. It also can reduce the cost of the synchronous communication, improve the ability of communication for agent node, and enhance efficiency and robustness for whole network.
Keywords:Mobile Ad hoc NETwork(MANET)  agent on-demand generation mechanism  dynamic addressing
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号