A social popularity aware scheduling algorithm for ad-hoc social networks

In an ad-hoc social network (ASNET), users normally require scheduling popular data packet first. However, ASNET users have some limitations due to the scarce bandwidth and unreliability in wireless connection. Traditional algorithms use First In First Out (FIFO) order for scheduling, which is not suitable in ASNETs and cannot work properly with congested environments. To overcome the above mentioned problems, in this paper, we introduce a social popularity aware scheduling algorithm in the context of ad-hoc social networks, namely Pop-aware. Pop-aware provides solution after calculating the traffic load of intermediate node and assigns priority to incoming flow using degree centrality (social property). It provides fairness in received service to each flow using the active service rate concept. Experimental results show that the performance of Pop-aware is better as compared against existing schemes, in terms of average throughput, packet loss rate and average delay.