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.
|Title of host publication||2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Publication status||Published - 2016|
|Event||2016 IEEE Globecom Workshops, GC Wkshps 2016 - Washington, United States|
Duration: 2016 Dec 4 → 2016 Dec 8
|Name||2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings|
|Other||2016 IEEE Globecom Workshops, GC Wkshps 2016|
|Period||16/12/4 → 16/12/8|
Bibliographical noteFunding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (No. 2014R1A1A1008705).
© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering