PERFORMANCE EVALUATION OF MOBILE AD HOC NETWORKS USING ROUTING WITH SELFISH NODES

J. Singh, R. Ranjan, Sant Longowal
{"title":"PERFORMANCE EVALUATION OF MOBILE AD HOC NETWORKS USING ROUTING WITH SELFISH NODES","authors":"J. Singh, R. Ranjan, Sant Longowal","doi":"10.18000/IJIES.30030","DOIUrl":null,"url":null,"abstract":"In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route request packets even if some of its neighbors have already broadcast the requests and thus the rebroadcasts may reach no additional nodes. Appropriate use of a probabilistic method can reduce the number of rebroadcasting; therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing reach ability or having any significant degradation. In this paper, we propose a selfish node based approach.","PeriodicalId":368328,"journal":{"name":"International Journal on Intelligent Electronic Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Intelligent Electronic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18000/IJIES.30030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route request packets even if some of its neighbors have already broadcast the requests and thus the rebroadcasts may reach no additional nodes. Appropriate use of a probabilistic method can reduce the number of rebroadcasting; therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing reach ability or having any significant degradation. In this paper, we propose a selfish node based approach.
基于自利节点路由的移动AD hoc网络性能评估
在移动自组织网络(manet)[1]中,移动站(MS)可以通过中间节点作为中继与其传输范围外的节点进行通信。为了找到到特定目的节点的路径,源节点广播路由请求报文,并将其转发给所有其他节点。在AODV[2]中采用了一种简单的泛洪方案,每个节点重广播这些路由请求数据包,即使它的一些邻居已经广播了这些请求,因此重广播可能不会到达其他节点。适当地使用概率方法可以减少转播的次数;因此减少了相邻节点之间争用和冲突的机会。一个好的概率广播协议可以实现更高的吞吐量和更低的能量消耗,而不会牺牲到达能力或有任何明显的退化。在本文中,我们提出了一种基于自利节点的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信