Tree Multicast Strategies in Mobile , Multihop
نویسندگان
چکیده
Tree multicast is a well established concept in wired networks. Two versions, per-source tree multicast (e.g. DVMRP) and shared tree multicast (e.g. Core Based Tree), account for the majority of the wireline implementations. In this paper, we extend the tree multicast concept to wireless, mobile, multihop networks for applications ranging from ad hoc networking to disaster recovery and battleeeld. The main challenge in wireless, mobile networks is the rapidly changing environment. We address this issue in our design by: (a) using \soft state"; (b) assigning diierent roles to nodes depending on their mobility (2-level mobility model); (c) proposing an adaptive scheme which combines shared tree and per-source tree beneets, and; (d) dynamically relocating the shared tree Rendezvous Point (RP). A detailed wireless simulation model is used to evaluate various multicast schemes. The results show that per-source trees perform better in heavy loads because of the more eecient traac distribution; while shared trees are more robust to mobility and are more scalable to large network sizes. The adaptive tree multicast scheme, a hybrid between shared tree and per-source tree, combines the advantages of both and performs consistently well across all load and mobility scenarios. The main contributions of this study are: the use of a 2-level mobility model to improve the stability of the shared tree; the development of a hybrid, adaptive per-source and shared tree scheme, and; the dynamic relocation of the RP in the shared tree.
منابع مشابه
Tree Multicast Strategies in Mobile, Multihop Wireless Networks
Tree multicast is a well established concept in wired networks. Two versions, per-source tree multicast (e.g., DVMRP) and shared tree multicast (e.g., Core Based Tree), account for the majority of the wireline implementations. In this paper, we extend the tree multicast concept to wireless, mobile, multihop networks for applications ranging from ad hoc networking to disaster recovery and battle...
متن کاملShared Tree Wireless Network Multicast
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...
متن کاملEnergy-efficient broadcast and multicast routing in multihop ad hoc wireless networks
This paper addresses the problem of broadcasting and multicasting in large scale multihop ad hoc wireless networks. We focus on the energy-efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session. Minimum spanning tree (MST) has the property that the longest edge in the tree is the s...
متن کاملOn-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Dem...
متن کاملAdaptive Shared Tree Multicast in Mobile Wireless Networks
Shared Tree multicast is a well established concept used in several multicast protocols for wireline networks (eg. Core Base Tree, PIM sparse mode etc). In this paper, we extend the Shared Tree concept to wireless, mobile, multihop networks for applications ranging from ad hoc networking to disaster recovery and battlefield. The main challenge in wireless, mobile networks is the rapidly changin...
متن کامل