Mobility based minimal network coding (MBMNC) algorithm for mobile ad-hoc network

Saravanan K, Venkatalakshmi B
{"title":"Mobility based minimal network coding (MBMNC) algorithm for mobile ad-hoc network","authors":"Saravanan K, Venkatalakshmi B","doi":"10.1109/ICRTIT.2013.6844218","DOIUrl":null,"url":null,"abstract":"Recent times, a new communication archetype called Network Coding (NC) has emerged in which the mediator nodes allowed to carry out encoding and decoding operations on the information they receive. Network capacity of any communication network can be enhanced through this network coding strategy. Mobile Ad-hoc Networks (MANET) often consist of large number of mobile nodes that are strictly power constrained. So, it is important to minimize the power utilization of every single node in order to improve the network lifetime. Blind Encoding consequences superfluous power consumption. If a node moves after encoding the packet due its dynamic nature then obviously waste of time and power occurs. This work proposes an algorithm called mobility based minimal network coding algorithm (MBMNC) for MANET which allows only minimal number of nodes to encode by considering the node mobility. The eligibility criteria of a node to do NC have a dependency on link availability of a node with respect to its neighboring node. The probability of the link availability influences the decision of whether the node is an encoding node or forwarding node. Only a limited number of nodes with high probability of link availability will do network coding. This work proposes a solution for enhancing the network capacity through network coding in consideration with node mobility.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"465 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recent times, a new communication archetype called Network Coding (NC) has emerged in which the mediator nodes allowed to carry out encoding and decoding operations on the information they receive. Network capacity of any communication network can be enhanced through this network coding strategy. Mobile Ad-hoc Networks (MANET) often consist of large number of mobile nodes that are strictly power constrained. So, it is important to minimize the power utilization of every single node in order to improve the network lifetime. Blind Encoding consequences superfluous power consumption. If a node moves after encoding the packet due its dynamic nature then obviously waste of time and power occurs. This work proposes an algorithm called mobility based minimal network coding algorithm (MBMNC) for MANET which allows only minimal number of nodes to encode by considering the node mobility. The eligibility criteria of a node to do NC have a dependency on link availability of a node with respect to its neighboring node. The probability of the link availability influences the decision of whether the node is an encoding node or forwarding node. Only a limited number of nodes with high probability of link availability will do network coding. This work proposes a solution for enhancing the network capacity through network coding in consideration with node mobility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
移动自组网中基于移动性的最小网络编码算法
最近,出现了一种称为网络编码(Network Coding, NC)的新通信原型,在这种原型中,中介节点允许对它们接收到的信息执行编码和解码操作。通过这种网络编码策略,可以提高任何通信网络的网络容量。移动自组织网络(MANET)通常由大量受到严格功率限制的移动节点组成。因此,为了改善网络生命周期,最小化每个单个节点的功率利用率是非常重要的。盲目编码会导致多余的功耗。如果一个节点由于其动态特性而在编码后移动,那么显然会浪费时间和功率。本文提出了一种基于移动性的最小网络编码算法(MBMNC),该算法通过考虑节点的移动性,只允许最小数量的节点进行编码。一个节点进行NC的资格标准依赖于该节点相对于其相邻节点的链路可用性。链路可用性的概率影响节点是编码节点还是转发节点的决定。只有具有高链路可用性的有限数量的节点才会进行网络编码。本文提出了一种考虑节点移动性的网络编码增强网络容量的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Secure AODV to combat black hole attack in MANET Position aware energy efficient multicast routing in MANET Evolutionary optimization in ANFIS for intelligent navigation system Voice based login authentication for Linux Information extraction and unfilled-form structure retrieval from filled-up forms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1