Evaluation of Distributed Cover Set Algorithms in Mobile Ad hoc Network for Simplified Multicast Forwarding
Abstract
This paper presents design issues and performance analysis of optimized cover set algorithms supporting Simplified Multicast Forwarding (SMF) of data plane traffic within mobile ad hoc network (MANET) environments. SMF is presently being developed within the Internet Engineering Task Force (IETF) as an experimental specification to provide simplified multicast data dissemination among multi-hop, wireless nodes within peer MANET routing neighborhoods. The SMF protocol allows for a variety of cover set reduction techniques to optimize the simplified data flooding and relaying process amongst routing peers. A variety of distributed algorithms for forming connected dominating sets (CDS) are being considered as mechanisms to reduce the cover set. This paper presents modeling and analysis work of various CDS relay set algorithms and demonstrates working code within an SMF implementation. We provide a brief problem background, discuss models and scenarios, compare various algorithms, and then summarize observations as well as discuss future work. A main purpose of the paper is to begin examining the robustness of the algorithms to mobility and increasing multicast traffic load. We examine the results against a classical flooding baseline for comparison.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 2007
- Accession Number
- ADA521608
Entities
People
- Brian Adamson
- Ian Downard
- Joseph Macker
- Justin Dean
Organizations
- United States Naval Research Laboratory