基于博弈理論的無線自組織網(wǎng)增強(qiáng)協(xié)作模型研究
doi: 10.11999/JEIT150356 cstr: 32379.14.JEIT150356
基金項(xiàng)目:
網(wǎng)絡(luò)體系架構(gòu)與融合北京市重點(diǎn)實(shí)驗(yàn)室主任基金(2015BKL-NSAC-ZJ-06)
Ad hoc Network Cooperation Enforcement Model Based on Game Theory
Funds:
The Director Funds of Laboratory of Network System Architecture and Convergence (2015BKL-NSAC-ZJ-06)
-
摘要: 為了解決無線自組織網(wǎng)絡(luò)中轉(zhuǎn)發(fā)節(jié)點(diǎn)因自身能量與存儲空間限制而拒絕協(xié)作的自私性問題,該文從分析數(shù)據(jù)包源節(jié)點(diǎn)與轉(zhuǎn)發(fā)節(jié)點(diǎn)的收益與開銷特性出發(fā),基于虛擬貨幣的獎(jiǎng)勵(lì)機(jī)制,結(jié)合博弈理論提出無線自組織網(wǎng)絡(luò)增強(qiáng)協(xié)作模型。該模型將網(wǎng)絡(luò)協(xié)作問題轉(zhuǎn)化為數(shù)據(jù)包轉(zhuǎn)發(fā)路徑中多轉(zhuǎn)發(fā)節(jié)點(diǎn)與源節(jié)點(diǎn)收益的博弈均衡問題,在保障雙方利益的基礎(chǔ)上提出最優(yōu)的激勵(lì)方式,促進(jìn)通信協(xié)作的進(jìn)行。另外,為最大化網(wǎng)絡(luò)生存時(shí)間與避免擁塞,該模型對轉(zhuǎn)發(fā)節(jié)點(diǎn)的電量與存儲空間狀態(tài)做了相應(yīng)的約束。
-
關(guān)鍵詞:
- 無線自組織網(wǎng) /
- 自私性 /
- 增強(qiáng)協(xié)作 /
- 博弈 /
- 虛擬貨幣
Abstract: In order to solve the selfishness problem that forwarding nodes in the wireless ad hoc network refuse to cooperation due to the limit of energy and storage space, a wireless ad hoc network cooperation enhancement model combined with the game theory is proposed, which is based on the incentive mechanism of virtual currency, analysis the benefit and overhead characteristics of the source nodes and forwarding nodes. In this model, the network cooperation problem is transformed into a game equilibrium problem about the benefit of source node and forwarding nodes in the data forwarding path, promoting the cooperation of communication. Furthermore, in order to avoid the congestion and maximizing network lifetime, the model makes some certain constraint about the energy and storage space for the forwarding nodes.-
Key words:
- Ad hoc network /
- Selfishness /
- Cooperation enforcement /
- Game theory /
- Virtual currency
-
Marti S and Giuli T J. Mitigating routing misbehavior in mobile Ad hoc networks[C]. MibiCOM 2000, USA, Boston, 2000: 255-265. Michiardi P and Molva R. Simulation-based analysis of security exposures in mobile Ad hoc networks[C]. Proceedings of European Wireless Conference, Firenze, Italy, 2002: 275-281. Malnar M Z and Neskovic N J. An analysis of performances of multi-channel routing protocol based on different link quality metrics[C]. International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, Nis, Serbia, 2011: 737-740. Buchegger S and Boudec J Y L. Performance analysis of the Confidant protocol: cooperation of nodes-fairness in dynamic Ad-hoc networks[C]. MobiHOC, Lausanne, Switzerland, 2002: 226-236. Michiardi P and Molva R. A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks[C]. Conference on Communications and Multimedia Security, Portoroz, 2002: 107-121. 汪洋, 林闖, 李學(xué)林, 等. 基于非合作博弈的無線網(wǎng)絡(luò)路由機(jī)制研究[J]. 計(jì)算機(jī)學(xué)報(bào), 2009, 32(1): 54-68. Wang Yang, Lin Chuang, Li Xue-lin, et al.. Non-cooperation game based research on routing schemes for wireless networks[J]. Chinese Journal of Computers, 2009, 32(1): 54-68. Akkarajitsakul K. Game theoretic approaches for multiple access in wireless networks: a survey[J]. IEEE Communications Surveys and Tutorials, 2012, 13(3): 372-395. Brown D R and Fazel F. A game theoretic study of energy efficient cooperative wireless networks[J]. Journal of Communications and Networks, 2011, 13(3): 266-276. Alizadeh Y, Sabaei M, and Tavallaie O. Game theoretic modeling of joint topology control and forwarding in MANET based on local information[C]. Computational Intelligence and Communication Networks (CICN), Mathura, India, 2013: 510-515. Sarkar S and Datta R. A game theoretic model for stochastic routing in self-organized MANETs[C]. Wireless Communications and Networking Conference (WCNC), Shanghai, China, 2013: 1962-1967. Rong C. Cooperative game based relay vehicle selection algorithm for VANETs[C]. Communications and Information Technologies (ISCIT), Seoul, Korea, 2014: 30-34. Anderegg L and Eidenbenz S. Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents[C]. International Conference on Mobile Computing and Networking, California, USA, 2003: 245-259. Buttyan L and Hubaux J P. Enforcing service availability in mobile Ad hoc WANs[C]. MobiHOC, Boston, USA, 2000: 87-96. Zhong S, Chen J, and Yang Y R. Sprite: a simple cheat proof credit-base system for mobile ad hoc networks[C]. INFOCOM, San Francisco, USA, 2003: 1987-1997. 鄭慧芳, 蔣挺, 周正. MANET增強(qiáng)合作模型的理論研究[J]. 北京郵電大學(xué)學(xué)報(bào), 2008, 31(10): 21-24. Zheng Hui-fang, Jiang Ting, and Zhou Zheng. Theoretical study with the model for MANET cooperation enforcement[J]. Journal of Beijing University of Posts and Telecommunications, 2008, 31(10): 21-14. Akkarajitsakul K, Hossain E, and Niyato D. Coalition-based cooperative packet delivery under uncertainty: a dynamic Bayesian coalitional game[J]. IEEE Transactions on Mobile Computing, 2013, 12(2): 371-385. Li Z and Shen H. Game-theoretic analysis of cooperation incentive strategies in mobile Ad hoc networks[J]. IEEE Transactions on Mobile Computing, 2012, 11(8): 1287-1303. Naserian M and Tepe K. Dynamic probabilistic forwarding in wireless Ad hoc networks based on game theory[C]. Vehicular Technology Conference (VTC Spring), Seoul, Korea, 2014: 1-5. 張華鵬, 張宏斌. 基于重復(fù)博弈的Ad hoc網(wǎng)絡(luò)合作轉(zhuǎn)發(fā)模型[J]. 電子與信息學(xué)報(bào), 2014, 36(3): 703-707. Zhang Hua-peng and Zhang Hong-bin. Cooperative forwarding model based on repeated game in Ad hoc networks[J]. Jourenal of Electronics Information Technology, 2014, 36(3): 703-707. 黃開枝, 洪穎, 羅文宇. 基于演化博弈機(jī)制的物理層安全協(xié)作方法[J]. 電子與信息學(xué)報(bào), 2015, 37(1): 193-197. Huang Kai-zhi, Hong Ying, and Luo Wen-yu. A method for physical layer security cooperation based on evolutionary game[J]. Journal of Electronics Information Technology, 2015, 37(1): 193-197. Tang Chang-bing, Li Ang, and Li Xiang. When reputation enforces evolutionary cooperation in unreliable MANETs[J]. IEEE Transactions on Cybernetics, 2014, PP(99): 1-1. Safaei Z, Sabaei M, and Torgheh F. An efficient reputation-based mechanism to enforce cooperation in MANETs[C]. Application of Information and Communication Technologies, Venice, Italy, 2009: 1-6. Sengathir J, Manoharan R, and Kumar R. Markovian process based reputation mechanisms for detecting selfish nodes in MANETs: A survey[C]. Advanced Computing (ICoAC), Madras, India, 2013: 217-222. 蔣小杰, 芮蘭蘭, 郭少勇, 等. 一種基于信譽(yù)的移動自組網(wǎng)區(qū)分服務(wù)激勵(lì)機(jī)制[J]. 電子與信息學(xué)報(bào), 2012, 29(7): 1299-1303. Jiang Xiao-jie, Rui Lan-lan, Guo Shao-yong, et al.. A Reputation-based service differentiated incentive mechanism for MANETs[J]. Journal of Electronics Information Technology, 2012, 29(7): 1299-1303. Liu L, Guo Y, and Yin L. Analyzing asking/bidding price in dynamic game for cooperative authentication[C]. Computer Communications Workshops (INFOCOM WKSHPS), Toronto, Canada, 2014: 165-166. Liu Li-cai, Yin Li-hua, Guo Yun-chuan, et al.. Bargaining-based dynamic decision for cooperative authentication in MANETs[C]. Trust, Security and Privacy in Computing and Communications (TrustCom), Beijing, China, 2014: 212-220. -
計(jì)量
- 文章訪問數(shù): 1364
- HTML全文瀏覽量: 116
- PDF下載量: 640
- 被引次數(shù): 0