{"title":"基于传输距离极坐标网格的消息传播算法","authors":"Seho Han, Taeyoung Kim, Sukyoung Lee","doi":"10.1109/VNC.2018.8628464","DOIUrl":null,"url":null,"abstract":"Message dissemination in Vehicular Ad Hoc Networks (VANETs) provides many benefits to the commercial and public services. However, frequent communication disconnection or interference occurs in various network topology. In this paper, we propose efficient message dissemination algorithm. Using this algorithm, transmission nodes divide the transmission range to several grids, and select k forwarding nodes within each grid. The simulation results show that this proposed algorithm can cut unnecessary message transmission and the transmission coverage overlap.","PeriodicalId":335017,"journal":{"name":"2018 IEEE Vehicular Networking Conference (VNC)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Message Dissemination Algorithm based on Polar Grid of Transmission Range\",\"authors\":\"Seho Han, Taeyoung Kim, Sukyoung Lee\",\"doi\":\"10.1109/VNC.2018.8628464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Message dissemination in Vehicular Ad Hoc Networks (VANETs) provides many benefits to the commercial and public services. However, frequent communication disconnection or interference occurs in various network topology. In this paper, we propose efficient message dissemination algorithm. Using this algorithm, transmission nodes divide the transmission range to several grids, and select k forwarding nodes within each grid. The simulation results show that this proposed algorithm can cut unnecessary message transmission and the transmission coverage overlap.\",\"PeriodicalId\":335017,\"journal\":{\"name\":\"2018 IEEE Vehicular Networking Conference (VNC)\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Vehicular Networking Conference (VNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VNC.2018.8628464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Vehicular Networking Conference (VNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNC.2018.8628464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Message Dissemination Algorithm based on Polar Grid of Transmission Range
Message dissemination in Vehicular Ad Hoc Networks (VANETs) provides many benefits to the commercial and public services. However, frequent communication disconnection or interference occurs in various network topology. In this paper, we propose efficient message dissemination algorithm. Using this algorithm, transmission nodes divide the transmission range to several grids, and select k forwarding nodes within each grid. The simulation results show that this proposed algorithm can cut unnecessary message transmission and the transmission coverage overlap.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
