|
Published Articles >> Table of Contents >> Abstract
Sixth International Conference on Computer Communications and Networks (ICCCN '97)
p. 28
Shared Tree Wireless Network Multicast
Ching-Chuan Chiang, Computer Science Department, UCLA
Mario Gerla, Computer Science Department, UCLA
Lixia Zhang, Computer Science Department, UCLA
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1997.623287
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Index Terms- Routing, Multicast, Clustering, Multihop Wireless Networks, Hard state, Soft Stat
Citation:
Ching-Chuan Chiang, Mario Gerla, Lixia Zhang,
"Shared Tree Wireless Network Multicast,"
icccn,
p. 28,
Sixth International Conference on Computer Communications and Networks (ICCCN '97),
1997
|
|
