Joint Head Selection and Airtime Allocation for Data Dissemination in Mobile Social Networks

TL;DR

This paper introduces a Nash bargaining-based scheme for joint head selection and airtime allocation in mobile social networks, addressing mobility and fairness issues to improve data dissemination.

Contribution

It formulates a novel joint head selection and airtime allocation scheme using Nash bargaining, with solutions proven for both homogeneous and heterogeneous cases.

Findings

The scheme guarantees Pareto optimality and proportional fairness.

Distributed algorithm effectively implements joint head selection and airtime allocation.

Numerical results validate the scheme's performance and fairness improvements.

Abstract

Mobile social networks (MSNs) enable people with similar interests to interact without Internet access. By forming a temporary group, users can disseminate their data to other interested users in proximity with short-range communication technologies. However, due to user mobility, airtime available for users in the same group to disseminate data is limited. In addition, for practical consideration, a star network topology among users in the group is expected. For the former, unfair airtime allocation among the users will undermine their willingness to participate in MSNs. For the latter, a group head is required to connect other users. These two problems have to be properly addressed to enable real implementation and adoption of MSNs. To this aim, we propose a Nash bargaining-based joint head selection and airtime allocation scheme for data dissemination within the group. Specifically, the bargaining game of joint head selection and airtime allocation is first formulated. Then, Nash bargaining solution (NBS) based optimization problems are proposed for a homogeneous case and a more general heterogeneous case. For both cases, the existence of solution to the optimization problem is proved, which guarantees Pareto optimality and proportional fairness. Next, an algorithm, allowing distributed implementation, for join head selection and airtime allocation is introduced. Finally, numerical results are presented to evaluate the performance, validate intuitions and derive insights of the proposed scheme.