Paper Info
Title
User popularity-based packet scheduling for congestion control in ad-hoc social networks
Abstract
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. 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.
Year
DOI
Venue
2016
10.1016/j.jcss.2015.07.002
Journal of Computer and System Sciences
Keywords
Field
DocType
Mobile social networking in proximity,Ad-hoc social networks,Mobile social networks,Degree centrality,First-in-first-out,Congestion control
Computer science,Scheduling (computing),Network packet,Packet loss,Computer network,Network congestion,Fairness measure,Throughput,Round-robin scheduling,Fair queuing,Distributed computing
Journal
Volume
Issue
ISSN
82
1
Journal of Computer and System Sciences, Vol.82, No.1, 2016, pp. 93-112
Citations 
PageRank 
References 
8
0.49
34
Authors
7
Name
Order
Citations
PageRank
Feng Xia12013153.69
Hannan Bin Liaqat2121.89
Ahmedin Mohammed Ahmed3906.26
Li Liu4493.76
Jianhua Ma51401148.82
Runhe Huang640756.46
Amr Tolba717729.10