首页> 外文会议>Proceedings of the 2007 International Conference on Machine Learning and Cybernetics >EFFICIENT BROADCAST SCHEDULING BASED ON FUZZY CLUSTERING AND HOPFIELD NETWORK FOR AD HOC NETWORKS
【24h】

EFFICIENT BROADCAST SCHEDULING BASED ON FUZZY CLUSTERING AND HOPFIELD NETWORK FOR AD HOC NETWORKS

机译:基于模糊聚类和Hopfield网络的AD HOC网络高效广播调度。

获取原文

摘要

Efficient broadcast scheduling in Ad hoc networks is important to avoid any conflict and to exploit channel resource efficiently.The broadcast scheduling problem (BSP) for Ad hoc is an NP-complete issue.In this paper, combination of fuzzy clustering and Hopfield neural network (FC-HNN) technique is adopted to solve the TDMA (time division multiple access) broadcast scheduling problem in Ad hoc.We formulate it as discrete energy minimization problem and map it into Hopfield neural network with the fuzzy c-means strategy to find the TDMA schedule for nodes in a communication network.Each time slot is regarded as a data sample and every node is taken as a cluster.Time slots are adequately distributed to the dedicated node while satisfying the constraints.The aim is to minimize the TDMA cycle length and maximize the node transmissions avoiding both primary and secondary conflicts.Simulation results show that the FC-HNN had superior ability to solve the broadcast scheduling problem for Ad hoc over other neural network methods as well as improves performance substantially in terms of both channel utilization and packet delay.
机译:Ad hoc网络中有效的广播调度对于避免任何冲突并有效地利用信道资源至关重要.Ad hoc的广播调度问题(BSP)是一个NP完全问题。为了解决Ad hoc中的TDMA(时分多址)广播调度问题,我们采用FC-HNN技术,将其表述为离散能量最小化问题,并通过模糊c均值策略将其映射到Hopfield神经网络中以找到TDMA通信网络中节点的调度,每个时隙被视为一个数据样本,每个节点被视为一个簇,在满足约束的前提下将时隙充分分配给专用节点,目的是最小化TDMA周期长度和仿真结果表明,FC-HNN具有较强的能力解决Ad h广播调度问题。与其他神经网络方法相比,它在信道利用率和数据包延迟方面都大大提高了性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号