A method for implementing a network-free video transmission scheme

Abstract

This application relates to the field of wireless communication technology and discloses a method for implementing a network-free video transmission scheme, comprising the following steps: First, a distributed election algorithm is used to calculate a fitness score based on comprehensive performance parameters such as the remaining power and computing resources of nodes, electing a unique master control device; then, the master control device collects the neighbor list information of all nodes in the network, constructs a weighted global network topology graph, and calculates the optimal relay path with the lowest link cost for the video transmission task based on this topology graph; finally, the master control device generates and broadcasts a globally unified time-division multiple access (TDMA) time slot allocation table to accurately allocate conflict-free transmission and relay time slots to each node on the optimal path. This invention combines the flexibility of distributed election with the determinism of centralized scheduling, effectively avoiding network data collisions and significantly improving the reliability and real-time performance of video transmission in dynamic, network-free environments.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, specifically to a method for implementing a network-free video transmission scheme. Background Technology

[0002] In many specific application scenarios, such as emergency rescue, field exploration, temporary large-scale events, or military operations, traditional cellular or wired networks often fail to provide coverage or are too costly to deploy. To achieve temporary, rapid network communication in these environments, ad-hoc network technology has emerged. This technology allows a group of wireless devices to quickly build a multi-hop communication network through self-organization and self-management without any pre-existing network infrastructure.

[0003] With the development of multimedia technology, the demand for real-time transmission of high-definition video data in the aforementioned scenarios is increasing, such as transmitting real-time monitoring video from a site via drones or ground sensors. Video data streams are characterized by large data volumes, high real-time requirements, and sensitivity to network jitter and packet loss, posing a severe challenge to the transmission capabilities of wireless ad hoc networks.

[0004] However, existing wireless ad hoc network technologies face inherent challenges in handling high-bandwidth, low-latency video services. The widely adopted Carrier Sense Multiple Access / Collision Avoidance (CSMA / CA) channel access mechanism is essentially a competitive resource contention method. As the number of nodes transmitting large amounts of data, such as video, increases, channel contention becomes extremely fierce, leading to a sharp rise in the probability of packet collisions and triggering numerous retransmissions. This severely impacts network throughput and transmission latency, failing to provide stable Quality of Service (QoS) guarantees for video services. Furthermore, traditional ad hoc network routing protocols often use minimum hop count as the primary or sole criterion for path selection, neglecting crucial quality indicators such as link signal strength, stability, and bandwidth capacity. This single metric may lead to routing onto a "fragile" path with low hop count but poor signal quality and susceptibility to interruptions, which is fatal for video streams requiring continuous and stable transmission. Because each node in the network makes decisions based on local information, lacking a global and unified perspective for resource scheduling and path planning, the overall network resource utilization is low, making it difficult to fundamentally avoid transmission conflicts and reserve reliable communication resources for critical services. Therefore, how to design a system and method that can provide reliable, efficient paths and conflict-free channel resources for video data transmission in a dynamic, decentralized infrastructure environment is a technical problem that urgently needs to be solved in this field. Summary of the Invention

[0005] To address the shortcomings of existing technologies, this invention provides a method for implementing a network-free video transmission scheme, which solves the problem that in dynamic wireless ad hoc networks, the lack of unified coordination leads to channel resource contention conflicts and blind path selection, resulting in unreliable and inefficient real-time video transmission.

[0006] To achieve the above objectives, the present invention provides the following technical solution:

[0007] The first aspect of this invention provides a method for implementing a network-free video transmission scheme, the method comprising the following steps:

[0008] A master control device is elected by multiple devices in the network through a preset election algorithm;

[0009] The main control device acquires the connection relationships between devices in the network to construct a global network topology;

[0010] Based on the global network topology, the main control device calculates one or more optimal relay paths for the video data of the specified video source device.

[0011] The main control device generates a time-division multiple access scheduling instruction containing time slot allocation information based on the optimal relay path.

[0012] The main control device broadcasts the time division multiple access scheduling command to devices in the network, causing devices on the optimal relay path to perform video data transmission or relay forwarding in the specified time slot.

[0013] In one specific implementation, the step of electing a master control device includes: each device in the network broadcasting status information containing its own performance parameters; each device calculates the fitness score of other devices in the network based on the received status information, and jointly confirms the device with the highest fitness score as the master control device.

[0014] Preferably, the fitness score Calculated using the following formula:

[0015] ;

[0016] in, For equipment fitness score; respectively equipment Normalized power consumption, computing resources, and hardware capability parameters; The preset weighting coefficients, and .

[0017] In one specific implementation, the election step also jointly identifies the device with the second-highest fitness score as the backup control device, and the backup control device takes over its function when the main control device is detected to have failed.

[0018] Preferably, the step of constructing the global network topology includes: the main control device receiving the respective neighbor node lists reported by other devices in the network; the main control device aggregating all neighbor node lists to generate the global network topology representing the connectivity of the entire network.

[0019] In one embodiment, the step of calculating one or more optimal relay paths includes: the main control device calculating a link cost for each link in the global network topology; the main control device using a preset shortest path algorithm to calculate the path with the lowest total link cost from the video source device to the target device in the global network topology, which is taken as the optimal relay path.

[0020] Furthermore, the link cost Calculated using the following formula:

[0021] ;

[0022] in, For the transmission cost of link e; This is the normalized Received Signal Strength Indication (RSSI) value for link e; The base cost for a single hop; and The preset weighting coefficients, and .

[0023] In one embodiment, the time division multiple access (TDMA) frame structure upon which the TDMA scheduling instruction is based includes: fixed time slots allocated to the video source device; control time slots for network management signaling interaction; and relay time slots for data forwarding, the number of which is dynamically calculated.

[0024] Furthermore, the number of relay time slots It is calculated based on the total number of hops across all optimal relay paths, and the formula is as follows:

[0025] ;

[0026] in, This represents the total number of relay slots; This is the set of all video streams that need to be relayed in the current network; For video stream The number of nodes included in the transmission path.

[0027] In one specific implementation, the time division multiple access scheduling instruction is encapsulated in a time slot allocation table, and the main control device broadcasts the time slot allocation table to all network devices within the control time slot.

[0028] Preferably, the method has dynamic adaptive capability, wherein the steps of constructing the global network topology, calculating the optimal relay path, and generating and broadcasting time-division multiple access scheduling instructions are periodically performed by the main control device or re-executed when a change in the global network topology is detected.

[0029] This invention provides a method for implementing a network-free video transmission scheme. It has the following beneficial effects:

[0030] 1. This invention constructs a global network topology and calculates the optimal relay path, using other devices on the path as relay nodes for multi-hop data forwarding, effectively overcoming the distance limitations of traditional point-to-point transmission and realizing long-distance video transmission in areas without network coverage.

[0031] 2. This invention generates and broadcasts unified time-division multiple access scheduling instructions through the main control device, which allocates a definite and conflict-free time window for the transmission and relay tasks of each device in the network. This mechanism fundamentally avoids data collisions and packet loss caused by channel contention, and ensures the stability and reliability of video data stream transmission.

[0032] 3. This invention has network dynamic adaptive capability. The main control device can periodically or when the topology changes, recalculate the optimal relay path and update the scheduling instructions, so that the network can automatically adapt to dynamic changes such as device movement, addition or failure, quickly restore the transmission link, and ensure the robustness and service continuity of the entire system. Attached Figure Description

[0033] Figure 1 This is a schematic diagram of the network-free video transmission system architecture of the present invention;

[0034] Figure 2 This is a flowchart of the network initialization and master control device election process of the present invention;

[0035] Figure 3 This is a schematic diagram illustrating a weighted global network topology diagram according to the present invention.

[0036] Figure 4 This is a schematic diagram of the time-division multiple access frame structure of the present invention;

[0037] Figure 5 This is a schematic diagram of the collaborative data relay forwarding process of the present invention. Detailed Implementation

[0038] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0039] See attached document Figure 1 , Figure 1 This is a schematic diagram of the architecture of a network-free video transmission system according to an embodiment of the present invention. The present invention provides a network-free video transmission system, which consists of multiple wireless device nodes operating in a centralized infrastructure environment. These wireless device nodes construct a temporary wireless network through self-organization for the transmission of video data.

[0040] A wireless device node may include: a processor, a memory, a wireless transceiver, a power module, and a functional interface.

[0041] The processor is the control unit of the wireless device node, and it can be a central processing unit (CPU), a microprocessor (MPU), or other form of computing unit. The processor is responsible for executing program instructions stored in memory to implement the method steps described in this invention and controlling the operation of other hardware modules of the wireless device node.

[0042] Memory can be any type of volatile or non-volatile storage medium, such as random access memory (RAM) or flash memory. Memory is used to store the operating system, application code, and temporary data generated during operation required by the processor, including neighbor list, network topology information, and time slot allocation table.

[0043] A wireless transceiver is responsible for transmitting and receiving wireless radio frequency signals between wireless device nodes. It operates on a preset frequency band and supports point-to-point and broadcast communication modes to enable ad hoc network communication. The wireless transceiver performs functions such as data modulation and demodulation, channel access control, and signal strength measurement.

[0044] The power module provides the electrical energy required for the operation of the various components of the wireless device node. In one embodiment, the power module also has a status monitoring function, which can provide the processor with its current remaining power information.

[0045] The functional interface provides connectivity between the wireless device node and external functional units. The processor communicates with the memory, wireless transceiver, power module, and functional interface to coordinate and control the operation of the entire wireless device node.

[0046] To implement the method of this invention, the memory also stores program code for multiple functional modules. When the processor executes this program code, the corresponding functions can be implemented. These functional modules may specifically include: a node state management module for monitoring and encapsulating the performance parameters of the node; a neighbor discovery and reporting module for maintaining a list of neighboring nodes and reporting to the main control device; a scheduling instruction parsing and execution module for parsing the time slot allocation table and controlling the wireless transceiver to perform transmission and reception operations in the specified time slot; and a data routing and forwarding module for receiving, buffering, and forwarding data packets based on the parsing results.

[0047] Depending on its specific task in the network, a wireless device node can operate as one or more of the following types of devices: when its functional interface is connected to a video acquisition unit, the wireless device node operates as a video source device, responsible for acquiring video data and sending it to the network; when the wireless device node is not configured with a video acquisition unit and mainly performs data forwarding tasks, it operates as a relay device; when its functional interface is connected to a data processing and display terminal, it operates as a data center device, responsible for receiving the final video data.

[0048] In a specific application scenario, such as environmental monitoring in mountainous areas, multiple wireless device nodes are deployed within the monitoring area. Several wireless device nodes equipped with video acquisition units serve as video source devices, deployed at specific locations requiring monitoring; one wireless device node acts as a data center device, deployed at the monitoring center; and the remaining wireless device nodes act as relay devices, distributed between the video source devices and the data center device. Due to geographical obstructions, some video source devices and data center nodes lack direct line-of-sight communication links, necessitating multi-hop forwarding of video data via one or more relay devices.

[0049] See attached document Figure 2 , Figure 2 This is a schematic diagram of the network initialization and master control device election process according to an embodiment of the present invention. During the system startup phase, all wireless device nodes are in a peer-to-peer state, and a master control device and a backup control device are determined through a distributed election process to establish a centralized control structure for the network.

[0050] Specifically, each wireless device node enters a discovery mode upon startup. In this mode, the device periodically broadcasts a node status information packet to its one-hop neighbors via its wireless transceiver. This packet encapsulates key performance parameters characterizing the device's current state, including the device's unique identifier, current remaining battery percentage, current computing resource leeway, and a preset hardware capability level. The computing resource leeway is an inverse function of the processor load, and the hardware capability level is a pre-defined quantized score based on the device's signal transmission power, processor model, and other hardware configurations.

[0051] After receiving node status information packets from other nodes, each wireless device node in the network parses them and stores them in a local candidate device list. After several broadcast cycles, each node will obtain the status information of all or most of the other nodes in the network.

[0052] Subsequently, each wireless device node independently calculates a fitness score for each device in its locally stored list of candidate devices (including itself). This fitness score is a comprehensive quantitative metric used to assess the suitability of a device to assume the responsibilities of a master control device. In one embodiment, the device... fitness score Calculated using the following formula:

[0053] ;

[0054] in, For equipment fitness score; respectively equipment Normalized power consumption, computing resources, and hardware capability parameters; The preset weighting coefficients, and .

[0055] respectively equipment The parameters of power consumption, computing resources, and hardware capabilities have been normalized. Normalization aims to eliminate the influence of different parameter units. For example, if the original power consumption... If it is a percentage value between 0 and 100, then the normalized energy parameter It is possible Calculations show that if the original computing resource adequacy... If the value is between 0 and 1, then the resource parameter is normalized. That is If the original hardware capability level The value range is from 1 to 5, then the normalized hardware capability parameter It is possible The calculation yielded the result.

[0056] After calculating the fitness scores of all candidate devices, each wireless device node sorts all the scores locally. All nodes in the network jointly identify the device with the highest fitness score as the sole master control device and the device with the second highest fitness score as the backup control device.

[0057] In one specific embodiment, to handle situations where two or more devices have identical fitness scores, the election algorithm also includes a preset conflict resolution rule. This rule stipulates that when the highest fitness scores are the same, the unique identifiers of these devices with the same score are compared, and the device with the smaller (or larger) unique identifier value is selected as the final master controller. This mechanism ensures that a unique master controller can be determined under any circumstances.

[0058] Finally, the elected master control device broadcasts a role confirmation message to the entire network. This message contains its unique device identifier and the master control device's role identity. Upon receiving this role confirmation message, all other devices in the network exit the election process, switch to normal node mode, and begin receiving instructions from the master control device. At this point, network initialization and the master control device election process are complete.

[0059] See attached document Figure 3 , Figure 3 This is a schematic diagram of a global network topology construction process according to an embodiment of the present invention. After the election of the master control device is completed, the master control device will be responsible for collecting the connection information of the entire network, and based on this, constructing and maintaining a topology data structure that represents the global state of the network.

[0060] Each non-master node in the network periodically performs a neighbor discovery operation. Specifically, the device broadcasts a "Hello" signaling packet containing its own unique identifier. Other devices within one hop of the device, upon receiving this signaling packet, record the source device's unique identifier and obtain the received Signal Strength Indicator (RSSI) value through the physical layer of the radio transceiver. When a device continuously receives "Hello" signaling packets from another device within a preset time window, and the RSSI value remains stable above a preset communication threshold, it recognizes the other device as a valid neighbor node.

[0061] Each non-master control device node compiles information on all its valid neighbor nodes (including the unique identifiers of the neighbor nodes and their corresponding average RSSI values) into a neighbor node list. The device then sends this neighbor node list as reporting data to the master control device at a preset time or within a specified control time slot.

[0062] The master control device is responsible for receiving and aggregating lists of neighbor nodes from all non-master control device nodes in the network. The master control device maintains a weighted graph data structure in its internal memory to represent the global network topology. The set of vertices in this weighted graph consists of unique identifiers for all known devices in the network, while the set of edges represents direct communication links between devices.

[0063] For each edge in the graph, i.e., each direct communication link, the master control device calculates a link cost. This cost value quantifies the expense of data transmission over that link. In one embodiment, the link cost of link e is... Calculate using the following formula.

[0064] ;

[0065] in, For the transmission cost of link e; This is the normalized Received Signal Strength Indicator (RSSI) value for link e. This normalization operation linearly maps the RSSI value measured at the physical layer (e.g., a range from -100 dBm to -30 dBm) to a preset numerical range (e.g., 0.1 to 1.0) to obtain a dimensionless link quality indicator. This mapping function ensures that better signal strength corresponds to a smaller cost component. The single-hop base cost represents the basic resources consumed by data for each hop forwarding. and The preset weighting coefficients, and By adjusting the relative magnitudes of these two coefficients, the emphasis of the path selection strategy can be changed: increasing... The weighting will make path selection more inclined towards links with high signal quality, while increasing the weighting will make the path selection more inclined towards links with high signal quality. The weight will make path selection more inclined to links with fewer hops.

[0066] Once the main control device calculates the corresponding link cost for all known links in the topology diagram, a complete weighted global network topology is constructed.

[0067] To address dynamic changes such as device movement or failure within the network, the global network topology is dynamically maintained. On one hand, the master control device periodically requests all nodes to re-report their neighbor node lists to globally refresh the topology information. On the other hand, when any device detects a link interruption with a neighbor node (e.g., not receiving a "Hello" signaling packet from the neighbor within a specified time) or discovers a new neighbor node, it immediately generates an event-triggered topology update report and sends it to the master control device. The master control device then updates its internal topology graph data structure in real time based on this report, ensuring the real-time nature of the topology information.

[0068] See attached document Figure 4 , Figure 4 This is a schematic diagram of a TDMA frame structure according to an embodiment of the present invention. After the global network topology is constructed, the main control device performs path planning and channel resource allocation for video transmission tasks in the network based on the topology information.

[0069] The master control device first defines a globally unified, periodically repeating Time Division Multiple Access (TDMA) frame structure. A complete TDMA frame is divided into three time slots with different functions: a control time slot, one or more fixed time slots, and a dynamically variable number of relay time slots.

[0070] The control time slot is located at the beginning of each frame and is dedicated to the master control device. The master control device uses this time slot to broadcast system-level control signaling to the entire network. The most important content of this signaling is the time slot allocation table for the next frame and the beacon signal used for network-wide time synchronization.

[0071] The beacon signal used for network-wide time synchronization can be a data packet containing the current timestamp of the master control device. Upon receiving this beacon signal, all other devices in the network calibrate their local clocks based on its arrival time. This periodic calibration ensures that all network devices maintain a high degree of time synchronization in the time slot allocation of TDMA frames, which is a prerequisite and guarantee for the accurate execution of the time slot allocation table.

[0072] Fixed time slots are time slots that immediately follow control time slots, and each fixed time slot is statically allocated to a designated video source device. This allocation mechanism ensures that the video source device has a conflict-free, deterministic data transmission window to send video data to the first-hop node on its optimal relay path.

[0073] Relay time slots are used for data forwarding by intermediate nodes in a path. Unlike fixed time slots, the number of relay time slots is not fixed, but dynamically calculated by the master control device based on the total path length of all transmission tasks in the current network. In one embodiment, the total number of relay time slots is... Calculated using the following formula:

[0074] ;

[0075] in, This represents the total number of relay slots; This is the set of all video streams that need to be relayed in the current network; For video stream The number of nodes included in the transmission path.

[0076] After defining the TDMA frame structure, the master control device calculates the optimal relay path for each video transmission task (i.e., each transmission request from a specified video source device to a data center device). This calculation is performed on a weighted global network topology graph. The master control device uses Dijkstra's algorithm, with the video source device as the starting vertex and the data center device as the target vertex, to search for a path with the lowest total link cost in the graph.

[0077] Assume device A is the video source device and device E is the data center device. The Dijkstra algorithm's computation steps are as follows: First, initialize the algorithm by setting the path cost of the starting vertex A to 0 and the path costs of the remaining vertices (B, C, D, E) to infinity. Starting from A, update the path costs of its neighbors B and C. Then, select vertex C with the lowest known path cost and update the path cost of its neighbor D. Continue this process until the lowest total cost path to the target vertex E is calculated. Finally, the algorithm outputs an optimal relay path consisting of a sequence of vertices, for example, A→C→D→E.

[0078] After determining the optimal relay path, the master control device generates a detailed time slot allocation table. This table explicitly defines the user of each time slot in the subsequent TDMA frames. The table is a data structure containing multiple entries, each of which specifies at least: the time slot index, the time slot type (control, fixed, or relay), the unique identifier of the sending device, and the unique identifier of the receiving device.

[0079] Continuing with the path A→C→D→E as an example, some entries in the generated time slot allocation table will look like this:

[0080] Entry 1: Slot Index = 1, Slot Type = Fixed Slot, Sender = A, Receiver = C.

[0081] Item 2: Slot Index = 2, Slot Type = Relay Slot, Sender = C, Receiver = D.

[0082] Item 3: Slot Index = 3, Slot Type = Relay Slot, Sender = D, Receiver = E.

[0083] Finally, the master control device encapsulates this generated time slot allocation table into a control data packet and broadcasts it to all devices in the network via its wireless transceiver during the control time slot of the next TDMA frame. Each device in the network, upon receiving the table, parses its contents and, based on the relevant entries in the table, performs the corresponding send or receive operation in the designated time slot.

[0084] See attached document Figure 5 , Figure 5This is a schematic diagram of a collaborative data relay forwarding process according to an embodiment of the present invention. After receiving the time slot allocation table broadcast by the master control device, all devices in the network perform highly synchronized data transmission and reception operations according to the table.

[0085] Within a specific transmission cycle, taking a calculated optimal relay path A→C→D→E as an example, where A is the video source device, E is the data center device, and C and D are relay devices, when the clock enters the first fixed time slot of this TDMA frame, i.e., the transmission time slot assigned to device A in the time slot allocation table, device A's processor will retrieve a video data packet from its data buffer and forward it to the next hop node of the path, i.e., device C, through its wireless transceiver.

[0086] Within the same time slot, all other devices on the path, including devices C, D, and E, set their own transceivers to receive mode according to the time slot allocation table. After successfully receiving a data packet from device A, device C temporarily stores it in its own forwarding buffer.

[0087] Subsequently, when the clock enters the first relay time slot assigned to device C for forwarding in the time slot allocation table, device C's processor retrieves the recently received data packet from the forwarding buffer and forwards it to the next-hop node in the path, device D, via its wireless transceiver. During this relay time slot, device D's wireless transceiver is in receive mode, while other devices in the network not involved in this forwarding remain silent or in sleep mode to avoid channel conflicts and conserve energy.

[0088] The forwarding process described above proceeds sequentially along the path. After receiving the data packet, device D will forward it to the final destination device E in the next relay time slot it is assigned. Once device E receives the data packet in its designated time slot, it has completed a full multi-hop data transmission and submits the data to the upper-layer application for processing or display.

[0089] The technical solution of this invention also includes a dynamic adaptive mechanism to handle dynamic changes in network topology. When a link interruption event occurs in the network, such as relay device C moving out of the communication range of device D, the event is detected in two ways: if device C does not receive an acknowledgment (ACK) from the physical layer or link layer within a preset time after sending data to device D, the link is determined to be faulty; or, if device D does not receive a "Hello" signaling packet from device C for a preset neighbor discovery period, the link is also determined to be faulty.

[0090] The device that detects a link failure (C or D in this example) immediately sends a topology change report to the master control device. Upon receiving this report, the master control device instantly updates its internally maintained global network topology map, for example, by deleting the edge between device C and device D. Subsequently, for the affected video transmission task (A to E), the master control device recalculates the optimal relay path based on the updated topology map, thus obtaining a new path that does not traverse the failed link. After the calculation is complete, the master control device generates a completely new time slot allocation table and broadcasts it to the entire network in the next control time slot. Upon receiving the new allocation table, all devices in the network automatically switch to the new path and time slot arrangement to perform data transmission at the start of the next TDMA frame, thereby completing the adaptive adjustment to network changes.

[0091] Accordingly, when a new device joins the network, it first enters listening mode to receive control signaling broadcast by the master control device and synchronize its time. After synchronization, the new device sends a network entry request containing its own status information to the master control device. Upon receiving this request, the master control device adds the new device to its maintained global network topology and triggers a global topology update and optimal path recalculation. In the next scheduling cycle, the new time slot allocation table broadcast by the master control device will include resource allocation for the new device, allowing it to formally integrate into the network and undertake corresponding data transmission or relay tasks.

[0092] Furthermore, the system also possesses fault-tolerant switching capabilities in case of primary control device failure. The primary control device's act of broadcasting control signaling within the control time slot of each TDMA frame constitutes a heartbeat signal audible throughout the network. The elected backup control device will continuously monitor this heartbeat signal. If the backup control device fails to receive a valid control signaling from the primary control device within N consecutive TDMA frame periods (N is a preset integer, such as 3), the primary control device is determined to have failed.

[0093] Once the primary control device is determined to have failed, the backup control device will immediately switch its role from backup to active primary control device. It will then immediately broadcast a declaration message containing its unique identifier and new primary control role to the entire network. Upon receiving this message, all other nodes in the network will switch their communication and reporting targets to this new primary control device. The new primary control device will immediately begin performing all responsibilities of topology information collection, path calculation, and TDMA scheduling instruction generation and broadcasting, thereby taking over network control and ensuring the continuity of services throughout the system.

Claims

1. A method for implementing a network-free video transmission scheme, characterized in that, Includes the following steps: A master control device is elected by multiple devices in the network through a preset election algorithm; The main control device acquires the connection relationships between multiple devices in the network to construct a global network topology; Based on the global network topology, the main control device calculates one or more optimal relay paths for the video data of the specified video source device. The main control device generates a time-division multiple access scheduling instruction containing time slot allocation information based on the optimal relay path. The main control device broadcasts the time division multiple access scheduling command to devices in the network, causing devices on the optimal relay path to perform video data transmission or relay forwarding in the specified time slot; The time division multiple access (TDMA) frame structure upon which the TDMA scheduling instruction is based includes: A fixed time slot allocated to the video source device; Control slots used for network management signaling interaction; And relay slots used for data forwarding, the number of which is dynamically calculated.

2. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The step of electing a master control device includes: Each device on the network broadcasts status information containing its own performance parameters; Based on the received status information, each device calculates the fitness score of other devices in the network and jointly confirms that the device with the highest fitness score is the master control device.

3. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The steps for constructing the global network topology include: The main control device receives the neighbor node lists reported by other devices in the network. The main control device aggregates all neighbor node lists to generate the global network topology that represents the overall network connectivity.

4. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The steps for calculating one or more optimal relay paths include: The main control device calculates a link cost for each link in the global network topology; The main control device uses a preset shortest path algorithm to calculate the path with the lowest total link cost from the video source device to the target device in the global network topology, which is then used as the optimal relay path.

5. The method for implementing a network-free video transmission scheme according to claim 4, characterized in that, The link cost is calculated based on the received signal strength indicator and hop count factor of the link.

6. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The number of relay slots is calculated based on the total number of hops across all optimal relay paths.

7. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The steps of constructing the global network topology, calculating the optimal relay path, and generating and broadcasting time-division multiple access scheduling instructions are periodically performed by the main control device or re-executed when a change in the global network topology is detected.

8. The method for implementing a network-free video transmission scheme according to claim 2, characterized in that, In the step of electing a master control device, the device with the second highest fitness score is jointly identified as the backup control device, and the backup control device takes over its function when the master control device fails.

9. The method for implementing a network-free video transmission scheme according to claim 1, characterized in that, The time division multiple access scheduling instruction is encapsulated in a time slot allocation table, and the main control device broadcasts the time slot allocation table to all network devices within the control time slot.

Images