User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks

TL;DR

This paper introduces Pop-aware, a user popularity-based packet scheduling scheme for congestion control in ad-hoc social networks, improving performance metrics over existing algorithms.

Contribution

The paper presents a novel scheduling algorithm that leverages social popularity to prioritize flows and ensure fairness in congestion control for ASNETs.

Findings

Pop-aware reduces control and total overhead.

Pop-aware increases throughput and packet delivery rate.

Pop-aware decreases packet loss and delay.

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.