{"title":"基于争用的无线分组网络合作多址","authors":"A. Masuda, S. Shimamoto","doi":"10.1109/GLOCOM.2007.267","DOIUrl":null,"url":null,"abstract":"We propose a contention based multiple access scheme that enables packet level cooperation in wireless packet network, where the idle nodes help the source nodes by offering relay of the failed packet. Also a prioritization scheme is implemented to optimize to the contention whose complexity is added by participation of relay nodes. Throughput and delay performance improvement is confirmed by computer simulations considering wireless links that have different packet error rates according to the radio condition which suffer from propagation loss and Rayleigh fading. Analysis shows that the addition of active nodes for cooperation rather eases the number of waiting nodes in the contention, and that the reduction of retries needed for transmission reduces the average delay.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Contention Based Cooperative Multiple Access for Wireless Packet Networks\",\"authors\":\"A. Masuda, S. Shimamoto\",\"doi\":\"10.1109/GLOCOM.2007.267\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a contention based multiple access scheme that enables packet level cooperation in wireless packet network, where the idle nodes help the source nodes by offering relay of the failed packet. Also a prioritization scheme is implemented to optimize to the contention whose complexity is added by participation of relay nodes. Throughput and delay performance improvement is confirmed by computer simulations considering wireless links that have different packet error rates according to the radio condition which suffer from propagation loss and Rayleigh fading. Analysis shows that the addition of active nodes for cooperation rather eases the number of waiting nodes in the contention, and that the reduction of retries needed for transmission reduces the average delay.\",\"PeriodicalId\":370937,\"journal\":{\"name\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2007.267\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Contention Based Cooperative Multiple Access for Wireless Packet Networks
We propose a contention based multiple access scheme that enables packet level cooperation in wireless packet network, where the idle nodes help the source nodes by offering relay of the failed packet. Also a prioritization scheme is implemented to optimize to the contention whose complexity is added by participation of relay nodes. Throughput and delay performance improvement is confirmed by computer simulations considering wireless links that have different packet error rates according to the radio condition which suffer from propagation loss and Rayleigh fading. Analysis shows that the addition of active nodes for cooperation rather eases the number of waiting nodes in the contention, and that the reduction of retries needed for transmission reduces the average delay.