多跳设备到设备网络中基于能效的数据转发算法

2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2017-12-01 DOI:10.1109/PDCAT.2017.00056

Yong Zhang, Ruonan Li, Yanan Zhang, Mei Song

{"title":"多跳设备到设备网络中基于能效的数据转发算法","authors":"Yong Zhang, Ruonan Li, Yanan Zhang, Mei Song","doi":"10.1109/PDCAT.2017.00056","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Data Forwarding Algorithm Based on Energy Efficiency in Multi-Hop Device to Device Network\",\"authors\":\"Yong Zhang, Ruonan Li, Yanan Zhang, Mei Song\",\"doi\":\"10.1109/PDCAT.2017.00056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":119197,\"journal\":{\"name\":\"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2017.00056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2017.00056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

能量效率是优化多跳转发策略的一个重要因素。为了与D2D (device-to-device)用户共享蜂窝频谱资源，提出了PD (pair -inspired Dijkstra)多跳数据转发算法。本文建立了候选复用信道模型。基于该模型，PD算法解决了信道和路径的选择问题。PD算法包括KM二分类匹配算法和多次迭代Dijkstra算法两部分。PD算法在能量效率和QoS (Quality Service)约束下，在D2D用户之间选择最优传输路径。在仿真部分对PD、Dijkstra和CD (nearest to Destination)算法下的能量效率和传输延迟进行了评估。仿真结果表明，PD在能效和端到端延迟方面具有较好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

自引率

0.00%

发文量