CN118102413A - Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data - Google Patents
Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data Download PDFInfo
- Publication number
- CN118102413A CN118102413A CN202410495888.4A CN202410495888A CN118102413A CN 118102413 A CN118102413 A CN 118102413A CN 202410495888 A CN202410495888 A CN 202410495888A CN 118102413 A CN118102413 A CN 118102413A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- transmitted
- nodes
- proposal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 230000005540 biological transmission Effects 0.000 claims abstract description 45
- 230000006872 improvement Effects 0.000 claims abstract description 13
- 238000004891 communication Methods 0.000 claims description 17
- 230000007246 mechanism Effects 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 7
- 230000000977 initiatory effect Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000010363 phase shift Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000000779 smoke Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a transmission method, a system, equipment and a storage medium of multi-hop self-organizing network data, comprising the following steps: each node discovers a corresponding neighbor node through an ND improvement method based on SIC and MPR; constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node; a first node in the multi-hop self-organizing network, which detects data to be transmitted for the first time, creates a first proposal according to the type of the data to be transmitted, and sends the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted; based on a transmission rule determined according to the number of nodes in the multi-hop ad hoc network, determining whether data to be transmitted need to be transmitted in the multi-hop ad hoc network or not according to a first proposal, and transmitting the data to be transmitted when the data need to be transmitted, wherein the accuracy and the effectiveness of data transmission can be improved through the method.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, a system, an apparatus, and a storage medium for transmitting data in a multihop ad hoc network.
Background
The self-organizing network (AD hoc) is a multi-hop wireless network without center self-organization, can construct a temporary network at any time and any place without taking any existing fixed facilities as the basis, has flexible and quick networking, has high anti-destruction performance and has wide application prospect. In AD hoc networks, where nodes have message forwarding capabilities, communication between nodes may be forwarded via multiple intermediate nodes, i.e. via multiple hops (MultiHop), which is the most fundamental distinction between AD hoc networks and other mobile networks. In addition, the characteristics of the method comprise centerless, self-organizing, multi-hop routing and dynamic topology.
The location and data changes of each individual in an AD hoc network may participate in and improve the sensing task, possibly resulting in the generation of a large amount of repeated data. Currently, priority is the only fully temporary solution for evaluating individual data transmissions. Such a policy may prevent excessive duplicate data from congesting the network. It does not include an assessment of each data and is unreliable in accuracy and efficiency.
Disclosure of Invention
In order to solve the above problems in the prior art, the present invention provides a method, a system, a device and a storage medium for transmitting data of a multihop ad hoc network. The method specifically comprises the following steps:
In a first aspect, the present invention provides a method for transmitting data in a multihop ad hoc network, including:
Each node discovers a corresponding neighbor node through an ND improvement method based on SIC and MPR;
Constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node;
a first node in the multi-hop self-organizing network, which detects data to be transmitted for the first time, creates a first proposal according to the type of the data to be transmitted, wherein the proposal comprises attribute information of the data to be transmitted;
The first node sends the first proposal to neighbor nodes of the first node;
Based on the transmission determined according to the number of nodes in the multi-hop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node determine whether the data to be transmitted needs to be transmitted in the multi-hop ad hoc network according to the first proposal, and transmit the data to be transmitted when the data to be transmitted needs to be transmitted.
In a second aspect, the present invention provides a multi-hop ad hoc network system comprising:
A plurality of nodes;
each node is used for discovering each corresponding neighbor node through an ND improvement method based on SIC and MPR, and constructing a multi-hop self-organizing network based on the discovered neighbor nodes;
A first node for detecting data to be transmitted for the first time in a plurality of nodes is used for creating a first proposal according to the type of the data to be transmitted and sending the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted;
The neighbor nodes of the first node or the neighbor nodes of the first node and the first node are used for determining whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal based on the transmission determined according to the number of the nodes in the multi-hop ad hoc network, and transmitting the data to be transmitted when the data to be transmitted need to be transmitted.
In a third aspect, the present invention provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing any of the methods provided in the first aspect when executing a program stored on a memory.
In a fourth aspect, the present invention provides a computer readable storage medium having a computer program stored therein, the computer program, when executed by a processor, implementing any of the methods provided in the first aspect.
The invention has the beneficial effects that:
The invention provides a transmission method, a system, equipment and a storage medium of multi-hop self-organizing network data, wherein each node discovers a corresponding neighbor node through an ND improvement method based on SIC and MPR; constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node; a first node in the multi-hop self-organizing network, which detects data to be transmitted for the first time, creates a first proposal according to the type of the data to be transmitted, and sends the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted; based on the transmission determined according to the number of nodes in the multi-hop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node determine whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal, and the data to be transmitted is transmitted when the data to be transmitted need to be transmitted, so that the accuracy and the effectiveness of the data transmission in the multi-hop ad hoc network can be improved.
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Drawings
Fig. 1 is a schematic flow chart of a method for transmitting data in a multi-hop ad hoc network according to the present invention;
Fig. 2 is a schematic diagram of a timeslot provided in the present invention;
Fig. 3 is a schematic diagram of a multi-hop ad hoc network system according to the present invention;
FIG. 4 is a schematic diagram of a node low density rule provided by the present invention;
fig. 5 is a schematic diagram of a node high-density rule according to the present invention.
Detailed Description
The present invention will be described in further detail with reference to specific examples, but embodiments of the present invention are not limited thereto.
The first part of the transmission method of the multi-hop self-organizing network data is that the improved neighbor node discovery (Neighbor Discovery, ND) method based on SIC and MPR carries out the efficient discovery of neighbor nodes, specifically, the neighbor nodes send signals in a specific mode, the signals are unpacked and analyzed according to a specific modulation mode, the relevant information of the corresponding sending node of the data packet is extracted, and the discovery of the neighbor nodes is completed based on a double handshake principle; the second part is to make route decision to form network topology process, which does not limit the route method too much, and can be source drive route protocol (Ad hoc On-DEMAND DISTANCE Vector, AODV) route method, etc., the part is to make the whole data transmission process complete; the third part is a data transmission process, specifically, after each node detects the received data, a collaborative trigger propagation mechanism (collaboratively-TRIGGERED DISSEMINATION, CTD) comprising a node low density rule (CTD-passive) and a node high density rule (CTD-query) is used for evaluating the data content, so that the effectiveness and quality of the data content are improved, the quality of the transmitted data is improved, and the transmission of useless data is reduced. The method can be applied to cities, so that people can know things happening in a certain area as soon as possible, and can make changes to own plans. Meanwhile, the invention can be applied to unmanned areas with dangerous environment and rare human smoke, so that technicians in all places can know local changes as soon as possible, such as climate and personnel surfing, and forecast and prevent some emergencies.
Fig. 1 is a flow chart of a method for transmitting data in a multihop ad hoc network according to the present invention, as shown in fig. 1, the method includes:
s101, each node discovers a corresponding neighbor node through an ND improvement method based on SIC and MPR.
In order to solve the problem that a plurality of signals cannot be unpacked simultaneously in the traditional ND method, and the data Packet is discarded for retransmission under the condition of facing data Packet collision, the invention provides an ND method based on successive interference cancellation (Successive Interference Cancellation, SIC) and Multi-Packet Reception (MPR), which can realize Multi-Packet decompression and achieve a neighbor discovery rate higher than that of the traditional algorithm.
The following steps A1-A4 are further explanation of how each node discovers its corresponding neighbor node by means of the SIC and MPR based ND improvement method according to the present invention:
specifically, for any second node in each node, discovering a corresponding neighbor node by using an ND improvement method based on SIC and MPR, including:
And A1, judging signals sent by a plurality of nodes based on a randomly selected modulation mode in a minimum time slot by a second node to reject signals sent by discovered neighbor nodes to obtain residual signals, performing unpacking processing on the residual signals by adopting an ND method based on MPR, and performing unpacking processing on the signals with data collision by adopting an ND method based on SIC when the data collision exists, so as to finish unpacking.
The minimum slot (mini-slot) is a term describing a transmission time unit smaller than a standard slot in order to study a method of increasing a data transmission speed in an ad hoc network. As shown in fig. 2, since the method adopts a two-way handshake mechanism, each time slot (time-slot) is divided into two identical mini-slots, in this process, a message is first generated, the content of the message generally includes relevant identity information of a node, such as identity identification, status, etc., after the message is generated, the messages are transmitted through wireless signals, in a modulation stage, the node processes the message signals by using a specific modulation scheme, and the generation and modulation processes of the message are both combined with actual situations by using a conventional mode, which is not particularly limited. For example, modulation schemes such as Binary phase shift keying (Binary PHASE SHIFT KEYING, BPSK), quadrature phase shift keying (Quadrature PHASE SHIFT KEYING, QPSK), and Quadrature amplitude modulation (Quadrature Amplitude Modulation, QAM) are used.
For example, referring to fig. 3, taking node a as an example, in the first minimum time slot, node B, C, D, E, F, G randomly selects a modulation scheme to generate a signal based on a data packet to be transmitted, and sends the generated signal to node a. After the node a receives the plurality of signals, if the sending node G is a neighbor node found by itself, the signal corresponding to the node G is removed and is not responded to the neighbor node, and after the signal is removed, the signal sent by the remaining node B, C, D, E, F is further unpacked by adopting an ND method based on MPR, if the modulation modes of the signals sent by B and C are the same, data collision occurs when the signals sent by B and C are unpacked by adopting an ND method based on MPR, the signals sent by B and C are required to be unpacked by adopting an ND method based on SIC, so that a final unpacking result is obtained.
The following steps a1-a5 are further illustrative of the SIC-based ND method of the invention:
A SIC-based ND method comprising:
step a1, pretreatment: when multiple signals are received, they are sent to matched filters for preprocessing.
Step a2, signal sequencing: and sorting the preprocessed signals according to the signal intensity from strong to weak.
The signal strength depends on the signal power, which is affected by the inter-node distance, and this power difference is used to sort the different signals differently, followed by unpacking.
Step a3, unpacking the first data packet: and according to the sequencing result, detecting, judging and reconstructing to obtain a first data packet.
Step a4, interference removal: the unpacked first signal is subtracted from the received signal to eliminate interference of the signal with subsequent signals.
Step a5, repeating iteration: after the first signal is processed, the steps are repeated to recover the remaining signal and process it. And repeating the iteration to finish the unpacking processing of all the signals adopting the same modulation mode.
Referring to the example shown in fig. 3, assuming that node B and node C employ the same modulation scheme, the power of the signals received by node a is different from that of the signals received by node B and C because the distance between node a and node B is not equal to the distance between node a and node C. Wherein the power of the received signal sent by node B is greater than the power of the signal sent by node C, and node A uses this power difference to unpack the signals of node B and node C via SIC. The node A regards the signal sent by the low-power node C as interference, and unpacks the signal sent by the node B with Bao Gao power, when the node A successfully unpacks the signal sent by the node B, the signal is subtracted from all the received signals, and then the unpacking of the signal sent by the node C is executed.
The following steps b1-b4 are further illustrative of the MPR-based ND method of the present invention:
an MPR-based ND method comprising:
step b1, by using special treatment of the physical layer or link layer (Medium Access Control, MAC) layer. For example, using spatial diversity, frequency domain filtering, etc., to distinguish the signals of different modulation schemes and thereby separate the received mixed signal into different signal streams. The signal stream refers to a set containing signals of the same modulation scheme.
And b2, for each separated signal flow, the node identifies the modulation mode adopted by the node by analyzing the statistical characteristics and waveform characteristics of the signal.
And b3, according to the identified modulation mode, the node applies a corresponding demodulation algorithm to restore the original data. Demodulation algorithms may vary, including demodulator parameter settings, synchronization algorithms, error correction, and the like.
And b4, after the demodulation is completed, the node extracts the data packet from the demodulated signal. By analyzing the extracted packet content, the node can identify the node that sent the packet. The content of the data packet typically contains information about the identity of the sending signal node, such as identity, status, etc.
And A2, in the next minimum time slot, the second node determines whether the node corresponding to each residual signal becomes a neighbor node according to the unpacking result corresponding to each residual signal, generates a response signal according to the determination result and sends the response signal to the node corresponding to each residual signal.
Illustratively, with continued reference to the example shown in fig. 3, in the second minimum time slot, node a randomly selects the modulation scheme to generate a corresponding reply signal to reply to the signal sent by node B, C, D, E, F.
And A3, establishing a relation between the nodes corresponding to the residual signals and the second node based on the received response signals.
Illustratively, referring to fig. 3, a plurality of nodes transmitting signals receive a reply signal transmitted by node a. The node A and the surrounding nodes realize the discovery of the neighbor nodes through the double handshake mechanism for mutually transmitting signals.
And A4, the second node updates the value of the local neighbor node counter according to the current corresponding neighbor node condition.
Neighbor node discovery is a key step in an ad hoc network, determines the efficiency of the ad hoc network construction, and aims to improve the speed of constructing and transmitting data of the ad hoc network and improve the ND rate. In the conventional methods for improving the ND rate, such as mining of priori information and parameter optimization, collision is very important, however, the method does not study the recovery of the collision message of the receiving node, and in order to solve the problem of collision in the ND process, the invention adopts the SIC technology to recover the data packet when the collision occurs, so as to reduce the time required by ND. SIC is an algorithm used in the field of non-orthogonal multiple access, and the scheme can be applied on the basis of the proposed ND algorithm, and is introduced into the ND algorithm in the invention, and has the advantage of being capable of successfully unpacking a plurality of collided data packets instead of directly discarding the collided data packets. Although the introduction of SIC reduces ND time, additional signal processing is required, thereby increasing complexity. MPR is adopted to avoid data packet collision, and the performance of ND algorithm is further improved. MPR is a technology that enables a receiver to detect information transmitted by a plurality of nodes within its reception range, and can greatly improve the throughput of an ad hoc network. The enabling of SIC and MPR technology on the original ND realizes the great improvement of ND speed.
S102, constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node.
Specifically, each node and the neighbor node corresponding to each node construct a multi-hop self-organizing network based on the routing decision. The application does not impose excessive restrictions on the routing algorithm, and the conventionally used AODV routing algorithm, for example, can be used.
The following steps B1-B3 are a method for constructing a multi-hop self-organizing network.
Referring to fig. 3, exemplary, following an established neighbor node, routing decisions form a network topology using an AODV algorithm, comprising:
In step B1, taking node a as an example, node a broadcasts a query signal (RREQ) to query whether a path exists for the destination node P.
Step B2, other nodes, such as B, C, D, G, etc., upon receiving the request check their routing tables to establish whether a path exists to the destination node P. Each node maintains a routing table, each table containing the next hop address to the destination and related information. Since the relevant information of P can be found in the routing table of G, the node G can receive the query signal.
Step B3, node G will send a REPly signal (RREP) to node a containing the path of node G to destination node P, updating the routing table of node a.
The other paths are similar to the above steps until the routing tables of all nodes are updated, and finally the network is formed.
S103, the first node which detects the data to be transmitted for the first time creates a first proposal according to the type of the data to be transmitted, and sends the first proposal to the neighbor node of the first node.
Wherein the proposal comprises attribute information of the data to be transmitted. A request is proposed as to whether to transmit such data.
Specifically, the attribute information of the data to be transmitted includes: summarizing information corresponding to the data to be transmitted, creating time of the data to be transmitted and type of the data to be transmitted.
S104, based on a transmission rule determined according to the number of nodes in the multi-hop self-organizing network, determining whether data to be transmitted need to be transmitted in the multi-hop self-organizing network or not according to a first proposal, and transmitting the data to be transmitted when the data to be transmitted need to be transmitted.
The transmission rule can be manually determined according to the number of the nodes in the multi-hop self-organizing network, or automatically determined by the nodes according to the number of the nodes in the multi-hop self-organizing network.
Specifically, determining a transmission rule according to the number of nodes in the multihop ad hoc network includes: periodically counting the number of nodes in the current network by a preselected central node in the multi-hop self-organizing network, determining a transmission rule according to the counting result and the size relation of a third threshold value, and issuing the transmission rule to other nodes in the multi-hop self-organizing network.
The following steps C1-C6 are a method for counting the number of nodes in the current network, which is provided by the invention:
specifically, periodically counting the number of nodes in the current network by the preselected central node in the multihop self-organizing network includes:
and C1, pre-setting a central node in the multi-hop self-organizing network.
And step C2, each node submits a unique identifier and own state information to the central node when the network is initialized. And the central node counts the initial total number of the nodes according to the node identifiers in the registration information of the nodes, and stores the state information of each node. The status information includes online and offline.
And C3, each node periodically transmits a heartbeat signal to the central node, which indicates that the central node is still online. The heartbeat signal contains a unique identifier of the node and current state information.
Step C4, after the central node receives the heartbeat signal, updating the state information of the corresponding node, and marking the state information as online; if a heartbeat signal of a node is not received for a long time, it is marked as leaving.
Step C5, when new nodes join the network, they need to submit relevant information to the central node, while if nodes when they leave the network, they may need to send an offline signal to the central node, or be considered to have left if no heartbeat signal has been sent for a long time.
And C6, dynamically counting the total number of the current nodes of the network by the central node according to the current state information of the nodes.
The following steps D1-D3 are further detailed descriptions of the data transmission process when the node low density rule is adopted in the present invention:
Specifically, based on a transmission rule determined according to the number of nodes in the multi-hop ad hoc network, determining whether to transmit data to be transmitted in the multi-hop ad hoc network is required or not according to a first proposal, and transmitting the data to be transmitted when the data to be transmitted is required, including:
If the transmission rule determined according to the number of nodes in the multi-hop ad hoc network indicates that the node low-density rule is adopted, aiming at any first neighbor node in all neighbor nodes:
And D1, determining whether to agree to transmit the data to be transmitted according to the content of the first proposal, if so, recording the accumulated times of receiving the first proposal, and comparing the accumulated times with a first threshold value.
And D2, if the accumulated times are smaller than a first threshold value, determining whether a first proposal exists in the previously stored historical proposals, if not, determining whether data to be transmitted corresponding to the first proposal exists in the previously stored historical data, and if not, transmitting the first proposal to a neighbor node of the first neighbor node.
And D3, if the accumulated times are greater than or equal to a first threshold value, determining whether the data to be transmitted corresponding to the first proposal exists in the previously stored historical data, and if not, adopting a flooding mechanism to transmit the data to be transmitted in the multi-hop self-organizing network.
The history proposal comprises a proposal created according to the detected data and a proposal sent by other received nodes. The historical data comprises data for initiating the whole network transmission and received data for initiating the whole network transmission by other nodes.
The following steps E1 and E2 are further detailed descriptions of the data transmission process when the node low density rule is adopted in the present invention:
Specifically, based on a transmission rule determined according to the number of nodes in the multi-hop ad hoc network, determining whether to transmit data to be transmitted in the multi-hop ad hoc network is required or not according to a first proposal, and transmitting the data to be transmitted when the data to be transmitted is required, including:
E1, if a transmission rule determined according to the number of nodes in the multi-hop self-organizing network indicates that a node high-density rule is adopted, each neighbor node judges whether to agree to transmit data to be transmitted according to the content of a first proposal or not respectively, and transmits a response signal to the first node according to a judgment result;
And E2, if the first node counts that the number of signals which agree to transmit the data to be transmitted in the received response signals is larger than a second threshold value, transmitting the data to be transmitted in the multi-hop self-organizing network by adopting a flooding mechanism.
Further, the first threshold and/or the second threshold may be determined according to the number of neighboring nodes corresponding to the node. Specifically, each node determines a first threshold according to the value of the local neighbor node counter, for example, the value of the local neighbor node counter is K, and the first threshold may be set asThe second threshold may be set to/>。
The node low density rule is a passive screening mechanism when the node is low density, referring to fig. 4, the node F sends the proposal P to the neighbor node, and the neighbor node compares the proposal received this time with the proposal Pn (n=1, 2, …, N) received before, and counts the number of proposals meeting the condition. The node high density rule is an active query mechanism when the node is high density, see fig. 5, and the node F sends a proposal (request) to the neighbor node, and the neighbor node responds (reply) based on the received signal. The two content perception evaluation mechanisms selectively judge the data when a large amount of data exists, so that the transmitted data can be ensured to be higher in quality and more effective, and the accuracy of data transmission is improved; in addition, the probability of network breakdown caused by excessive information is reduced under the action of the two, and the data transmission effectiveness is improved.
According to the transmission method of the multi-hop self-organizing network data, each node discovers the corresponding neighbor node through an ND improvement method based on SIC and MPR; constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node; a first node in the multi-hop self-organizing network, which detects data to be transmitted for the first time, creates a first proposal according to the type of the data to be transmitted, and sends the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted; based on the transmission determined according to the number of nodes in the multi-hop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node determine whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal, and the data to be transmitted is transmitted when the data to be transmitted need to be transmitted, so that the accuracy and the effectiveness of the data transmission in the multi-hop ad hoc network can be improved.
The invention also provides a multi-hop self-organizing network system, which comprises: a plurality of nodes.
Each node is used for discovering each corresponding neighbor node through an ND improvement method based on SIC and MPR, and constructing a multi-hop self-organizing network based on the discovered neighbor nodes.
The method comprises the steps that a first node for detecting data to be transmitted for the first time in a plurality of nodes is used for creating a first proposal according to the type of the data to be transmitted and sending the first proposal to a neighbor node of the first node, and the proposal comprises attribute information of the data to be transmitted.
Based on the transmission determined according to the number of nodes in the multi-hop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node are used for determining whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal, and transmitting the data to be transmitted when the data to be transmitted need to be transmitted.
The invention also provides a structural schematic diagram of the electronic equipment, which comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus,
A memory for storing a computer program;
And the processor is used for realizing the steps provided in the method embodiment when executing the program stored in the memory.
The communication interface is used for communication between the electronic device and other devices.
The method provided by the embodiment of the invention can be applied to electronic equipment. Specifically, the electronic device may be: desktop computers, portable computers, intelligent mobile terminals, servers, etc. Any electronic device capable of implementing the present invention is not limited herein, and falls within the scope of the present invention.
The present invention also provides a computer readable storage medium having a computer program stored therein, which when executed by a processor implements the steps provided in the above-described method embodiments.
For the apparatus/electronic device/storage medium embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and details, advantages, and the like may be found in part in the description of the method embodiments.
The terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (10)
1. A method for transmitting data in a multihop ad hoc network, comprising:
Each node discovers a corresponding neighbor node through an ND improvement method based on SIC and MPR;
constructing a multi-hop self-organizing network according to each node and the neighbor nodes corresponding to each node;
A first node which detects data to be transmitted for the first time in the multi-hop self-organizing network creates a first proposal according to the type of the data to be transmitted, and sends the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted;
Based on a transmission rule determined according to the number of nodes in the multi-hop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node determine whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal, and transmit the data to be transmitted when the data to be transmitted need to be transmitted.
2. The method according to claim 1, wherein the determining whether the data to be transmitted needs to be transmitted in the multihop ad hoc network according to the first proposal based on the transmission rule determined according to the number of nodes in the multihop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node, and transmitting the data to be transmitted when the data to be transmitted needs to be transmitted, comprises:
if the transmission rule determined according to the number of nodes in the multi-hop ad hoc network indicates that a node low density rule is adopted,
For any first neighbor node of the neighbor nodes:
Determining whether to agree to transmit the data to be transmitted according to the content of the first proposal, if agree, recording the accumulated times of receiving the first proposal, and comparing the accumulated times with a first threshold;
if the accumulated times are smaller than a first threshold value, determining whether the first proposal exists in the previously stored historical proposal, if not, determining whether data to be transmitted corresponding to the first proposal exists in the previously stored historical data, and if not, transmitting the first proposal to a neighbor node of the first neighbor node;
If the accumulated times are greater than or equal to the first threshold, determining whether the data to be transmitted corresponding to the first proposal exists in the previously stored historical data, and if not, adopting a flooding mechanism to transmit the data to be transmitted in the multi-hop self-organizing network.
3. The method according to claim 1 or 2, wherein the determining whether the data to be transmitted needs to be transmitted in the multihop ad hoc network according to the first proposal based on the transmission rule determined according to the number of nodes in the multihop ad hoc network, the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node, and transmitting the data to be transmitted when the data to be transmitted needs to be transmitted, comprises:
If the transmission rule determined according to the number of nodes in the multi-hop ad hoc network indicates that a node high density rule is adopted,
Each neighbor node judges whether to agree to transmit the data to be transmitted according to the content of the first proposal, and transmits a response signal to the first node according to a judgment result;
And if the first node counts that the number of signals which agree to transmit the data to be transmitted in the received response signals is larger than a second threshold value, transmitting the data to be transmitted in the multi-hop self-organizing network by adopting a flooding mechanism.
4. A method according to claim 3, wherein the respective nodes discover respective corresponding neighbor nodes by means of SIC and MPR based ND improvement methods, comprising:
for any second node of the respective nodes:
The second node judges the signals sent by a plurality of nodes based on a randomly selected modulation mode in a minimum time slot, eliminates the signals sent by the discovered neighbor nodes to obtain residual signals, adopts an ND method based on MPR to unpack the residual signals, and adopts an ND method based on SIC to unpack the signals with data collision when the data collision exists, so as to finish unpacking;
The second node determines whether the node corresponding to each residual signal becomes a neighbor node according to the unpacking result corresponding to each residual signal in the next minimum time slot, generates a response signal according to the determining result and sends the response signal to the node corresponding to each residual signal;
The nodes corresponding to the residual signals respectively establish a relation with the second node based on the received response signals;
And the second node updates the value of the local neighbor node counter according to the current corresponding neighbor node condition.
5. The method of claim 4, wherein the historical proposal comprises a proposal created from the detected data, a proposal sent by the other node received;
The historical data comprises data for initiating the whole network transmission and received data for initiating the whole network transmission by other nodes.
6. The method of claim 5, wherein the attribute information of the data to be transmitted comprises: summarizing information corresponding to the data to be transmitted, creating time of the data to be transmitted and type of the data to be transmitted.
7. The method of claim 6, wherein determining a transmission rule based on the number of nodes in the multihop ad hoc network comprises:
periodically counting the number of nodes in the current network by the preselected central node in the multi-hop self-organizing network, determining a transmission rule according to the counting result and the magnitude relation of a third threshold value, and transmitting the transmission rule to other nodes in the multi-hop self-organizing network.
8. A multi-hop ad hoc network system, comprising:
A plurality of nodes;
each node is used for discovering a corresponding neighbor node through an ND improvement method based on SIC and MPR, and constructing a multi-hop self-organizing network based on the discovered neighbor node;
a first node for detecting data to be transmitted for the first time in the plurality of nodes is used for creating a first proposal according to the type of the data to be transmitted and sending the first proposal to a neighbor node of the first node, wherein the proposal comprises attribute information of the data to be transmitted;
the neighbor node of the first node or the neighbor nodes of the first node and the neighbor nodes of the first node are used for determining whether the data to be transmitted need to be transmitted in the multi-hop ad hoc network according to the first proposal based on the transmission determined according to the number of nodes in the multi-hop ad hoc network, and transmitting the data to be transmitted when the data to be transmitted need to be transmitted.
9. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;
a memory for storing a computer program;
A processor for implementing the method of any of claims 1-7 when executing a program stored on a memory.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a computer program which, when executed by a processor, implements the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410495888.4A CN118102413B (en) | 2024-04-24 | 2024-04-24 | Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410495888.4A CN118102413B (en) | 2024-04-24 | 2024-04-24 | Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118102413A true CN118102413A (en) | 2024-05-28 |
| CN118102413B CN118102413B (en) | 2024-07-09 |
Family
ID=91165557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410495888.4A Active CN118102413B (en) | 2024-04-24 | 2024-04-24 | Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118102413B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262448A (en) * | 2008-04-21 | 2008-09-10 | 神州亿品科技有限公司 | IP data packet transmission method and system |
| US7957355B1 (en) * | 2005-05-27 | 2011-06-07 | Heiferling Mark J | Swarm autonomous routing algorithm for mobile ad hoc network communications |
| US20110205961A1 (en) * | 2010-02-19 | 2011-08-25 | Bbn Technologies Corp. | Carrier sense multiple access (csma) protocol with multi-packet reception (mpr) in a wireless ad hoc network |
| CN104080112A (en) * | 2014-07-17 | 2014-10-01 | 重庆邮电大学 | Method for improving service reliability of wireless self-organizing network |
| CN104349418A (en) * | 2014-11-04 | 2015-02-11 | 广东石油化工学院 | Rapid routing transmission method for data in wireless sensor network facing sudden events |
| CN104735743A (en) * | 2015-03-18 | 2015-06-24 | 无锡士康通讯技术有限公司 | Routing optimization method for embedded wireless self-organized network |
| CN107182103A (en) * | 2017-04-27 | 2017-09-19 | 浙江工商大学 | Cooperation broadcasting method based on neighbours' broadcast coefficient in mobile ad-hoc network |
| CN107197495A (en) * | 2017-01-17 | 2017-09-22 | 燕山大学 | A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM) |
| CN112969210A (en) * | 2021-02-04 | 2021-06-15 | 中国运载火箭技术研究院 | Aircraft cooperative networking network layer routing protocol processing device and implementation method |
| CN114422444A (en) * | 2022-01-26 | 2022-04-29 | 华北电力大学 | Network congestion control method and system for power transmission line unmanned aerial vehicle routing inspection |
-
2024
- 2024-04-24 CN CN202410495888.4A patent/CN118102413B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7957355B1 (en) * | 2005-05-27 | 2011-06-07 | Heiferling Mark J | Swarm autonomous routing algorithm for mobile ad hoc network communications |
| CN101262448A (en) * | 2008-04-21 | 2008-09-10 | 神州亿品科技有限公司 | IP data packet transmission method and system |
| US20110205961A1 (en) * | 2010-02-19 | 2011-08-25 | Bbn Technologies Corp. | Carrier sense multiple access (csma) protocol with multi-packet reception (mpr) in a wireless ad hoc network |
| CN104080112A (en) * | 2014-07-17 | 2014-10-01 | 重庆邮电大学 | Method for improving service reliability of wireless self-organizing network |
| CN104349418A (en) * | 2014-11-04 | 2015-02-11 | 广东石油化工学院 | Rapid routing transmission method for data in wireless sensor network facing sudden events |
| CN104735743A (en) * | 2015-03-18 | 2015-06-24 | 无锡士康通讯技术有限公司 | Routing optimization method for embedded wireless self-organized network |
| CN107197495A (en) * | 2017-01-17 | 2017-09-22 | 燕山大学 | A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM) |
| CN107182103A (en) * | 2017-04-27 | 2017-09-19 | 浙江工商大学 | Cooperation broadcasting method based on neighbours' broadcast coefficient in mobile ad-hoc network |
| CN112969210A (en) * | 2021-02-04 | 2021-06-15 | 中国运载火箭技术研究院 | Aircraft cooperative networking network layer routing protocol processing device and implementation method |
| CN114422444A (en) * | 2022-01-26 | 2022-04-29 | 华北电力大学 | Network congestion control method and system for power transmission line unmanned aerial vehicle routing inspection |
Non-Patent Citations (5)
| Title |
|---|
| SID AHMED HICHAME BELKHIRA; SOFIANE BOUKLI-HACENE; PASCAL LORENZ; MOHAMED BELKHEIR; MARC GILG; ABDELHALIM ZE: "A new mechanism for MPR selection in mobile ad hoc and sensor wireless networks", IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 11 June 2020 (2020-06-11) * |
| ZHIQING WEI; YUEYUE LIANG; ZEYANG MENG; ZHIYONG FENG; KAIFENG HAN; HUICI WU: "Fast Neighbor Discovery for Wireless Ad Hoc Network With Successive Interference Cancellation", IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 30 August 2023 (2023-08-30) * |
| 任鹏: "于跨层设计的煤矿井下无线传感器网络路由协议研究", 信息科技辑, 15 March 2017 (2017-03-15) * |
| 冯志刚: "无人机自组织网络高效并发通信干扰管理机制研究", 信息科技辑, 31 December 2022 (2022-12-31) * |
| 杨共燕;邝育军;隆克平;: "一种支持高速移动自组织网络的路由协议", 电子技术应用, no. 05, 6 May 2010 (2010-05-06) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118102413B (en) | 2024-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Baccelli et al. | An Aloha protocol for multihop mobile wireless networks | |
| EP3140975B1 (en) | Distributed voting mechanism for attack detection | |
| Pai H et al. | Delay‐Driven Opportunistic Routing with Multichannel Cooperative Neighbor Discovery for Industry 4.0 Wireless Networks Based on Power and Load Awareness | |
| EP1704687A1 (en) | Cost determination in a multihop network | |
| Zhang et al. | A security aware fuzzy enhanced reliable ant colony optimization routing in vehicular ad hoc networks | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| Singhal et al. | Cluster head selection protocol under node degree, competence level and goodness factor for mobile ad hoc network using AI technique | |
| CN118102413B (en) | Method, system, equipment and storage medium for transmitting multi-hop self-organizing network data | |
| Fonseca et al. | Beacon vector routing: Scalable point-to-point in wireless sensornets | |
| Bhattacharya et al. | Secure multipath routing for multimedia communication in cognitive radio networks | |
| Sharma et al. | Broadcasting methods in mobile ad-hoc networks | |
| Zhang et al. | On reducing broadcast expenses in ad hoc route discovery | |
| Abbas et al. | Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery | |
| Cicioğlu et al. | An effective routing algorithm for spectrum allocations in cognitive radio based internet of things | |
| Kausar Fatima et al. | An analysis on cooperative attacks in manets | |
| Sousa et al. | Ant colony optimization with fuzzy heuristic information designed for cooperative wireless sensor networks | |
| Sonekar et al. | A loom for revealing selfish and malicious node in cluster based Adhoc wireless networks | |
| Singh et al. | Routing Misbehabiour In Mobile Ad Hoc Network | |
| Pai et al. | Research Article Delay-Driven Opportunistic Routing with Multichannel Cooperative Neighbor Discovery for Industry 4.0 Wireless Networks Based on Power and Load Awareness | |
| Aparna et al. | A New Adaptive Broadcast Scheduling Algorithm in MANETs Using Good Neighbor Node Detection Approach | |
| Ramesh et al. | Secured Preemptive DSR (S-PDSR): An integration of SRP and SMT with Preemptive DSR for Secured Route Discovery | |
| Jain et al. | A Novel Approach of Routing Protocol using Hybrid Analysis for MANETs | |
| Prozorov et al. | A Simple Model of MESH Routing Protocols | |
| Doshi et al. | A NOVEL APPROACH AGAINST BLACKHOLE ATTACK IN AODV PROTOCOL FOR WIRELESS NETWORKS | |
| Cao et al. | Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |