{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
