A huge amount of content exists on the Internet, and contents from mobile devices are also present. Growth of the Internet of Things (IoT) is further accelerating this trend. Content oriented networks have been proposed as a new network architecture that conducts routing using the content's ID instead of an IP address. Content queries are routed on the content name itself instead of a destination address in these content oriented networks. When the content from a mobile device moves somewhere else, all the routing tables are generally re-created with the movement information that the mobile device sends. However, a routing scheme that uses ant colony optimization has attracted attention for supporting this process, but this optimization has a problem in that it cannot cope with moving contents and users sufficiently. In this paper, we propose a scheme that can cope with moving contents sources and users that require contents by using pheromones that are laid by these moving mobile devices. This proposed scheme can be applied to case of not only moving content sources but also the moving request users. Moreover, we conduct simulations to evaluate the performance of the proposed scheme.
Shintaro MANOME
Tokyo Metropolitan University
Takuya ASAKA
Tokyo Metropolitan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shintaro MANOME, Takuya ASAKA, "Dynamic Ant Colony Optimization for Routing in Mobile Content Oriented Networks" in IEICE TRANSACTIONS on Communications,
vol. E100-B, no. 2, pp. 304-312, February 2017, doi: 10.1587/transcom.2016EBP3121.
Abstract: A huge amount of content exists on the Internet, and contents from mobile devices are also present. Growth of the Internet of Things (IoT) is further accelerating this trend. Content oriented networks have been proposed as a new network architecture that conducts routing using the content's ID instead of an IP address. Content queries are routed on the content name itself instead of a destination address in these content oriented networks. When the content from a mobile device moves somewhere else, all the routing tables are generally re-created with the movement information that the mobile device sends. However, a routing scheme that uses ant colony optimization has attracted attention for supporting this process, but this optimization has a problem in that it cannot cope with moving contents and users sufficiently. In this paper, we propose a scheme that can cope with moving contents sources and users that require contents by using pheromones that are laid by these moving mobile devices. This proposed scheme can be applied to case of not only moving content sources but also the moving request users. Moreover, we conduct simulations to evaluate the performance of the proposed scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3121/_p
Copy
@ARTICLE{e100-b_2_304,
author={Shintaro MANOME, Takuya ASAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Ant Colony Optimization for Routing in Mobile Content Oriented Networks},
year={2017},
volume={E100-B},
number={2},
pages={304-312},
abstract={A huge amount of content exists on the Internet, and contents from mobile devices are also present. Growth of the Internet of Things (IoT) is further accelerating this trend. Content oriented networks have been proposed as a new network architecture that conducts routing using the content's ID instead of an IP address. Content queries are routed on the content name itself instead of a destination address in these content oriented networks. When the content from a mobile device moves somewhere else, all the routing tables are generally re-created with the movement information that the mobile device sends. However, a routing scheme that uses ant colony optimization has attracted attention for supporting this process, but this optimization has a problem in that it cannot cope with moving contents and users sufficiently. In this paper, we propose a scheme that can cope with moving contents sources and users that require contents by using pheromones that are laid by these moving mobile devices. This proposed scheme can be applied to case of not only moving content sources but also the moving request users. Moreover, we conduct simulations to evaluate the performance of the proposed scheme.},
keywords={},
doi={10.1587/transcom.2016EBP3121},
ISSN={1745-1345},
month={February},}
Copy
TY - JOUR
TI - Dynamic Ant Colony Optimization for Routing in Mobile Content Oriented Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 304
EP - 312
AU - Shintaro MANOME
AU - Takuya ASAKA
PY - 2017
DO - 10.1587/transcom.2016EBP3121
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2017
AB - A huge amount of content exists on the Internet, and contents from mobile devices are also present. Growth of the Internet of Things (IoT) is further accelerating this trend. Content oriented networks have been proposed as a new network architecture that conducts routing using the content's ID instead of an IP address. Content queries are routed on the content name itself instead of a destination address in these content oriented networks. When the content from a mobile device moves somewhere else, all the routing tables are generally re-created with the movement information that the mobile device sends. However, a routing scheme that uses ant colony optimization has attracted attention for supporting this process, but this optimization has a problem in that it cannot cope with moving contents and users sufficiently. In this paper, we propose a scheme that can cope with moving contents sources and users that require contents by using pheromones that are laid by these moving mobile devices. This proposed scheme can be applied to case of not only moving content sources but also the moving request users. Moreover, we conduct simulations to evaluate the performance of the proposed scheme.
ER -