An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks

Aminu Mohammed, M. Ould-Khaoua, L. Mackenzie, J. Abdulai
{"title":"An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks","authors":"Aminu Mohammed, M. Ould-Khaoua, L. Mackenzie, J. Abdulai","doi":"10.1109/UKSIM.2008.16","DOIUrl":null,"url":null,"abstract":"Broadcasting is a fundamental and frequently usedoperation in mobile ad hoc networks (MANETs) wherea source node diffuses a message to all other nodes inthe networks. Flooding, the process in which eachnode retransmits every uniquely received packetexactly once is the simplest and most commonly usedmechanism for broadcasting in MANETs. Despite itssimplicity, it can result in high redundantretransmission, contention and collision, aphenomenon collectively referred to as the broadcaststorm problem, which can greatly increase thenetwork communication overhead. This paperproposes an adjusted counter-based scheme whichcombines the advantages of probability and counterbasedapproaches to mitigate this inherent problem.The scheme is simple, efficient and uses tworebroadcast probabilities to differentiate betweenmobile nodes in sparse and dense area as againstdropping the rebroadcast packet when a node is indense area. We evaluate the performance of ourscheme by comparing it against flooding, fixedprobability and counter-based schemes. Simulationresults reveal that our scheme achieves betterperformance in terms of saved rebroadcast, end-toenddelay and without sacrificing reachability.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"54 1","pages":"441-446"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKSIM.2008.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

Broadcasting is a fundamental and frequently usedoperation in mobile ad hoc networks (MANETs) wherea source node diffuses a message to all other nodes inthe networks. Flooding, the process in which eachnode retransmits every uniquely received packetexactly once is the simplest and most commonly usedmechanism for broadcasting in MANETs. Despite itssimplicity, it can result in high redundantretransmission, contention and collision, aphenomenon collectively referred to as the broadcaststorm problem, which can greatly increase thenetwork communication overhead. This paperproposes an adjusted counter-based scheme whichcombines the advantages of probability and counterbasedapproaches to mitigate this inherent problem.The scheme is simple, efficient and uses tworebroadcast probabilities to differentiate betweenmobile nodes in sparse and dense area as againstdropping the rebroadcast packet when a node is indense area. We evaluate the performance of ourscheme by comparing it against flooding, fixedprobability and counter-based schemes. Simulationresults reveal that our scheme achieves betterperformance in terms of saved rebroadcast, end-toenddelay and without sacrificing reachability.
一种基于调整计数器的移动Ad Hoc网络广播方案
广播是移动自组织网络(manet)中基本且经常使用的操作,其中源节点将消息扩散到网络中的所有其他节点。泛洪,即每个节点只重传一次唯一接收到的数据包的过程,是在manet中最简单和最常用的广播机制。尽管它很简单,但它可能导致高冗余转发、争用和冲突,这种现象统称为广播风暴问题,它会大大增加网络通信开销。本文提出了一种调整后的基于计数器的方案,该方案结合了概率和基于计数器的方法的优点来缓解这一固有问题。该方案简单、高效,利用两个重广播概率来区分稀疏和密集区域的移动节点,避免了密集区域节点重广播数据包的丢失。我们通过将其与泛洪、固定概率和基于计数器的方案进行比较来评估我们的方案的性能。仿真结果表明,该方案在不牺牲可达性的前提下,在节省重播、端到端延迟等方面取得了较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信