CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast

Authors:
Yunjung Yi;Jiejun Kong;Mario Gerla;Joon-Sang Park
Affiliations:
Computer Science Department, University of California, Los Angeles, CA 90095, USA;Computer Science Department, University of California, Los Angeles, CA 90095, USA;Computer Science Department, University of California, Los Angeles, CA 90095, USA;Department of Computer Engineering, Hongik University, 72-1 Sangsoo-dong, Mapo-gu, Seoul 121-791, Republic of Korea
Venue:
Computer Communications
Year:
2008

Citing 12
Cited 1

A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Multicast operation of the ad-hoc on-demand distance vector routing protocol

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Scalable multicasting: the core-assisted mesh protocol

Mobile Networks and Applications
Wake on wireless: an event driven energy saving strategy for battery operated devices

Proceedings of the 8th annual international conference on Mobile computing and networking
On-demand multicast routing protocol in multihop wireless mobile networks

Mobile Networks and Applications
Improving Internet multicast with routing labels

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Epidemic-based approaches for reliable multicast in mobile ad hoc networks

ACM SIGOPS Operating Systems Review
The Case for FEC-Based Reliable Multicast in Wireless Mesh Networks

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Codecast: a network-coding-based ad hoc multicast protocol

IEEE Wireless Communications
Reliable multicast transport protocol (RMTP)

IEEE Journal on Selected Areas in Communications

Review: Review of multicast routing mechanisms in mobile ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad hoc networks. CORA is an independent service that can run atop any ad hoc multicast routing protocol. The main features of CORA are localized recovery process, deterministic (as opposed to probabilistic) peer-to-peer recovery, and ability to trade off recovery with latency. A key component of CORA is the Cached Packet Distance Vector (CPDV) protocol for local peer-to-peer loss recovery. CPDV finds and retrieves the nearest copy of the missing packet while providing other useful NACK aggregation features. We use simulation experiments to demonstrate the effectiveness of CORA and explore the tradeoffs of CPDV localized recovery benefits versus memory and processor overhead. In a typical simulation experiment with mobile nodes CORA yields up to 99% delivery ratio as compared to 91% delivery ratio by Gossip. This improvement is achieved with negligible overhead.