講演名 | 2004/7/8 A Game Theorem-Based Approach to Avoid Malicious Nodes in Mobile Ad hoc Networks , |
---|---|
PDFダウンロードページ | PDFダウンロードページへ |
抄録(和) | |
抄録(英) | In ubiquitous context of mobile ad hoc networks, all network functions must be performed by the nodes themselves. Whereas the bandwidth allocated per node decreases with the number of nodes increase, some nodes may be interested in higher bandwidth, in this case, they may intend not to relay packets for other nodes. If most nodes find it benefit for themselves, their sequacious actions may break down the whole network. We address this as malicious nodes problem. In this paper, our approach is based on game theory with noncooperation, i. e., there are conflicts for which the rules of a game do not specify any agreement or cooperation. We establish a simple malicious node game that models the bandwidth payoffs for the network and the nodes, define contribution rate (CR) and attack rate (AR) for the two strategies of each node, and then we show Nash equilibria exist in all-node strategy set. Finally we propose an algorithm that converges to a Nash equilibrium. |
キーワード(和) | |
キーワード(英) | Malicious Nodes / Game theory / Pareto Optimal Point / Nash Equilibrium |
資料番号 | MoMuC2004-35 |
発行日 |
研究会情報 | |
研究会 | MoMuC |
---|---|
開催期間 | 2004/7/8(から1日開催) |
開催地(和) | |
開催地(英) | |
テーマ(和) | |
テーマ(英) | |
委員長氏名(和) | |
委員長氏名(英) | |
副委員長氏名(和) | |
副委員長氏名(英) | |
幹事氏名(和) | |
幹事氏名(英) | |
幹事補佐氏名(和) | |
幹事補佐氏名(英) |
講演論文情報詳細 | |
申込み研究会 | Mobile Multimedia Communications(MoMuC) |
---|---|
本文の言語 | ENG |
タイトル(和) | |
サブタイトル(和) | |
タイトル(英) | A Game Theorem-Based Approach to Avoid Malicious Nodes in Mobile Ad hoc Networks |
サブタイトル(和) | |
キーワード(1)(和/英) | / Malicious Nodes |
第 1 著者 氏名(和/英) | / Mingmei Li |
第 1 著者 所属(和/英) | The Graduate University for Advance Studies |
発表年月日 | 2004/7/8 |
資料番号 | MoMuC2004-35 |
巻番号(vol) | vol.104 |
号番号(no) | 189 |
ページ範囲 | pp.- |
ページ数 | 6 |
発行日 |