Data Forwarding Algorithm Based on Energy Efficiency in Multi-Hop Device to Device Network

Energy efficiency is an important factor to optimize the multi-hop forwarding strategy. PD (Pairing-inspired Dijkstra) multi-hop data forwarding algorithm is proposed to share cellular spectrum resources with D2D (device-to-device) users. Candidate multiplexing channel model is established in our pr...

Full description

Saved in:
Bibliographic Details
Published in2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) pp. 300 - 304
Main Authors Zhang, Yong, Li, Ruonan, Zhang, Yanan, Song, Mei
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2017
Subjects
data forwarding
Delays
Device-to-device communication
Energy efficiency
multi-hop device to device
Multiplexing
Quality of service
Relays
shortest path
Spread spectrum communication
Online AccessGet full text
DOI10.1109/PDCAT.2017.00056

Cover

More Information
Summary:Energy efficiency is an important factor to optimize the multi-hop forwarding strategy. PD (Pairing-inspired Dijkstra) multi-hop data forwarding algorithm is proposed to share cellular spectrum resources with D2D (device-to-device) users. Candidate multiplexing channel model is established in our proposal. Based on this model, PD algorithm solves the issue on channel and path selection. PD algorithm includes two parts, KM dichotomous matching algorithm and multiple iterations for Dijkstra algorithm. Under energy efficiency and QoS (Quality of Service) constraint, PD algorithm selects optimal transmission path among D2D users. Furthermore, the energy efficiency and transmission delay are evaluated in simulation section under PD, Dijkstra and CD (Closest to Destination) algorithm. Simulation results indicate that PD has better performance on energy efficiency and E2E (End to End) delay.
DOI:10.1109/PDCAT.2017.00056