Traditional ad-hoc network packet scheduling schemes cannot fulfill the requirements of proximity-based ad-hoc social networks (ASNETs) and they do not behave properly in congested environments. To address this issue, we propose a user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware. The proposed algorithm exploits social popularity of sender nodes to prioritize all incoming flows. Pop-aware also provides fairness of service received by each flow. We evaluate the performance of Pop-aware through a series of simulations. In comparison with some existing scheduling algorithms, Pop-aware performs better in terms of control overhead, total overhead, average throughput, packet loss rate, packet delivery rate and average delay.
@article{arxiv.2008.05395,
title = {User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks},
author = {Feng Xia and Hannan Bin Liaqat and Ahmedin Mohammed Ahmed and Li Liu and Jianhua Ma and Runhe Huang and Amr Tolba},
journal= {arXiv preprint arXiv:2008.05395},
year = {2020}
}