MAC design method based on even-odd graph coloring for underwater acoustic data collection

The MAC design method for UASNs uses odd-even graph coloring and AUV feedback to address interference from ocean currents and AUV movement, enhancing network efficiency and reducing energy consumption.

CN115209547BActive Publication Date: 2024-12-03HOHAI UNIV CHANGZHOU
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210828530.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-07-13
Publication Date
2024-12-03
Estimated Expiration
2042-07-13

AI Technical Summary

Technical Problem

Existing MAC protocols for Underwater Acoustic Sensor Networks (UASNs) fail to account for ocean currents and AUV movement, leading to data transmission challenges such as interference and inefficient channel utilization.

Method used

A MAC design method based on odd-even graph coloring and feedback mechanism, integrating location updates and time slot allocation to minimize interference and hidden terminal conflicts, using AUV path information and orthogonal preamble codes for neighbor determination.

Benefits of technology

Enhances network throughput, reduces energy consumption, and extends sensor network life by improving channel utilization and resolving hidden terminal issues.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115209547B_ABST
    Figure CN115209547B_ABST
Patent Text Reader

Abstract

The present invention discloses a MAC design method based on odd-even graph coloring for underwater acoustic data collection, and the specific steps are as follows: 1) Position update of sensor network nodes. 2) Broadcast of AUV path packets, where the path includes path endpoints and AUV speed. 3) Determination of the neighbor relationship of the sensor node relative to the AUV. The sensor node obtains the path information of the AUV by monitoring the path packet, and determines whether it is a one-hop or two-hop neighbor node of the AUV in combination with its own position. 4) Time slot allocation of the sensor node. The sensor node runs a graph coloring algorithm of odd-even grouping according to its own position and the position information of the neighbor node, and selects a time slot that has no conflict with the neighbor node. 5) Feedback mechanism of the AUV. The present invention can reduce the energy consumption of the sensor node, avoid conflicts between sensor nodes, and improve the throughput of the sensor network.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of underwater communication, and in particular relates to a MAC design method based on odd-even graph coloring for underwater acoustic data collection. Background Art

[0002] The research and application of Underwater Acoustic Sensor Networks (UASNs) have attracted widespread attention in recent years. UASNs have broad application prospects in marine flora and fauna monitoring, water physical and chemical composition analysis, resource exploration, tactical surveillance and auxiliary navigation. However, unlike ground-based wireless sensor networks, UASNs have complex characteristics such as low bandwidth, long delay, high bit error rate, and signal fading caused by multipath effects. Therefore, how to collect data safely, efficiently and stably is an urgent problem to be solved.

[0003] The key to MAC protocol design is to solve the data conflict problem. However, due to the slow propagation speed of underwater acoustic signals and the complex and changeable underwater environment, it is difficult to design a reliable communication protocol. In order to effectively transmit data, many media access control (MAC) protocols have emerged in recent years. The existing MAC protocols consider the usually static network and do not consider the impact of ocean currents and AUV movement. Summary of the invention

[0004] In view of the above problems, the present invention designs a MAC design method based on odd-even graph coloring for underwater acoustic data collection, which is specially used for the data collection scenario of AUV collecting sensor network nodes. By timely updating the location information of nodes in the sensor network during the initialization phase, the interference caused by ocean currents can be counteracted; the graph coloring method and odd-even grouping are integrated to achieve conflict-free transmission between neighboring nodes; the feedback mechanism of AUV is introduced to solve the hidden terminal problem and improve channel utilization.

[0005] In order to achieve the above objectives and the above technical effects, the present invention is implemented through the following technical solutions:

[0006] A MAC design method based on odd-even graph coloring for underwater acoustic data collection includes the following steps:

[0007] (1) Location update of sensor network nodes;

[0008] (2) Broadcasting of AUV path packages

[0009] The AUV broadcasts a path data packet, which contains the path endpoints and AUV speed;

[0010] (3) The neighbor relationship of the sensor node relative to the AUV is determined. By monitoring the path packet, the path information of the AUV is obtained, and combined with its own position, it is confirmed that it is a one-hop or two-hop neighbor node of the AUV; the node whose communication range of the sensor node intersects with the AUV path is a one-hop node, otherwise it is a two-hop node;

[0011] (4) Time slot allocation of sensor nodes: sensor nodes run the graph coloring algorithm of odd-even grouping according to their own positions and the position information of neighboring nodes, and select time slots that do not conflict with neighboring nodes;

[0012] (5) Feedback mechanism of AUV. AUV travels along the path and collects data. When AUV does not receive data or cannot parse a data packet in a certain time slot, AUV will broadcast a feedback data packet. The feedback data packet includes the ID, location and other information of the node in the data packet successfully received before this time slot. The sensor node adjusts its time slot allocation according to this data packet.

[0013] Preferably, in the above step (1), the position of the sensor network node is updated. In the periodic data collection scenario, the sensor node can predict the arrival time of the AUV, and the sensor network node completes the position update before that, and performs a time synchronization before each round of data collection to reduce the time error.

[0014] Preferably, in the above step (4), the sensor node allocates time slots. The sensor node divides the path of the AUV into a number of time slot segments according to the path and speed of the AUV, and the length of a time slot segment is the distance traveled by the AUV in one time slot; the one-hop node preliminarily screens the time slot corresponding to the time slot segment when the AUV is within its communication range, and the two-hop node preliminarily screens the time slot corresponding to the time slot segment before the AUV leaves the communication range of its one-hop neighbor node; then, the sensor node runs the graph coloring algorithm of odd-even grouping according to its own position and the position information of the neighbor node, and selects the time slot that has no conflict with the neighbor node.

[0015] Furthermore, the location update of the sensor network node in step (1) specifically includes the following steps:

[0016] (1.1) Divide the 2R×2R square area into The sensor node calculates the area number of the area it is in based on its own position and selects the preamble code corresponding to the area number. The preamble code is a ZC orthogonal sequence, and the selection rule is:

[0017]

[0018] Among them, Node.Pid represents the area number corresponding to the node, Node.y represents the vertical coordinate of the node relative to the reference system, Node.x represents the horizontal coordinate of the node relative to the reference system, and R represents the node transmission radius.

[0019] (1.2) The sensor node broadcasts an orthogonal preamble at the beginning of the time slot;

[0020] (1.3) The sensor node receives the preamble code by decoding, determines the number of neighbor nodes, and adjusts the transmission probability according to the number of neighbor nodes:

[0021]

[0022] in, is the adjustment coefficient, Node.nbnum represents the number of neighbors of the node;

[0023] (1.4) After a certain period of time, the sensor node sends a data packet according to the transmission probability obtained in (1.3). The data packet contains information such as the node ID and location;

[0024] Furthermore, in step (4), the one-hop node preliminarily selects the time slot corresponding to the time slot segment of the AUV within its communication range, and then runs the graph coloring algorithm of the odd-even grouping; the specific steps are:

[0025] (4.1.1) The sensor node determines whether it is on the upper or lower side of the path based on its own position. If it is on the upper side, it selects an odd time slot, and if it is on the lower side, it selects an even time slot. The judgment rule is:

[0026] y=path(x) (3)

[0027]

[0028] path(·) represents the correspondence between the horizontal and vertical coordinates of the AUV path.

[0029] (4.1.2) The sensor node traverses the neighbor nodes, filters out the one-hop nodes on the same side, and removes the non-same-side nodes from the neighbor list;

[0030] (4.1.3) The sensor node runs the graph coloring method and integrates the odd-even grouping into the graph coloring method. The specific method is as follows: on the other side of the path symmetry, it is assumed that there is a node that is symmetrical to itself, called a virtual node, and it is added to the topology graph. When coloring the graph, each time a node is colored, its virtual node is colored, and the color of the node is different from the color of any node. After coloring is completed, the node selects a conflict-free time slot based on the color;

[0031] Furthermore, in step (4), the two-hop node selects the time slot corresponding to the time before the AUV leaves its one-hop neighbor node, and then runs the graph coloring algorithm for odd-even grouping. The specific steps are:

[0032] (4.2.1) The two-hop node traverses the neighboring nodes and determines the target one-hop node to send;

[0033] (4.2.2) The two-hop node calculates the time slots used by the one-hop node and removes the time slots selected by the one-hop node;

[0034] (4.2.3) The two-hop node determines whether it is on the left or right side of the one-hop node. If it is on the left side, it selects the odd time slot, and if it is on the right side, it selects the even time slot. The judgment rule is: the point closest to the one-hop node is used as the tangent of the AUV path, which is regarded as the horizontal axis, and the straight line passing through this point and perpendicular to the horizontal axis is the vertical axis. In the above reference system, the horizontal coordinate is less than 0 for the left side, and the horizontal coordinate is greater than 0 for the right side;

[0035] (4.2.4) The two-hop node traverses the neighbor nodes, filters the two-hop nodes on the same side, and removes the two-hop nodes on the non-same side from the neighbor list;

[0036] (4.2.5) The two-hop node runs the graph coloring algorithm for odd-even grouping. After coloring is completed, time slots are allocated according to color.

[0037] Beneficial effects of the present invention:

[0038] The present invention is designed to update the position of the sensor network node in the initialization phase, so as to resist the interference of ocean current drift on the node; the sensor node quickly determines the number of neighbors by broadcasting orthogonal preamble codes to accelerate the initialization process; in the data collection phase, the node obtains the path of the AUV by listening to the path packet, and runs the graph coloring algorithm of odd and even grouping to select the time slot that does not conflict with the neighbor node according to its own position, the position of the neighbor node and the AUV path. The introduction of the AUV feedback mechanism solves the hidden terminal problem and improves the channel utilization rate; the present invention can improve the network throughput, save the energy consumption of the sensor node, extend the life of the sensor network, and provide help for the future underwater mobile node communication. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 A flowchart of an embodiment of this invention;

[0040] Figure 2 It is the application scenario diagram;

[0041] Figure 3 is the preamble code distribution diagram;

[0042] Figure 4 Schematic diagram of selecting a preamble for a node;

[0043] Figure 5 is the network topology interference graph;

[0044] Figure 6 Color the process diagram for the upper side figure;

[0045] Figure 7 Color the process diagram for the lower figure;

[0046] Figure 8 Example of coloring results for the graph;

[0047] Fig. 9 is the available time slot graph of two-hop nodes;

[0048] Fig.10 Schematic diagram of the dividing line;

[0049] Fig.11 This is a schematic diagram of a hidden terminal. DETAILED DESCRIPTION

[0050] In order to enable people in the technical field to better understand the technical solutions in this application, the technical solutions in the embodiments of this application are clearly and completely described below. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this application.

[0051] The application principle of the present invention is described in detail below in conjunction with the accompanying drawings.

[0052] like Figure 2 As shown, the sensor node network is distributed on the seabed to collect data, and the data is transmitted to the surface data processing center through the forwarding node, or the AUV traverses to collect data and then transmits the data to the surface processing center. The surface processing center uses electromagnetic waves to transmit the data to the ground base station via the satellite.

[0053] A MAC design method based on odd-even graph coloring for underwater acoustic data collection specifically includes the following steps:

[0054] (1) Location update of sensor network nodes

[0055] Figure 3 The relationship between the node position and the selected preamble is shown, dividing the 2R×2R square area into The sensor node calculates the area number of the area it is in based on its own position and selects the preamble code corresponding to the area number. The preamble code is a ZC orthogonal sequence, and the selection rule is:

[0056]

[0057] Among them, Node.Pid represents the area number corresponding to the node, Node.y represents the ordinate of the node relative to the reference system, Node.x represents the abscissa of the node relative to the reference system, and R represents the node transmission radius. In this paper, 2R is selected as the side length of the small area to avoid interference between small areas. Figure 4 An example is shown, where the preamble number selected by node A is 10, the preamble number selected by node B is 57, and the preamble number selected by node C is 64;

[0058] (2) Broadcasting of AUV path packages

[0059] The AUV packages the pre-planned path into a data packet containing the path endpoints and the AUV speed, and broadcasts it; the sensor node can obtain the AUV's path information by monitoring this data packet;

[0060] (3) Determination of the neighbor relationship between the sensor node and the AUV

[0061] The sensor node obtains the path information of the AUV by listening to the path packet, and determines whether it is a one-hop or two-hop neighbor node of the AUV based on its own position; the node whose communication range of the sensor node intersects with the AUV path is a one-hop node, otherwise it is a two-hop node;

[0062] (4) Time slot allocation of sensor nodes

[0063] The sensor node divides the path of the AUV into several time slots according to the path and speed of the AUV. The length of a time slot is the distance traveled by the AUV in one time slot. The one-hop node preliminarily selects the time slot corresponding to the time slot when the AUV's time slot is within its communication range, and the two-hop node preliminarily selects the time slot corresponding to the time slot before the AUV leaves the communication range of its one-hop neighbor node. Then, the sensor node runs the graph coloring algorithm of odd-even grouping according to its own position and the position information of the neighbor node, and selects the time slot that has no conflict with the neighbor node.

[0064] (4.1) One-hop node time slot selection

[0065] A one-hop node can communicate directly with the AUV when the AUV enters its communication range, and the AUV does not send data packets during this process, mainly considering the conflict with neighbors who are also one-hop nodes;

[0066] A one-hop node determines whether it is on the upper or lower side of the path based on its own position. If it is on the upper side, it selects an odd time slot, and if it is on the lower side, it selects an even time slot. The judgment rules are:

[0067] y=path(x) (3)

[0068]

[0069] like Figure 5 As shown, Figure 5 The left side shows the actual data collection scenario, where the gray nodes are one-hop nodes, the white nodes are two-hop nodes, and the arrowed lines represent the underwater acoustic signals; Figure 5 Right Figure 5 The corresponding interference graph on the left, the nodes connected by black solid lines indicate that there is interference between each other and the same time slot cannot be used; when the nodes on the upper side select odd time slots and the nodes on the lower side select even time slots, there will be no conflict between the nodes on the upper side and the nodes on the lower side, and the interference graph will be further simplified; in addition, due to the mobility of AUV, the unfairness of sensor network nodes is increased, and the stay time of AUV in the communication range of different nodes is long or short. In order to ensure that the one-hop node has enough communication time, the one-hop node is given priority, and the two-hop node will choose the time slot that does not affect the one-hop node for communication, so the two-hop node is eliminated from the graph; Figure 6 Demonstrates the process of graph coloring.

[0070] like Figure 6 As shown in the figure, we let the nodes on the upper side of the path use odd-numbered time slots, and the nodes on the lower side of the path use even-numbered time slots. This is reflected in the graph coloring method as follows: each node assumes that there is a virtual node on the other side of the path, which is represented by light gray in the figure. The solid line represents the interference between the actual nodes, and the dotted line represents the interference between the virtual node and other nodes. When coloring the nodes, each time a node is colored, its virtual node is colored, and the color of the virtual node is different from the color of the already colored nodes. The coloring process of the nodes on the upper side of the path and the nodes on the lower side of the path is independent. Figure 7 Similarly, after coloring is completed, the node selects the time slot corresponding to the color. Figure 8 An example of coloring completion is given.

[0071] like Figure 8 As shown in the figure, different colors represent different time slots. Node A chooses black, so it uses the black time slot segment. The communication ranges of node B and node A overlap, but since they choose different time slots, there will be no conflict. Looking at the three nodes D, E, and F, node D has communication ranges with nodes E, C, and F. Therefore, in the intersection of D and E, it needs to share time slots with nodes E and F, and in the intersection of C and D, it needs to share time slots with node C and its assumed virtual node. There is a disadvantage here, that is, there are some blank time slots in the intersection of C and D communication ranges that are not used. The solution is given in Section (5).

[0072] (4.2) Two-hop node time slot selection

[0073] The two-hop node selects the time slot corresponding to the time before the AUV leaves its one-hop neighbor node. Figure 8 As shown, the time slot segment that node A is expected to use is segment T1, and the time slot segment that nodes B, C, and D are expected to use is segment T2; because the two-hop node is expected to use more time slots, the two-hop node does not compete with the one-hop node for time slots, and gives priority to the one-hop node to select time slots; on the basis of removing the time slot selected by the one-hop node, select the time slot that does not conflict with other two-hop nodes; in order to avoid the hidden terminal problem, the odd area and the even area are also divided according to the position of the two-hop node, and the two-hop node determines whether it is on the left or right side of the one-hop node; if it is on the left side, select the odd time slot, and if it is on the right side, select the even time slot; the judgment rule is: the point closest to the one-hop node from the AUV path is used as the tangent of the AUV path, which is regarded as the horizontal axis, and the straight line passing through this point and perpendicular to the horizontal axis is the vertical axis; in the above reference system, the horizontal coordinate is less than 0 for the left side, and the horizontal coordinate is greater than 0 for the right side. As Fig. 9 shown.

[0074] (5) Feedback mechanism of AUV

[0075] The graph coloring method of odd-even grouping avoids the possibility of conflict with neighbor nodes. Since the node only collects the information of one-hop neighbors, there is still a hidden danger of hidden terminals. Nodes on both sides of the AUV path will not conflict, but nodes on the same side that are out of communication range may still conflict, such as Fig.10 As shown in Figure 2, since the two one-hop nodes do not know each other's location information, they choose the same time slot to send to the AUV, resulting in a hidden terminal conflict.

[0076] The AUV’s feedback mechanism is used to resolve hidden terminal conflicts. When the AUV does not receive data in a certain time slot or cannot parse a data packet, the AUV will broadcast a feedback data packet. The feedback data packet includes the node ID, location, and other information in the data packet successfully received before this time slot. Based on this data packet, the sensor node can determine whether it is a conflict with a hidden terminal or a blank time slot as mentioned in (4.1). If it is a hidden terminal conflict, the hidden terminal will be added to the interference graph, recolored, and its time slot allocation will be adjusted; if there is a blank time slot, the blank time slot will be added to the available time slot and reallocated.

Claims

1. A MAC design method based on odd-even graph coloring for underwater acoustic data collection, characterized in that: The main steps include: (1) Location update of sensor node network; (2) Broadcasting of AUV path package The AUV broadcasts a path data packet, which contains the path endpoints and AUV speed; (3) The neighbor relationship of the sensor node relative to the AUV is determined. By monitoring the path packet, the path information of the AUV is obtained, and combined with its own position, it is confirmed that it is a one-hop or two-hop neighbor node of the AUV; the node whose communication range of the sensor node intersects with the AUV path is a one-hop node, otherwise it is a two-hop node; (4) Time slot allocation of sensor nodes: sensor nodes run the graph coloring algorithm of odd-even grouping according to their own positions and the position information of neighboring nodes, and select time slots that do not conflict with neighboring nodes; The one-hop node initially selects the time slots corresponding to when the AUV's time slot segment is within its communication range, and then runs the graph coloring algorithm for odd-even grouping. The specific steps are as follows: (4.1.1) The sensor node determines whether it is on the upper or lower side of the path based on its own position. If it is on the upper side, it selects an odd time slot, and if it is on the lower side, it selects an even time slot. The judgment rule is: y=path(x) (3) path(·) represents the correspondence between the horizontal and vertical coordinates of the AUV path; (4.1.2) The sensor node traverses the neighbor nodes, filters out the one-hop nodes on the same side, and removes the non-same-side nodes from the neighbor list; (4.1.3) The sensor node runs the graph coloring method and incorporates the odd-even grouping into the graph coloring method. The specific method is as follows: on the other side of the path symmetry, it is assumed that there is a node that is symmetrical to itself, called a virtual node, and it is added to the topology graph. When coloring the graph, each time a node is colored, its virtual node is colored, and the color of the node is different from the color of any node; After coloring is completed, nodes select conflict-free time slots based on color; The two-hop node selects the time slot corresponding to the time before the AUV leaves its one-hop neighbor node, and then runs the graph coloring algorithm for odd-even grouping. The specific steps are as follows: (4.2.1) The two-hop node traverses the neighboring nodes and determines the target one-hop node to send; (4.2.2) The two-hop node calculates the time slots used by the one-hop node and removes the time slots selected by the one-hop node; (4.2.3) The two-hop node determines whether it is on the left or right side of the one-hop node; if it is on the left side, it selects an odd time slot, and if it is on the right side, it selects an even time slot; the judgment rule is: the point closest to the one-hop node from the AUV path is taken as the tangent of the AUV path, which is regarded as the horizontal axis, and the straight line passing through this point and perpendicular to the horizontal axis is the vertical axis; In the above reference system, the horizontal coordinate is less than 0, which is on the left side, and the horizontal coordinate is greater than 0, which is on the right side; (4.2.4) The two-hop node traverses the neighbor nodes, filters the two-hop nodes on the same side, and removes the two-hop nodes on the non-same side from the neighbor list; (4.2.5) The two-hop node runs the graph coloring algorithm for odd-even grouping. After coloring is completed, time slots are allocated according to color. (5) AUV feedback mechanism. The AUV travels along the path and collects data. When the AUV does not receive data or cannot parse a data packet in a certain time slot, the AUV will broadcast a feedback data packet. The feedback data packet includes the ID and location information of the node in the data packet successfully received before this time slot. The sensor node adjusts its time slot allocation based on this data packet.

2. The MAC design method based on odd-even graph coloring for underwater acoustic data collection according to claim 1, characterized in that: In the step (1), the sensor network nodes update their positions. In a periodic data collection scenario, the sensor nodes can predict the arrival time of the AUV, and the sensor network nodes complete their position updates before that time. In addition, they perform time synchronization before each round of data collection to reduce time errors.

3. The MAC design method based on odd-even graph coloring for underwater acoustic data collection according to claim 1, characterized in that: In the step (4), the sensor nodes allocate time slots. The sensor nodes divide the path of the AUV into a number of time slot segments according to the path and speed of the AUV. The length of a time slot segment is the distance traveled by the AUV in one time slot. The one-hop node preliminarily selects the time slot corresponding to the time slot segment when the AUV is within its communication range. The two-hop node preliminarily selects the time slot corresponding to the time slot segment before the AUV leaves the communication range of its one-hop neighbor node. Then, the sensor node runs a graph coloring algorithm of odd-even grouping according to its own position and the position information of the neighbor node to select a conflict-free time slot.

4. The MAC design method based on odd-even graph coloring for underwater acoustic data collection according to claim 1, characterized in that: The location update of the sensor network node in step (1) specifically includes the following steps: (1.1) Divide the 2R×2R square area into The sensor node calculates the area number of the area it is in based on its own position and selects the preamble code corresponding to the area number. The preamble code is a ZC orthogonal sequence, and the selection rule is: Among them, Node.Pid represents the area number corresponding to the node, Node.y represents the vertical coordinate of the node, Node.x represents the horizontal coordinate of the node, and R represents the node transmission radius; (1.2) The sensor node broadcasts an orthogonal preamble at the beginning of the time slot; (1.3) The sensor node determines the number of neighbor nodes by calculating the number of received preamble codes and adjusts the transmission probability according to the number of neighbor nodes: in, is the adjustment coefficient, Node.nbnum represents the number of neighbors of the node; (1.4) After a certain period of time, the sensor node sends a data packet with the transmission probability set according to formula (2). The data packet contains the node ID and location information.