IEICE TRANSACTIONS on Fundamentals
A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks: WDD Algorithm
Summary :
In recent years, studies on multi-hop wireless networks have been made by many brilliant researchers. Such a network consists of a set of mobile nodes having wireless communication devices, and is constructed by the nodes autonomously. The most serious problem on the network is the difficulty of network topology management. All nodes are freely movable and their topology is dynamically changing continuously, so it is difficult to determine the paths to any nodes in the network. Although a classical flooding algorithm is a robust algorithm in that situation, the number of retransmitting nodes increases beyond what is necessary. In this paper, a new and more efficient information dissemination algorithm called WDD is proposed, which can substitute for various broadcasting algorithms by just selecting an appropriate waiting-time function. The algorithm is implemented and its applicability is evaluated on a network simulator.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.6 pp.1599-1611
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Mobile Information Network and Personal Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Toshio KOIDE, Hitoshi WATANABE, "A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks: WDD Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 6, pp. 1599-1611, June 2004, doi: .
Abstract: In recent years, studies on multi-hop wireless networks have been made by many brilliant researchers. Such a network consists of a set of mobile nodes having wireless communication devices, and is constructed by the nodes autonomously. The most serious problem on the network is the difficulty of network topology management. All nodes are freely movable and their topology is dynamically changing continuously, so it is difficult to determine the paths to any nodes in the network. Although a classical flooding algorithm is a robust algorithm in that situation, the number of retransmitting nodes increases beyond what is necessary. In this paper, a new and more efficient information dissemination algorithm called WDD is proposed, which can substitute for various broadcasting algorithms by just selecting an appropriate waiting-time function. The algorithm is implemented and its applicability is evaluated on a network simulator.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_6_1599/_p
Copy
@ARTICLE{e87-a_6_1599,
author={Toshio KOIDE, Hitoshi WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks: WDD Algorithm},
year={2004},
volume={E87-A},
number={6},
pages={1599-1611},
abstract={In recent years, studies on multi-hop wireless networks have been made by many brilliant researchers. Such a network consists of a set of mobile nodes having wireless communication devices, and is constructed by the nodes autonomously. The most serious problem on the network is the difficulty of network topology management. All nodes are freely movable and their topology is dynamically changing continuously, so it is difficult to determine the paths to any nodes in the network. Although a classical flooding algorithm is a robust algorithm in that situation, the number of retransmitting nodes increases beyond what is necessary. In this paper, a new and more efficient information dissemination algorithm called WDD is proposed, which can substitute for various broadcasting algorithms by just selecting an appropriate waiting-time function. The algorithm is implemented and its applicability is evaluated on a network simulator.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks: WDD Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1599
EP - 1611
AU - Toshio KOIDE
AU - Hitoshi WATANABE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2004
AB - In recent years, studies on multi-hop wireless networks have been made by many brilliant researchers. Such a network consists of a set of mobile nodes having wireless communication devices, and is constructed by the nodes autonomously. The most serious problem on the network is the difficulty of network topology management. All nodes are freely movable and their topology is dynamically changing continuously, so it is difficult to determine the paths to any nodes in the network. Although a classical flooding algorithm is a robust algorithm in that situation, the number of retransmitting nodes increases beyond what is necessary. In this paper, a new and more efficient information dissemination algorithm called WDD is proposed, which can substitute for various broadcasting algorithms by just selecting an appropriate waiting-time function. The algorithm is implemented and its applicability is evaluated on a network simulator.
ER -
English
