User popularity-based packet scheduling for congestion control in ad-hoc social networks
作者：
Highlights：
• User popularity-based packet scheduling is explored for ad-hoc social networks.
• The scheme can avoid the dropping of the most popular node's data.
• It helps effectively control congestion and fully utilize available bandwidth.
• It can maintain fairness among flows and nodes.
• Simulations have been conducted for performance evaluation and comparison.
摘要
•User popularity-based packet scheduling is explored for ad-hoc social networks.•The scheme can avoid the dropping of the most popular node's data.•It helps effectively control congestion and fully utilize available bandwidth.•It can maintain fairness among flows and nodes.•Simulations have been conducted for performance evaluation and comparison.
论文关键词：Mobile social networking in proximity,Ad-hoc social networks,Mobile social networks,Degree centrality,First-in-first-out,Congestion control
论文评审过程：Received 27 November 2014, Revised 25 June 2015, Accepted 2 July 2015, Available online 6 August 2015, Version of Record 28 October 2015.
论文官网地址：https://doi.org/10.1016/j.jcss.2015.07.002
