A full-coverage low-latency routing method for opportunistic networks based on message ferry

Abstract

The invention provides an opportunity-network full-coverage low-time-delay routing method based on message ferry. The method includes the following steps: during an idle stage, ferry nodes move in a fixed route and periodically broadcasting beacon messages; in a data transmission stage, common nodes contact the ferry nodes and the ferry nodes actively move towards the common nodes; the ferry nodes exchange data with the common nodes; and the ferry nodes return to the fixed route. The routing method achieves effects of eliminating network coverage dead zones, optimizing the active movement path of the ferry nodes, reducing transmission time delay of data packets, improving data transmission success rate, reducing control overhead and improving routing effect.

Description

technical field [0001] The present invention belongs to the field of using opportunistic networks (opportunistic networks) or delay tolerant networks (delay tolerant networks) technology, and particularly relates to a network node equipped with a location information acquisition device, equipped with RSSI (Received Signal Strength Indication, received signal strength indication) function and partially Opportunity / Delay Tolerant Networks in which Nodes Can Move Autonomously. Background technique [0002] An opportunistic network is a wireless ad hoc network with partial or discontinuous connection topology, which uses the opportunity of encounter (referring to mutual entry into the communication range, the same below) brought by node movement to achieve communication, delay and break tolerance. In some wireless network application fields, due to the influence of the environment and the communication range of nodes, it is impossible to establish a fully connected network topol...

AI Technical Summary

Problems solved by technology

The existence of a dead zone in the communication coverage of the ferry node makes it impossible to achieve full coverage in the network area, which will cause nodes in the uncovered area to fail to communicate with the ferry node because they cannot receive beacon messages, resulting in data loss

[0012] (2) The active movement path of the ferry node is not optimized enough

[0013] In terms of defining the active movement path of the ferry node, the currently relatively simple and optimized method is the nearest neighbor algorithm (NNA), that is, after the ferry encounters a requesting service node, it always follows the position of the nearest node among all requesting service nodes Linear movement, when multiple nodes requesting services exist at the same time, this method is not conducive to the encounter and communication between the ferry node and other requesting service nodes, which affects the delay of data transmission

[0014] (3) Ferry nodes cannot perceive ordinary nodes without data transmission

[0017] In the existing related routing methods, the beacon message broadcast by the ferry node contains the node's location information field. After our in-depth research, we found that the location report function completed by this field can be realized through the wireless ranging mechanism, so this field is Redundant, will bring additional control overhead

Images