首页> 外文会议>IFIP TC6 International Conference on Personal Wireless Communications >Stable and Energy Efficient Clustering of Wireless Ad-Hoc Networks with LIDAR Algorithm
【24h】

Stable and Energy Efficient Clustering of Wireless Ad-Hoc Networks with LIDAR Algorithm

机译:LIDAR算法的无线ad-hoc网络稳定和节能集群

获取原文

摘要

The main objective of clustering in mobile ad-hoc network environments is to identify suitable node representatives, I.e. cluster heads (CHs) to store routing and topology information; CHs should be elected so as to maximize clusters stability, that is to prevent frequent cluster re-structuring. A popular clustering algorithm (LID) suggests CH election based on node Ids (nodes with locally lowest ID value become CHs). Although fast and simple, this method is biased against nodes with low Ids, which are likely to serve as CHs for long periods and are therefore prone to rapid battery exhaustion. Herein, we propose LIDAR, a novel clustering method which represents a major improvement over traditional LID algorithm: node Ids are periodically re-assigned so that nodes with low mobility rate and high energy capacity are assigned low ID values and, therefore, are likely to serve as CHs. Our protocol also greatly reduces control traffic volume of existing algorithms during clustering maintenance phase, while not risking the energy availability of CHs. Simulation results demonstrate the efficiency, scalability and stability of our protocol against alternative approaches.
机译:在移动ad-hoc网络环境聚类的主要目的是识别合适的节点的代表,即簇头(CHS)来存储路由和拓扑信息;簇头应如此当选为最大限度地提高集群的稳定性,这是为了防止频繁的簇重新构造。一种流行的聚类算法(LID)建议基于节点ID(具有局部最低ID值成为簇头节点)CH选举。虽然快速而简单的,这种方法偏压抵靠具有低的ID,这是可能作为簇头长时间,并因此倾向于快速电池耗尽节点。在此,我们提出LIDAR,其表示比传统的LID算法的一个重大改进的新颖的聚类方法:节点ID被周期性地重新分配,使得具有低迁移率率和高能量容量节点被分配低ID值,因此,有可能作为簇头。我们的协议也大大降低的期间聚类维持阶段现有的算法控制的流量,而不是冒着簇头的能量可用性。仿真结果表明我们对替代办法的协议的效率,可扩展性和稳定性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号