A method and networking system for many-to-one data reporting in a wireless ad hoc network

Abstract

This invention provides a method and system for many-to-one data reporting in a wireless ad hoc network. The system is based on a network consisting of a convergence node and multiple terminal nodes, where the convergence node's signal covers all terminal nodes. The method includes the following steps: the convergence node sends a reporting command; upon receiving the command, the terminal nodes report their data sequentially according to their IDs; after reporting, the convergence node, having detected the presence of all directly connected terminal nodes and some secondary connected terminal nodes, broadcasts the collected information about the directly connected terminal nodes. The advantages of this invention are: fast network setup, high network status controllability, and reduced power consumption.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a method and networking system for many-to-one data reporting in a wireless ad hoc network. Background Technology

[0002] Existing technologies require each terminal to spend a certain amount of time listening to the channel before transmitting to check if other terminals are already transmitting. As the number of terminals increases, the random backoff listening time must be lengthened to minimize collisions. The main problem with this approach is low channel utilization and low transmission efficiency. To minimize collisions caused by multiple terminals transmitting simultaneously, existing technologies generally employ CSMA + random backoff. In wireless networks, terminal nodes collect data, forward it through a cascading process, and report the data to a aggregation node. This many-to-one wireless cascaded network configuration can lead to transmission collisions during network setup and when multiple terminals are reporting data, especially when the number of terminal nodes is large. Summary of the Invention

[0003] To address the shortcomings of existing technologies, this paper proposes a method and system for many-to-one data reporting in wireless ad hoc networks. This system features rapid network setup, high network status controllability, and reduced power consumption. It is implemented through the following technical solution.

[0004] A method for many-to-one data reporting in a wireless ad hoc network, based on a network system consisting of a sink node and multiple terminal nodes, wherein the signal of the sink node covers all terminal nodes, the method includes the following steps:

[0005] The aggregation node issues a data reporting command;

[0006] After receiving the reporting instruction, the terminal nodes report the numbers one by one according to their ID order;

[0007] After the reporting ends, the aggregation node has detected the presence of all directly connected terminal nodes and some secondary connected terminal nodes, and broadcasts the collected information on the directly connected terminal nodes.

[0008] Furthermore, when a terminal node listens to a report, it senses neighboring terminal nodes; when reporting a report, it broadcasts the information to neighboring terminal nodes.

[0009] Furthermore, after receiving the reporting instruction, the terminal node calculates the time slot number based on its own ID, and sends a reporting response frame when the corresponding time slot arrives.

[0010] Furthermore, the aggregation node broadcasts information about the terminal nodes directly connected to it.

[0011] Furthermore, it also includes methods for resolving launch conflicts in the traditional free-competition method during data reporting, with the following steps:

[0012] The aggregation node initiates a pull-up command to the first terminal node;

[0013] The first terminal node performs data reporting, and the second terminal node acts as a route to forward the data from the first terminal node.

[0014] The aggregation node confirms data reception.

[0015] Furthermore, after the pull-up cycle of the first terminal node is reached, the aggregation node initiates a pull-up to the first terminal node and allocates several consecutive specified time slots to it.

[0016] The first terminal node reports data using the specified time slot and designates the second terminal node as its routing node;

[0017] The second terminal node forwards data using the specified time slot;

[0018] The aggregation node sends an acknowledgment after receiving the data.

[0019] Furthermore, this also includes accelerating the aggregation node's awareness of the terminal nodes, with the following steps:

[0020] The terminal node sends a push field along with the data reporting frame, pushing unnoticed neighboring terminal nodes to the aggregation node.

[0021] When a data reporting frame is delivered to the aggregation node, the aggregation node immediately detects the existence of the terminal node, allocates a designated time slot for data reporting, and the terminal node then withdraws from the free competition.

[0022] A wireless ad hoc network system for many-to-one data reporting is provided. The system consists of a convergence node and multiple terminal nodes. The convergence node receives data reported by the terminal nodes. Near-end terminal nodes send data directly to the convergence node, while data sent by far-end terminal nodes needs to be forwarded by adjacent terminal nodes to reach the convergence node.

[0023] Furthermore, the aggregation node is equipped with a high-power wireless communication module, which covers all terminal nodes; the terminal nodes are equipped with low-power wireless communication modules, which have a small signal coverage area, and the radius of the signal coverage area of ​​each terminal node is the same.

[0024] The beneficial effects of this invention are:

[0025] Fast network setup: By utilizing the reporting mechanism, each node can quickly obtain the topology structure with its surrounding nodes, thereby quickly obtaining the route to the aggregation node.

[0026] High channel utilization: transmission in designated time slots does not require random backoff, resulting in high data reporting efficiency and speed; designated terminal nodes do not occupy free time slots, reducing the possibility of transmission collisions in free time slots, and free terminal nodes require less random backoff time, resulting in higher channel utilization.

[0027] Network conflict convergence: As more and more terminal nodes become designated terminal nodes, the number of free terminal nodes participating in free competition decreases, and network conflicts show a convergence trend.

[0028] High transmission reliability: No transmission collisions will occur in the specified time slot, ensuring high transmission reliability.

[0029] The data reporting cycle is controllable: the reporting cycle of the specified terminal node is uniformly controlled by the aggregation node.

[0030] Power saving: The reduced probability of transmission collisions reduces invalid transmissions and lowers the power consumption of nodes. Attached Figure Description

[0031] Figure 1 This is a diagram of the network system structure of the present invention.

[0032] Figure 2 This is a network system structure diagram according to an embodiment of the present invention.

[0033] Figure 3 This is a schematic diagram of the aggregation node reporting mechanism according to an embodiment of the present invention.

[0034] Figure 4 This is a schematic diagram of the aggregation node pull-up mechanism in an embodiment of the present invention. Detailed Implementation

[0035] The embodiments of the present invention will be described in detail below with reference to the accompanying drawings, but the present invention can be implemented in many different ways as defined and covered by the claims.

[0036] A wireless self-organizing network many-to-one data reporting system is disclosed. The network system consists of a convergence node and multiple terminal nodes. The convergence node receives data reported by the terminal nodes, and the signal of the convergence node covers all terminal nodes. Data sent by remote terminal nodes needs to be forwarded by adjacent terminal nodes to reach the convergence node.

[0037] The networking system employs a characteristic of asymmetrical signal coverage between aggregation nodes and terminal nodes, while maintaining symmetrical signal coverage among terminal nodes. Aggregation nodes are equipped with high-power wireless communication modules, transmitting signals with full coverage, meaning their signals can reach all terminal nodes, resulting in a wide coverage area. Terminal nodes are equipped with low-power wireless communication modules, transmitting signals that only cover a smaller area and must reach the aggregation node via hop-by-hop cascading. Its advantage is that, given the aggregation node's full signal coverage, it possesses direct centralized scheduling capabilities for networking and data transmission.

[0038] like Figure 1 As shown, this is a wireless communication network consisting of a convergence node 10 and multiple terminal nodes 20. The convergence node receives data reported by the terminal nodes. The convergence node is equipped with a high-power wireless communication module, whose signal can cover all terminal nodes (the large circle). Each terminal node is equipped with a low-power wireless communication module, whose signal coverage is smaller (the small circle). The signal coverage areas of all terminal nodes are the same, and the radii of their small circles are equal. Data sent by a distant terminal node needs to be forwarded by other terminal nodes before reaching the convergence node. Messages sent by the convergence node can be directly received by all terminal nodes; data reported by a distant terminal node needs to be forwarded sequentially by adjacent terminal nodes and then by nearby terminal nodes before reaching the convergence node.

[0039] The technical solution implements different networking / data reporting mechanisms according to different stages of the networking process:

[0040] The network reporting mechanism works as follows: At the initial stage of network establishment, the aggregation node is unaware of the existence of any terminal nodes and initiates a reporting command to quickly form the network. Upon receiving the reporting command, terminal nodes report their numbers sequentially according to their terminal IDs. On one hand, terminal nodes listen to the reporting from other terminal nodes to understand their neighbors; on the other hand, while reporting their own numbers, they broadcast information about their neighboring terminal nodes. After the reporting ends, the aggregation node is aware of the existence of all directly connected terminal nodes and some or all of the secondary connected terminal nodes, and broadcasts the collected information about directly connected terminal nodes. This method allows terminal nodes to quickly understand the network topology and establish routes to the aggregation node as soon as possible.

[0041] like Figure 3 As shown: A method for many-to-one data reporting in a wireless ad hoc network includes the following steps:

[0042] S101, The aggregation node issues a data reporting command;

[0043] S102. After receiving the reporting instruction, the terminal nodes report the numbers one by one in order of their IDs.

[0044] S103, the reporting ends. The aggregation node has detected the existence of all directly connected terminal nodes and some secondary connected terminal nodes, and broadcasts the collected information on the directly connected terminal nodes.

[0045] Step S101: The aggregation node initiates a data reporting command;

[0046] Step S102: The network system is configured with a total of N (N is a natural number) terminal nodes, whose IDs are 1, 2...N. After receiving the reporting command, the terminal node calculates the timeslot number based on its own ID and sends a reporting response frame when the corresponding timeslot arrives. The reported content is broadcasting information about other terminal nodes that it can hear. During this process, both the terminal nodes and the aggregation node obtain the topology relationship with their neighboring nodes.

[0047] Step S103: The aggregation node broadcasts information about its directly connected terminal nodes. Since the coverage of the aggregation node and the terminal nodes is asymmetrical, the aggregation node must declare this; otherwise, the terminal nodes cannot be certain whether their signals can be received by the aggregation node.

[0048] like Figure 2 As shown, the aggregation node initiates a reporting command. For ease of description, the terminal nodes are numbered and divided into terminal node 20a, terminal node 20b, and terminal node 20c, and their respective time slot numbers are calculated as time slot 1, time slot 2, and time slot 3.

[0049] When time slot 1 arrives, terminal node 20a sends a count response frame. At this time, this node has not received any messages from any other terminal node, so the neighbor information for terminal node 20a carried in the count response frame is "no neighbors." This message is received by terminal node 20b, which registers terminal node 20a as a neighbor. When time slot 2 arrives, terminal node 20b sends a count response frame carrying a neighbor information of 1, meaning it carries information about terminal node 20a. This message is received by terminal node 20a, which registers terminal node 20b as a neighbor. This message is also received by terminal node 20c, which registers terminal node 20b as a neighbor. When time slot 3 arrives, terminal node 20c sends a count response frame carrying a neighbor information of having one neighbor, terminal node 20b. This message is received by terminal node 20b, which registers terminal node 20c as a neighbor. The message was also received by the aggregation node, which registered terminal node 20c as a directly connected terminal node and also became aware of the existence of the secondary connected terminal node 20b.

[0050] The aggregation node sends a data acknowledgment frame, carrying information about directly connected terminal nodes, specifically terminal node 20c. This message is received by terminal node 20c, which then adds a directly connected route to its routing table. This message is also received by terminal node 20b, which discovers that its neighbor, terminal node 20c, is directly connected to the aggregation node and adds a route through terminal node 20c to its routing table. This message is also received by terminal node 20a. Since terminal node 20c is not a neighbor of terminal node 20a, terminal node 20a cannot obtain a valid route from this message. Terminal node 20a will obtain a route to the aggregation node during the pull-up mechanism described below.

[0051] After a round of reporting, neighbor relationships are established between adjacent terminal nodes and between the sink node and adjacent terminal nodes. Terminal nodes closer to the sink node establish routes to the sink node, and the network is initially established.

[0052] To address the issue of launch conflicts in the traditional free-competition method during data reporting, this solution introduces a pull-up mechanism.

[0053] The pull-up mechanism described in this invention involves the aggregation node sending a request for data reporting (i.e., pull-up) command to a certain terminal node, and all terminal nodes' transmissions must obey the command of the aggregation node.

[0054] In the embodiments of the present invention, a terminal node that has been detected by the aggregation node is called a designated terminal node. The aggregation node will allocate multiple dedicated designated time slots for it for transmission. All transmission actions within these time slots, including routing addressing of the designated terminal node, data reporting, and data forwarding by other terminal nodes for the designated terminal node, do not have transmission conflicts.

[0055] In embodiments of the present invention, terminal nodes not detected by the aggregation node are referred to as free terminal nodes, and the aggregation node allocates free time slots to them. Free terminal nodes use CSMA+random backoff to perform routing and data reporting in the free time slots; when a free terminal node is detected by the aggregation node, it becomes a designated terminal node and no longer occupies a free time slot.

[0056] like Figure 4 The diagram shows a method for resolving launch conflicts in the traditional free-race mode during data reporting, including the following steps:

[0057] S201, The aggregation node initiates a pull-up command to the first terminal node;

[0058] S202, The first terminal node performs data reporting, and the second terminal node acts as a route to forward the data from the first terminal node;

[0059] S203, The aggregation node confirms data reception.

[0060] In step S201, after the pull-up period of terminal node 20a is reached, the aggregation node initiates a pull-up for terminal node 20a and allocates several consecutive specified time slots for it.

[0061] In step S202: Terminal node 20a reports data using a specified time slot and designates terminal node 20b as its routing node; terminal node 20b forwards data using the subsequent specified time slot;

[0062] In step S203: After receiving the data, the aggregation node sends an acknowledgment.

[0063] Combination Figure 1 and Figure 3 In a network system, the aggregation node allocates fixed time slots for data reporting to the terminal nodes it detects. The aggregation node is equipped with a timer module, for example, collecting data every two seconds. When the reporting cycle of terminal node 20b is reached, the aggregation node sends a pull-up command, specifying terminal node 20b to report data, and allocates multiple subsequent consecutive time slots for data transmission and forwarding.

[0064] When terminal node 20b receives the pull-up command, it sends a data reporting frame in the first specified time slot and declares the route to the aggregation node as: terminal node 20b -> terminal node 20c -> aggregation node.

[0065] The message is received by terminal node 20c. Since terminal node 20c is the subsequent routing node for this data reporting frame, it forwards the data reporting frame in the second specified time slot. Upon receiving the data reporting frame forwarded by terminal node 20c, the aggregation node immediately sends a data acknowledgment frame to complete the data transmission loop.

[0066] The data reporting frame sent by terminal node 20b is also received by terminal node 20a. Since terminal node 20b is a neighbor of terminal node 20a, terminal node 20a obtains a valid route to the aggregation node, namely terminal node 20a -> terminal node 20b -> terminal node 20c -> aggregation node.

[0067] As mentioned above, the aggregation node allocates designated time slots for data reporting to the aware end nodes. For unaware end nodes, the traditional free-competition method is still used, with the aggregation node allocating undesignated time slots for these end nodes to report data using CSMA+random backoff.

[0068] In step S202, the terminal node sends a data reporting frame along with a push field, pushing neighboring nodes that are not yet known to the aggregation node to the aggregation node. Continuing from the above... Figure 1 For example, a push field is added to the data reporting frame sent by terminal node 20b, filled with the ID of neighboring terminal node 20a. When the data frame is delivered to the sink node, the sink node immediately detects the existence of terminal node 20a, and can then allocate a specified time slot for data reporting to terminal node 20a, at which point terminal node 20a withdraws from the free competition.

[0069] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for many-to-one data reporting in a wireless ad hoc network, characterized in that, Based on a network system consisting of one aggregation node and multiple terminal nodes, where the signal of the aggregation node covers all terminal nodes, the method includes the following steps: The aggregation node issues a data reporting command; After receiving the reporting instruction, the terminal nodes report the numbers one by one according to their ID order; After the reporting ends, the aggregation node has detected the existence of all directly connected terminal nodes and some secondary connected terminal nodes, and broadcasts the collected information on the directly connected terminal nodes. The method further includes a step to resolve transmission conflicts in the traditional free-competition mode during data reporting: the aggregation node initiates a pull command to the first terminal node; the first terminal node performs data reporting, and the second terminal node acts as a route to forward the data from the first terminal node; the aggregation node confirms data reception.

2. The method for many-to-one data reporting in a wireless ad hoc network according to claim 1, characterized in that, When a terminal node listens to a report, it detects neighboring terminal nodes; when reporting a report, it broadcasts the information to neighboring terminal nodes.

3. The method for many-to-one data reporting in a wireless ad hoc network according to claim 2, characterized in that, After receiving the reporting instruction, the terminal node calculates the time slot number based on its own ID, and sends a reporting response frame when the corresponding time slot arrives.

4. The method for many-to-one data reporting in a wireless ad hoc network according to claim 3, characterized in that, The aggregation node broadcasts information about the terminal nodes directly connected to it.

5. The method for many-to-one data reporting in a wireless ad hoc network according to claim 4, characterized in that, After the pull-up cycle of the first terminal node is reached, the aggregation node initiates a pull-up to the first terminal node and allocates several consecutive specified time slots to it. The first terminal node reports data using the specified time slot and designates the second terminal node as its routing node; The second terminal node forwards data using the specified time slot; The aggregation node sends an acknowledgment after receiving the data.

6. The method for many-to-one data reporting in a wireless ad hoc network according to claim 1, characterized in that, This also includes accelerating the aggregation node's awareness of the terminal nodes, with the following steps: The terminal node sends a push field along with the data reporting frame, pushing unnoticed neighboring terminal nodes to the aggregation node. When a data reporting frame is delivered to the aggregation node, the aggregation node immediately detects the existence of the terminal node, allocates a designated time slot for data reporting, and the terminal node then withdraws from the free competition.

7. A wireless self-organizing network many-to-one data reporting system, characterized in that, The application is the wireless self-organizing network many-to-one data reporting method as described in any one of claims 1-6. The networking system consists of a convergence node and multiple terminal nodes. The convergence node receives data reported by the terminal nodes. Near-end terminal nodes send data directly to the convergence node, while data sent by far-end terminal nodes needs to be forwarded through adjacent terminal nodes to reach the convergence node.

8. The networking system according to claim 7, characterized in that, The aggregation node is equipped with a high-power wireless communication module, which provides signal coverage to all terminal nodes; the terminal nodes are equipped with low-power wireless communication modules, which provide a smaller signal coverage area, and the radius of the signal coverage area of ​​each terminal node is the same.

Images