• Title/Summary/Keyword: Maximum-Distance Based Relay Selection

Search Result 2, Processing Time 0.012 seconds

Performance Evaluation of D2D Advertisement Dissemination Algorithms with Maximum Distance and Transmission Efficiency Based Relay Selections (D2D 광고 확산을 위한 최대거리 기반 알고리즘과 최대효율 기반 알고리즘의 성능 분석)

  • Kim, Junseon;Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.287-292
    • /
    • 2015
  • In this paper, we evaluated the performance of D2D advertisement dissemination algorithms with maximum-distance and transmission-efficiency based relay selections with respect to the total number of successfully received users and transmission efficiency. To assume more practical environment, we took into account pre-defined target-areas based on the information of user density and the limit for the maximum number of relay users. Through the simulations we compared the performance results of both D2D advertisement dissemination algorithms with maximum-distance and transmission-efficiency based relay selections according to increment of the number of sectors. And then, we analysed the superiority of algorithm with transmission-efficiency based relay selections more than maximum-distance based relay selections.

Performance Analysis of User Clustering Algorithms against User Density and Maximum Number of Relays for D2D Advertisement Dissemination (최대 전송횟수 제한 및 사용자 밀집도 변화에 따른 사용자 클러스터링 알고리즘 별 D2D 광고 확산 성능 분석)

  • Han, Seho;Kim, Junseon;Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.721-727
    • /
    • 2016
  • In this paper, in order to resolve the problem of reduction for D2D (device to device) advertisement dissemination efficiency of conventional dissemination algorithms, we here propose several clustering algorithms (modified single linkage algorithm (MSL), K-means algorithm, and expectation maximization algorithm with Gaussian mixture model (EM)) based advertisement dissemination algorithms to improve advertisement dissemination efficiency in D2D communication networks. Target areas are clustered in several target groups by the proposed clustering algorithms. Then, D2D advertisements are consecutively distributed by using a routing algorithm based on the geographical distribution of the target areas and a relay selection algorithm based on the distance between D2D sender and D2D receiver. Via intensive MATLAB simulations, we analyze the performance excellency of the proposed algorithms with respect to maximum number of relay transmissions and D2D user density ratio in a target area and a non-target area.