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

一种基于位置信息的分簇算法*
引用本文:刘铮,马正新,石荣.一种基于位置信息的分簇算法*[J].计算机应用研究,2011,28(12):4691-4634.
作者姓名:刘铮  马正新  石荣
作者单位:1. 清华大学电子工程系,北京,100084
2. 中国电子科技集团公司第二十九研究所,成都,610036
基金项目:综合控制国家重点实验室资助项目
摘    要:用户分簇是移动自组网通信需要解决的基本问题.从分簇结构与频率规划的角度出发,提出一种基于位置信息的分簇算法.该算法采用估计节点运动速度、引入虚拟网络中心节点、预警簇头失效、均衡簇间负载等方法,达到既形成稳定合理的分簇结构又易于频率规划的目的.仿真结果表明,基于位置信息的分簇算法极大地改善了吞吐量、丢包率及延时等网络性能,可用于多节点、中高速移动环境.

关 键 词:移动自组网  分簇  位置信息  虚拟网络中心节点  簇内生存时间  中高速移动环境

Location information based clustering algorithm
LIU Zheng,MA Zheng-xin,SHI Rong.Location information based clustering algorithm[J].Application Research of Computers,2011,28(12):4691-4634.
Authors:LIU Zheng  MA Zheng-xin  SHI Rong
Affiliation:LIU Zheng1,MA Zheng-xin1,SHI Rong2(1.Dept.of Electronic Engineering,Tsinghua University,Beijing 100084,China,2.China Electronics Technology Group Corporation,The 29th Institute,Chengdu 610036,China)
Abstract:User clustering is a fundamental problem in mobile Ad hoc network. Taking both clustering structure and frequency planning into consideration, this paper proposed a location information based clustering algorithm. By node velocity estimation, introduction of virtual network central node, early warning for cluster head failure, inter-cluster load balancing, the proposed algorithm not only succeeded in forming a stable and reasonable clustering structure, but also was easy for frequency planning. Simulation result shows that the location information based clustering algorithm significantly improve network performance such as throughput, packet loss rate and delay, and is suitable for a multi-node, middle or high speed mobile environment.
Keywords:mobile Ad hoc network  clustering  location information  virtual network central node  in-cluster survival time  middle or high speed mobile environment
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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