On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering

Seho Han; Howon Lee; Junseon Kim; Woongsup Lee

doi:10.1109/GLOCOMW.2016.7848977

On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering

Seho Han, Howon Lee, Junseon Kim, Woongsup Lee

Graduate School of Information

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781509024827
DOIs	https://doi.org/10.1109/GLOCOMW.2016.7848977
Publication status	Published - 2016
Event	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Washington, United States Duration: 2016 Dec 4 → 2016 Dec 8

Publication series

Name	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

Other

Other	2016 IEEE Globecom Workshops, GC Wkshps 2016
Country/Territory	United States
City	Washington
Period	16/12/4 → 16/12/8

Bibliographical note

Funding 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).

Publisher Copyright:
© 2016 IEEE.

All Science Journal Classification (ASJC) codes

Communication
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/GLOCOMW.2016.7848977

Cite this

Han, S., Lee, H., Kim, J., & Lee, W. (2016). On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering. In 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings [7848977] (2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOMW.2016.7848977

@inproceedings{a331a28ccf8a4de29ce3ac78bb000284,

title = "On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering",

abstract = "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.",

author = "Seho Han and Howon Lee and Junseon Kim and Woongsup Lee",

note = "Funding 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). Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE Globecom Workshops, GC Wkshps 2016 ; Conference date: 04-12-2016 Through 08-12-2016",

year = "2016",

doi = "10.1109/GLOCOMW.2016.7848977",

language = "English",

series = "2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings",

address = "United States",

}

Han, S, Lee, H, Kim, J & Lee, W 2016, On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering. in 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings., 7848977, 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE Globecom Workshops, GC Wkshps 2016, Washington, United States, 16/12/4. https://doi.org/10.1109/GLOCOMW.2016.7848977

On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering. / Han, Seho; Lee, Howon; Kim, Junseon et al.

2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2016. 7848977 (2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering

AU - Han, Seho

AU - Lee, Howon

AU - Kim, Junseon

AU - Lee, Woongsup

N1 - Funding 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). Publisher Copyright: © 2016 IEEE.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85015930180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015930180&partnerID=8YFLogxK

U2 - 10.1109/GLOCOMW.2016.7848977

DO - 10.1109/GLOCOMW.2016.7848977

M3 - Conference contribution

AN - SCOPUS:85015930180

T3 - 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

BT - 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE Globecom Workshops, GC Wkshps 2016

Y2 - 4 December 2016 through 8 December 2016

ER -

On the connectivity in opportunistic D2D networks with hierarchical and non-hierarchical clustering

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this