蜂窝系统中有争议的反馈

A. Reznik, E. Zeira
{"title":"蜂窝系统中有争议的反馈","authors":"A. Reznik, E. Zeira","doi":"10.1109/WCNC.2009.4917637","DOIUrl":null,"url":null,"abstract":"We consider the problem of counting mobile stations based on feedback they provide. For this problem we propose an anonymous contentious feedback mechanism which permits efficient counting and relate the resulting estimation problem to a well know combinatorial problem of \"coupon collection.\" Using this relationship, we analyze the estimation problem in an idealized setting. We find the ML estimator and demonstrate that it is inappropriate in this setting. We then propose an estimator which is shown to achieve good performance over a large range of parameters.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Contentious Feedback in Cellular Systems\",\"authors\":\"A. Reznik, E. Zeira\",\"doi\":\"10.1109/WCNC.2009.4917637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of counting mobile stations based on feedback they provide. For this problem we propose an anonymous contentious feedback mechanism which permits efficient counting and relate the resulting estimation problem to a well know combinatorial problem of \\\"coupon collection.\\\" Using this relationship, we analyze the estimation problem in an idealized setting. We find the ML estimator and demonstrate that it is inappropriate in this setting. We then propose an estimator which is shown to achieve good performance over a large range of parameters.\",\"PeriodicalId\":186150,\"journal\":{\"name\":\"2009 IEEE Wireless Communications and Networking Conference\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Wireless Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2009.4917637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2009.4917637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们考虑了基于移动台提供的反馈来计算移动台的问题。对于这个问题,我们提出了一个匿名的有争议的反馈机制,该机制允许有效的计数,并将结果估计问题与众所周知的“优惠券收集”组合问题联系起来。利用这种关系,我们分析了理想情况下的估计问题。我们找到了ML估计器,并证明它在这种情况下是不合适的。然后,我们提出了一个估计器,该估计器在大范围的参数范围内显示出良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Contentious Feedback in Cellular Systems
We consider the problem of counting mobile stations based on feedback they provide. For this problem we propose an anonymous contentious feedback mechanism which permits efficient counting and relate the resulting estimation problem to a well know combinatorial problem of "coupon collection." Using this relationship, we analyze the estimation problem in an idealized setting. We find the ML estimator and demonstrate that it is inappropriate in this setting. We then propose an estimator which is shown to achieve good performance over a large range of parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信