Unmanned Aerial Vehicle Ad-Hoc Networks consists of moving multiple UAVS, which needs to communicate with each other through bandwidth-limited wireless channels. These networks have been widely applied in military reconnaissance, disaster response, and geographic surveying. Due to the high mobility of UAVs, they face more challenges in queue scheduling than terrestrial wireless ad-hoc networks. This work focuses on the queue scheduling issue within Unmanned Aerial Vehicle Flying Ad hoc Networks (UAV-FANETs), where the performance of scheduling algorithms is examined for different number of UAV nodes. We selected four widely used scheduling algorithms for performance comparison, i.e., Round Robin (RR), Priority Scheduling, Weighted Round Robin (WRR), and Weighted Shortest Remaining Time First (WSRTF). Specifically, we employed the NS-3 simulation software to construct a UAV-MANET scenario with multiple UAV nodes for evaluating the performance of different algorithms. We show the effect of these algorithms on key metrics such as network throughput, end-to-end delay, average queue length, and packet loss rate. This work not only provides valuable insights for the design and optimization of queue scheduling strategy in UAV networks but also significantly enhances the communication efficiency and reliability of UAV networks in dynamic environments.