首页> 外文会议>International Conference on Intelligent Sensors, Sensor Networks and Information Processing >A Dynamic Cluster Formation Algorithm for Collaborative Information Processing in Wireless Sensor Networks
【24h】

A Dynamic Cluster Formation Algorithm for Collaborative Information Processing in Wireless Sensor Networks

机译:一种动态集群形成算法,用于无线传感器网络中的协作信息处理

获取原文

摘要

Clustering of sensor nodes has been shown to be an effective approach for Distributed Collaborative Information Processing in resource constrained Wireless Sensor Networks to keep network traffic local in order to reduce energy dissipation of long-distance transmissions. Defining the range and topology of clusters to reduce energy consumption and retransmissions due to collisions on shared radio channels is an ongoing research topic. One solution is to minimize overlapping cluster ranges to reduce signal contention, thus reducing the energy dissipation of collisions and retransmissions. In this paper, we propose a Dynamic Cluster Formation (DCF) algorithm that dynamically groups a set of sensor nodes into a logical cluster-based sensing and processing unit, Collaborative Agent Sensor Team (CAST), to detect and track localized phenomena. Each cluster head is selected locally such that the total overlap between clusters in a CAST is low and the coverage of each cluster head is high. We compare our approach with optimal solutions, and simulation results show the effectiveness and scalability of our CAST DCF algorithm.
机译:传感器节点的聚类已被证明是资源受限的无线传感器网络中的分布式协作信息处理的有效方法,以保持网络流量局部,以减少长距离传输的能量耗散。定义群集的范围和拓扑以降低由于共享无线电频道的碰撞导致的能量消耗和重传是一个正在进行的研究主题。一种解决方案是最小化重叠群集范围以降低信号争用,从而降低碰撞和重传的能量耗散。在本文中,我们提出了一种动态集群形成(DCF)算法,它将一组传感器节点动态地将一组传感器节点分组成逻辑集群的传感和处理单元,协同代理传感器团队(演员),以检测和跟踪局部现象。本地选择每个簇头,使得铸造中的簇之间的总重叠是低的,并且每个簇头的覆盖率高。我们将我们的方法与最佳解决方案进行比较,仿真结果表明了铸造DCF算法的有效性和可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号