Tree-based versus gossip-based reliable multicast in wireless ad hoc networks
| Autor: | D. Pao, K.S. Lau |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Computer science
Wireless ad hoc network computer.internet_protocol Distributed computing Distance Vector Multicast Routing Protocol Intelligent Network Xcast Gossip protocol Pragmatic General Multicast Vehicular ad hoc network Protocol Independent Multicast Multicast business.industry Inter-domain Network packet ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Mobile ad hoc network Ad hoc wireless distribution service Source-specific multicast Optimized Link State Routing Protocol Geocast Reliable multicast IP multicast business computer Computer network |
| Zdroj: | CCNC |
| DOI: | 10.1109/ccnc.2006.1593059 |
| Popis: | Gossip-based reliable multicast protocols for ad hoc networks have recently gained popularity. Gossip-based approach has the advantage that it is resilient to arbitrary node movements and failures. However, a large amount of data traffic will be generated by the gossip procedure. In this paper, an efficient tree-based reliable multicast protocol is presented. The proposed method can avoid feedback implosion at the source and share the workload of packet recovery among the multicast members. Simulations reveal that the large volume of data traffic in the gossip-based method will congest the network and adversely affects the packet delivery ratio. Tree-based method on the other hand is much more efficient and can achieve very good reliability. I. INTRODUCTION |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|