基于重复博弈的移动自组网自利行为避免研究

Tao Lei, Ming-Sen Xiang
{"title":"基于重复博弈的移动自组网自利行为避免研究","authors":"Tao Lei, Ming-Sen Xiang","doi":"10.1109/MINES.2012.166","DOIUrl":null,"url":null,"abstract":"In a mobile ad hoc network (MANET), each node communicated with other nodes has relied on the intermediate nodes. But selfish nodes which aimed to get the greatest benefits from the MANET, like battery life and bandwidth. In this paper, we defined a half selfish node which is not selfish always but sometimes. Then we used the repeated game in MANET to avoid the half selfish nodes. Lastly, we have a simulation with NS-2 to test our scheme weather successful or not. Through the simulation, we proved our scheme is successful.","PeriodicalId":208089,"journal":{"name":"2012 Fourth International Conference on Multimedia Information Networking and Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Research of Avoid the Selfish Behavior in Mobile Ad Hoc Networks Based on Repeated Game\",\"authors\":\"Tao Lei, Ming-Sen Xiang\",\"doi\":\"10.1109/MINES.2012.166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a mobile ad hoc network (MANET), each node communicated with other nodes has relied on the intermediate nodes. But selfish nodes which aimed to get the greatest benefits from the MANET, like battery life and bandwidth. In this paper, we defined a half selfish node which is not selfish always but sometimes. Then we used the repeated game in MANET to avoid the half selfish nodes. Lastly, we have a simulation with NS-2 to test our scheme weather successful or not. Through the simulation, we proved our scheme is successful.\",\"PeriodicalId\":208089,\"journal\":{\"name\":\"2012 Fourth International Conference on Multimedia Information Networking and Security\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Multimedia Information Networking and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MINES.2012.166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Multimedia Information Networking and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MINES.2012.166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在移动自组网(MANET)中,各节点之间的通信依赖于中间节点。但自私的节点旨在从MANET中获得最大的好处,比如电池寿命和带宽。本文定义了一个半自利节点,它不是总是自利的,而是有时自利的。然后利用自组网中的重复博弈来避免半自利节点。最后,我们用NS-2进行了仿真,以测试我们的方案是否成功。通过仿真验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research of Avoid the Selfish Behavior in Mobile Ad Hoc Networks Based on Repeated Game
In a mobile ad hoc network (MANET), each node communicated with other nodes has relied on the intermediate nodes. But selfish nodes which aimed to get the greatest benefits from the MANET, like battery life and bandwidth. In this paper, we defined a half selfish node which is not selfish always but sometimes. Then we used the repeated game in MANET to avoid the half selfish nodes. Lastly, we have a simulation with NS-2 to test our scheme weather successful or not. Through the simulation, we proved our scheme is successful.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信