CN106304230B - Based on the wireless self-networking method and device routed immediately - Google Patents
Based on the wireless self-networking method and device routed immediately Download PDFInfo
- Publication number
- CN106304230B CN106304230B CN201610861463.6A CN201610861463A CN106304230B CN 106304230 B CN106304230 B CN 106304230B CN 201610861463 A CN201610861463 A CN 201610861463A CN 106304230 B CN106304230 B CN 106304230B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- field strength
- layer
- neighbor list
- 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
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
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/244—Connectivity information management, e.g. connectivity discovery or connectivity update using a network of reference devices, e.g. beaconing
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention is provided based on the wireless self-networking method and device routed immediately, method includes the following steps: to construct tree network, using all neighbours of wireless sensor network node at the middle and upper levels as next layer network node, next layer network node is using the maximum node of field strength in a node layer thereon as host node, a tree network being attached with maximum field intensity values is constituted, the neighbor list of whole network is collected simultaneously；Network redundancy optimization is carried out to the tree network, making one, there are a plurality of communication paths between node and host node.The present invention uses instant route technology, directly can calculate routing relation by IP, avoids additional routing table storage, is suitable for battery powered low-power consumption occasion.
Description
Technical field
The present invention relates to wireless sensor network technology fields, more particularly to based on the wireless self-networking method routed immediately
And device.
Background technique
During wireless sensor ad hoc network, all nodes have par, are borne by the function of host and router
Can, each node has the transmitting-receiving ability of message.Limited by communication distance, when nodal distance farther out when, centre can be passed through
The forwarding capability of node realizes communication.Traditional Routing Protocol, such as Zigbee, RPL, GWBZ and static routing, data by
To when interference, routing will be found again, then data are retransmitted by source address, these technologies can be used to power consumption
Do not have under the occasion of particular/special requirement.In order to reduce energy consumption, data is avoided to retransmit from source, the advantages of in combination with static routing,
It is internal that routing iinformation is encapsulated into IP address coding, is stored to save additional routing table, this route technology is referred to as i.e.
When route technology.
Traditional ad hoc network method will extraly store routing table, be according to storage when destination address is unreachable
Routing table recalculates path, then retransmits data by source address host.Although it is able to achieve dynamic more new route, thus
Guarantee the reliability of data transmission, but it there are clearly disadvantageous, the number of data re-transmitting excessively can greatly consume energy,
Particularly, under battery powered low-power consumption occasion, this method is not applicable.Wherein, the method that network is obtained by self study,
Its learning time is influenced by network size, its somewhat larger treatment process of scale is long, can not quickly networking, inconvenience debugging,
It is unable to satisfy actual engineering demand.
Never how initial data is taken in traditional network-building method and is obtained and how address is distributed and be described in detail,
Theoretical formula is various, numerous models be only through computer simulation it is concluded that, it is difficult only theoretical ideally feasible
It is gone in practice with being applied to, to Engineering Guidance meaning and little.
More there are some route technologies, only give the thought of routing, group mesh portions are not related to, experimental data is
It is obtained by way of artificial networking, although it has preferable communication efficiency and higher anti-interference ability, its group of networks
It builds and is completed by the mode of artificial networking, lead to not promote.
Summary of the invention
The present invention provide it is a kind of at least partly solve above-mentioned technical problem based on the wireless self-networking method routed immediately
And device.
In a first aspect, the present invention provides a kind of based on the wireless self-networking method routed immediately, include the following steps:
S10: building tree network: using all neighbours of wireless sensor network node at the middle and upper levels as next layer network section
Point, next layer network node constitute one using the maximum node of field strength in a node layer thereon as host node with maximum field intensity values
The tree network being attached is collected simultaneously the neighbor list of whole network；
S20: the network optimization: network redundancy optimization is carried out to the tree network, makes one to deposit between node and host node
In a plurality of communication path.
Preferably, the building process of tree network described in step S10 is as follows:
S100: host node sends all nodes in Wake on LAN frame wake-up network；
S110: host node sends out networking beacon, receives the node of the networking beacon for data source address and received field hypermnesia
It records neighbor list and forwards networking beacon；
S120: the node in neighbor list by the descending sequence of field strength is received, is preset in front in sequence by host node
The node division of quantity is first layer, and calculates and distribute IP for the first-level nodes；
S130: the neighbor list on the node for having distributed IP is collected, and arranges and obtains its next layer network node；
S140: judging whether there is the unallocated IP of new node, if so, continuing in next step；If it is not, then terminating；
S150: finding the maximum connection relationship of field strength as IP to each lower level node from field strength and distribute foundation, and
Calculate corresponding IP；
S160: host node is that corresponding node distributes IP, return step S130 by network layer instruction.
Preferably, the process of the optimization of network redundancy described in step S20 is as follows:
S200: reading the neighbor list of whole network, constructs matrix with its field intensity value；
S210: field strength minimum is handled, and in every two node, each node records the field strength of other side, takes in two field strength
Smaller value；
S220: the processing of field strength thresholding, the field strength Compulsory Removal that will be less than preset threshold is 0；
S230: network layer is divided, each node is distributed to different network layers；
S240: calculating optimal communication path, on the communication path, in the communication link of each node and upper layer network, and section
The field strength of point is most strong；
S250: being calculated by network cluster, increases communication redundancy path；
S260: IP is calculated by allocation rule, and node distributes IP one by one.
Preferably, the first-level nodes described in step S120 are no more than 14, and extra is divided into next layer.
Preferably, it is as follows to minimize the process handled for field strength described in step S210:
Between any two node when two-way communication, each node takes the minimum value for receiving field strength, constructs symmetrical field
Strong square matrix, in the field strength square matrix, the node in the neighbor list is not expressed as 0.
Preferably, the process of the processing of field strength thresholding described in step S220 is as follows:
Host node layer and other layers take different threshold values to handle field strength respectively, will be low by host node layer and other layers
In corresponding preset threshold field strength Compulsory Removal be 0.
Preferably, the process that network layer is divided described in step S230 is as follows:
In the field strength square matrix, using statistical method, the connection number of every a line and upper layer node is calculated first, is then pressed
The descending sequence of the connection number of statistics, connection number are the node that node division in non-zero row is this layer network；
After sequence is completed, the field strength square matrix procession is converted；
The connection number is the quantity of non-zero element.
Preferably, the process that optimal communication path is calculated described in step S240 is as follows:
Calculate the best overlay communication node of each node, the road between each node and the best overlay communication node
Diameter is the optimal communication path；
The acquisition process of the best overlay communication node is as follows:
Upper layer network node column, current layer network node is taken to be expert at constituted matrix from original field strength matrix
For networking matrix, calculate in the networking matrix that the maximum node position of field strength, the position are in each node in every a line
A node of corresponding upper layer network is arranged, which is the best overlay communication node.
Preferably, the process that network cluster calculates in step S250 is as follows:
By the progress of all nodes and operation on the optimal communication path with identical upper layer node, in the field strength side
In the respective column of battle array, as long as having one is 0, it all is cleared to 0, to generate multiple upper layer node branches cluster；
Multiple branch's clusters are merged, two tuftlets are merged into a big cluster, there is each node maximum
Connection number can be used.
Preferably, the process of calculating described in step S260 and distribution IP are as follows:
Top-down distribution IP between layers；
Inside cluster, small size IP is preferentially distributed into the most node of connection number, cluster member branch number incremented by successively obtains IP.
Second aspect, the present invention also provides a kind of based on the wireless self-networking device routed immediately, comprising:
Tree network construction unit, for constructing tree network: by all neighbours of wireless sensor network node at the middle and upper levels
It occupies and is used as next layer network node, next layer network node is using the maximum node of field strength in a node layer thereon as host node, structure
The tree network being attached at one with maximum field intensity values is collected simultaneously the neighbor list of whole network；
Network optimization unit, be used for the network optimization: to the tree network carry out network redundancy optimization, make a node with
There are a plurality of communication paths between host node.
As shown from the above technical solution, the present invention is based on the wireless self-networking method and devices routed immediately, using instant
Route technology directly can calculate routing relation by IP, avoid additional routing table storage, be suitable for battery powered low
Power consumption occasion；A group network process is divided into 2 stages, the 1st stage carried out networking by single most strong path, in order to acquire
To the neighbor list of all nodes, the 2nd stage, the neighbor information that comprehensive analysis is collected into guarantees network by redundancy
Communication quality avoids the limitation of previous networking mode localization；It forces in optimization process using minimum value and threshold process
Method expresses networking technology using matrix form, joined different threshold conditions for heterogeneous networks level, to avoid
Receive and dispatch imbalance problem, with field minimum intensity values construct symmetrical matrix, guarantee the available connection being calculated be actually consistent, that is, lead to
The network of this matrix establishment is crossed, can certainly realize data interaction between node, it is uneven right to avoid receiving and dispatching due to wireless field density
The influence of networking result；In order to accelerate arithmetic speed, statistical method joined in hierarchical algorithm and Clustering Algorithm, with statistics
As a result it is ranked up, row-column transform is applied to matrix by the result that statistic sorts, achievees the purpose that quickly to arrange, avoid
Extra searching loop；Optimal communication path is remained, redundant path joined by clustering method, is guaranteeing that network is most preferably logical
In the case where believing path, the stability of network is improved.
Detailed description of the invention
Fig. 1 is the flow chart based on the wireless self-networking method routed immediately that one embodiment of the invention provides；
Fig. 2 is the specific flow chart of step S10 in Fig. 1；
Fig. 3 is the specific flow chart of step S20 in Fig. 1；
Fig. 4 is the schematic illustration routed immediately；
Fig. 5 is tree network structural schematic diagram；
Fig. 6 is field strength square matrix schematic diagram；
Fig. 7 is the field strength square matrix schematic diagram of double-layer network；
Fig. 8 is optimal communication path computing schematic diagram；
Fig. 9 is that network cluster calculates schematic diagram one；
Figure 10 is that network cluster calculates schematic diagram two；
Figure 11 is that network cluster calculates schematic diagram three；
Figure 12 is the functional block diagram based on the wireless self-networking device routed immediately that one embodiment of the invention provides.
Specific embodiment
With reference to the accompanying drawings and examples, specific embodiments of the present invention will be described in further detail.Implement below
Example is not intended to limit the scope of the invention for illustrating the present invention.
It is different from traditional route technology, instant route technology is used in the present invention, and routing iinformation is encoded in IP address
Inside, to reduce the storage of routing table information.The present invention indicates IP address using 6 byte lengths (i.e. 12 16 system numbers),
One IP address is made of network number and branch number, and wherein branch number is the last one 16 non-zero binary data.Wherein
000000000000 indicates host node (or root node), and FFFFFFFFFFFF indicates broadcast address.
All 0 is omitted in Fig. 4, such as No. 9 nodes, IP address are shown as 1131, and practical IP is 11 31 00
00 00 00, network number 113, branch number is 1, shows that the routing of its upper layer for 113, then sees that 113 network number is 11, i.e., its
Overlying roaduay is 1 by the network number for being 11,11, without overlying roaduay by expression is the first-level nodes, can be directly logical with top layer
Letter, communication path are just found out, and storage routing table is not needed.
Network redundancy information, such as 4 tri- node network numbers having the same of ABC as shown in the figure, table are expressed by cluster member
Show that it is cluster member, cluster member can communicate by upper layer cluster member with host node.Preferentially pass through the corresponding section of network number
Point is communicated such as No. 5 nodes in Fig. 4, and when No. 5 node failures, No. 6 can substitute No. 5 and become routing node.
In order to collect all neighbor informations in network node, first have to the neighbor list of all nodes and corresponding
Field intensity information acquisition is returned.In real network and not can guarantee all network nodes can be directly in MAC (Media Access
Control, body access control) it is communicated on layer, as shown in Figure 4, host node only can directly and 1,2, No. 3 node is direct
Communication, can not be directly by MAC layer instruction acquisition to all information, if carrying out networking, nothing in such a way that side acquires side texture
Method avoids wireless receiving and dispatching imbalance problem, and the obtained network information is also incomplete.Therefore, a group network process is divided by the present invention
Two stages, first stage, field strength collection phase, second stage, network redundancy optimizing phase.
Embodiment 1
Fig. 1 is the process based on the wireless self-networking method one embodiment routed immediately that one embodiment of the invention provides
Figure.
As shown in Figure 1, it is of the invention based on the wireless self-networking method routed immediately, include the following steps:
S10: building tree network: using all neighbours of wireless sensor network node at the middle and upper levels as next layer network section
Point, next layer network node constitute one using the maximum node of field strength in a node layer thereon as host node with maximum field intensity values
The tree network being attached is collected simultaneously the neighbor list of whole network；
S20: the network optimization: network redundancy optimization is carried out to the tree network, makes one to deposit between node and host node
In a plurality of communication path.
The present invention uses instant route technology, directly can calculate routing relation by IP, avoid additional routing table
Storage is suitable for battery powered low-power consumption occasion；A group network process is divided into 2 stages, the 1st stage, by single most strong path
Carry out networking, in order to collect the neighbor list of all nodes, the 2nd stage, the neighbor information that comprehensive analysis is collected into,
The communication quality for guaranteeing network by redundancy avoids the limitation of previous networking mode localization；It is forced in optimization process
Using the method for minimum value and threshold process, networking technology is expressed using matrix form, is added for heterogeneous networks level
Different threshold conditions constructs symmetrical matrix to avoid transmitting-receiving imbalance problem with field minimum intensity values, guarantees to be calculated
Can be consistent with connection and actually, i.e., the network set up by this matrix can certainly realize data interaction between node, avoid by
In the uneven influence to networking result of wireless field density transmitting-receiving；In order to accelerate arithmetic speed, in hierarchical algorithm and Clustering Algorithm
It joined statistical method, be ranked up with the result of statistics, row-column transform is applied to matrix by the result that statistic sorts, is reached
To the purpose quickly arranged, extra searching loop is avoided；Optimal communication path is remained, joined by clustering method superfluous
Remaining path improves the stability of network in the case where guaranteeing network optimal communication path.
Embodiment 2
As shown in Figures 2 and 3, of the invention based on the wireless self-networking method routed immediately, a group network process is divided into two
A stage, first stage, field strength collection phase, second stage, network redundancy optimizing phase.
First stage carries out path planning by the strongest path of field strength, splits the network into the connection shape of multiple single-pathways
Formula, i.e., be considered as next layer network node with all neighbours of upper layer node, and next layer network node is in a node layer thereon
The node of communication efficiency preferably (or field strength is maximum) is host node, finally constitutes the tree-shaped being attached with maximum field intensity values
Network.
First stage specifically comprises the following steps:
S100: host node sends all nodes in Wake on LAN frame wake-up network；
In the present embodiment, all nodes are all waken up, receive wake-up association by host node active transmission broadcast wakeup frame
Node successively forwards broadcast wakeup frame, sends out and forwarding is primary, to improve anti-interference ability, be then followed by a synchronization frame；Host node
All nodes are waited to be waken up, the waiting time is related with network size；
As shown in figure 4, No. 0 node is known as host node, wake up instruction is sent by No. 0 node first, by all waking up nodes,
1,2,3 nodes can receive wake up instruction first, then, by the ID computation delay of oneself, forward wake up instruction；Other nodes receive
It is similarly handled after wake up instruction；
S110: host node sends out networking beacon, receives the node of networking beacon for data source address and receives field intensity value record
To neighbor list and forward networking beacon；
It is understood that host node sends networking beacon, receive the node of networking beacon, first by data source address and
It receives field intensity value to be recorded in the neighbor list of oneself, while carrying out threshold process, too small direct removal；Then according to oneself
ID calculate forwarding time, modification source address simultaneously forwards networking beacon, and each node only forwards once；Networking beacon is waited to turn
Distribute complete, the waiting time is related with network size；
As shown in figure 4, No. 0 node sends networking beacon, all nodes for receiving networking beacon can all forward primary group
Net beacon changes data source address in MAC layer, while record receives the source address of networking beacon, and records field intensity value, this
The information recorded claims neighbor list；
S120: host node presses the descending sequence of field strength to the node in neighbor list, by front preset quantity in sequence
Node division be first layer, and for the first-level nodes calculate and distribute IP；
It is understood that host node is ranked up the node in itself neighbor list by field strength is descending, and will
The node division of front preset quantity is the 1st layer in sequence, limits the 1st node layer number and (is as less than or equal to no more than 14
14), extra is divided into next layer, to avoid the address of 0 and F beginning, calculates for the 1st node layer and distributes IP address；
As shown in figure 4, including 1,2,3 in No. 0 nodes neighbors list, distribution node 1,2,3 is instructed by MAC layer at this time
IP address is 11,21,31；
S130: the neighbor list on the node for having distributed IP is collected, and arranges and obtains its next layer network node；
S140: judging whether there is the unallocated IP of new node, if so, continuing in next step；If it is not, then terminating；
In the present embodiment, acquisition IP address is respectively the neighbor list of 11,21,31 node 1,2,3, is sent out by comparison
Existing multiple new nodes (corresponding step S130-S140) such as 4,5,6,7,8；
It is worth noting that end herein indicate be step S10 end, i.e., step S20 is executed after the step.
S150: finding the maximum connection relationship of field strength as IP to each lower level node from field strength and distribute foundation, and
Calculate corresponding IP；
S160: host node is that corresponding node distributes IP, return step S130 by network layer instruction.
In the present embodiment, wherein the most strong node communicated with 4,5,6 nodes is 1, therefore 4,5,6 node IPs of distribution=
111,121,131, and the most strong node communicated with 7,8 nodes is 3, therefore distributes 7,8 node IPs=311,321 (corresponding step
S150-S160)；
Acquire neighbor list discovery new node 9, A, B, C, D, E, F (the corresponding step S130- of 4,5,6,7,8 nodes
S140)；
By most strong ties relation allocation IP, node 9, A, B, C, D, E, F IP be respectively 9=1111, A=1211, B=
1221, C=1231, D=3111, E=3121, F=3131 (corresponding step S150-S160)；
The neighbor list for acquiring 9, A, B, C, D, E, F node, does not find extra node, and IP distribution terminates (corresponding step
Rapid S130-S140)；
It is finished at this time with the tree network establishment of best field intensity value building, is received as shown in right side structure figure in Fig. 4, while also
The neighbor list of whole network is collected；
Second stage is network redundancy optimization, as long as a node failure it can be seen from the tree network of Fig. 4, then
The node of carry thereunder can all fail, this is because deleting available company too much when using most strong communication link
Caused by connecing and the drawbacks of single-pathway network.Therefore, the purpose of second stage is: before guaranteeing that optimal path is available
It puts and retains extension available communication number of path as much as possible, is i.e. a node has a plurality of road communicated with host node as far as possible
Diameter.
Second stage includes the following steps:
S200: reading the neighbor list of whole network, constructs matrix with its field intensity value；
First stage has collected the neighbor list of whole network；
S210: field strength minimum is handled, and in every two node, each node records the field strength of other side, takes in two field strength
Smaller value；
In the present embodiment, as unit of node, the neighbor information of each node accounts for a line of matrix, only protects in matrix
Field intensity information is stayed, the row and column at place corresponds to actual node, supplementing with 0 not in neighbor list, as shown in Figure 6；
Due to there is the transmitting-receiving unbalanced problem of field strength in wireless network, i.e., when being communicated between the two nodes, by
The factors such as the antenna of node mounting locations and node direction influence, and the field intensity value mutually received is not necessarily the same, thus
The minimum value for taking two reception field strength can normal communication when guaranteeing that it carries out networking by this field strength.After processing, obtain
Field strength matrix will be a symmetrical field strength square matrix；
Neighbor list is arranged, each node a line, matrix is constructed, as shown in fig. 6, oneself writes the field strength of oneself
0 or FF；
S220: the processing of field strength thresholding, the field strength Compulsory Removal that will be less than preset threshold is 0；
As a kind of preferred embodiment, the process of the processing of field strength thresholding described in step S220 is as follows:
Host node layer and other layers take different threshold values to handle field strength respectively, and host node layer and other layers will be less than
The field strength Compulsory Removal of corresponding preset threshold is 0.
It is understood that in practical applications, it is received since the antenna that different wireless devices uses is different
Field strength also can be different, and in implementation process of the present invention, the antenna of host node and other nodes is inconsistent, for this purpose, not using two
Same threshold value is respectively handled the field intensity value of host node layer and other layers, under two kinds of layers, will be less than the field of respective threshold
Intensity values (it is bad that expression is currently located the corresponding two node communication efficiencies of ranks) Compulsory Removal is 0, and otherwise, field intensity value is converted
To communicate coefficient；Communication coefficient is an assessment to communication efficiency, because there is certain passes for field intensity value and communication efficiency
System, can also simply directly be indicated using field intensity value；
S230: network layer is divided, each node is distributed to different network layers；
As a kind of preferred embodiment, the process that network layer is divided described in step S230 is as follows:
In the field strength square matrix, using statistical method, the connection number of every a line and upper layer node is calculated first, is then pressed
The descending sequence of the connection number of statistics, connection number are the node that node division in non-zero row is this layer network；
After sequence is completed, the field strength square matrix procession is converted；
The connection number is the quantity of non-zero element.
In the present embodiment, specifically, since front has carried out threshold process to field strength, when distinguishing hierarchy
As long as checking node whether in upper one layer of neighbor list；Since obtained matrix is a symmetrical matrix, carried out by row
Processing is carried out handling obtained result and is consistent by column；Discriminant approach in a matrix is that present node is expert at, on
If there is non-zero element in all node columns of layer, then present node can be dispensed on current layer, otherwise node is replaced
It goes to the back；Notice that host node must not be replaced with other nodes, and host node must occur in the first row of matrix, that is, scheme
0th row (i.e. host node) shown in 6 must not be swapped with other rows.
In order to accelerate arithmetic speed, statistical method is introduced, calculates every a line (removing has been layered) and upper layer first
The connection number (i.e. non-zero element number) of node, then by the descending sequence of connection number of statistics, the non-zero row of connection data (or
Node) be this layer network node；After sequence is completed, matrix is applied into row-column transform simultaneously, to guarantee data
Consistency；So circulation, the non-zero Elemental redistribution of obtained matrix is in the two sides of leading diagonal；
As shown in fig. 7, host node is at the 0th layer；Referring initially to the first row, this is the neighbor list of host node, non-zero element institute
The column accounted for are all drawn in the 1st layer network；
Then, the non-zero element of each row on the shared column of the 1st layer network of statistics, (ranks except 1 layer or more) and presses its size
It is ranked up, the node division that the non-zero corresponding row (or column) of statistic is represented is the 2nd layer；
Then, the non-zero element of each row on the shared column of statistics layer 2 network, (ranks except 2 layers or more) in a manner described
Processing；Other layers circular treatment in this way, until all node processings are completed.
S240: calculating optimal communication path, on the communication path, in the communication link of each node and upper layer network, and section
The field strength of point is most strong；
It is understood that be calculated before sub-clustering to guarantee that the optimal communication path of node can be retained
The best overlay communication node of each node out guarantees that these optimal communication nodes are within cluster after sub-clustering, often as far as possible
There are a strongest communication link, the network being made up of this link, as best single-stranded communication lines in a node and upper layer
Diameter, i.e., the path between each node and the best overlay communication node are the optimal communication path；
The acquisition process of the best overlay communication node is as follows:
Corresponding networking matrix is extracted from original matrix, that is, takes upper layer network node column, current layer network node
Constituted matrix (networking matrix) is expert at for the initial data of cluster member division, and it is (i.e. every to calculate every a line in networking matrix
A node) in maximum value position (arranging a node of corresponding upper layer network), which is that the best overlay communicates
Node；
As shown in fig. 7, taking the connection relationship of itself and previous layer network since the 2nd layer, it is alternatively that foundation, in Fig. 7
Data shown in box, matrix as shown in Fig. 8；Its maximum value is found in the every a line of the matrix of Fig. 8, this arranges corresponding upper layer network
Node be exactly optimal communication path；
S250: being calculated by network cluster, increases communication redundancy path；
It is understood that the greatest drawback of single-stranded communication is exactly poor reliability, when one of node failure, pass through
All nodes that this node is communicated will all fail, and improve the reliability of network by increasing communication redundancy path.
Cluster principle 1: can be in communication with each other between the cluster member of any two different levels, as shown in Figure 5, in 5,6
Any one node can be communicated with the node of any one in A, B, C；The pass for being expressed as public (non-zero) subset is closed in collection
System after space transformation and rank transformation (or ranks where extracting cluster member), shows as a non-zero element structure in a matrix
At matrix；
Cluster principle 2: there are independence between cluster and cluster, i.e., cannot have overlapped part between any two cluster,
If there is the part being stacked, then the node of this overlapping can only distribute to one of cluster, and another cluster corresponding element will be all
Clear 0, wherein optimal method is used in assigning process, when being assigned to cluster in this way, guarantee can be maximum with connection number；
First by all nodes on most strong link (the optimal communication path) with identical upper layer node carry out intersection (or
Claim with) operation, i.e., guarantee different layers cluster member between may be implemented to communicate two-by-two, when being handled on matrix, in corresponding column
(in the respective column of the field strength square matrix) if on have one for 0, be all cleared to 0；
By will appear multiple upper layer node branches cluster after above-mentioned processing, then by these branches, cluster is merged, i.e.,
Two tuftlets are merged into a big cluster, combined principle is to guarantee that each node has maximum available connection number, while guaranteeing cluster
It is mutually indepedent between cluster, problem is converted into a demand assignment problem, i.e., seeks the optimization of extreme value under specifying constraint
Problem；
As shown in figure 9, firstly, building tuftlet, first presses the most strong path public relation of cluster principle 1 and merges network, press simultaneously
Cluster principle 2 is handled, and data shown in Fig. 9 are obtained；
Then, merge cluster, combined principle is to reach maximum using destination path quantity, is converted under prescribed conditions
Optimization problem is substantially that the most scheme in a path is obtained in some permutation and combination as output scheme；
Two different clustering methods are set forth in Figure 10 and Figure 11, and the path that wherein method of Figure 10 obtains is greater than figure
11, therefore the method for selecting Figure 10 carries out networking, establishes cyberrelationship with non-zero first number column；I.e. as shown in Figure 10, the 1st row
With upper layer network the 1st, 3 column clusters, the 4th, 6,10 column cluster of 2,3,7,10 rows and upper layer network, 4,5,6,8,9 rows and upper layer 5,
7,8,9 column cluster；
To non-clustering, its sequence is write with network number, cluster is numbered by member；
S260: IP is calculated by allocation rule, and node distributes IP one by one；
Allocation rule specifically includes: allocation order, between layers top-down distribution IP；Inside cluster, due to IP serial number
Small node has preferential forwarding power, therefore small size IP is preferentially distributed to the most node of connection number, to guarantee preferable communication
Effect, as shown in figure 4, distribution trumpet IP111 give No. 5 nodes since the optimal path of A, B, C are all on No. 5 nodes,
Cluster member branch number incremented by successively obtains IP.
In the present invention, field strength thresholding handles part, can also be by realizing different networkings to the definition of transfer function.
Such as, using binarization method, that is, when thinking to be greater than certain value, communication is normal, degenerates for the networking of peer-to-peer network；If by field strength with
Communication efficiency combines, it is believed that the stronger node communication efficiency of field strength is better, and relationship is a non-linear relation, then will
Field intensity value is converted to communication efficiency value, and original calculating maximum path number is converted to and seeks maximum communication effect by this processing method
Fruit value is equivalent to the communication score certain for each path allocation, and total score is highest to think that effect is best.Or seek its failure
Factor, as each path define failure probability, by calculating minimum failure factor to determine optimum network structure.
Figure 12 is the functional block diagram based on the wireless self-networking device routed immediately that one embodiment of the invention provides.
As shown in figure 12 is a kind of based on the wireless self-networking device routed immediately, comprising:
Tree network construction unit 1211a, for constructing tree network: by the institute of wireless sensor network node at the middle and upper levels
There are neighbours as next layer network node, next layer network node is saved based on the maximum node of field strength in a node layer thereon
Point is constituted a tree network being attached with maximum field intensity values, is collected simultaneously the neighbor list of whole network；
Network optimization unit 1211b: it is used for the network optimization: network redundancy optimization being carried out to the tree network, makes one
There are a plurality of communication paths between node and host node.
Due in the present invention based on the wireless self-networking device routed immediately and based on the wireless self-networking routed immediately
Method is one-to-one, therefore this will not be detailed here the device.
Those of ordinary skill in the art will appreciate that: the above embodiments are only used to illustrate the technical solution of the present invention., and
It is non-that it is limited；Although present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art
It is understood that it is still possible to modify the technical solutions described in the foregoing embodiments, either to part of or
All technical features are equivalently replaced；And these are modified or replaceed, it does not separate the essence of the corresponding technical solution this hair
Bright claim limited range.
Claims (10)
1. a kind of based on the wireless self-networking method routed immediately, which comprises the steps of:
S10: building tree network: using all neighbours of wireless sensor network node at the middle and upper levels as next layer network node,
Next layer network node constitutes one using the maximum node of field strength in a node layer thereon as host node with the progress of maximum field intensity values
The tree network of connection is collected simultaneously the neighbor list of whole network；
S20: the network optimization: to the tree network carry out network redundancy optimization, make one between node and host node exist it is more
Communication path；
The building process of tree network described in step S10 is as follows:
S100: host node sends all nodes in Wake on LAN frame wake-up network；
S110: host node sends out networking beacon, and data source address and received field are recorded by force the node for receiving the networking beacon
Neighbor list simultaneously forwards networking beacon；
S120: host node presses the node in neighbor list and receives the descending sequence of field strength, by front preset quantity in sequence
Node division be first layer, and for the first-level nodes calculate and distribute IP；
S130: the neighbor list on the node for having distributed IP is collected, and arranges and obtains its next layer network node；
S140: judging whether there is the unallocated IP of new node, if so, continuing in next step；If it is not, then terminating；
S150: the maximum connection relationship of field strength is found as IP from field strength to each lower level node and distributes foundation, and is calculated
Corresponding IP；
S160: host node is that corresponding node distributes IP, return step S130 by network layer instruction.
2. the method according to claim 1, wherein the process of the optimization of network redundancy described in step S20 is as follows:
S200: reading the neighbor list of whole network, constructs matrix with its field intensity value；
S210: the processing of field strength minimum, in every two node, each node records the field strength of other side, take in two field strength compared with
Small value；
S220: the processing of field strength thresholding, the field strength Compulsory Removal that will be less than preset threshold is 0；
S230: network layer is divided, each node is distributed to different network layers；
S240: calculating optimal communication path, on the communication path, in the communication link of each node and upper layer network, node
Field strength is most strong；
S250: being calculated by network cluster, increases communication redundancy path；
S260: IP is calculated by allocation rule, and node distributes IP one by one.
3. according to the method described in claim 2, it is characterized in that, the first-level nodes described in step S120 be no more than 14,
Extra is divided into next layer.
4. according to the method described in claim 3, it is characterized in that, field strength described in step S210 minimizes the process of processing such as
Under:
Between any two node when two-way communication, each node takes the minimum value for receiving field strength, constructs symmetrical field strength side
Gust, in the field strength square matrix, the node in the neighbor list is not expressed as 0.
5. according to the method described in claim 4, it is characterized in that, field strength thresholding described in step S220 processing process such as
Under:
Host node layer and other layers take different threshold values to handle field strength respectively, and host node layer and other layers will be less than accordingly
The field strength Compulsory Removal of preset threshold is 0.
6. according to the method described in claim 5, it is characterized in that, dividing the process of network layer such as described in step S230
Under:
In the field strength square matrix, using statistical method, the connection number of every a line and upper layer node is calculated first, then by statistics
The descending sequence of the connection number, connection number is the node that node division in non-zero row is this layer network；
After sequence is completed, the field strength square matrix procession is converted；
The connection number is the quantity of non-zero element.
7. according to the method described in claim 6, it is characterized in that, calculating the process in optimal communication path described in step S240
It is as follows:
The best overlay communication node of each node is calculated, the path between each node and the best overlay communication node is
The optimal communication path；
The acquisition process of the best overlay communication node is as follows:
Upper layer network node column, current layer network node is taken to be expert at constituted matrix for group from original field strength matrix
Net matrix, calculates in the networking matrix in every a line that the maximum node position of field strength, the position are column pair in each node
A node of upper layer network is answered, which is the best overlay communication node.
8. the method according to the description of claim 7 is characterized in that the process that network cluster calculates in step S250 is as follows:
By the progress of all nodes and operation on the optimal communication path with identical upper layer node, in the field strength square matrix
In respective column, as long as having one is 0, it all is cleared to 0, to generate multiple upper layer node branches cluster；
Multiple branch's clusters are merged, two tuftlets are merged into a big cluster, there is each node maximum available
Connection number.
9. according to the method described in claim 8, it is characterized in that, being calculated described in step S260 and distributing the process of IP such as
Under:
Top-down distribution IP between layers；
Inside cluster, small size IP is preferentially distributed into the most node of connection number, cluster member branch number incremented by successively obtains IP.
10. a kind of based on the wireless self-networking device routed immediately characterized by comprising
Tree network construction unit, for constructing tree network: by wireless sensor network at the middle and upper levels node all neighbours make
For next layer network node, next layer network node constitutes one using the maximum node of field strength in a node layer thereon as host node
A tree network being attached with maximum field intensity values, is collected simultaneously the neighbor list of whole network；
Network optimization unit is used for the network optimization: carrying out network redundancy optimization to the tree network, makes a node and main section
There are a plurality of communication paths between point；
The building process of the tree network is as follows:
S100: host node sends all nodes in Wake on LAN frame wake-up network；
S110: host node sends out networking beacon, and data source address and received field are recorded by force the node for receiving the networking beacon
Neighbor list simultaneously forwards networking beacon；
S120: host node presses the node in neighbor list and receives the descending sequence of field strength, by front preset quantity in sequence
Node division be first layer, and for the first-level nodes calculate and distribute IP；
S130: the neighbor list on the node for having distributed IP is collected, and arranges and obtains its next layer network node；
S140: judging whether there is the unallocated IP of new node, if so, continuing in next step；If it is not, then terminating；
S150: the maximum connection relationship of field strength is found as IP from field strength to each lower level node and distributes foundation, and is calculated
Corresponding IP；
S160: host node is that corresponding node distributes IP, return step S130 by network layer instruction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610861463.6A CN106304230B (en) | 2016-09-28 | 2016-09-28 | Based on the wireless self-networking method and device routed immediately |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610861463.6A CN106304230B (en) | 2016-09-28 | 2016-09-28 | Based on the wireless self-networking method and device routed immediately |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106304230A CN106304230A (en) | 2017-01-04 |
| CN106304230B true CN106304230B (en) | 2019-06-21 |
Family
ID=57716505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610861463.6A Active CN106304230B (en) | 2016-09-28 | 2016-09-28 | Based on the wireless self-networking method and device routed immediately |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106304230B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107277886B (en) * | 2017-05-18 | 2021-06-04 | 成都实唯物联网科技有限公司 | Internet of things equipment ad hoc network method based on WIFI |
| CN107786390B (en) * | 2017-10-27 | 2020-12-22 | 武汉友讯达科技有限公司 | Method and device for correcting networking nodes |
| CN108965012B (en) * | 2018-07-25 | 2021-08-03 | 国家超级计算无锡中心 | Efficient transmission method of node row-column full-interconnection network |
| CN110839213B (en) * | 2019-10-25 | 2022-06-21 | 南京英锐祺科技有限公司 | Broadcasting method and system |
| CN111369777A (en) * | 2020-04-21 | 2020-07-03 | 深圳芯珑电子技术有限公司 | Maintenance method and maintenance system for low-voltage user electricity consumption information acquisition system |
| CN113316033B (en) * | 2021-05-31 | 2022-07-22 | 宁波迦南智能电气股份有限公司 | Wireless meter reading method based on LORA hierarchical topological network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1988509A (en) * | 2006-12-07 | 2007-06-27 | 中国科学院计算技术研究所 | Method for forming fine convergence gradient in sensor network |
| CN102256324A (en) * | 2011-07-06 | 2011-11-23 | 南京航空航天大学 | Internet-of-things self-organizing network protocol based on tree routing algorithm |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| CN104093182A (en) * | 2014-05-28 | 2014-10-08 | 深圳市有方科技有限公司 | Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network |
| CN105634964A (en) * | 2015-12-21 | 2016-06-01 | 华南师范大学 | Mobile self-organizing network and multicast routing method thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7738402B2 (en) * | 2004-12-23 | 2010-06-15 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
-
2016
- 2016-09-28 CN CN201610861463.6A patent/CN106304230B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1988509A (en) * | 2006-12-07 | 2007-06-27 | 中国科学院计算技术研究所 | Method for forming fine convergence gradient in sensor network |
| CN102256324A (en) * | 2011-07-06 | 2011-11-23 | 南京航空航天大学 | Internet-of-things self-organizing network protocol based on tree routing algorithm |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| CN104093182A (en) * | 2014-05-28 | 2014-10-08 | 深圳市有方科技有限公司 | Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network |
| CN105634964A (en) * | 2015-12-21 | 2016-06-01 | 华南师范大学 | Mobile self-organizing network and multicast routing method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106304230A (en) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106304230B (en) | Based on the wireless self-networking method and device routed immediately | |
| CN110191148B (en) | Statistical function distributed execution method and system for edge calculation | |
| CN102075402B (en) | Virtual network mapping processing method and system | |
| CN100583900C (en) | Radio sensor network data convergence path planning method based on the intelligent agent | |
| CN103415018B (en) | Communication resource allocation method of wireless sensor network | |
| CN105246117B (en) | A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network | |
| CN107343302A (en) | A kind of routing of sensor networks structural optimization method based on polycaryon processor | |
| CN105469143A (en) | Network-on-chip resource mapping method based on dynamic characteristics of neural network | |
| CN104093188A (en) | Novel cluster head election method for wireless sensor networks | |
| CN105208622A (en) | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method | |
| CN105897577A (en) | Immune system-inspired routing recovery method of energy-harvesting wireless sensor networks | |
| CN106354574A (en) | Acceleration system and method used for big data K-Mean clustering algorithm | |
| Seyyedabbasi et al. | HEEL: A new clustering method to improve wireless sensor network lifetime | |
| CN102802163B (en) | A kind of wireless sense network topological construction method based on mixed integer programming | |
| CN102546380B (en) | Modified tree-based multicast routing scheme | |
| CN103987102A (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| CN101394418A (en) | General computation data processing control method based on mobile proxy | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| CN102223385A (en) | Multi-agent-based grid geographic information system (GIS) resource management system | |
| CN110752594B (en) | Power distribution network path optimization method based on improved aggregation hierarchical clustering method | |
| CN115208578A (en) | Unmanned aerial vehicle cluster information consistency sharing method based on block chain | |
| CN103889022A (en) | Method for constructing condition monitoring network routing of photovoltaic power generation system | |
| CN107707471A (en) | The energy-saving scheme of minimum conversion link number based on extensive SDN | |
| Meena et al. | An Analysis of Energy Efficient Clustering based Techniques in WSN | |
| CN106603197A (en) | High-energy-efficiency wireless sensing network data transmission method based on compression network coding |
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 |