Multi-broadcasting tree generating method of extending network survival time

Abstract

The invention relates to a multicast tree formation method for prolonging network survival time. The method comprises (1) selecting a link with minimum damage to transmit data packet; (2) after a while, transmitting a detection packet from a source node; (3) transmitting a return message to the source node, and when the node receives the message, constructing an AODV routing algorithm; (4) when receiving RREQ-J message, searching the position of this node in an energy value line; (5) performing time-lag, and retransmitting the RREQ request packet. The invention considers the different characteristics of the initial stage and second half stage of the data packet network transmission, and adopts the strategy including not performing time-lag retransmission to the node with large residual energy, performing time-lag retransmission to the node with relatively small residual energy, and not performing request packet retransmission to the node with very small residual energy, so as to effectively ensure the formation of multicast tree, improve the data packet transmission efficiency and the performance of the entire network, and prolong the survival time of the network.

Description

Technical field [0001] The invention belongs to the technical field of network computing and communication, and particularly relates to a method for generating a multicast tree for prolonging network survival time. Background technique [0002] At present, there are two ways to extend the survival time of the network in Ad hoc: The first is to minimize the energy consumed to send each data packet, and to extend the survival time by saving energy. The second is to delay the network split and prolong the survival time of the network by protecting nodes with small remaining energy. The routing algorithm of the first idea achieves the goal of saving energy by discovering the route with the smallest transmit power, so as to minimize the energy consumed to send each data packet. But it still retains a problem in the original routing algorithm, that is, after a route is selected, it will continue to be used until the data is sent or the topology change triggers the routing update. This ...

AI Technical Summary

Problems solved by technology

[0003] In the initial stage of transmitting data packets throughout the network, since the energy of each node is roughly equal, even if the delay mechanism is adopted, the energy saving is not too obvious. On the contrary, due to the increased delay, the request times out or the TTL value is 0 , it has to be retransmitted, which increases the load and network congestion, and this phenomenon is especially obvious when the number of nodes increases

Images