On the Connectivity in Opportunistic D2D Networks with Hierarchical and Non-Hierarchical Clustering

In wireless device-to-device (D2D) networks, where users can directly communicate each other, the messages should be delivered reliably with low cost and low power consumption. We herein consider a D2D based opportunistic data dissemination algorithm for the advertisement messages in social commerce services when the user distribution is not identical over area. In order to provide reliable connectivity to users and to deliver messages efficiently, target areas where user density is high are partitioned into several clusters, i.e., target groups, using hierarchical and non-hierarchical clustering algorithms. In addition, near-optimal routing paths and a user selection strategy for relaying the messages to their neighboring users are established for effective data dissemination. Through intensive MATLAB simulations, we evaluate the performance of various clustering algorithms in view of the coverage probability and transmission efficiency. We also investigate the optimal way to achieve the maximum coverage probability for given network topology.