CN105657774B - Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network - Google Patents
Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network Download PDFInfo
- Publication number
- CN105657774B CN105657774B CN201610174116.6A CN201610174116A CN105657774B CN 105657774 B CN105657774 B CN 105657774B CN 201610174116 A CN201610174116 A CN 201610174116A CN 105657774 B CN105657774 B CN 105657774B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- broadcast message
- network
- information
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/20—Selecting an access point
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a method and a system for establishing a self-adaptive core forwarding network in a wireless self-organizing network. The system for establishing the self-adaptive core forwarding network in the wireless self-organizing network comprises an antenna, a radio transceiver, a self-organizing network controller and an upper computer, wherein the antenna is in bidirectional communication connection with the radio transceiver, the radio transceiver is in bidirectional communication connection with the self-organizing network controller, and the self-organizing network controller is in bidirectional communication connection with the upper computer. It is proposed to implement the complete physical layer, media control layer and network layer protocols in the DSP. The whole hardware and network protocol can be packaged in the independent self-organizing network controller by using the flexibility of DSP to digital signal processing, and the end user can directly apply and develop without considering the specific networking process only by connecting the controller to an upper computer. Thereby achieving the purpose of reducing the occurrence of network storm.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and a system for establishing an adaptive core forwarding network in a wireless ad hoc network.
Background
Wireless ad hoc networks are a non-centralized, fully distributed network. Unlike conventional networks with master-slave structures, nodes in a wireless ad hoc network have no mutual dependency relationship, and any node has the capability of receiving information and can also forward the received information. If the two communication nodes are not in the direct wireless communication distance of the point-to-point, the message can start from the source node, be forwarded for a plurality of times through the intermediate node and finally reach the destination node. The use of this communication scheme can eliminate the reliance on base station nodes in conventional networks to achieve the goal of fully distributed deployment. However, the basis of the multi-hop operation mode is that intermediate nodes on the path from the source node to the destination node already have corresponding routing tables, i.e. each node knows to forward the message to a neighboring node of a certain characteristic, through which the message can arrive correctly at the destination. Since there is no fixed central management unit in the wireless multi-hop network, each node does not have such a routing table at the time of network initialization. The wireless multi-hop network requires a corresponding routing protocol to complete the establishment of the routing table.
Since no central management unit is present in a wireless multi-hop network, a broadcast approach is typically used for interrogation when one node needs to establish a multi-hop path in the network to another node. Other nodes in the network forward the routing query continuously until the query is received by the destination node. After the destination node responds correspondingly, other nodes on the path from the source node to the destination node can establish correct route information, and the source node starts to send data. The use of broadcast messages plays an important role in route setup, or in querying other nodes, and can help nodes in a centreless network to get the desired information in the best effort. However, if the number of nodes in the network is excessive and each node participates in the process of forwarding the broadcast, the broadcast efficiency becomes very low, and normal data communication is also affected. It is noted that an important feature of wireless communication, unlike wired communication, is that when a node transmits information, nodes within direct communication distance of the node can receive the content of the communication. Fig. 1 schematically illustrates the reception and forwarding of broadcast information by various nodes in a wireless multi-hop network.
In fig. 1, nodes that can be connected by arrows are shown within direct communication distance of each other. The corresponding nodes on the two adjacent real lines are within the maximum direct communication distance, and similarly, the corresponding nodes on the two adjacent broken lines are also within the maximum direct communication distance. Nodes at corresponding positions on the adjacent solid line and broken line are within the communication distance between both parties (assumed to be equivalent to half the maximum communication distance). Without appropriate optimization measures, all nodes participate in the broadcast. For example, the first broadcast starts at node 1 and the broadcast is forwarded after the reception of nodes 2,3,4, which are received by nodes 1, 11, 7, 12, 8, 13. The nodes 11, 7, 12, 8, 13 perform broadcast forwarding again, and all the nodes except the node 1 in the figure receive the broadcast forwarding.
All nodes participate in the broadcast, and although it can be ensured that all nodes receive the information, network storms can occur.
Disclosure of Invention
The invention aims to provide a method and a system for establishing an adaptive core forwarding network in a wireless self-organizing network so as to realize the advantage of reducing the occurrence of network storm.
In order to achieve the above purpose, the invention adopts the following technical scheme:
a method for establishing a self-adaptive core forwarding network in a wireless self-organizing network comprises the following steps:
step 1: in a wireless self-organizing network, X nodes in the wireless self-organizing network periodically and actively initiate whole network broadcasting, wherein X nodes are called initiating nodes for short, the broadcasting message comprises two parts of information, one part is the information of the initiator of the broadcasting message, namely the information of the initiating node, and the other part is the address of the neighbor node which is detected by the node which forwards the broadcasting message in the latest time;
step 2: after receiving the broadcast information, one node of the wireless self-organizing network except the initiating node determines the shortest distance between the current node and the initiating node according to the number of times the broadcast information has been transmitted, and then the neighbor information of the current node is put into a neighbor node address field in the broadcast information;
step 3: analyzing the addresses of the neighbor nodes in the broadcast message, specifically: comparing the neighbor node information with the received forwarder of the broadcast message and the neighbor information of the forwarder, for example, if all neighbors of the current node can be covered by part of neighbor nodes through one-time wireless communication, the current node can judge that the current node does not need to participate in forwarding the broadcast message on the premise of not influencing the whole network broadcast, for example, the current node can not ensure that the broadcast message can reach all neighbor nodes of the current node through some neighbor nodes of the current node, and the current node sets the current node as a core forwarding node to ensure the accessibility of the message;
step 4: and (3) according to the steps from the step 1 to the step 3, setting each node in the wireless self-organizing network is completed after the whole network broadcast is carried out for a plurality of times, so that the establishment of the self-adapting core forwarding network is realized.
Preferably, after the analysis of the address of the neighboring node in the broadcast message in the step 3 is finished, if the current node needs to forward the broadcast message, the current node needs to:
retaining the information of an initiator of the broadcast message;
and updating the address of the sending node of other messages detected by the current node in the latest period into the broadcast message, so as to cover the neighbor information of the former forwarder originally carried in the broadcast message, and forwarding the message.
Preferably, the method comprises the steps of,
the neighbor information of each node in the wireless ad hoc network is established by recording the forwarder address of the received broadcast message.
Preferably, the data packet format adopted by the broadcast message includes:
initiator address: 2 bytes, representing an address of an originator of the broadcast message;
sender address: 2 bytes, representing the address of the broadcast message forwarder;
destination address: 2 bytes, representing the destination address of the broadcast message;
packet length: 2 bytes, representing the total length of the data packet;
packet type: 1 byte, representing the packet type;
sender type: 1 byte, representing a broadcast message forwarder type;
hop count: 1 byte, which indicates the number of times the packet has been forwarded;
sequence number: 2 bytes, representing the ID of the data packet;
number of sender neighbor nodes: 2 bytes, representing how many message forwarders' neighbors are contained in the current broadcast message.
Preferably, the forwarder type includes a normal forwarder, a core forwarder, a temporary core forwarder and a non-forwarder.
Preferably, the sequence number is incrementally present in the broadcast message sent from the originating node in order for the broadcast message receiver to determine the broadcast message's uniqueness and prevent duplicate processing after duplicate reception.
Preferably, after the establishment of the adaptive core forwarding network is completed, the step of performing core node judgment after the node receives the broadcast message includes:
step 701, recording address information and hop count of a sender of a broadcast message, and the type of the sender, so as to perfect neighbor information of a current node;
step 702, if the current packet type is that the core forwarding network is requested to be updated, or the forwarder of the broadcast message does not exist in the neighbor information of the current node before, entering a core forwarding node judging process, otherwise, if the current node is not a forwarder, ending; if the current node is a forwarder, preparing to forward the broadcast information;
step 703, storing the neighbor information of the current node in a neighbor node list, and if the distance from the node in the neighbor node list to the broadcast information initiator is not greater than the distance from the current node to the broadcast information initiator, not considering the nodes in the neighbor node list;
step 704, judging whether the distance from the node in the neighbor node list to the broadcast information initiator is larger than the distance from the current node to the broadcast information initiator, if not, the current node is not used as a core forwarding node, and if so, entering the next step;
step 705, the node in the neighbor node list having a distance greater than the distance of the current node to the broadcast information initiator is called a remaining neighbor node, if the neighbor node of each remaining neighbor node is also a neighbor of the current node and the neighbor is marked as a core forwarding node, the remaining neighbor node can receive the broadcast message through the core forwarding node, the current node does not need to consider the remaining neighbor node any more, and the current node is set as a non-forwarding node;
step 706, if there are other neighbor nodes that do not meet the requirement of step 705, checking whether the distance from the neighbor node to the broadcast initiator will be increased if the neighbor node reaches the other neighbor node that does not meet the requirement through some neighbor node of the current node, if the distance will be increased, the current node must be set as a core forwarding node, if the distance will not be increased, the current node is set as a temporary core forwarding node, waiting for further information;
step 707, if the current node is set as a core forwarding node, or a temporary core forwarding node, checking the initiator information and the message sequence number of the current broadcast message, if the current node is already processed, not processing the current broadcast message, waiting for sending the current broadcast update, and if the current node is not processed, replacing the information in the broadcast message with the current node information and the current node neighbor information, and forwarding the current broadcast message.
The technical scheme of the invention also discloses a system for establishing the self-adaptive core forwarding network in the wireless self-organizing network, which comprises an antenna, a radio transceiver, a self-organizing network controller and an upper computer, wherein the antenna is in bidirectional communication connection with the radio transceiver, the radio transceiver is in bidirectional communication connection with the self-organizing network controller, and the self-organizing network controller is in bidirectional communication connection with the upper computer.
Preferably, the radio transceiver comprises a radio frequency receiving circuit, an analog-to-digital conversion circuit, a digital-to-analog conversion circuit and a radio frequency transmitting circuit, wherein the self-organizing network controller adopts a DSP chip circuit, the output end of the radio frequency receiving circuit is connected with the input end of the analog-to-digital conversion circuit, the output end of the analog-to-digital conversion circuit is connected with the input end of the DSP chip circuit, the output end of the DSP chip circuit is connected with the input end of the digital-to-analog conversion circuit, and the output end of the digital-to-analog conversion circuit is connected with the input end of the radio frequency transmitting circuit.
The technical scheme of the invention has the following beneficial effects:
according to the technical scheme, the node in the wireless self-organizing network is judged by itself, so that the non-core node stops executing the forwarding function, and the information can be ensured to be received by all nodes in the network as long as the information is forwarded in the core forwarding network. Thereby achieving the purpose of reducing the occurrence of network storm. The technical proposal of the invention proposes to realize the complete physical layer, media control layer and network layer protocol in the DSP. The whole hardware and network protocol can be packaged in the independent self-organizing network controller by using the flexibility of DSP to digital signal processing, and the end user can directly apply and develop without considering the specific networking process only by connecting the controller to an upper computer. While the DSP may be configured to accommodate a variety of radio modulation modes, such as FSK, ASK, etc. After the wireless signal enters the self-organizing network controller, the processes of demodulation, channel decoding, frame content analysis, network protocol stack execution and the like are completed in the controller. Thus, the establishment of the core forwarding network in the wireless self-organizing network is simply completed.
The technical scheme of the invention is further described in detail through the drawings and the embodiments.
Drawings
Fig. 1 is a schematic block diagram of a broadcast and forwarding architecture in a conventional wireless multi-hop network;
fig. 2 is a schematic block diagram of a wireless multi-hop network constructed by adopting the technical scheme of the invention;
fig. 3 is a schematic structural diagram of a wireless multi-hop network after a first round of broadcasting in the technical scheme of the present invention;
fig. 4 is a flowchart of a core forwarding node decision according to an embodiment of the present invention;
fig. 5 is a functional block diagram of a system for establishing an adaptive core forwarding network in a wireless ad hoc network;
fig. 6 is a functional block diagram of a decision algorithm and associated network protocol for implementing a core forwarding network node in a programmable DSP module.
Detailed Description
The preferred embodiments of the present invention will be described below with reference to the accompanying drawings, it being understood that the preferred embodiments described herein are for illustration and explanation of the present invention only, and are not intended to limit the present invention.
The technical scheme of the invention has the basic idea that: if some specific nodes are selected from the network and only the nodes are required to participate in the broadcasting process, all the nodes are not required to forward the broadcasting, and the whole network broadcasting purpose can be achieved.
A simplified whole network broadcast architecture as shown in fig. 2. The gray nodes 7, 8, 16, 17 will not participate in the broadcast forwarding process. Because the gray nodes are in the effective coverage of other nodes still broadcasting, the gray nodes can still receive the information through the broadcasting and forwarding of other nodes in the network, and meanwhile, the opportunity of network storm is greatly reduced because the gray nodes stop executing the forwarding function. The network formed by the connection of other nodes can be called a core forwarding network. The network information can ensure that all nodes in the network receive the message as long as the network information is forwarded in the core forwarding network. If the gray node needs to communicate with other nodes, the routing request can be delivered to the nearest member node of the core forwarding network, and the core forwarding network is utilized to transmit the request to the destination node, so that a corresponding routing table entry is established.
The establishment of the core forwarding network requires a certain interaction process between nodes. In order to update topology information of a network, periodic information is broadcast in the network, and each node makes a judgment by analyzing the received information. When the received information is more complete, the judgment is more accurate, and the establishment of the core forwarding network can be performed. The establishment of the core forwarding network is based on a principle: all the neighbor nodes of the node which does not participate in the broadcast forwarding can acquire the broadcast information through a certain neighbor node of the node which does not participate in the broadcast forwarding. If a node can judge that one or several neighbor nodes exist in own neighbor nodes, so that all other neighbor nodes, including the node itself, can receive the broadcast information, the node does not need to participate in the broadcast forwarding process.
The technical scheme adopted by the invention is as follows:
the method for establishing the self-adaptive core forwarding network in the wireless self-organizing network comprises the following steps:
step 1: in a wireless self-organizing network, X nodes in the wireless self-organizing network periodically and actively initiate whole network broadcasting, wherein X nodes are called initiating nodes for short, the broadcasting message comprises two parts of information, one part is the information of the initiator of the broadcasting message, namely the information of the initiating node, and the other part is the address of the neighbor node which is detected by the node which forwards the broadcasting message in the latest time;
step 2: after receiving the broadcast information, one node of the wireless self-organizing network except the initiating node determines the shortest distance between the current node and the initiating node according to the number of times the broadcast information has been transmitted, and then the neighbor information of the current node is put into a neighbor node address field in the broadcast information;
step 3: analyzing the addresses of the neighbor nodes in the broadcast message, specifically: comparing the neighbor node information with the received forwarder of the broadcast message and the neighbor information of the forwarder, for example, if all neighbors of the current node can be covered by part (one or more) of the neighbor nodes through one-time wireless communication, the current node can judge that the current node does not need to participate in forwarding the broadcast message on the premise of not influencing the whole network broadcast, for example, the current node can not ensure that the broadcast message can reach all the neighbor nodes of the current node through some neighbor nodes of the current node, and the current node sets the current node as a core forwarding node;
step 4: and (3) according to the steps from the step 1 to the step 3, setting each node in the wireless self-organizing network is completed after the whole network broadcast is carried out for a plurality of times, so that the establishment of the self-adapting core forwarding network is realized.
Specifically, in a wireless ad hoc network, one or a limited number of nodes are used to periodically and actively initiate a whole network broadcast. The broadcast message contains two parts of information, one part is the information of the initiator of the broadcast message, and the other part is the neighbor information which is detected in the latest time by the node which transmits the broadcast message. When a node receives the broadcast information, firstly, the initiator of the broadcast information is recorded and analyzed, and the shortest distance between the current node and the initiator of the information is determined according to the number of times the information has been transmitted. The sender (forwarder) of the message is then put into the message for analysis of the addresses of the neighboring nodes. The analysis process also requires a comparison of the neighbor information of the current node. If all neighbors of the current node can be covered by one or more neighbor nodes, the current node judges that the current node does not need to forward the broadcast message. If one or more neighboring nodes cannot ensure that the broadcast message can reach via other neighboring nodes, the current node sets itself as a core forwarding node. After the analysis is finished, if the broadcast message needs to be forwarded, the current node needs to 1) reserve the information of the initiator of the broadcast message, 2) update the neighbor information detected by the current node in the last period of time into the broadcast message, cover the related content of the previous sender originally carried by the message, and then forward. The neighbor information of each node can be obtained by recording the received neighbor information an address of an originator (forwarder) of the broadcast message.
The data packet format adopted in the scheme is shown in table 1:
table 1, packet format table.
Initiator address: 2 bytes indicating an address of an originator of the broadcast message;
sender address: 2 bytes indicating the address of the sender or forwarder of the broadcast message;
destination address: 2 bytes, representing the destination address of the message, typically 0xfff, representing that this is a broadcast message;
packet length: 2 bytes, representing the total length of the data packet;
packet type: 1 byte, representing the packet type;
sender type: 1 byte, representing the sender or type of forwarder of the broadcast message, including normal forwarder, core forwarder, temporary core forwarder, and non-forwarder;
hop count: 1 byte, which indicates the number of times the packet has been forwarded;
sequence number: 2 bytes, representing the ID of the packet;
number of sender neighbor nodes: 2 bytes, which indicates how many message senders or forwarders' neighbors are contained in the current message.
The process of judging whether a node in the network joins the core forwarding network depends on the content of the neighbor node and the broadcast message, so that the process can be completed after multiple times of whole-network broadcasting. Taking fig. 3 as an example, assume that node 1 is the originator of a broadcast message and starts the first round of full-network broadcast. In this broadcast, since the member nodes of the core forwarding network have not been selected yet, all nodes mark themselves as ordinary forwarders. Meanwhile, because the neighbor list is not established, the information length of the neighbor node in the broadcast message of the node 1 at the beginning is 0, and the address content of the corresponding neighbor node is also empty. Node 1 sets the number of hops in the message content to 1 while setting a sequence number for the current message. The sequence number is present in an incremental manner in all broadcast messages currently and thereafter sent from node 1, in order for the message receiver to determine the message's uniqueness and to prevent duplicate processing after duplicate reception.
In fig. 3, nodes 2,3,4 can directly receive the broadcast message of node 1, so that nodes 2,3,4 establish route entries in their own routing tables, mark the distance to reach node 1 as 1 hop, and simultaneously place node 1 as a neighbor node in the neighbor table. Taking the node 2 as an example, since the node 2 already has the node 1 as a neighboring node, the node 2 puts the information of the node 1 into the broadcast message, adds 1 to the hop count in the message content, and then forwards and broadcasts the message.
The broadcast message forwarded by node 2 will be acquired by node 7 and node 11. By the same process, the node 11 and the node 7 can calculate the distance to the node 1 as 2. Before the node 11 and the node 7 forward broadcast, 1 is added to the hop count in the message content, and the neighbor node information is replaced by 2.
The node 11 will again receive the broadcast message. By comparing the initiator address with the message sequence number, the node 11 determines that the message has been received. So that only the message is analyzed and no forwarding is performed. As a result of the analysis, it can be known that the node 7 is a neighbor of the node 11, the distance from the node 7 to the node 1 is 2, and the node 7 has the same neighbor node 2 as the node 11. The node 11 records the information in the neighbour list and discards the message.
Broadcast forwarding continues until all nodes receive the broadcast message. Meanwhile, because the broadcasting process of the nodes has a sequence, in order to ensure that the information collection of the neighbor nodes is complete, the whole broadcasting process needs to be repeatedly carried out, and the carrying out times are determined by the number of the nodes.
When the neighbor node information collection is complete, each node should establish a neighbor node information table. Taking node 7 and node 12 as examples, tables 2 and 3 show neighbor node information for these two nodes.
Table 2, neighbor node information table of node 7.
Table 3, neighbor node information table of node 12.
The analysis process of the node 7 is as follows:
1. the distance from the neighbor node 2 to the broadcast initiator node 1 is 1, which is smaller than the distance from the node 7 to the node 1, so that the broadcast arrival of the node 2 is taken care of by the node having a shorter distance to the node 1 (in the present case, the node 1), and thus the node 7 does not consider the situation of the node 2
2. The situation of the neighbor node 3 coincides with the situation of the node 2, so the node 7 does not take the situation of the node 3 into account
3. The distance from the neighbor node 11 to the node 1 is 2 and is consistent with the distance from the node 7 to the node 1, so that the broadcast reachability of the node 11 should be taken into account by the node closer to the node 1, and the node 7 does not need to consider the node 11
4. The distance from the neighbor node 16 to node 1 is 3, which is greater than the distance from node 7 to node 1. The neighbors of node 16 are further analyzed, where nodes 20 and 21 are not neighbors of node 7, so the validity of these two nodes is not considered. Node 7 is the current node and is not considered. Nodes 11 and 12 reach node 1 by a distance of 2, as with node 7, and thus temporary node 7 will set itself as a temporary core forwarding node since it is currently uncertain whether nodes 11 and 12 will choose to become members of the core forwarding network. The temporary core forwarder will still forward the broadcast message until further information is obtained.
5. The distance from the neighbor node 12 to the node 1 is 2, which is the same as the distance from the node 7 to the node 1, so that the node 7 does not consider the node 12.
After the current analysis is completed, node 7 may produce the results shown in the following table:
table 4, node 7 preliminary analysis results table.
In the following broadcast message forwarding process, the forwarding type of the node 7 is "temporary core forwarder".
Analysis process of node 12:
1. the distance from the neighbor node 3 to the node 1 is smaller than the distance from the node 12 to the node 1, so that the node 12 does not consider the neighbor node
2. The distance from the neighbor node 7 to the node 1 is equal to the distance from the node 12 to the node 1, so that the node 12 does not consider the neighbor node
3. The distance from the neighbor node 8 to the node 1 is equal to the distance from the node 12 to the node 1, so that the node 12 does not consider the neighbor node
4. The distance from the neighbor node 16 to node 1 is 3, which is greater than the distance from node 12 to node 1. The neighbor nodes of node 16 are further analyzed, wherein node 11 is not a neighbor node of node 12, which is not considered. The distance from node 7 to node 1 is the same as the distance from node 12 to node 1, and it is currently not possible to determine whether node 7 will become a core forwarding network node. Node 12 is a self node and is temporarily disregarded. Node 20 is not a neighbor node to node 12 and is not considered. The distance from node 21 to node 1 is 3, which is greater than the distance from node 12 to node 1, and it should be noted that the distance from node 16 to node 1 is also 3, and if node 16 needs to be forwarded by node 21, its distance will become 4, possibly creating a round-robin route, so node 16 needs to be forwarded by node 12. Thus, node 12 sets itself as the core forwarder.
5. The distance from the neighbor node 21 to the node 1 is 3, which is greater than the distance from the node 12 to the node 1. The neighbors of node 21 are further analyzed, where node 12 is itself, temporarily disregarded. Nodes 16 and 17 are both neighbors of node 12 and reach node 1 by a distance of 3, which is greater than the distance of node 12 to node 1. If node 12 does not become a core forwarding node but is responsible for forwarding by either node 16 or 17, then node 21 will reach node 1 by a distance of 4, resulting in a round robin route, so node 12 will set itself as the core forwarding point.
6. The distance from the neighbor node 17 to the node 1 is 3, which is greater than the distance from the node 12 to the node 1. The neighbors of node 17 are further analyzed, wherein node 12 is its own node, temporarily disregarded. Nodes 22 and 13 are not neighbor nodes of node 12, regardless. The distance from node 8 to node 1 is less than the distance from node 12 to node 1, but it cannot be determined whether node 8 would be the core forwarding point. The distance from node 21 to node 1 is 3, and if node 21 is responsible for forwarding of node 17, the distance from node 17 to node 1 will be 4, resulting in a routing loop, so node 12 will itself be the core forwarding node.
After the analysis is completed, the node 12 is set as the core forwarder. This information will be included in the broadcast information that is then forwarded by node 12.
Up to now, the node 7 has set itself as a temporary core forwarder, and the node 12 has set itself as a core forwarder. After the next whole network broadcast is performed, the node 7 obtains the identity information of the node 12, and judges that the node 12 is responsible for broadcast forwarding, so that the arrival of the broadcast information can be ensured by the neighbor node 16 of the node 7. The node 7 therefore sets itself as a non-forwarder and no longer forwards the broadcast message. Until one of the following two conditions arises:
1. a node initiates a request for broadcasting a whole network, and actively requests to update the composition of the core forwarding network.
2. The node 7 finds that a new node is added to the network, which node does not exist in the original neighbor list of the node.
A flowchart of a node in the network determining whether itself is set as a core forwarding network node is shown in fig. 4.
After a node receives the broadcast message:
1. recording address information, hop count and type of the sender or the forwarder of the broadcast message for perfecting information of neighbor list
2. If the current packet type is a request to update the core forwarding network or the sender of this broadcast message is not previously present in the neighbor list of the current node, a core forwarding node decision process is entered. Otherwise, if the current node is a non-forwarder, ending. If the current node is not a non-forwarder, the broadcast is ready to be forwarded.
3. Entering into process for analyzing broadcast reachability of neighbor node
4. In the neighbor node list, if the distance from a node to the broadcast initiator is less than or equal to the distance from the current node to the broadcast initiator, the neighbor nodes are not considered.
5. Whether there are any remaining nodes. If there are no remaining nodes, the current node need not act as a core forwarding node. If there are remaining nodes, go to the next step.
6. According to the previous judgment, the distance from the rest neighbor nodes to the broadcast initiator is larger than the distance from the current node to the broadcast initiator. If the neighbor node of each remaining neighbor node is also a neighbor of the current node and the neighbor is marked as a core forwarding node, this remaining neighbor node may receive the broadcast message through the core forwarding node. The current node no longer needs to consider the neighbor node. The current node may be set as a non-forwarding node.
7. If there are more neighbor nodes that do not meet the requirement of step 6, it is checked whether the distance that the neighbor node reaches the broadcast initiator is increased if the neighbor node that does not meet the requirement is reached by a certain neighbor node of the current node. If the distance is increased, the current node must be set as a core forwarding node to prevent the cyclic routing. If not, the current node is set as a temporary core forwarding node waiting for further information.
8. If the current node is set as a core forwarding node or a temporary core forwarding node, checking the initiator information and the message sequence number of the current broadcast message, and if the current node is processed, not processing the current broadcast message, and waiting for sending the current broadcast message when updating the next broadcast message so as to avoid repeated processing. If not, the current node information and the current node neighbor information are used for replacing the information in the broadcast message and forwarding. The process ends.
The processing mode of the broadcast message provided by the invention is different from the conventional processing mode in that the node needs to process the content of the broadcast message and make replacement when the content is needed, and the conventional processing mode only needs to modify the hop count information in the content of the data packet and then completely forwards the hop count information. Therefore, the method provided by the invention requires a special processing flow when the network layer processes data. In order to distinguish the processing function of the network layer protocol from the user application layer to facilitate the user's focus on application development, the present invention proposes to implement the complete physical layer, media control layer and network layer protocol in the digital signal processing module (DSP). The whole hardware and network protocol can be packaged in the independent self-organizing network controller by using the flexibility of DSP to digital signal processing, and the end user can directly apply and develop without considering the specific networking process only by connecting the controller to an upper computer. While the DSP may be configured to accommodate a variety of radio modulation modes, such as FSK, ASK, etc. After the wireless signal enters the self-organizing network controller, the processes of demodulation, channel decoding, frame content analysis, network protocol stack execution and the like are completed in the controller. Similarly, after the user data is issued from the upper computer, the ad hoc network controller completes the functions of framing, encoding, modulation and the like according to the destination address of the data, and sends the data packet to the destination. As shown in fig. 5, the connections of the ad hoc network controller, the radio transceiver, and the host computer are shown. As shown in fig. 6, a workflow within an ad hoc network controller is illustrated. As shown in fig. 5, the system for establishing the adaptive core forwarding network in the wireless ad hoc network includes an antenna, a radio transceiver, an ad hoc network controller and an upper computer, where the antenna and the radio transceiver are in bidirectional communication connection, the radio transceiver and the ad hoc network controller are in bidirectional communication connection, and the ad hoc network controller is in bidirectional communication connection with the upper computer.
As shown in fig. 6, the radio transceiver comprises a radio frequency receiving circuit, an analog-to-digital conversion circuit, a digital-to-analog conversion circuit and a radio frequency transmitting circuit, wherein the self-organizing network controller adopts a DSP chip circuit, the output end of the radio frequency receiving circuit is connected with the input end of the analog-to-digital conversion circuit, the output end of the analog-to-digital conversion circuit is connected with the input end of the DSP chip circuit, the output end of the DSP chip circuit is connected with the input end of the digital-to-analog conversion circuit, and the output end of the digital-to-analog conversion circuit is connected with the input end of the radio frequency transmitting circuit.
Finally, it should be noted that: the foregoing description is only a preferred embodiment of the present invention, and the present invention is not limited thereto, but it is to be understood that modifications and equivalents of some of the technical features described in the foregoing embodiments may be made by those skilled in the art, although the present invention has been described in detail with reference to the foregoing embodiments. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (8)
1. The method for establishing the self-adaptive core forwarding network in the wireless self-organizing network is characterized by comprising the following steps:
step 1: in a wireless self-organizing network, X nodes in the wireless self-organizing network periodically and actively initiate whole network broadcasting, wherein X nodes are called initiating nodes for short, the broadcasting message comprises two parts of information, one part is the information of the initiator of the broadcasting message, namely the information of the initiating node, and the other part is the address of the neighbor node which is detected by the node which forwards the broadcasting message in the latest time;
step 2: after receiving the broadcast message, one node of the wireless self-organizing network except the initiating node determines the shortest distance between the current node and the initiating node according to the number of times the broadcast message has been transmitted, and then the neighbor information of the current node is put into the neighbor node address field in the broadcast message;
step 3: analyzing the addresses of the neighbor nodes in the broadcast message, specifically: comparing the neighbor node information with the received forwarder of the broadcast message and the neighbor information of the forwarder, for example, if all neighbors of the current node can be covered by part of neighbor nodes through one-time wireless communication, the current node can judge that the current node does not need to participate in forwarding the broadcast message on the premise of not influencing the whole network broadcast, for example, the current node can not ensure that the broadcast message can reach all neighbor nodes of the current node through some neighbor nodes of the current node, and the current node sets the current node as a core forwarding node to ensure the accessibility of the message;
step 4: according to the steps from the step 1 to the step 3, after multiple times of whole network broadcasting, setting of each node in the wireless self-organizing network is completed, so that establishment of the self-adapting core forwarding network is realized; after the establishment of the self-adaptive core forwarding network is completed, the step of judging the core node after the node receives the broadcast message comprises the following steps:
step 701, recording address information and hop count of a sender of a broadcast message, and the type of the forwarder, so as to perfect neighbor information of a current node;
step 702, if the current packet type is that the core forwarding network is requested to be updated, or the forwarder of the broadcast message does not exist in the neighbor information of the current node before, entering a core forwarding node judging process, otherwise, if the current node is not a forwarder, ending; if the current node is a forwarder, preparing to forward the broadcast information;
step 703, judging whether the distance from the node in the neighbor node list to the broadcast information initiator is larger than the distance from the current node to the broadcast information initiator, if not, the current node is not used as a core forwarding node, and if so, entering the next step;
step 704, the node in the neighbor node list having a distance greater than the distance of the current node from the broadcast information initiator is called a remaining neighbor node, if the neighbor node of each remaining neighbor node is also a neighbor of the current node and the neighbor is marked as a core forwarding node, the remaining neighbor node can receive the broadcast message through the core forwarding node, the current node does not need to consider the remaining neighbor node any more, and the current node is set as a non-forwarding node;
step 705, if there are other neighbor nodes that do not meet the requirement of step 705, checking whether the distance from the neighbor node to the broadcast initiator will be increased if the neighbor node reaches the other neighbor node that does not meet the requirement through some neighbor node of the current node, if the distance will be increased, the current node must be set as a core forwarding node, if the distance will not be increased, the current node is set as a temporary core forwarding node, waiting for further information;
step 706, if the current node is set as a core forwarding node, or a temporary core forwarding node, checking the initiator information and the message sequence number of the current broadcast message, if the current node is processed, not processing the current broadcast message, waiting for sending the next broadcast update, and if the current node is not processed, replacing the information in the broadcast message with the current node information and the current node neighbor information, and forwarding the current broadcast message.
2. The method for establishing an adaptive core forwarding network in a wireless ad hoc network according to claim 1,
after the analysis of the addresses of the neighbor nodes in the broadcast message in the step 3 is finished, if the current node needs to forward the broadcast message, the current node needs to:
retaining the information of an initiator of the broadcast message;
and updating the address of the sending node of other messages detected by the current node in the latest period into the broadcast message, so as to cover the neighbor information of the former forwarder originally carried in the broadcast message, and forwarding the message.
3. The method for establishing an adaptive core forwarding network in a wireless ad hoc network according to claim 1,
the neighbor information of each node in the wireless ad hoc network is established by recording the forwarder address of the received broadcast message.
4. A method for establishing an adaptive core forwarding network in a wireless ad hoc network according to any one of claims 1 or 3, wherein the data packet format adopted by the broadcast message comprises:
initiator address: 2 bytes, representing an address of an originator of the broadcast message;
sender address: 2 bytes, representing the address of the broadcast message forwarder;
destination address: 2 bytes, representing the destination address of the broadcast message;
packet length: 2 bytes, representing the total length of the data packet;
packet type: 1 byte, representing the packet type;
sender type: 1 byte, representing a broadcast message forwarder type;
hop count: 1 byte, which indicates the number of times the packet has been forwarded;
sequence number: 2 bytes, representing the ID of the data packet;
number of sender neighbor nodes: 2 bytes, representing how many message forwarders' neighbors are contained in the current broadcast message.
5. The method of claim 4, wherein the forwarder type comprises a normal forwarder, a core forwarder, a temporary core forwarder, and a non-forwarder.
6. The method for establishing an adaptive core forwarding network in a wireless ad hoc network according to claim 4, wherein the sequence number is incrementally present in the broadcast message sent from the originating node, so as to allow the broadcast message receiver to determine the uniqueness of the broadcast message and prevent duplicate processing after duplicate reception.
7. An adaptive core forwarding network system established according to any one of claims 1-6, comprising an antenna, a radio transceiver, an ad hoc network controller and an upper computer, wherein the antenna is in bidirectional communication connection with the radio transceiver, the radio transceiver is in bidirectional communication connection with the ad hoc network controller, and the ad hoc network controller is in bidirectional communication connection with the upper computer, and wherein the ad hoc network controller is configured to implement the method of any one of claims 1-6.
8. The adaptive core forwarding network system of claim 7, wherein the radio transceiver comprises a radio frequency receiving circuit, an analog-to-digital conversion circuit, a digital-to-analog conversion circuit and a radio frequency transmitting circuit, the self-organizing network controller adopts a DSP chip circuit, an output end of the radio frequency receiving circuit is connected with an input end of the analog-to-digital conversion circuit, an output end of the analog-to-digital conversion circuit is connected with an input end of the DSP chip circuit, an output end of the DSP chip circuit is connected with an input end of the digital-to-analog conversion circuit, and an output end of the digital-to-analog conversion circuit is connected with an input end of the radio frequency transmitting circuit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610174116.6A CN105657774B (en) | 2016-03-24 | 2016-03-24 | Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610174116.6A CN105657774B (en) | 2016-03-24 | 2016-03-24 | Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105657774A CN105657774A (en) | 2016-06-08 |
| CN105657774B true CN105657774B (en) | 2023-06-20 |
Family
ID=56495280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610174116.6A Active CN105657774B (en) | 2016-03-24 | 2016-03-24 | Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105657774B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109121096B (en) * | 2017-06-23 | 2020-09-11 | 华为技术有限公司 | Method and apparatus for determining broadcast nodes in a mesh network |
| EP3541101B1 (en) * | 2018-03-15 | 2020-12-23 | CPAC Systems AB | A method for a wireless communication system |
| CN112738733B (en) * | 2020-12-17 | 2021-12-31 | 湖南智领通信科技有限公司 | Wireless mesh network networking method and device based on physical layer protocol |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105072586A (en) * | 2015-07-20 | 2015-11-18 | 无锡士康通讯技术有限公司 | Management method for forwarding of broadcast message in embedded wireless ad hoc network |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350831B (en) * | 2008-09-10 | 2011-04-06 | 北京航空航天大学 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
| CN101707793B (en) * | 2009-11-13 | 2012-02-15 | 华南理工大学 | Flooding control method of on-demand route maintenance of multi-hop wireless self-organizing network |
| CN201577088U (en) * | 2010-01-22 | 2010-09-08 | 西安烽火电子科技有限责任公司 | Short wave network control terminal |
| CN101951615B (en) * | 2010-08-03 | 2013-01-30 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN205545958U (en) * | 2016-03-24 | 2016-08-31 | 无锡士康通讯技术有限公司 | System that establishs of network is forwardded to self -adaptation core among wireless ad hoc networks |
-
2016
- 2016-03-24 CN CN201610174116.6A patent/CN105657774B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105072586A (en) * | 2015-07-20 | 2015-11-18 | 无锡士康通讯技术有限公司 | Management method for forwarding of broadcast message in embedded wireless ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105657774A (en) | 2016-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2682930C2 (en) | Route selection in wireless networks | |
| TWI249306B (en) | Channel assignment method in mobile ad-hoc networks | |
| WO2016081734A2 (en) | Techniques to support heterogeneous network data path discovery | |
| JP4535380B2 (en) | Data transmission method in wireless sensor network | |
| WO2007067851A2 (en) | Method and system for improving a wireless communication route | |
| MX2008014927A (en) | Systems, methods and apparatus for allocating time slots in an ad hoc wireless communication network. | |
| US20030069988A1 (en) | In-band signaling | |
| US11290942B2 (en) | System and method for independent dominating set (IDS) based routing in mobile AD hoc networks (MANET) | |
| US20100020740A1 (en) | Wireless Communication System, Wireless Communication Device, Wireless Communication Method, and Program | |
| CN109068367B (en) | Wireless token passing method, device, equipment and readable storage medium | |
| CN112534782B (en) | Independent redundant path discovery for bluetooth networks | |
| KR20100004970A (en) | Method for allowing a family-based address in a wireless sensor network, and method for hierarchical routing a path setting using the same | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| CN105657774B (en) | Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| US20060209774A1 (en) | Wireless base station, wireless mobile device, and wireless access network | |
| JP2009260720A (en) | Route control method, communication system and communication apparatus | |
| WO2001097447A2 (en) | Random identity management in scatternets | |
| CN105072586B (en) | To the management method of the forwarding of broadcast message in embedded radio self-organizing network | |
| JP7326230B2 (en) | Communication system, node, communication method and program | |
| CN205545958U (en) | System that establishs of network is forwardded to self -adaptation core among wireless ad hoc networks | |
| KR20090062317A (en) | Method and system for upgrading in multi hop wireless network | |
| CN111193667B (en) | Routing method, leaf node and storage medium of ad hoc network | |
| CN107959985B (en) | Hybrid mesh network construction method, data transmission method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |