The Research On Multicast Routing Algorithm Of The Specifical Environment In Wireless Sensor Networks

Wireless sensor network constitutes a special kind of ad-hoc network, which is the multi-hop and temporary autonomy system that is made of large numbers of small, cheap devices with limited sensing, computation, actuation and wireless communication capabilities. This wireless network could be so flexible and convenient highly that could apply abroad to situations which are the appealing of tragedy, the temporary conference and the battlefield reconnaissance. Those applications have one common characteristic that is the data transfer form of one-to-many or many-to-many. If there is making use of unicast and broadcast to carry out those applications, without fail it could increasing the transferring quantity of communication and blocking networks. But using multicast communication could not only decreasing the disposing load of source systems, but also reducing the use of network bandwidth. Therefore, it is necessary to use multicast to implement the routing of Wireless Sensor Networks, which is limited by communication bandwidth, energy and so on. At present, many multicast routing algorithms that has already put forward have so many disadvantages. It is difficult to design one routing algorithm to apply to all circumstances, because of the networks of inhere characteristic and the different application circumstance.Between those routing algorithms, the data transmit is very rapid, but is not suit to the network whose topology change swiftly in tree configuration; there has better toughness, but the spending and load is too big in grid configuration; it is complex in mixture configuration. Aim at different circumstances monitoring, there are putting forward the multicast routing algorithms that are applicable to forest and mine circumstances in this thesis. For the forest monitoring, it is supposed that nodes'position should be known in this circumstance. There has put forward to a multicast routing algorithm that is based region and cluster hierarchy, the basic principle of this routing algorithm is that the monitor area is divides into suppositional cells in first, and choosing the cluster node in every cells, and constituting multicast tree through cluster nodes communication. That configuration could reduce the figure of tree, especially adapting to biggish scale network. That routing algorithm show out that it could make cluster nodes distributing uniformity in inspect area, and increase the network lifetime, and also reduce the consuming network energy. For the mine monitoring, it is supposed that some nodes should be immobile and some nodes be mobile in this circumstance. There has put forward to a multicast routing algorithm that is based tree configuration and cluster hierarchy, which is making use of the characteristic of the mine sap to array an immobile topology. When there have some nodes joining or leaving the network, it only need to change the local topology. It could increase the lifetime of the network and monitor real-time different circs in the mine circumstance. Those two multicast routing algorithms are applied to the specifical environment in wireless sensor network in this paper, which have some localization, but those restrict conditions couldn't be becoming troubles. Therefore, those two routing algorithms could optimize the routing of network, obtaining well purpose.