首页> 外文会议>IEEE GLOBECOM Workshops >A Realistic Weighted Clustering algorithm for data gathering in single hop cell phone based sensor network
【24h】

A Realistic Weighted Clustering algorithm for data gathering in single hop cell phone based sensor network

机译:一种基于单跳手机的传感器网络中的数据收集的现实加权聚类算法

获取原文

摘要

We present Weight based Realistic Clustering algorithm (WRCA) for energy efficient data collection from human based wireless network such as cell phone based sensor network. The WRCA creates better load balanced and stable clusters for data gathering in a realistic human mobility scenario as compared to WCA algorithm of mobile adhoc networks. Traditional way of stable clustering used to select stable Cluster Heads (CHs) based on instantaneous mobility criteria. While our algorithm incorporate only a pause time weighting parameter to leverage pause time distribution of human mobility for selection of more stable CHs. Load balancing aspect of WRCA tackles realistic scenario of inhomogeneous node distribution. Improvement in load balancing with WRCA assure better aggregation of sensor data and MAC layer performance. This is accomplished by incorporating a density center weighting parameter. This information is used to select density centered CHs. WRCA requires fewer messages to find density centered nodes as compared to TASC. Simulation results demonstrate the overall superiority in performance of the WRCA when mobility according to a realistic mobility model called Self similar Least Action Walk (SLAW) is considered. Simulation result shows that our proposed algorithm consumes 20% less energy and 50% more network lifetime as compared to WCA algorithm.
机译:我们将基于体重的现实聚类算法(WRCA)从基于人类的无线网络中的节能数据收集,如手机基于手机的传感器网络。与移动adhoc网络的WCA算法相比,WRCA为逼真的人类移动性方案中的数据收集更好的负载平衡和稳定的集群。稳定聚类的传统方式用于根据瞬时移动标准选择稳定的簇头(CHS)。虽然我们的算法仅包含暂停时间加权参数,以利用人类移动性的暂停时间分布,以选择更稳定的CH。 WRCA的负载平衡方面解决了不均匀节点分布的现实场景。随着WRCA的负载平衡的改进确保了更好的传感器数据和MAC层性能聚合。这是通过结合密度中心加权参数来实现的。此信息用于选择浓度为中心的CH。与TSC相比,WRC需要较少的消息来查找浓度为中心的节点。仿真结果表明,当考虑了根据称为自类似动作步行(SLAW)的逼真移动模型时,WRCA的性能的整体优势。仿真结果表明,与WCA算法相比,我们所提出的算法消耗了20%的能量和50%的网络生命周期。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号