Resource Allocation for Energy Efficient k-out-of-n System in Mobile Ad Hoc Networks

Chien-An Chen, M. Won, R. Stoleru, G. Xie
{"title":"Resource Allocation for Energy Efficient k-out-of-n System in Mobile Ad Hoc Networks","authors":"Chien-An Chen, M. Won, R. Stoleru, G. Xie","doi":"10.1109/ICCCN.2013.6614183","DOIUrl":null,"url":null,"abstract":"Resource Allocation has been widely used for improving various performance metrics in wireless networks. Applying resource allocation to a Mobile Ad Hoc Network (MANET), however, is a challenging problem because of dynamic network topology. In this paper, we develop a novel resource allocation scheme designed for MANETs that minimizes the communication cost for accessing distributed resources while improving the reliability by adopting the k-out-of-n system, a widely used technique for reliability control. Specifically, we propose a scheme that allocates resources to n nodes, called service centers, such that the expected energy consumption for nodes to access k service centers out of the n service centers (k ≤ n) is minimized. Our scheme accounts for dynamic network topology by estimating the failure probabilities of nodes and monitoring the network for significant topology changes. In addition, an Importance Sampling technique is used to reduce the computation-overhead. To evaluate the performance, we build a mobile distributed file system based on our resource allocation scheme. Through both extensive simulations and real hardware implementation on Smartphones, we show that our resource allocation scheme effectively reduces energy consumption by up to 45% and increases the successful data retrieval rate by up to 50% in comparison with a greedy algorithm.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Resource Allocation has been widely used for improving various performance metrics in wireless networks. Applying resource allocation to a Mobile Ad Hoc Network (MANET), however, is a challenging problem because of dynamic network topology. In this paper, we develop a novel resource allocation scheme designed for MANETs that minimizes the communication cost for accessing distributed resources while improving the reliability by adopting the k-out-of-n system, a widely used technique for reliability control. Specifically, we propose a scheme that allocates resources to n nodes, called service centers, such that the expected energy consumption for nodes to access k service centers out of the n service centers (k ≤ n) is minimized. Our scheme accounts for dynamic network topology by estimating the failure probabilities of nodes and monitoring the network for significant topology changes. In addition, an Importance Sampling technique is used to reduce the computation-overhead. To evaluate the performance, we build a mobile distributed file system based on our resource allocation scheme. Through both extensive simulations and real hardware implementation on Smartphones, we show that our resource allocation scheme effectively reduces energy consumption by up to 45% and increases the successful data retrieval rate by up to 50% in comparison with a greedy algorithm.
移动Ad Hoc网络中高效k-out- n系统的资源分配
在无线网络中,资源分配被广泛用于改善各种性能指标。然而,由于网络拓扑结构的动态性,对移动自组织网络(MANET)进行资源分配是一个具有挑战性的问题。在本文中,我们开发了一种新的为manet设计的资源分配方案,该方案通过采用k-out- n系统(一种广泛使用的可靠性控制技术)来最小化访问分布式资源的通信成本,同时提高可靠性。具体来说,我们提出了一种方案,将资源分配给n个节点,称为服务中心,使得节点访问n个服务中心(k≤n)中的k个服务中心的期望能耗最小。我们的方案通过估计节点的故障概率和监测网络的重大拓扑变化来考虑动态网络拓扑。此外,还使用了重要性采样技术来减少计算开销。为了评估性能,我们基于我们的资源分配方案构建了一个移动分布式文件系统。通过大量的模拟和智能手机上的实际硬件实现,我们表明,与贪婪算法相比,我们的资源分配方案有效地减少了高达45%的能耗,并将成功的数据检索率提高了高达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学术官方微信