Distributed lifetime maximizing cooperative routing algorithm in wireless Ad hoc networks

Lina Zheng, Ju Liu, C. Zhai, Lei Chen
{"title":"Distributed lifetime maximizing cooperative routing algorithm in wireless Ad hoc networks","authors":"Lina Zheng, Ju Liu, C. Zhai, Lei Chen","doi":"10.4108/CHINACOM.2010.39","DOIUrl":null,"url":null,"abstract":"In this paper, jointly combining advantages of cooperative communication at the physical layer and distributed routing schemes at the network layer, we propose a novel lifetime maximizing cooperative routing (LMCR) algorithm with decode-and-forward cooperative fashion to prolong the lifetime of wireless Ad-hoc networks. Optimal power allocation mechanism is analyzed for both cooperative and non-cooperative links with the constraint of average SER. Subsequently, link costs representing the weighted total consumed power are constructed to avoid the overuse of certain nodes with little energy. In addition, both the transmission energy and circuit energy are considered in energy consumption model. Finally, simulation results are provided to verify the efficiency of the proposed routing scheme.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International ICST Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/CHINACOM.2010.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, jointly combining advantages of cooperative communication at the physical layer and distributed routing schemes at the network layer, we propose a novel lifetime maximizing cooperative routing (LMCR) algorithm with decode-and-forward cooperative fashion to prolong the lifetime of wireless Ad-hoc networks. Optimal power allocation mechanism is analyzed for both cooperative and non-cooperative links with the constraint of average SER. Subsequently, link costs representing the weighted total consumed power are constructed to avoid the overuse of certain nodes with little energy. In addition, both the transmission energy and circuit energy are considered in energy consumption model. Finally, simulation results are provided to verify the efficiency of the proposed routing scheme.
无线Ad hoc网络中的分布式生存期最大化协同路由算法
本文结合物理层协作通信和网络层分布式路由方案的优点,提出了一种新的LMCR(生存期最大化协作路由)算法,该算法采用解码转发的协作方式来延长无线Ad-hoc网络的生存期。在平均电力效率约束下,分析了合作链路和非合作链路的最优电力分配机制。随后,构建代表加权总消耗功率的链路成本,以避免某些能量较少的节点过度使用。此外,在能量消耗模型中同时考虑了传输能量和电路能量。最后,仿真结果验证了所提路由方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信