Abstract
Multi-hop wireless broadcast is an important component of vehicular networks. Many services rely on the performance of broadcast communication to disseminate data packets. In an urban vehicular network, an efficient way of broadcasting data packets is choosing some vehicles as relay nodes. The base station only needs to multicast data packets to these relay vehicles and the packets would be spread to the whole network through D2D communication among vehicles. In this situation, the strategy of relay selection becomes a key factor of the broadcast efficiency. In this paper, we provide an unsupervised-learning-based method developed from k-means algorithm to help select relay nodes. The base station can learn the distribution of devices itself and choose the relay devices automatically. We use Manhattan map as our map model for the simulation and the result shows great efficiency over a random- selecting strategy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.