Relay Selection Algorithms in D2D Cluster Underlaying Cellular Networks

Zhi Hao Ruan; Shi Xiang Shao; Jun Sun

doi:10.4028/www.scientific.net/AMM.713-715.1413

Paper Titles

3-Dimensional Localization Algorithm Research Based on Weighted Fusion with Projected Coordinate
p.1394

Harmonic Analyzing and Filtering of Motor Discrete Variable Frequency Soft Starter
p.1401

A Simulation Study of Nakagami-m Distribution
p.1405

Normalized p-Norm Blind Equalization Algorithm with Adaptive Momentum under Impulsive Noise Environment
p.1409

Relay Selection Algorithms in D2D Cluster Underlaying Cellular Networks
p.1413

Research and Simulation for Audio Stream Synchronization Algorithm of Multimedia Network
p.1419

Research on Routing Algorithm Based on Ant Colony Optimization for Wireless Sensor Networks
p.1423

Research on the Technology of Service Pricing Optimization Strategy for Mobile Communication Enterprise
p.1427

Research on the Ultra-Short-Term Bus Load Forecasting Method Considering Meteorological Mutation
p.1431

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 713-715Relay Selection Algorithms in D2D Cluster...

Relay Selection Algorithms in D2D Cluster Underlaying Cellular Networks

Abstract:

With the development of mobile communication, D2D (Device-to-Device technology) has become a research hotpot. In this paper, we first derive the channel capacity of an n-hop link and get the formula of spectrum efficiency. And then to maximize the spectrum efficiency, we focus the algorithm of selecting the best relay for data transmission in a D2D cluster of cellular network. The algorithm proposed in this paper is an improvement of the greedy algorithm. This algorithm solves the problem that the greedy algorithm would be invalid in the case of having a big hole in the topology. At last, we could see a significant gain in terms of spectrum efficiency by using the new relay selection algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 713-715)

Pages:

1413-1418

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.713-715.1413

Citation:

Cite this paper

Online since:

January 2015

Authors:

Zhi Hao Ruan*, Shi Xiang Shao, Jun Sun

Keywords:

Device-To-Device (D2D), N-Hop Channel Capacity, Relay Selection Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Weifeng Su, Ahmed K. Sadek, K. J. Ray Liu, Cooperative Communication Protocols in Wireless Networks, Wireless Personal Communications, Volume 44, Issue 2, pp.181-217, (2008).

DOI: 10.1007/s11277-007-9359-z

Google Scholar

[2] Zhou B, Hu H, Huang S, et al. Intracluster Device-to-Device Relay Algorithm With Optimal Resource Utilization[J]. Vehicular Technology, IEEE Transactions on, 2013, 62(5): 2315 - 2326.

DOI: 10.1109/tvt.2012.2237557

Google Scholar

[3] Fang Q, Gao J, Guibas L J. Locating and Bypassing Holes in Sensor Networks[J]. Mobile Networks and Applications, 2006, 11(2): 187-200.

DOI: 10.1007/s11036-006-4471-y

Google Scholar

[4] Zhao Qian, Hongwei Liu, et al. Research on Routing Algorithms for mobile ad-hoc networks based on location information[J]. Intelligent computer and Application, 2013, (1).

Google Scholar

[5] Wang C, Syue S. A Geographic-Based Approach to Relay Selection for Wireless Ad Hoc Relay Networks[C]. /Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th. IEEE, 2009: 1 - 5.

DOI: 10.1109/vetecs.2009.5073295

Google Scholar

[6] S Basagni, I Chlamtac, V R Syrotiuk. A distance routing effect algorithm for mobility (DREAM)[M]. The ACM/IEEE Int'l Conf on Mobile Computing and Networking(MOBICOM), Dallas, (1998).

DOI: 10.1145/288235.288254

Google Scholar

[7] Zhao Y, Chen Y, Li B, et al. Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks[J]. Mobile Computing, IEEE Transactions on, 2007, 6(9): 1075 - 1089.

DOI: 10.1109/tmc.2007.1042

Google Scholar