Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Performance Analysis of User Clustering Algorithms against User Density and Maximum Number of Relays for D2D Advertisement Dissemination

최대 전송횟수 제한 및 사용자 밀집도 변화에 따른 사용자 클러스터링 알고리즘 별 D2D 광고 확산 성능 분석

  • Han, Seho (Department of Electrical, Electronic and Control Engineering & IITC, Hankyong National University) ;
  • Kim, Junseon (School of Electrical & Computer Engineering, UNIST) ;
  • Lee, Howon (Department of Electrical, Electronic and Control Engineering & IITC, Hankyong National University)
  • Received : 2016.02.29
  • Accepted : 2016.04.01
  • Published : 2016.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

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.

본 논문에서는 기존 알고리즘에서의 특정 D2D 사용자 분포에 대한 광고확산 효율 저하 문제를 해결하기 위해, D2D 통신 네트워크에서 광고확산 효율을 개선하는 광고확산 알고리즘 기반의 Modified Single Linkage, K-means, 그리고 Gaussian mixture model을 적용한 Expectation Maximization 클러스터링 알고리즘의 적용이 제안되었다. 제안된 클러스터링 알고리즘들을 통해 광고 확산을 위한 목표지역들이 목표그룹으로 클러스터링되고 이를 통해 D2D 전송 단말과 수신 단말 사이의 거리를 기반으로 광고 확산 경로 설정 알고리즘과 릴레이 단말 설정 알고리즘이 적용되어 광고가 연속적으로 전파된다. 본 논문에서는 MATLAB 시뮬레이션을 통해 각 알고리즘의 최대 D2D 릴레이 제한 수와 목표지역과 비목표지역의 사용자 밀집도의 비에 따른 성능을 비교 분석한다.

Keywords

References

  1. J. G. Andrews, et al., "What will 5G be?." IEEE Journal on Sel. Areas in Communications, vol. 32, no. 6, pp. 1065-1082, June 2014. https://doi.org/10.1109/JSAC.2014.2328098
  2. L. Lei, et al., "Operator controlled device-to-device communications in LTE-advanced networks", IEEE Wireless Communications, vol. 19, no. 3, pp. 96-104, June 2012. https://doi.org/10.1109/MWC.2012.6231164
  3. N. NaderiAlizadeh, et al., "ITLinQ: a new approach for spectrum sharing in device-to-device communication systems," IEEE Journal on Sel. Areas in Communications, vol. 32, no. 6, pp. 1139-1151, Sep. 2014. https://doi.org/10.1109/JSAC.2014.2328102
  4. J. Kim, et al., "VADA: Wi-Fi Direct Based Voluntary Advertisement Dissemination Algorithm for Social Commerce Services," IEEE VTC 2015 Spring, pp. 1-6, May 2015.
  5. J. Kim, et al., "Geographical Proximity Based Target-Group Formation Algorithm for Efficient D2D Advertisement Dissemination," IEEE PerCom 2015, pp. 275-278, Mar. 2015.
  6. C. D. Manning, et al, Introduction to Information Retrieval, Cambridge, Cambridge University Press, 2008.
  7. S. Han, et al., "Performance Analysis of Hierarchical/Non-Hierarchical Clustering Algorithm for D2D Advertisement Dissemination," KICS 2015 Fall Conference, pp 36-37, Nov. 2015.
  8. C. M. Bishop, Pattern Recognition and Machine Learning, New York, Springer, 2006.
  9. SMALL ENTERPRISE AND MARKET SERVICE. SEMAS Marketing Area Analysis System [Internet]. Available:http://sg.sbiz.or.kr/index.sg?supDev=1#/analy/mainD/