An On-Demand Cluster Formation Scheme for Efficient Flooding in Ad-Hoc Networks
Summary :
Flooding is usually utilized to find a multi-hop route toward a node which is not within transmission range. However, existing flooding schemes deteriorate the performance of network because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve the problem, a lightweight and novel flooding scheme is proposed in this paper. The scheme employs ongoing packets for constructing a cluster architecture as the existing on-demand clustering scheme. Unlike to the existing schemes, it makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results prove that it causes fewer packet transmissions and fewer collisions than those of two other schemes.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.9 pp.3563-3569
- Publication Date
- 2005/09/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.9.3563
- Type of Manuscript
- Special Section PAPER (Special Section on Advances in Ad Hoc Mobile Communications and Networking)
- Category
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
Gicheol WANG, Gihwan CHO, "An On-Demand Cluster Formation Scheme for Efficient Flooding in Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 9, pp. 3563-3569, September 2005, doi: 10.1093/ietcom/e88-b.9.3563.
Abstract: Flooding is usually utilized to find a multi-hop route toward a node which is not within transmission range. However, existing flooding schemes deteriorate the performance of network because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve the problem, a lightweight and novel flooding scheme is proposed in this paper. The scheme employs ongoing packets for constructing a cluster architecture as the existing on-demand clustering scheme. Unlike to the existing schemes, it makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results prove that it causes fewer packet transmissions and fewer collisions than those of two other schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.9.3563/_p
Copy
@ARTICLE{e88-b_9_3563,
author={Gicheol WANG, Gihwan CHO, },
journal={IEICE TRANSACTIONS on Communications},
title={An On-Demand Cluster Formation Scheme for Efficient Flooding in Ad-Hoc Networks},
year={2005},
volume={E88-B},
number={9},
pages={3563-3569},
abstract={Flooding is usually utilized to find a multi-hop route toward a node which is not within transmission range. However, existing flooding schemes deteriorate the performance of network because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve the problem, a lightweight and novel flooding scheme is proposed in this paper. The scheme employs ongoing packets for constructing a cluster architecture as the existing on-demand clustering scheme. Unlike to the existing schemes, it makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results prove that it causes fewer packet transmissions and fewer collisions than those of two other schemes.},
keywords={},
doi={10.1093/ietcom/e88-b.9.3563},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - An On-Demand Cluster Formation Scheme for Efficient Flooding in Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3563
EP - 3569
AU - Gicheol WANG
AU - Gihwan CHO
PY - 2005
DO - 10.1093/ietcom/e88-b.9.3563
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2005
AB - Flooding is usually utilized to find a multi-hop route toward a node which is not within transmission range. However, existing flooding schemes deteriorate the performance of network because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve the problem, a lightweight and novel flooding scheme is proposed in this paper. The scheme employs ongoing packets for constructing a cluster architecture as the existing on-demand clustering scheme. Unlike to the existing schemes, it makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results prove that it causes fewer packet transmissions and fewer collisions than those of two other schemes.
ER -
English
