Target position estimation with mobile adaptive network with selective cooperation

A. Pak, Shahrood Aghazadeh, A. Rastegarnia, A. Khalili
{"title":"Target position estimation with mobile adaptive network with selective cooperation","authors":"A. Pak, Shahrood Aghazadeh, A. Rastegarnia, A. Khalili","doi":"10.1109/CADS.2013.6714245","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of collective motion for a set of mobile nodes. The objective of nodes is to move toward a target. Adaptive network can be used for this purpose. In this paper, we propose a reduced-complexity diffusion adaptive network solution. The idea is to use a selective cooperation, by choosing the best nodes at each iteration, to reduce the number of communications. As our simulation results show, we can achieve proper steady-state performance while reducing the communication overhead.","PeriodicalId":379673,"journal":{"name":"The 17th CSI International Symposium on Computer Architecture & Digital Systems (CADS 2013)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 17th CSI International Symposium on Computer Architecture & Digital Systems (CADS 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CADS.2013.6714245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper we consider the problem of collective motion for a set of mobile nodes. The objective of nodes is to move toward a target. Adaptive network can be used for this purpose. In this paper, we propose a reduced-complexity diffusion adaptive network solution. The idea is to use a selective cooperation, by choosing the best nodes at each iteration, to reduce the number of communications. As our simulation results show, we can achieve proper steady-state performance while reducing the communication overhead.
基于选择性合作的移动自适应网络目标位置估计
本文研究了一组移动节点的集体运动问题。节点的目标是向目标移动。自适应网络可以用于此目的。本文提出了一种降低复杂度的扩散自适应网络解决方案。其思想是通过在每次迭代中选择最佳节点来使用选择性合作,以减少通信的数量。仿真结果表明,我们可以在降低通信开销的同时获得适当的稳态性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信