An outage-aware power saving Cooperative Routing algorithm in wireless networks

Pouyan Ahmadi, B. Jabbari
{"title":"An outage-aware power saving Cooperative Routing algorithm in wireless networks","authors":"Pouyan Ahmadi, B. Jabbari","doi":"10.1109/WTS.2013.6566252","DOIUrl":null,"url":null,"abstract":"In this paper emphasizing the relation between outage and power, we propose a novel cooperative routing algorithm, called Outage-aware K-shortest paths Cooperative Routing (OKCR), which minimizes the transmitted power while exploiting the merit of cooperative communication. The OKCR algorithm (i.e., inherently based on Yen's Kshortest paths algorithm) finds the best route between the source and the destination considering particular outage probability as its constraint. The proposed algorithm nominates k different optimum routes and then selects the best possible relay in each route on the basis of performance analysis. Simulation results show that this strategy enhances power-efficiency in comparison to non-cooperative and other existing cooperative algorithms investigated in the literature by more than 50%.","PeriodicalId":441229,"journal":{"name":"2013 Wireless Telecommunications Symposium (WTS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Wireless Telecommunications Symposium (WTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WTS.2013.6566252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper emphasizing the relation between outage and power, we propose a novel cooperative routing algorithm, called Outage-aware K-shortest paths Cooperative Routing (OKCR), which minimizes the transmitted power while exploiting the merit of cooperative communication. The OKCR algorithm (i.e., inherently based on Yen's Kshortest paths algorithm) finds the best route between the source and the destination considering particular outage probability as its constraint. The proposed algorithm nominates k different optimum routes and then selects the best possible relay in each route on the basis of performance analysis. Simulation results show that this strategy enhances power-efficiency in comparison to non-cooperative and other existing cooperative algorithms investigated in the literature by more than 50%.
一种无线网络中可感知中断的节能协同路由算法
本文在强调停电与功率关系的基础上,提出了一种新的协同路由算法——中断感知k -最短路径协同路由(OKCR),该算法在充分利用协同通信优点的同时使传输功率最小化。OKCR算法(即本质上基于Yen的k最短路径算法)以特定的中断概率作为约束,寻找源和目的之间的最佳路径。该算法提出k条不同的最优路由,然后在性能分析的基础上,在每条路由中选择可能的最优中继。仿真结果表明,与非合作算法和文献中研究的其他合作算法相比,该策略提高了50%以上的功率效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信