The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
On-Demand Multicasting in Ad-Hoc Networks: Comparing AODV and ODMRP
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Cross layering in wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Broadcasting in multihop mobile tactical networks: to network code or not
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
EDFS a novel flooding protocol for multi-hop wireless networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Distributed connected dominating set election from uniform random to power law network graphs
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
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. We observe similar efficiency and robustness performance for several forwarding algorithms of interest.