2跳中继蜂窝网络中的节能方法

A. Negi, Suresh Singh
{"title":"2跳中继蜂窝网络中的节能方法","authors":"A. Negi, Suresh Singh","doi":"10.1109/PIMRC.2005.1651717","DOIUrl":null,"url":null,"abstract":"This paper discusses various approaches to save power in relay-based cellular networks. We introduce an optimization method based on the Hungarian assignment problem to globally minimize the power-based allocation of relays. We compare this approach with the greedy approach of choosing a relay. We introduce another approach based on the concept of intelligent relays. Here, based on the expected power values of mobiles at the relay's location, the relay chooses to carry call for a mobile. We show that this approach introduces less intra-cell interference","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Power saving approaches in 2-hop relaying cellular networks\",\"authors\":\"A. Negi, Suresh Singh\",\"doi\":\"10.1109/PIMRC.2005.1651717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses various approaches to save power in relay-based cellular networks. We introduce an optimization method based on the Hungarian assignment problem to globally minimize the power-based allocation of relays. We compare this approach with the greedy approach of choosing a relay. We introduce another approach based on the concept of intelligent relays. Here, based on the expected power values of mobiles at the relay's location, the relay chooses to carry call for a mobile. We show that this approach introduces less intra-cell interference\",\"PeriodicalId\":248766,\"journal\":{\"name\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2005.1651717\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2005.1651717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

本文讨论了在基于中继的蜂窝网络中节省电力的各种方法。提出了一种基于匈牙利分配问题的优化方法,使继电器的功率分配全局最小化。我们将这种方法与选择继电器的贪心方法进行比较。我们介绍了基于智能继电器概念的另一种方法。在这里,根据中继所处位置的移动设备的预期功率值,中继选择为移动设备进行呼叫。我们表明,这种方法引入较少的细胞内干扰
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Power saving approaches in 2-hop relaying cellular networks
This paper discusses various approaches to save power in relay-based cellular networks. We introduce an optimization method based on the Hungarian assignment problem to globally minimize the power-based allocation of relays. We compare this approach with the greedy approach of choosing a relay. We introduce another approach based on the concept of intelligent relays. Here, based on the expected power values of mobiles at the relay's location, the relay chooses to carry call for a mobile. We show that this approach introduces less intra-cell interference
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信