Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2008-10-01
著者
-
TAKINE Tetsuya
Graduate School of Engineering, Osaka University
-
Takine Tetsuya
Graduate School Of Engineering Osaka University
-
Takine Tetsuya
Department Of Information And Communication Technology Graduate School Of Engineering Osaka Universi
-
MATSUDA Takahiro
Graduate School of Engineering, Osaka University
-
NOGUCHI Taku
College of Information Science and Engineering, Ritsumeikan University
-
Noguchi Taku
Ritsumeikan Univ. Kusatsu‐shi Jpn
-
Noguchi Taku
College Of Information Science And Engineering Ritsumeikan University
-
Matsuda Takahiro
Osaka Univ. Suita‐shi Jpn
-
Matsuda Takahiro
Graduate School Of Engineering Osaka University
関連論文
- On Strategies for Allocating Replicas of Mobile Databases
- Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
- Contention-Free λ-Planes in Optically Burst-Switched WDM Networks(Internet)
- Identifying Heavy-Hitter Flows from Sampled Flow Statistics(Next Generation Network Management)
- TCP Congestion Control with ACK-Pacing for Vertical Handover(Network)
- Network Supported Bandwidth Control for TCP in Hierarchical Mobile Internet(Internet)
- Mismatch of Packet Recovery Mechanisms for Bit Error and Handover in Wireless TCP(TCP)(Networking Technologies for Mobile Internet Systems)
- Construction of a Robust Multicast Tree for Application-Level Multicast(Multicast, Autonomous Decentralized Systems)
- Cheatproof Dual-Tree Application-Level Multicast for Bulk Data Distribution
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas(Network Quality and Control)
- Contribution of the Application, Transport and Network Layers to the Self-Similarity of Internet Traffic(Network Protocols)
- Survey of Network Coding and Its Applications
- Active ECN Mechanism for Fairness among TCP Sessions with Different Round Trip Times(Internet)
- Performance Analysis of Fairness Issue of Wireless and Wired TCP Connections
- Performance Evaluation of TCP Session Considering Long-Range Dependence of RTT
- Compressive Sampling for Remote Control Systems
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas
- Bitwise Operation-Based In-Network Processing for Loss Tomography
- Sequential Loss Tomography Using Compressed Sensing
- Contribution of the Application, Transport and Network Layers to the Self-Similarity of Internet Traffic