Cross-Layer Optimization Using Game Theory to Alleviate Unfairness in Wireless Networks

R. Gunasekaran, E. Niranjani, S. Suganya, D. Vivekananthan, K. Raja
{"title":"Cross-Layer Optimization Using Game Theory to Alleviate Unfairness in Wireless Networks","authors":"R. Gunasekaran, E. Niranjani, S. Suganya, D. Vivekananthan, K. Raja","doi":"10.1109/KICSS.2012.13","DOIUrl":null,"url":null,"abstract":"The IEEE 802.11 Distributed Coordination Function (DCF) does not require the presence of a central controller or access point. It is therefore, the standard protocol used for resolving medium access contention in mobile ad hoc networks. IEEE 802.11 DCF is based on carrier sense multiple access with collision avoidance and Binary Exponential Back off Algorithm (BEBA). BEBA can improve the system throughput but increases the capture effect, permitting one node to seize the channel. This is because BEBA inherently favours the last successful node by providing it a smaller contention window after each successful transmission. This unfairness issue at the Medium Access Control (MAC) layer also affects the Transmission Control Protocol (TCP) layer as it leads to the most active connection dominating the shared channel. We have two types of instability issues that arise -- intraflow and interflow instabilities. In this paper, we take a game theory based approach for solving these instability issues that arise as a result of the capture effect. A modified back off mechanism for the DCF game called Optimized Back off Mechanism (OBM), in which nodes adopt smooth dynamics in changing their channel access probabilities by taking into account the actions of the other nodes in the neighborhood has been proposed. To ensure that no particular node gains undue access to the channel, we design the mechanism so as to achieve Nash equilibrium in the neighborhood. A node which unilaterally increases its channel access probability will eventually be penalized and incur a higher payoff. The mechanism will prevent a particular node or flow from dominating the shared channel in the intraflow and interflow scenarios respectively.","PeriodicalId":309736,"journal":{"name":"2012 Seventh International Conference on Knowledge, Information and Creativity Support Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Seventh International Conference on Knowledge, Information and Creativity Support Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KICSS.2012.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The IEEE 802.11 Distributed Coordination Function (DCF) does not require the presence of a central controller or access point. It is therefore, the standard protocol used for resolving medium access contention in mobile ad hoc networks. IEEE 802.11 DCF is based on carrier sense multiple access with collision avoidance and Binary Exponential Back off Algorithm (BEBA). BEBA can improve the system throughput but increases the capture effect, permitting one node to seize the channel. This is because BEBA inherently favours the last successful node by providing it a smaller contention window after each successful transmission. This unfairness issue at the Medium Access Control (MAC) layer also affects the Transmission Control Protocol (TCP) layer as it leads to the most active connection dominating the shared channel. We have two types of instability issues that arise -- intraflow and interflow instabilities. In this paper, we take a game theory based approach for solving these instability issues that arise as a result of the capture effect. A modified back off mechanism for the DCF game called Optimized Back off Mechanism (OBM), in which nodes adopt smooth dynamics in changing their channel access probabilities by taking into account the actions of the other nodes in the neighborhood has been proposed. To ensure that no particular node gains undue access to the channel, we design the mechanism so as to achieve Nash equilibrium in the neighborhood. A node which unilaterally increases its channel access probability will eventually be penalized and incur a higher payoff. The mechanism will prevent a particular node or flow from dominating the shared channel in the intraflow and interflow scenarios respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用博弈论的跨层优化缓解无线网络中的不公平
IEEE 802.11分布式协调功能(DCF)不需要中央控制器或接入点的存在。因此,它是用于解决移动自组织网络中介质访问争用的标准协议。IEEE 802.11 DCF基于载波感测多址,具有避碰和二进制指数回退算法(BEBA)。BEBA可以提高系统吞吐量,但增加捕获效果,允许一个节点占用信道。这是因为BEBA在每次成功传输后都会为最后一个成功的节点提供较小的争用窗口,从而有利于最后一个成功的节点。介质访问控制(MAC)层的这种不公平问题也会影响传输控制协议(TCP)层,因为它会导致最活跃的连接支配共享通道。我们有两种类型的不稳定性问题——内部流不稳定性和内部流不稳定性。在本文中,我们采用基于博弈论的方法来解决由于捕获效应而产生的这些不稳定性问题。提出了一种改进的DCF博弈退退机制,即优化退退机制(OBM),其中节点通过考虑邻域内其他节点的动作,采用平滑动态的方式来改变其通道访问概率。为了确保没有特定节点获得对通道的过度访问,我们设计了在邻域内实现纳什均衡的机制。单方面增加通道访问概率的节点最终会受到惩罚,并产生更高的收益。该机制将防止特定节点或流分别在流内和流间场景中主导共享通道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Framework of an Extended Reading Passage Grading System for Personalised English Learning Knowledge Management and E-governance: A Case Study of E-kiosk in India Knowledge Systems for User Applications and Education Demand Response Architectures and Load Management Algorithms for Energy-Efficient Power Grids: A Survey Towards more Efficient Building Energy Management Systems
×
引用
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