Nowadays, with the fast growth of Internet of Vehicles (IoV), wireless communication techniques for IoV is becoming more and more important for vehicular networks. To achieve more reliable information and reduce the computational complexity, receiver detection is one of the most significant techniques. In this paper, several modified K-best detection algorithms are developed to take advantages of the list decoder, which provide a flexible performance and complexity tradeoff. Different from the existing algorithms, the proposed K-best algorithms could make use of the a priori probability to generate the list. Simulation results demonstrate that the proposed low complexity algorithms can achieve a significant performance gain over existing ones, especially for the networks with high order constellations.