| アイテムタイプ |
学術雑誌論文 / Journal Article.(1) |
| 公開日 |
2017-10-06 |
| 書誌情報 |
ja : IEEE Transactions on Parallel and Distributed Systems
巻 26,
号 8,
p. 2178-2187,
発行日 2014-08-01
|
| タイトル |
|
|
タイトル |
CAMF: Context-Aware Message Forwarding in Mobile Social Networks |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
mobile social networks |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
forwarding/receiving capability |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
knapsack problem |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
forwarding profit maximization |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
WEI, Kaimin
董, 冕雄
太田, 香
XU, Ke
|
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
董 冕雄（DONG Mianxiong） |
|
URL |
http://rdsoran.muroran-it.ac.jp/html/100000145_ja.html |
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
In mobile social networks (MSN), with the aim of conserving limited resources, egotistic nodes might refuse to forward messages for other nodes. Different from previous work which mainly focuses on promoting cooperation between selfish nodes, we consider it from a more pragmatic perspective in this paper. Be specific, we regard selfishness as a native attribute of a system and allow nodes to exhibit selfish behavior in the process of message forwarding. Apparently, selfishness has a profound influence on routing efficiency, and thus novel mechanisms are necessary to improve routing performance when self-centered nodes are considered. We first put forward a stateless approach to measure encounter opportunities between nodes, and represent forwarding capabilities of nodes by combining the acquired encounter opportunities with node selfishness.We then quantify receiving capabilities of nodes based on their available buffer size and energy. Taking both forwarding and receiving capabilities into account, we finally present a forwarding set mechanism, which could be deduced to a multiple knapsack problem to maximize the forwarding profit. Consequently, we take all the above studies into the design of a context-aware message forwarding algorithm (CAMF). Extensive trace-driven simulations show that CAMF outperforms other existing algorithms greatly. In fact, it achieves a surprisingly high routing performance while consumes low transmission cost and resource in MSN. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE |
|
言語 |
en |
| 出版者版へのリンク |
|
|
表示名 |
10.1109/TPDS.2014.2346212 |
|
URL |
https://doi.org/10.1109/TPDS.2014.2346212 |
| DOI |
|
|
関連タイプ |
isVersionOf |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/TPDS.2014.2346212 |
| 日本十進分類法 |
|
|
主題Scheme |
NDC |
|
主題 |
547 |
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
1045-9219 |
| 権利 |
|
|
権利情報 |
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
|
言語 |
en |
| 著者版フラグ |
|
|
出版タイプ |
AM |
|
出版タイプResource |
http://purl.org/coar/version/c_ab4af688f83e57aa |
| フォーマット |
|
|
内容記述タイプ |
Other |
|
内容記述 |
application/pdf |
IEEE_2015_26(8)_2178 (1.9 MB)
