The Research On Multicast Routing In Sensor Networks

Sensor network has intensive potential on military and other fields for its unique advantages. More attention is paid to it and the research to each aspect of sensor network is also a active field in current academe. Routing algorithm is a key issue on network layer in sensor network. Because of the constrain of energy, memory and computation capacity, data-integration is intensively used to save energy in sensor network, so broadcast and multicast are also important methods to communicate. This thesis emphasis on multicast routing algorithm in sensor network.Firstly, this thesis introduces simply some multicast routing protocols in wire networks and ad hoc, defines some measures and evaluates the their performance. According to these results, we can design more suitable multicast routing algorithm. Considering the high density of nodes in sensor network, thesis proposes an algorithm based on minimal connected dominating set (MCDS). Algorithm gives a distributed method to calculate MCDS and constructs a connected subnet composed by cluster in CDS. It can deduce the number of packets and limit the forwarding of packets and save the energy of nodes. In sensor network, each node can do as a source, so this thesis proposes a new algorithm based on gradient. The algorithm use minimal-path-tree, has low delay and can adapt the change because of nodes failing or moving. The simulation shows the algorithm has good performance and save much energy. According to foregoing algorithms, we use the concept of spiral tree and propose a new algorithm. New algorithm use spiral-tree to assure the robustness and packets can be forwarded along with spare path when links or nodes fail. Even when nodes move, algorithm can still have good performance.