{"title":"具有同步检测的大规模非协调多路中继网络","authors":"M. N. Hasan, K. Anwar","doi":"10.1109/ICCW.2015.7247504","DOIUrl":null,"url":null,"abstract":"In this paper, we consider multiway relay networks with massive number of users. In this situation a fixed transmission scheduling is difficult to apply. We propose uncoordinated communications using the concept of coded slotted ALOHA (CSA), where simultaneous transmitted signals are detected using iterative demapping (IDM) algorithm to improve the success rate probability. We allow each user to transmit the information via any random time slots (during the contention period) to the network. We show the bound of the proposed system and confirm an achievable point using practical coding. We also evaluate the bit-error-rate (BER) performance of the proposed technique via computer simulations. The results indicate that even though with the offered traffic of 1.11 packets/slot, reliable communications is achievable. It is also validated that the proposed system works very well even in relatively low signal-to-noise ratio (SNR) environments. Moreover, the packet-loss-rate (PLR) evaluation shows that the proposed technique outperforms the conventional CSA without simultaneous detection algorithm.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"70 1","pages":"2175-2180"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Massive uncoordinated multiway relay networks with simultaneous detections\",\"authors\":\"M. N. Hasan, K. Anwar\",\"doi\":\"10.1109/ICCW.2015.7247504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider multiway relay networks with massive number of users. In this situation a fixed transmission scheduling is difficult to apply. We propose uncoordinated communications using the concept of coded slotted ALOHA (CSA), where simultaneous transmitted signals are detected using iterative demapping (IDM) algorithm to improve the success rate probability. We allow each user to transmit the information via any random time slots (during the contention period) to the network. We show the bound of the proposed system and confirm an achievable point using practical coding. We also evaluate the bit-error-rate (BER) performance of the proposed technique via computer simulations. The results indicate that even though with the offered traffic of 1.11 packets/slot, reliable communications is achievable. It is also validated that the proposed system works very well even in relatively low signal-to-noise ratio (SNR) environments. Moreover, the packet-loss-rate (PLR) evaluation shows that the proposed technique outperforms the conventional CSA without simultaneous detection algorithm.\",\"PeriodicalId\":6464,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"volume\":\"70 1\",\"pages\":\"2175-2180\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2015.7247504\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Massive uncoordinated multiway relay networks with simultaneous detections
In this paper, we consider multiway relay networks with massive number of users. In this situation a fixed transmission scheduling is difficult to apply. We propose uncoordinated communications using the concept of coded slotted ALOHA (CSA), where simultaneous transmitted signals are detected using iterative demapping (IDM) algorithm to improve the success rate probability. We allow each user to transmit the information via any random time slots (during the contention period) to the network. We show the bound of the proposed system and confirm an achievable point using practical coding. We also evaluate the bit-error-rate (BER) performance of the proposed technique via computer simulations. The results indicate that even though with the offered traffic of 1.11 packets/slot, reliable communications is achievable. It is also validated that the proposed system works very well even in relatively low signal-to-noise ratio (SNR) environments. Moreover, the packet-loss-rate (PLR) evaluation shows that the proposed technique outperforms the conventional CSA without simultaneous detection algorithm.