| Summary: | 碩士 === 國立中興大學 === 通訊工程研究所 === 104 === Multicasting in Wireless Mesh Networks is an important application. Based on a tree structure contained in the mesh network, a node can deliver packets to all other members of a multicast group via a multicast protocol. Also, information can be exchanged among nodes via such a structure. Particularly, in the tree structure, a node can not only send and receive information but also serve as a relay node of other nodes for propagating information over the network.
In this thesis, we propose an algorithm for constructing a multicast tree in a wireless mesh network. Such a multicast tree can be continually adjusted according to the latest topology information carried on packets propagated among nodes. Moreover, the routing path with the lowest weight will be dynamically selected to improve the efficiency of delivering packets. Finally, we also perform simulation experiments based on the PARSEC (PARallel Simulation Environment for Complex systems) simulation software. The experimental results show that our algorithm enjoys the ability to find a highly efficient path for each node in the system.
|
|---|
