CN105657774A - Building method and system for self-adaptive core forwarding network in wireless self-organized network - Google Patents
Building method and system for self-adaptive core forwarding network in wireless self-organized network Download PDFInfo
- Publication number
- CN105657774A CN105657774A CN201610174116.6A CN201610174116A CN105657774A CN 105657774 A CN105657774 A CN 105657774A CN 201610174116 A CN201610174116 A CN 201610174116A CN 105657774 A CN105657774 A CN 105657774A
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- network
- neighbor
- self
- 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
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 building method and system for a self-adaptive core forwarding network in a wireless self-organized network. The building system for the self-adaptive core forwarding network in the wireless self-organized network comprises an antenna, a wireless transceiver, a self-organized network controller and an upper computer; the antenna is in two-way communication with the wireless transceiver, the wireless transceiver is in two-way communication with the self-organized network controller, and the self-organized network controller is in two-way communication with the upper computer. It is presented that a complete protocol of a physical layer, a media control layer and a network layer is achieved in a DSP. Through the flexibility of the DSP on digital signal processing, the overall hardware and a network protocol can be encapsulated in the independent self-organized network controller, a terminal user can directly perform application development only by connecting the controller to the upper computer without needing to considering the specific networking process, and therefore the purpose of reducing occurrence of network storms is achieved.
Description
Technical field
The present invention relates to communication technical field, in particular it relates to self adaptation core forwards method for building up and the system of network in a kind of wireless self-organization network.
Background technology
Wireless self-organization network is a kind of acentric, fully distributed network. It is different from and traditional there is hypotactic network, do not have mutual dependence, any node all to have the ability reception information between node and the node in wireless self-organization network, it is also possible to the information received is forwarded. If both sides' node of communication is not in point-to-point direct wireless communication distance, message from source node, repeatedly can be forwarded by intermediate node, eventually arrives at destination node. The use of this communication mode, it is possible to eliminate the dependence to base-station node in legacy network, to realize the target of complete distributed deployment. But, the basis of multi-hop working method, it it is the intermediate node on the path from source node to destination node, all there is corresponding routing table, namely each node both knows about the neighbor node forwarding messages to certain feature, by the forwarding of this neighbor node, message can correctly arrive at. Owing to being absent from the central manage-ment unit fixed in wireless multi-hop network, each node network firm initialized time not there is this routing table. Wireless multi-hop network needs corresponding Routing Protocol to complete the foundation of routing table.
Owing to not having central manage-ment unit to be present in wireless multi-hop network, when a node needs the multihop path setting up an arrival another one node in a network, the mode of broadcast generally can be used to inquire. In network, route inquiry is constantly forwarded broadcast by other nodes, until this inquiry is collected by destination node. After destination node makes corresponding response, other node required from source node to destination node path can set up correct routing iinformation, and source node just starts to send data. The use of broadcast is at Route establishment, or inquires there is important effect in the process of other node, it is possible to helps the node in network without center to try one's best and obtains the information wanted. If but nodes quantity is too much, and when each node is involved in forwarding in the process broadcasted, the efficiency of broadcast can become non-normally low, also affects normal data communication simultaneously. It should be noted that radio communication is different from an important feature of wire communication is that the node being in the direct communication distance of this node can receive the content of communication when a node sends information. In Fig. 1 simplified presentation wireless multi-hop network, each node is to the reception of broadcast message and forwarding.
In Fig. 1, can be represented by the node that arrow is connected and be in mutual direct communication distance. The corresponding node being on adjacent two solid lines is in maximum direct communication distance, and in the same manner, the corresponding node on adjacent two dotted lines is also in maximum direct communication distance. On adjacent solid line and dotted line the node of correspondence position be in intercommunication distance within (assuming to be equivalent to the half of maximum communication distance). Without suitable Optimized Measures, all nodes all can participate in broadcast. Such as node 1 starts first time broadcast, and node 2,3,4 carries out broadcast and forwards after receiving, this forwarding can be received by node 1,11,7,12,8,13. Node 11,7,12,8,13 carries out broadcast again and forwards, and now except node 1 in figure, other all nodes all can receive this broadcast and forward.
All of node participates in broadcast, although may insure that all of node all receives information, but can cause the generation of network storm.
Summary of the invention
It is an object of the invention to, for the problems referred to above, it is proposed in a kind of wireless self-organization network, self adaptation core forwards method for building up and the system of network, to realize reducing the advantage that network storm occurs.
For achieving the above object, the technical solution used in the present invention is:
In a kind of wireless self-organization network, self adaptation core forwards the method for building up of network, comprises the following steps:
Step 1: in wireless self-organization network, X node in wireless self-organization network is used periodically actively to initiate the whole network broadcast, hereafter by X node referred to as initiating node, wherein, broadcast comprises two parts information, namely the initiator information that a part is broadcast initiates nodal information, and another part is the address of its neighbor node that the node currently forwarding broadcast listens within nearest a period of time;
Step 2: after other node except initiating node of wireless self-organization network receive above-mentioned broadcast message, according to the number of times that this broadcast has been propagated, determine that present node arrives the beeline initiated between node, then the neighbor information of present node is put in the neighbor node address field in broadcast;
Step 3: the neighbor node address in broadcast is analyzed, particularly as follows: turning information of neighbor nodes and the broadcast received originator and turning the neighbor information of originator and compare, as, the all neighbours of present node can be covered by a radio communication by wherein part neighbor node, present node will judge under the premise not affecting the whole network broadcast, oneself need not participate in the forwarding of broadcast, as, cannot ensure that broadcast can arrive whole neighbor nodes of present node via some neighbor node of present node, present node is just self being set to core forward node to ensure the attainability of message,
Step 4: according to the step in step 1 to step 3, after repeatedly the whole network is broadcasted, completes the setting of each node in wireless self-organization network, thus realizing self adaptation core to forward the foundation of network.
Preferably, after the neighbor node address in broadcast is analyzed in described step 3 end, present node forwards if desired for broadcast, and present node needs:
Retain the initiator information of broadcast;
The sending node address of other message listened to by present node in nearest a period of time updates into broadcast, thus the previous neighbor information turning originator originally carried in covering this broadcast, then forwards.
Preferably,
The neighbor information of each node in wireless self-organization network is set up by recording the originator address that turns of the broadcast received.
Preferably, the data packet format that described broadcast adopts includes:
Originator address: 2 bytes, represents the originator address of broadcast;
Sender address: 2 bytes, represents that broadcast turns the address of originator;
Destination address: 2 bytes, represents the destination address of broadcast;
Data packet length: 2 bytes, represents the total length of packet;
Type of data packet: 1 byte, represents type of data packet;
Sender's type: 1 byte, represents that broadcast turns originator type;
Jumping figure: 1 byte, represents the hop count that packet passes through;
Serial number: 2 bytes, represents the ID of packet;
Sender's neighbor node quantity: 2 bytes, represents that comprising how many message in current broadcast message turns the neighbours of originator.
Preferably, described in turn originator type, including common turning originator, core turns originator, interim core turns originator and non-forwarded person.
Preferably, described serial number is being incrementally exist from initiating in the broadcast that node sends, it is therefore an objective to allow broadcast message reception person judge the uniqueness of broadcast, it is prevented that repeats repeating after receiving and processes.
Preferably, after self adaptation core forwards the foundation of network to complete, after node receives broadcast, the step carrying out core node judgement includes:
Step 701, the person's of the sending address information recording broadcast and jumping figure, and this turns the type of originator, in order to improve the neighbor information when prosthomere;
Core forwarding net is updated if step 702 current data Packet type is request, or broadcast turn originator before be not present in the neighbor information of present node, entering core forward node decision process, present node is not turn originator else if, terminates; If present node is to turn originator, prepare to forward broadcast message;
Step 703, present node neighbor information be saved in neighboring node list, if the distance of the node arrival broadcast message promoter in neighboring node list is not more than present node and arrives the distance of broadcast message promoter, then it is left out the node in these neighboring node list;
Step 704, the node determined whether in neighboring node list arrive the distance of broadcast message promoter and arrive the distance of broadcast message promoter more than present node, if it is not, present node is not as core forward node, if it has, enter next step;
Node in step 705, neighboring node list arrives the distance of broadcast message promoter and is called residue neighbor node more than the node of the distance of present node arrival broadcast message promoter, if the neighbor node of each residue neighbor node is also the neighbours of present node, and these neighbours are marked as core forward node, then this residue neighbor node can pass through core forward node reception broadcast, present node is without considering further that this residue neighbor node, and present node is set as non-forwarding nodes;
If step 706 also has residue neighbor node to be unsatisfactory for the requirement of step 705, if checking and arriving this residue neighbor node being unsatisfactory for requiring by certain neighbor node of present node, whether can increase neighbor node and arrive the distance of broadcast originator, if distance can be increased, then present node is necessarily arranged to core forward node, if will not increase, then present node is set to temporary transient core forward node, waits further information;
If step 707 present node is set to core forward node, or temporarily core forward node, check initiator information and the message SN of current broadcast message, if it is processed, then do not process, wait that broadcast next time sends when updating, if untreated, then use current node information and present node neighbor information to replace the information in broadcast, and forward.
What simultaneously technical solution of the present invention was also disclosed in a kind of wireless self-organization network self adaptation core and forwards network sets up system, including antenna, wireless set, self-organizing network controller and host computer, described antenna and wireless set two-way communication connect, described wireless set and self-organizing network controller two-way communication connect, and described self-organizing network controller and host computer two-way communication connect.
Preferably, described wireless set, including RF receiving circuit, analog to digital conversion circuit, D/A converting circuit and radio frequency transmitter circuitry, described self-organizing network controller adopts dsp chip circuit, the outfan of described RF receiving circuit is connected with the input of analog to digital conversion circuit, the outfan of analog-digital conversion circuit as described is connected with the input of dsp chip circuit, the described outfan of dsp chip circuit is connected with the input of D/A converting circuit, and the outfan of described D/A converting circuit is connected with the input of radio frequency transmitter circuitry.
Technical scheme has the advantages that
Technical scheme, by the node in wireless self-organization network is carried out self judgment, thus stopping non-core node to perform forwarding capability, as long as so that information is forwarded in core forwards and nets, it is possible to ensure that in network, all nodes all receive message. Thus reducing the purpose that network storm occurs. Technical solution of the present invention proposes to realize complete physical layer, media control layer and network layer protocol in dsp. By using the DSP motility to Digital Signal Processing, whole hardware and procotol can be encapsulated in independent self-organizing network controller, terminal use only need to connect this controller to host computer, it is possible to is made directly application and development, without considering concrete networking process. DSP may be configured to be applicable to multiple radio modulation pattern, such as FSK, ASK etc. simultaneously. After wireless signal enters self-organizing network controller, inside controller, complete the processes such as demodulation, channel-decoding, content frame analysis, network protocol stack execution. Thus being simply done in wireless self-organization network core and forward the foundation of net.
Below by drawings and Examples, technical scheme is described in further detail.
Accompanying drawing explanation
Fig. 1 is the structural principle block diagram of the broadcast in existing wireless multi-hop network and forwarding;
Fig. 2 is the structural principle block diagram of the wireless multi-hop network adopting technical solution of the present invention structure;
Fig. 3 is the structural principle schematic diagram of wireless multi-hop network after first round broadcast in technical solution of the present invention;
Fig. 4 is the core forward node decision flowchart described in the embodiment of the present invention;
Fig. 5 is the theory diagram of the system of setting up that self adaptation core forwards network in wireless self-organization network;
Fig. 6 realizes core to forward the decision algorithm of net node and the theory diagram of associated the Internet protocol in programmable DSP.
Detailed description of the invention
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are illustrated, it will be appreciated that preferred embodiment described herein is merely to illustrate and explains the present invention, is not intended to limit the present invention.
Technical solution of the present invention basic ideas are: if picking out some specific node in a network, and require that only these nodes participate in broadcasting process, then need not all carry out forwarding broadcast, the equally possible purpose reaching the whole network broadcast by all nodes.
The whole network broadcasting architecture after simplification as shown in Figure 2. Grayed-out nodes 7,8,16,17 will not participate in the process that broadcast forwards. Because grayed-out nodes is in other still in the node effective coverage range of broadcast, forwarded by the broadcast of other node in network, grayed-out nodes still can receive information, simultaneously because they stop performing forwarding capability so that the chance of network storm is substantially reduced. The network constituted is coupled together, it is possible to be referred to as core and forward net by other nodes. As long as the network information forwards in net in core and is forwarded, it is possible to ensure that in network, all nodes all receive message. If grayed-out nodes needs and other node communications, it is possible to route requests is submitted to nearest core and forwards net member node, core is utilized to forward net to pass the request to destination node, it is established that corresponding route table items.
Core forwards the foundation of net to need there is certain interaction between node. In order to update the topology information of network, the information of meeting life cycle is broadcasted in a network, and each node judges by analyzing the information received. When the information received is more complete, it is judged that can be more accurate, also can be carried out core and forward the foundation of net. Core forwards the foundation of net to be based on a principle: be not involved in forwarding the node of broadcast, and its all of neighbor node obtains broadcast message such as through this certain neighbor node being not involved in forwarding the node of broadcast. If able to judge in the neighbor node of oneself, there is one or several neighbor nodes in one node so that every other neighbor node, including himself, can receive broadcast message, then this node avoids the need for participating in broadcast repeating process.
The technical solution used in the present invention is:
In wireless self-organization network, self adaptation core forwards the method for building up of network, comprises the following steps:
Step 1: in wireless self-organization network, X node in wireless self-organization network is used periodically actively to initiate the whole network broadcast, hereafter by X node referred to as initiating node, wherein, broadcast comprises two parts information, namely the initiator information that a part is broadcast initiates nodal information, and another part is the address of its neighbor node that the node currently forwarding broadcast listens within nearest a period of time;
Step 2: after other node except initiating node of wireless self-organization network receive above-mentioned broadcast message, according to the number of times that this broadcast has been propagated, determine that present node arrives the beeline initiated between node, then the neighbor information of present node is put in the neighbor node address field in broadcast;
Step 3: the neighbor node address in broadcast is analyzed, particularly as follows: turning information of neighbor nodes and the broadcast received originator and turning the neighbor information of originator and compare, as, the all neighbours of present node can be covered by a radio communication by wherein part (one or more) neighbor node, present node will judge under the premise not affecting the whole network broadcast, oneself need not participate in the forwarding of broadcast, as, cannot ensure that broadcast can arrive whole neighbor nodes of present node via some neighbor node of present node, present node is just self being set to core forward node,
Step 4: according to the step in step 1 to step 3, after repeatedly the whole network is broadcasted, completes the setting of each node in wireless self-organization network, thus realizing self adaptation core to forward the foundation of network.
It is specially in wireless self-organization network, uses one or limited node is periodically actively initiated the whole network and broadcasted. Comprising two parts information in broadcast, a part is the initiator information of broadcast, and another part is the current neighbor information forwarding the node sending broadcast to listen within nearest a period of time. After a node receives broadcast message, first record the promoter of broadcast and be analyzed, according to the number of times that this message has been propagated, it is determined that present node is to the beeline between the promoter of message. Then the neighbor node address that the sender (turning originator) of message puts in message is analyzed. Analysis process is simultaneously need to the neighbor information of present node compares. If all of neighbours of present node can be covered by some or several neighbor node, present node will judge that oneself need not carry out the forwarding of broadcast again. If broadcast can arrive via other neighbor node to have one or more neighbor node cannot ensure that, present node is just self being set to core forward node. After analysis terminates, if needing broadcast is forwarded, present node need 1) retain broadcast initiator information, 2) neighbor information that present node in nearest a period of time listens to is updated into broadcast, covering the related content of the previous sender that this message is carried originally, then row forwards. The neighbor information of each node can be passed through to record promoter (the turning originator) address of the broadcast received and set up.
Data packet format such as table 1 adopted in this programme:
Table 1, data packet format table.
Originator address: 2 bytes, represents the originator address of this broadcast;
Sender address: 2 bytes, represents the sender of this broadcast or turns the address of originator;
Destination address: 2 bytes, represents the destination address of this message, is generally 0XFFFF, represents that this is broadcast;
Data packet length: 2 bytes, represents the total length of this packet;
Type of data packet: 1 byte, represents this type of data packet;
Sender's type: 1 byte, represents the sender of this broadcast or turns originator type, and including the common originator that turns, core turns originator, and interim core turns originator and non-forwarded person;
Jumping figure: 1 byte, represents the hop count that this packet passes through;
Serial number: 2 bytes, represents the ID of this packet;
Sender's neighbor node quantity: 2 bytes, represents in current message and comprises how many senders of the message or turn the neighbours of originator.
Node in network forwards the process of judgement of net to depend on the content of neighbor node and broadcast for whether adding core, it is therefore desirable to just can complete after repeatedly the whole network is broadcasted. For Fig. 3, it is assumed that node 1 is the promoter of broadcast, and start the whole network broadcast of the first round. In this broadcast, owing to but without the member node selecting core and forwarding net, oneself is all labeled as and common turns originator by all nodes. Simultaneously as neighbor list is also without setting up, so information of neighbor nodes length is 0 in the broadcast of node 1 the most at first, corresponding neighbor node address contents is also empty. Jumping figure in message content is set to 1 by node 1, current message is set a serial number simultaneously. Serial number current and all of afterwards be incrementally exist from the broadcast that node 1 sends, it is therefore an objective to allow message recipient judge the uniqueness of message, it is prevented that repeat receive after repeating process.
In Fig. 3, node 2,3,4 can directly receive the broadcast of node 1, and therefore node 2,3,4 sets up route entry in the routing table of self, and it is 1 jumping that labelling arrives the distance of node 1, is put in neighbor table as neighbor node by node 1 simultaneously. Next for node 2, owing to node 2 has had node 1 as neighbor node, therefore the information of node 1 is put in broadcast by node 2, then adds 1 to the jumping figure in message content, then is undertaken message forwarding broadcast.
The broadcast that node 2 forwards will be obtained by node 7 and node 11. Can calculate, by same process, node 11 and node 7, the distance arriving node 1 is 2. Jumping figure in message content is added 1, and all information of neighbor nodes is replaced with 2 before carrying out forwarding broadcast by node 11 and node 7 respectively.
Node 11 will be received again by broadcast. By comparing originator address and message SN, node 11 determines that this message was received. Therefore only this message is analyzed, does not forward. Analyze as a result, it is possible to learn that node 7 is the neighbours of node 11, it is 2 that node 7 arrives the distance of node 1, and node 7 has the neighbor node 2 the same with node 11. Node 11 records information in neighbor list, then abandons this message.
Broadcast forwarding is performed continuously over, until all nodes all receive broadcast. Simultaneously because node broadcasts process has precedence, the information in order to ensure neighbor node is complete, and whole broadcasting process needs to be repeatedly performed, and the number of times carried out is determined by number of nodes.
When information of neighbor nodes is collected after completely, each node should establish information of neighbor nodes table. The information of neighbor nodes of the two node is illustrated for node 7 and node 12, table 2 and table 3.
Table 2, node 7 information of neighbor nodes table.
Table 3, node 12 information of neighbor nodes table.
The analysis process of node 7 is:
1, neighbor node 2 is 1 to the distance of broadcast originator node 1, distance less than node 7 to node 1, therefore the broadcast attainability of node 2 is responsible for (being exactly node 1 under present case) by arriving node 1 apart from shorter node, and therefore node 7 is left out the situation of node 2
2, the situation of neighbor node 3 is consistent with the situation of node 2, and therefore node 7 is left out the situation of node 3
3, neighbor node 11 is 2 to the distance of node 1, consistent with the distance of node 7 to node 1, therefore the broadcast attainability of node 11 should by node 1 distance closer to node be responsible for, node 7 is without the concern for node 11
4, neighbor node 16 is 3 to the distance of node 1, more than the distance of node 7 to node 1. The neighbor node of further analysis node 16, its interior joint 20 and 21 is not the neighbours of node 7, so being left out the effectiveness of the two node. Node 7 is exactly present node, does not also account for. It is all 2 that node 11 and 12 arrives the distance of node 1, identical with node 7, forwards the member of net also uncertain at present owing to whether node 11 and 12 can be selected to core, and therefore oneself is set as interim core forward node by temporary nodes 7. Interim core turns originator still can forward broadcast, until further acquisition of information.
5, neighbor node 12 is 2 to the distance of node 1, and identical with the distance of node 7 to node 1, therefore node 7 is left out node 12.
After present analysis completes, node 7 can produce result as shown in the table:
Table 4, node 7 Preliminary Analysis Results table.
In broadcast repeating process later, the forwarding type of node 7 is " interim core turns originator ".
The analysis process of node 12:
1, neighbor node 3 arrives the distance distance less than node 12 to node 1 of node 1, and therefore node 12 is left out this neighbor node
2, neighbor node 7 is equal to the node 12 distance to node 1 to the distance of node 1, and therefore node 12 is left out this neighbor node
3, neighbor node 8 is equal to the node 12 distance to node 1 to the distance of node 1, and therefore node 12 is left out this neighbor node
4, neighbor node 16 is 3 to the distance of node 1, more than the distance of node 12 to node 1. The neighbor node of further analysis node 16, its interior joint 11 is not the neighbor node of node 12, it is not accounted for. Node 7 is identical with the distance of node 12 to node 1 to the distance of node 1, currently cannot determine whether node 7 can become core and forward net node. Node 12 is own node, is temporarily left out. Node 20 is not the neighbor node of node 12, it is not accounted for. Node 21 is 3 to the distance of node 1, distance more than node 12 to node 1, it should be noted that, node 16 is also 3 to the distance of node 1, if node 16 needs by node 21 to be responsible for forwarding, its distance will become 4, it is possible to produce Routing loops, and therefore node 16 needs to be responsible for forwarding by node 12. Therefore, setting themselves is that core turns originator by node 12.
5, neighbor node 21 arrives the distance of node 1 is 3, arrives the distance of node 1 more than node 12. The neighbor node of further analysis node 21, its interior joint 12 is self, is temporarily left out. Node 16 and 17 is all the neighbor node of node 12, and the distance arriving node 1 is all 3, arrives the distance of node 1 more than node 12. If node 12 does not become core forward node, and is responsible for forwarding by node 16 or 17, then node 21 arrives the distance of node 1 can become 4, causes Routing loops, and therefore node 12 sets itself to core and forwards point.
6, neighbor node 17 arrives the distance of node 1 is 3, arrives the distance of node 1 more than node 12. The neighbor node of further analysis node 17, its interior joint 12 is own node, is temporarily left out. Node 22 and 13 is not the neighbor node of node 12, is left out. Node 8 arrives the distance distance less than node 12 to node 1 of node 1, but cannot determine whether node 8 can become core and forward point. Node 21 is 3 to the distance of node 1, if by the forwarding of node 21 responsible node 17, node 17 will be 4 to the distance of node 1, causes route circulation, and therefore node 12 sets itself to core forward node.
After analysis terminates, node 12 is set as that core turns originator. In the broadcast message that the posterior nodal point 12 that this information will be included forwards.
Up to the present, node 7 sets from turning originator as interim core, and node 12 sets from turning originator as core. After the whole network broadcast next time carries out, node 7 will obtain the identity information of node 12, and judges that node 12 can be responsible for broadcast and forward, and thus the neighbor node 16 of node 7 can be guaranteed the attainability of broadcast message. Therefore node 7 sets from as non-forwarded person, no longer broadcast being forwarded. Until one of following two situation produces:
1, certain node initiates the whole network broadcast request, and initiative updates core and forwards the composition of net.
2, node 7 finds have new node to add network, and this node is not present in the original neighbor list of this node.
Nodes judges self whether to be set as that core forwards the flow chart of net node as shown in Figure 4.
After a node receives broadcast:
1, recording the transmission of broadcast or turn originator address information, jumping figure, and this transmission or turn the type of originator, in order to improve the information of neighbor table
Update core forwarding net if 2 current data Packet type are requests, or be not present in before the sender of this broadcast in the neighbor list of present node, enter core forward node decision process. Present node is non-forwarded person else if, terminates. If present node is not non-forwarded person, prepare to forward broadcast.
3, analysis neighbor node broadcast attainability process is entered
4, in neighboring node list, if having node to arrive the distance of broadcast originator arrive the distance of broadcast originator less than or equal to present node, then these neighbor nodes it are left out.
5, whether also node is remained. Without residue node, then present node is not needed as core forward node. If there being residue node, enter next step.
6, according to judgement before, residue neighbor node arrives the distance of broadcast originator and arrives the distance of broadcast originator more than present node. If the neighbor node of each residue neighbor node is also the neighbours of present node, and these neighbours are marked as core forward node, then this residue neighbor node can pass through core forward node reception broadcast. Present node is without considering further that this neighbor node. Present node can set that as non-forwarding nodes.
If 7 also have neighbor node to be unsatisfactory for the requirement of step 6, if checking and arriving this neighbor node being unsatisfactory for requiring by certain neighbor node of present node, if neighbor node can be increased and arrive the distance of broadcast originator. If distance can be increased, then present node is necessarily arranged to core forward node, to prevent the situation of Routing loops. If will not increase, then present node is set to temporary transient core forward node, waits further information.
If 8 present nodes are set to core forward node or temporary transient core forward node, check initiator information and the message SN of current broadcast message, if it is processed, then do not process, wait that broadcast next time sends when updating, to avoid repeating to process. If untreated, then current node information and present node neighbor information replaced the information in broadcast, and forward. Process terminates.
The processing mode of the broadcast that the present invention proposes and the difference of conventional processing mode are in that, node needs the content of broadcast is processed and makes replacement time in need, and the processing mode of routine has only to the hop count information in amendment packet content, then completely forward. Therefore the method that the present invention proposes needs special handling process when network layer handles data. In order to be distinguished facilitating user to be absorbed in application and development by the process function of network layer protocol and user application layer, the present invention proposes to realize complete physical layer, media control layer and network layer protocol in digital signal processing module (DSP). By using the DSP motility to Digital Signal Processing, whole hardware and procotol can be encapsulated in independent self-organizing network controller, terminal use only need to connect this controller to host computer, it is possible to is made directly application and development, without considering concrete networking process.DSP may be configured to be applicable to multiple radio modulation pattern, such as FSK, ASK etc. simultaneously. After wireless signal enters self-organizing network controller, inside controller, complete the processes such as demodulation, channel-decoding, content frame analysis, network protocol stack execution. Same, after user data issues from host computer, the destination address according to data, the functions such as self-organizing network controller completes framing, coding, modulation, mail to destination by packet. As it is shown in figure 5, illustrate the connection of self-organizing network controller, wireless set, and host computer. As shown in Figure 6, the workflow within self-organizing network controller is illustrated. As shown in Figure 5, in wireless self-organization network, self adaptation core forwarding network sets up system, including antenna, wireless set, self-organizing network controller and host computer, antenna and wireless set two-way communication connect, wireless set and self-organizing network controller two-way communication connect, and self-organizing network controller and host computer two-way communication connect.
As shown in Figure 6, wireless set, including RF receiving circuit, analog to digital conversion circuit, D/A converting circuit and radio frequency transmitter circuitry, self-organizing network controller adopts dsp chip circuit, the outfan of RF receiving circuit is connected with the input of analog to digital conversion circuit, the outfan of analog to digital conversion circuit is connected with the input of dsp chip circuit, the outfan of dsp chip circuit is connected with the input of D/A converting circuit, and the outfan of D/A converting circuit is connected with the input of radio frequency transmitter circuitry.
Last it is noted that the foregoing is only the preferred embodiments of the present invention, it is not limited to the present invention, although the present invention being described in detail with reference to previous embodiment, for a person skilled in the art, technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature carries out equivalent replacement. All within the spirit and principles in the present invention, any amendment of making, equivalent replacement, improvement etc., should be included within protection scope of the present invention.
Claims (9)
1. in a wireless self-organization network, self adaptation core forwards the method for building up of network, it is characterised in that comprise the following steps:
Step 1: in wireless self-organization network, X node in wireless self-organization network is used periodically actively to initiate the whole network broadcast, hereafter by X node referred to as initiating node, wherein, broadcast comprises two parts information, namely the initiator information that a part is broadcast initiates nodal information, and another part is the address of its neighbor node that the node currently forwarding broadcast listens within nearest a period of time;
Step 2: after other node except initiating node of wireless self-organization network receive above-mentioned broadcast message, according to the number of times that this broadcast has been propagated, determine that present node arrives the beeline initiated between node, then the neighbor information of present node is put in the neighbor node address field in broadcast;
Step 3: the neighbor node address in broadcast is analyzed, particularly as follows: turning information of neighbor nodes and the broadcast received originator and turning the neighbor information of originator and compare, as, the all neighbours of present node can be covered by a radio communication by wherein part neighbor node, present node will judge under the premise not affecting the whole network broadcast, oneself need not participate in the forwarding of broadcast, as, cannot ensure that broadcast can arrive whole neighbor nodes of present node via some neighbor node of present node, present node is just self being set to core forward node to ensure the attainability of message,
Step 4: according to the step in step 1 to step 3, after repeatedly the whole network is broadcasted, completes the setting of each node in wireless self-organization network, thus realizing self adaptation core to forward the foundation of network.
2. in wireless self-organization network according to claim 1, self adaptation core forwards the method for building up of network, it is characterised in that
After neighbor node address in broadcast is analyzed in described step 3 end, present node forwards if desired for broadcast, and present node needs:
Retain the initiator information of broadcast;
The sending node address of other message listened to by present node in nearest a period of time updates into broadcast, thus the previous neighbor information turning originator originally carried in covering this broadcast, then forwards.
3. in wireless self-organization network according to claim 1, self adaptation core forwards the method for building up of network, it is characterised in that
The neighbor information of each node in wireless self-organization network is set up by recording the originator address that turns of the broadcast received.
4. forward the method for building up of network according to self adaptation core in the arbitrary described wireless self-organization network of claim 1 or 3, it is characterised in that the data packet format that described broadcast adopts includes:
Originator address: 2 bytes, represents the originator address of broadcast;
Sender address: 2 bytes, represents that broadcast turns the address of originator;
Destination address: 2 bytes, represents the destination address of broadcast;
Data packet length: 2 bytes, represents the total length of packet;
Type of data packet: 1 byte, represents type of data packet;
Sender's type: 1 byte, represents that broadcast turns originator type;
Jumping figure: 1 byte, represents the hop count that packet passes through;
Serial number: 2 bytes, represents the ID of packet;
Sender's neighbor node quantity: 2 bytes, represents that comprising how many message in current broadcast message turns the neighbours of originator.
5. in wireless self-organization network according to claim 4, self adaptation core forwards the method for building up of network, it is characterised in that described in turn originator type, including common turning originator, core turns originator, interim core turns originator and non-forwarded person.
6. in wireless self-organization network according to claim 4, self adaptation core forwards the method for building up of network, it is characterized in that, described serial number is being incrementally exist from initiating in the broadcast that node sends, purpose is the uniqueness allowing broadcast message reception person judge broadcast, it is prevented that repeats repeating after receiving and processes.
7. in wireless self-organization network according to claim 4, self adaptation core forwards the method for building up of network, it is characterised in that after self adaptation core forwards the foundation of network to complete, after node receives broadcast, the step carrying out core node judgement includes:
Step 701, the person's of the sending address information recording broadcast and jumping figure, and this turns the type of originator, in order to improve the neighbor information when prosthomere;
Core forwarding net is updated if step 702 current data Packet type is request, or broadcast turn originator before be not present in the neighbor information of present node, entering core forward node decision process, present node is not turn originator else if, terminates; If present node is to turn originator, prepare to forward broadcast message;
Step 703, present node neighbor information be saved in neighboring node list, if the distance of the node arrival broadcast message promoter in neighboring node list is not more than present node and arrives the distance of broadcast message promoter, then it is left out the node in these neighboring node list;
Step 704, the node determined whether in neighboring node list arrive the distance of broadcast message promoter and arrive the distance of broadcast message promoter more than present node, if it is not, present node is not as core forward node, if it has, enter next step;
Node in step 705, neighboring node list arrives the distance of broadcast message promoter and is called residue neighbor node more than the node of the distance of present node arrival broadcast message promoter, if the neighbor node of each residue neighbor node is also the neighbours of present node, and these neighbours are marked as core forward node, then this residue neighbor node can pass through core forward node reception broadcast, present node is without considering further that this residue neighbor node, and present node is set as non-forwarding nodes;
If step 706 also has residue neighbor node to be unsatisfactory for the requirement of step 705, if checking and arriving this residue neighbor node being unsatisfactory for requiring by certain neighbor node of present node, whether can increase neighbor node and arrive the distance of broadcast originator, if distance can be increased, then present node is necessarily arranged to core forward node, if will not increase, then present node is set to temporary transient core forward node, waits further information;
If step 707 present node is set to core forward node, or temporarily core forward node, check initiator information and the message SN of current broadcast message, if it is processed, then do not process, wait that broadcast next time sends when updating, if untreated, then use current node information and present node neighbor information to replace the information in broadcast, and forward.
8. in a wireless self-organization network self adaptation core forward network set up system, it is characterized in that, including antenna, wireless set, self-organizing network controller and host computer, described antenna and wireless set two-way communication connect, described wireless set and self-organizing network controller two-way communication connect, and described self-organizing network controller and host computer two-way communication connect.
9. in wireless self-organization network according to claim 8 self adaptation core forward network set up system, it is characterized in that, described wireless set, including RF receiving circuit, analog to digital conversion circuit, D/A converting circuit and radio frequency transmitter circuitry, described self-organizing network controller adopts dsp chip circuit, the outfan of described RF receiving circuit is connected with the input of analog to digital conversion circuit, the outfan of analog-digital conversion circuit as described is connected with the input of dsp chip circuit, the described outfan of dsp chip circuit is connected with the input of D/A converting circuit, the outfan of described D/A converting circuit is connected with the input of radio frequency transmitter circuitry.
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 true CN105657774A (en) | 2016-06-08 |
| CN105657774B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109121096A (en) * | 2017-06-23 | 2019-01-01 | 华为技术有限公司 | Method and apparatus for determining the broadcast node in mesh network |
| CN111869243A (en) * | 2018-03-15 | 2020-10-30 | 科派克系统公司 | Method for wireless communication system |
| CN112738733A (en) * | 2020-12-17 | 2021-04-30 | 湖南智领通信科技有限公司 | Wireless mesh network networking method and device based on physical layer protocol |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350831A (en) * | 2008-09-10 | 2009-01-21 | 北京航空航天大学 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
| CN101707793A (en) * | 2009-11-13 | 2010-05-12 | 华南理工大学 | 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 |
| CN101951615A (en) * | 2010-08-03 | 2011-01-19 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN105072586A (en) * | 2015-07-20 | 2015-11-18 | 无锡士康通讯技术有限公司 | Management method for forwarding of broadcast message in embedded wireless ad hoc network |
| 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 (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350831A (en) * | 2008-09-10 | 2009-01-21 | 北京航空航天大学 | Control method for shrouding wireless sensor network using multiplex intersection point shrouding discrimination |
| CN101707793A (en) * | 2009-11-13 | 2010-05-12 | 华南理工大学 | 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 |
| CN101951615A (en) * | 2010-08-03 | 2011-01-19 | 北京航空航天大学 | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree |
| CN105072586A (en) * | 2015-07-20 | 2015-11-18 | 无锡士康通讯技术有限公司 | Management method for forwarding of broadcast message in embedded wireless ad hoc network |
| CN205545958U (en) * | 2016-03-24 | 2016-08-31 | 无锡士康通讯技术有限公司 | System that establishs of network is forwardded to self -adaptation core among wireless ad hoc networks |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109121096A (en) * | 2017-06-23 | 2019-01-01 | 华为技术有限公司 | Method and apparatus for determining the broadcast node in mesh network |
| CN109121096B (en) * | 2017-06-23 | 2020-09-11 | 华为技术有限公司 | Method and apparatus for determining broadcast nodes in a mesh network |
| CN111869243A (en) * | 2018-03-15 | 2020-10-30 | 科派克系统公司 | Method for wireless communication system |
| CN112738733A (en) * | 2020-12-17 | 2021-04-30 | 湖南智领通信科技有限公司 | Wireless mesh network networking method and device based on physical layer protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105657774B (en) | 2023-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1856853B1 (en) | Hybrid routing protocol for a network with mesh topology | |
| US8270302B2 (en) | System and method for providing an adaptive value of TTL (time to live) for broadcast/multicast messages in a mesh network using a hybrid wireless mesh protocol | |
| EP1317822B1 (en) | Multicast routing in ad-hoc networks | |
| US7532623B2 (en) | Methods for wireless mesh multicasting | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN105163349B (en) | A kind of multiple gateway Wireless Mesh network implementation method based on IEEE802.11s | |
| CN108476457A (en) | Distributed reaction resource in time slotted channel hopping network and management and running | |
| CN100583800C (en) | Method for multicast employing single static bidirectional sharing tree in flexible wire type tunnel | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| US11909545B2 (en) | Localized multicast in a low power and lossy network based on rank-based distance | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| CN105099902A (en) | Routing method for quantum Mesh network | |
| JP5004999B2 (en) | Hybrid mesh routing protocol | |
| US11909543B2 (en) | Multicast-only thin DODAG in low power and lossy network | |
| CN105657774A (en) | Building method and system for self-adaptive core forwarding network in wireless self-organized network | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| Tan et al. | Queue management for network coding in ad hoc networks | |
| CN205545958U (en) | System that establishs of network is forwardded to self -adaptation core among wireless ad hoc networks | |
| CN104219156A (en) | Multicast routing method applicable for hierarchical air ad hoc network | |
| CN102075864A (en) | MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure | |
| CN101552732A (en) | Hybrid grid route selection protocol | |
| JP5465328B2 (en) | Wireless communication apparatus and wireless communication method | |
| CN114189898B (en) | IPv6 wireless sensor network point-to-point routing method based on RPL routing protocol |
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 |