IEICE TRANSACTIONS on Communications
Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
Summary :
In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.10 pp.3216-3225
- Publication Date
- 2008/10/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.10.3216
- Type of Manuscript
- PAPER
- Category
- Network
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
Takahiro MATSUDA, Taku NOGUCHI, Tetsuya TAKINE, "Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 10, pp. 3216-3225, October 2008, doi: 10.1093/ietcom/e91-b.10.3216.
Abstract: In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.10.3216/_p
Copy
@ARTICLE{e91-b_10_3216,
author={Takahiro MATSUDA, Taku NOGUCHI, Tetsuya TAKINE, },
journal={IEICE TRANSACTIONS on Communications},
title={Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks},
year={2008},
volume={E91-B},
number={10},
pages={3216-3225},
abstract={In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.},
keywords={},
doi={10.1093/ietcom/e91-b.10.3216},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3216
EP - 3225
AU - Takahiro MATSUDA
AU - Taku NOGUCHI
AU - Tetsuya TAKINE
PY - 2008
DO - 10.1093/ietcom/e91-b.10.3216
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2008
AB - In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.
ER -
English
