Grouping strategy based opportunistic network routing algorithm

Abstract

The invention relates to an opportunistic network routing algorithm, by which nodes in an opportunistic network can transmit data packets efficiently, and the energy of the nodes can be consumed as less as possible. According to a grouping strategy provided by the invention, the nodes are grouped in accordance with the characteristics of the nodes in the opportunistic network, and because each group of nodes plays different roles, different routing strategies are adopted. The algorithm provided by the invention is based on a flooding strategy and has p, k, t parameters. In the grouping strategy, by using the p, k, t parameters, the existence of copies of invalid data packets in the network can be effectively reduced, and through properly setting the p, k, t parameters, a high transmissionsuccess rate can be obtained under the condition of approximately optimal routing overhead, which can not be achieved by using the traditional opportunistic network routing algorithm. Because of the characteristics above, the routing algorithm provided by the invention is suitable to be applied to scenes that energy becomes scarce resources, such as scenes after disasters occur.

Description

technical field [0001] The invention relates to an opportunistic network routing algorithm. The function of the invention is to enable nodes in the opportunistic network to efficiently forward data packets while consuming as little node energy as possible. Background technique [0002] An opportunistic network is a self-organizing network that can tolerate network communication, delay and split by using the encounter opportunities brought about by node movement without the need for a complete path between the source node and the destination node. Opportunistic networks are different from traditional multi-hop wireless networks in that their nodes are not uniformly deployed, the network scale and the initial positions of nodes are not preset, and the path between source nodes and destination nodes cannot be determined in advance. Opportunistic networks use the "store-carry-forward" mode to transmit information hop by hop to achieve inter-node communication. Its architecture i...

AI Technical Summary

Problems solved by technology

[0016] 2. Routing overhead

High routing overhead means that nodes forward a large number of data packets, which will flood the network with a large number of data packet copies, increase the probability of data packet collisions, and consume a lot of node energy

[0018] 3. Transmission delay

[0020] In order to pursue high transmission success rate and small transmission delay, the traditional opportunistic network routing algorithm usually forwards a large number of data packets, and a large number of invalid data packet forwarding becomes a prominent problem of node energy consumption.

Traditional routing algorithms do not take energy consumption as an important indicator, so it is difficult to apply to some scenarios where energy becomes a scarce resource, such as the scene after a disaster

Images