WEKO3
アイテム
Spray Router with Node Location Dependent Remaining-TTL Message Scheduling in DTNs
https://ipsj.ixsq.nii.ac.jp/records/169473
https://ipsj.ixsq.nii.ac.jp/records/16947313a2479d-a722-44ae-ba40-b6084817e72c
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5707006.pdf (4.8 MB)
|
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-07-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Spray Router with Node Location Dependent Remaining-TTL Message Scheduling in DTNs | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Spray Router with Node Location Dependent Remaining-TTL Message Scheduling in DTNs | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015] delay tolerant networks, store-carry-forward, routing protocol, message scheduling, island scenario. | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of Computer Science and System Engineering, Kyushu Institute of Technology | ||||||||||
| 著者所属 | ||||||||||
| Kyushu Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Computer Science and System Engineering, Kyushu Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Kyushu Institute of Technology | ||||||||||
| 著者名 |
Aguss, alim
× Aguss, alim
× Masato, Tsuru
|
|||||||||
| 著者名(英) |
Aguss, alim
× Aguss, alim
× Masato, Tsuru
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Delay and disruption tolerant networks (DTNs) adopt the store-carry-and-forward paradigm. Each node stores messages in a buffer storage and waits for either an appropriate forwarding opportunity or the message's expiration time, i.e., its time-to-live (TTL). There are two key issues that influence the performance of DTN routing: the forwarding policy that determines whether a message should be forwarded to an encountered node, and the buffer management policy that determines which message should be sent from the queue (i.e., message scheduling) and which message should be dropped when the buffer storage is full. This paper proposes a DTN routing protocol, called spray- and hop-distance-based with remaining-TTL consideration (SNHD-TTL) which integrates three features: (1) binary spray; (2) hop-distance-based forwarding; and (3) node location dependent remaining-TTL message scheduling. The aim is to better deliver messages which are highly congested especially in the “island scenario.” We evaluate it by simulation-based comparison with other popular protocols, namely Epidemic as a baseline and PRoPHETv2 that performs well according to our previous study. Our simulation results show that SNHD-TTL is able to outperform other routing protocols, significantly reduce overhead, and at the same time, increase the total size of delivered messages. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.647 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Delay and disruption tolerant networks (DTNs) adopt the store-carry-and-forward paradigm. Each node stores messages in a buffer storage and waits for either an appropriate forwarding opportunity or the message's expiration time, i.e., its time-to-live (TTL). There are two key issues that influence the performance of DTN routing: the forwarding policy that determines whether a message should be forwarded to an encountered node, and the buffer management policy that determines which message should be sent from the queue (i.e., message scheduling) and which message should be dropped when the buffer storage is full. This paper proposes a DTN routing protocol, called spray- and hop-distance-based with remaining-TTL consideration (SNHD-TTL) which integrates three features: (1) binary spray; (2) hop-distance-based forwarding; and (3) node location dependent remaining-TTL message scheduling. The aim is to better deliver messages which are highly congested especially in the “island scenario.” We evaluate it by simulation-based comparison with other popular protocols, namely Epidemic as a baseline and PRoPHETv2 that performs well according to our previous study. Our simulation results show that SNHD-TTL is able to outperform other routing protocols, significantly reduce overhead, and at the same time, increase the total size of delivered messages. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.647 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 57, 号 7, 発行日 2016-07-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
