In machine-type communication (MTC) consisting high-mobility machines, such as vehicles, aircrafts, robots, etc., there is a strong demand for fast wireless networking. With radars extensively applied in these machines for… Click to show full abstract
In machine-type communication (MTC) consisting high-mobility machines, such as vehicles, aircrafts, robots, etc., there is a strong demand for fast wireless networking. With radars extensively applied in these machines for environment awareness, radar assisted fast neighbor discovery (ND) for wireless ad hoc networks is proposed to realize fast wireless networking for MTC. Four neighbor discovery algorithms are designed according to the accuracy level of prior information provided by radar. Then, the performance of neighbor discovery algorithms is analyzed theoretically. Simulation results are further provided to compare neighbor discovery algorithms with and without the prior information from radar. The results demonstrate that the time consumption of neighbor discovery is greatly reduced with prior information of radar. Moreover, the time consumption with prior information from radar increases with the number of nodes. However, the increasing speed is much slower than the neighbor discovery without prior information from radar. This paper proves the advantages of radar assisted neighbor discovery, which may motivate the study of radar assisted wireless networking schemes in the future.
               
Click one of the above tabs to view related content.