• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Performance evaluation of a mathematical programming based clustering algorithm for a wireless ad hoc network operating in a threat environment.
【24h】

Performance evaluation of a mathematical programming based clustering algorithm for a wireless ad hoc network operating in a threat environment.

机译：在威胁环境中运行的无线自组织网络的基于数学编程的聚类算法的性能评估。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A distributed sensing network consists of several spatially separated sensors, each with possibly different characteristics and not all of them sensing the same set of entities. The sensors are mobile and change location with time. In this work, we evaluate the operational level performance of a column generation (CG) based clustering algorithm, that is developed for locating a given number of clusterheads in a wireless ad hoc sensor network such that maximum information can be gathered from the sensors under hostile conditions. This methodology is also compared with a representative approach (MOBIC - Mobility Based Metric for Clustering) from the clustering algorithms that have been proposed in the literature. Both small (30 nodes) and medium sized (60 nodes) networks are used for comparison purposes.; As a result of the numerical studies, it is concluded that the CG heuristic is superior to the original MOBIC algorithm in terms of sensor coverage. Under 3 of the 64 scenarios, MOBIC provides slightly better coverage. However, the objective function values corresponding to these scenarios indicate that the CG heuristic outperforms MOBIC by 46.06%. According to the packet level analysis performed using OPNET, a smaller percentage of packets sent by the sensors is lost due to the collision of packets transmitted to the same receiver channel of a clusterhead when the results of the CG heuristic are used. The percentage loss values are found to be 1.46% for CG and 2.22% for MOBIC. Finally, the number of packets received by the clusterheads is always higher for the CG heuristic.
机译：分布式传感网络由几个空间上分离的传感器组成，每个传感器可能具有不同的特性，并且并非所有传感器都感知同一组实体。传感器是可移动的，并随时间变化位置。在这项工作中，我们评估基于列生成（CG）的聚类算法的操作级别性能，该算法是为在无线ad hoc传感器网络中定位给定数量的簇头而开发的，以便可以从敌对状态下的传感器中收集最大信息条件。还将该方法与文献中提出的聚类算法中的代表性方法（MOBIC-基于聚类的移动性度量标准）进行了比较。小型（30个节点）和中型（60个节点）网络都用于比较。数值研究的结果表明，在传感器覆盖率方面，CG启发式算法优于原始的MOBIC算法。在64种情况中的3种情况下，MOBIC提供了更好的覆盖范围。但是，与这些情况相对应的目标函数值表明CG启发式算法比MOBIC优胜46.06％。根据使用OPNET进行的数据包级别分析，当使用CG启发式方法的结果时，由于传输到群集头的同一接收器通道的数据包发生冲突，传感器发送的数据包损失的百分比较小。发现CG的百分比损失值为1.46％，MOBIC的百分比损失值为2.22％。最后，对于CG启发式算法，簇头接收的数据包数量始终较高。

著录项

  • 作者

    Cosar, Esra.;

  • 作者单位

    State University of New York at Buffalo.;

  • 授予单位 State University of New York at Buffalo.;
  • 学科 Operations Research.
  • 学位 M.S.
  • 年度 2005
  • 页码 93 p.
  • 总页数 93
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 运筹学;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号