A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.
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
Hideki TODE, Makoto WADA, Kazuhiko KINOSHITA, Toshihiro MASAKI, Koso MURAKAMI, "Enhanced Flooding Algorithms Introducing the Concept of Biotic Growth" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 3, pp. 903-910, March 2005, doi: 10.1093/ietcom/e88-b.3.903.
Abstract: A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.3.903/_p
Copy
@ARTICLE{e88-b_3_903,
author={Hideki TODE, Makoto WADA, Kazuhiko KINOSHITA, Toshihiro MASAKI, Koso MURAKAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={Enhanced Flooding Algorithms Introducing the Concept of Biotic Growth},
year={2005},
volume={E88-B},
number={3},
pages={903-910},
abstract={A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.},
keywords={},
doi={10.1093/ietcom/e88-b.3.903},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Enhanced Flooding Algorithms Introducing the Concept of Biotic Growth
T2 - IEICE TRANSACTIONS on Communications
SP - 903
EP - 910
AU - Hideki TODE
AU - Makoto WADA
AU - Kazuhiko KINOSHITA
AU - Toshihiro MASAKI
AU - Koso MURAKAMI
PY - 2005
DO - 10.1093/ietcom/e88-b.3.903
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2005
AB - A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.
ER -