{"title":"模式3车对车侧链路通信的分层子信道分配","authors":"L. F. Abanto-Leon, A. Koppelaar, S. Groot","doi":"10.1145/3131672.3136987","DOIUrl":null,"url":null,"abstract":"In this poster we present a graph-based hierarchical subchannel allocation scheme for V2V sidelink communications in Mode-3. Under this scheme, the eNodeB allocates subchannels for in-coverage vehicles. Then, vehicles will broadcast directly without the eNodeB intervening in the process. Therefore, in each communications cluster, it will become crucial to prevent allocation conflicts in time domain since vehicles will not be able to transmit and receive simultaneously. We present a solution where the time-domain requirement can be enforced through vertex aggregation. Additionally, allocation of subchannels is performed sequentially from the most to the least allocation-constrained cluster. We show through simulations that the proposed approach attains near-optimality.","PeriodicalId":424262,"journal":{"name":"Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications\",\"authors\":\"L. F. Abanto-Leon, A. Koppelaar, S. Groot\",\"doi\":\"10.1145/3131672.3136987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this poster we present a graph-based hierarchical subchannel allocation scheme for V2V sidelink communications in Mode-3. Under this scheme, the eNodeB allocates subchannels for in-coverage vehicles. Then, vehicles will broadcast directly without the eNodeB intervening in the process. Therefore, in each communications cluster, it will become crucial to prevent allocation conflicts in time domain since vehicles will not be able to transmit and receive simultaneously. We present a solution where the time-domain requirement can be enforced through vertex aggregation. Additionally, allocation of subchannels is performed sequentially from the most to the least allocation-constrained cluster. We show through simulations that the proposed approach attains near-optimality.\",\"PeriodicalId\":424262,\"journal\":{\"name\":\"Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3131672.3136987\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3131672.3136987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications
In this poster we present a graph-based hierarchical subchannel allocation scheme for V2V sidelink communications in Mode-3. Under this scheme, the eNodeB allocates subchannels for in-coverage vehicles. Then, vehicles will broadcast directly without the eNodeB intervening in the process. Therefore, in each communications cluster, it will become crucial to prevent allocation conflicts in time domain since vehicles will not be able to transmit and receive simultaneously. We present a solution where the time-domain requirement can be enforced through vertex aggregation. Additionally, allocation of subchannels is performed sequentially from the most to the least allocation-constrained cluster. We show through simulations that the proposed approach attains near-optimality.