Distributed Multistage Cooperative-Social-Multicast-Aided Content Dissemination in Random Mobile Networks

A distributed multistage cooperative-social-multicast-protocol-aided content dissemination scheme is proposed, which is based on a self-organized ad hoc network of mobile stations (MSs) seeking the same content. In our content dissemination scheme, upon receiving the content, the content owners may further multicast it to their social contacts who are hitherto unserved content seekers. Then, we mathematically define the geographic social strength to describe the social relationships between a pair of MSs. By jointly considering the geographic social strength, the geographic distances, and the path loss, as well as the small-scale fading, we derive the closed-form formula of the average social unicast throughput. Furthermore, we model the content dissemination process by a discrete-time pure-birth-based Markov chain and derive the closed-form expressions for the statistical properties of the content dissemination delay. The proposed multistage cooperative social multicast protocol is capable of successfully delivering the content of common interest to all MSs in two transmission frames, provided that the density of the MSs is sufficiently high, as demonstrated both by our simulation and analytical results.