蜂窝移动系统中信道分配的自反馈最大神经网络

A. Hanamitsu, M. Ohta
{"title":"蜂窝移动系统中信道分配的自反馈最大神经网络","authors":"A. Hanamitsu, M. Ohta","doi":"10.1109/IJCNN.2002.1007594","DOIUrl":null,"url":null,"abstract":"The maximum neural network (MNN) with self-feedbacks for the channel assignment problem (CAP) is proposed. The CAP is one of the extremely important problems in cellular mobile systems. The CAP is to assign a channel to each call in order to minimize the interference and use available channels efficiently. Funabiki et al. (2000) have proposed the hysteresis binary neuron model for the CAP and it can find lower bound solutions for well-known benchmark problems. In order to avoid converging to a local minimum, this model introduces the hill-climbing term and the omega function. Although these methodologies are effective to escape from a local minimum, they need to adjust many parameters. In this paper, the MNN with self-feedbacks is proposed in order to reduce parameters. Our proposal is applied to the CAP, and it is compared with the hysteresis binary neuron model. Our model can find the lower bound solutions in all of the benchmark problems and the average iteration step decreases by 55.5[%].","PeriodicalId":382771,"journal":{"name":"Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A maximum neural network with self-feedbacks for channel assignment in cellular mobile systems\",\"authors\":\"A. Hanamitsu, M. Ohta\",\"doi\":\"10.1109/IJCNN.2002.1007594\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The maximum neural network (MNN) with self-feedbacks for the channel assignment problem (CAP) is proposed. The CAP is one of the extremely important problems in cellular mobile systems. The CAP is to assign a channel to each call in order to minimize the interference and use available channels efficiently. Funabiki et al. (2000) have proposed the hysteresis binary neuron model for the CAP and it can find lower bound solutions for well-known benchmark problems. In order to avoid converging to a local minimum, this model introduces the hill-climbing term and the omega function. Although these methodologies are effective to escape from a local minimum, they need to adjust many parameters. In this paper, the MNN with self-feedbacks is proposed in order to reduce parameters. Our proposal is applied to the CAP, and it is compared with the hysteresis binary neuron model. Our model can find the lower bound solutions in all of the benchmark problems and the average iteration step decreases by 55.5[%].\",\"PeriodicalId\":382771,\"journal\":{\"name\":\"Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.2002.1007594\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2002.1007594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对信道分配问题,提出了一种自反馈的最大神经网络(MNN)。CAP是蜂窝移动系统中极为重要的问题之一。CAP是为每个呼叫分配一个信道,以最大限度地减少干扰并有效地利用可用信道。Funabiki等人(2000)提出了CAP的滞后二值神经元模型,该模型可以为众所周知的基准问题找到下界解。为了避免收敛到局部极小值,该模型引入了爬坡项和函数。虽然这些方法可以有效地摆脱局部最小值,但它们需要调整许多参数。为了减小参数,本文提出了带自反馈的MNN。将该方法应用于CAP,并与滞后二值神经元模型进行了比较。我们的模型可以在所有的基准问题中找到下界解,平均迭代步长减少了55.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A maximum neural network with self-feedbacks for channel assignment in cellular mobile systems
The maximum neural network (MNN) with self-feedbacks for the channel assignment problem (CAP) is proposed. The CAP is one of the extremely important problems in cellular mobile systems. The CAP is to assign a channel to each call in order to minimize the interference and use available channels efficiently. Funabiki et al. (2000) have proposed the hysteresis binary neuron model for the CAP and it can find lower bound solutions for well-known benchmark problems. In order to avoid converging to a local minimum, this model introduces the hill-climbing term and the omega function. Although these methodologies are effective to escape from a local minimum, they need to adjust many parameters. In this paper, the MNN with self-feedbacks is proposed in order to reduce parameters. Our proposal is applied to the CAP, and it is compared with the hysteresis binary neuron model. Our model can find the lower bound solutions in all of the benchmark problems and the average iteration step decreases by 55.5[%].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CMAC-based fault diagnosis of power transformers Shape, orientation and size recognition of normal and ambiguous faces by a rotation and size spreading associative neural network Neuronal signal processing in Parkinson's disease Blind signal separation via simultaneous perturbation method Numerical solution of differential equations by radial basis function neural networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1