Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
Flooding for reliable multicast in multi-hop ad hoc networks
Wireless Networks
Multicasting: from fixed networks to ad hoc networks
Handbook of wireless networks and mobile computing
Independent-tree ad hoc multicast routing (ITAMAR)
Mobile Networks and Applications
A two-phase multicast routing in MANETs using Steiner connected dominating core sets
International Journal of Ad Hoc and Ubiquitous Computing
Simulating mission critical mobile ad hoc networks
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Multicast routing protocols in mobile ad hoc networks: a comparative survey and taxonomy
EURASIP Journal on Wireless Communications and Networking
A random obstacle-based mobility model for delay-tolerant networking
International Journal of Network Management
Modeling human mobility in obstacle-constrained ad hoc networks
Ad Hoc Networks
An anycast-based geocasting protocol for mobile ad hoc networks
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
An ad hoc multicast protocol based on passive data acknowledgement
Computer Communications
| Hi-index | 0.00 |
In this paper, we propose a multicast protocol for a multihop, mobile wireless network with cluster based routing and token access protocol within each cluster. The multicast protocol uses a shared tree which is dynamically updated to adjust to changes in topology and membership (i.e. dynamic joins and quits). Two options for tree maintenance have been simulated and evaluated: "hard state" (i.e. each connection must be explicitly cleared) and "soft state" (each connection is automatically timed out and must be refreshed). For the soft state policy, the performance of different choices of timeout and refresh timers is first analyzed for a range of node mobility values. Next, soft state and hard state policies are compared based on throughput, join delay, and control overhead criteria.