CN109560972A - Non-cooperative inference method for Ad Hoc network physical topology - Google Patents
Non-cooperative inference method for Ad Hoc network physical topology Download PDFInfo
- Publication number
- CN109560972A CN109560972A CN201811614989.XA CN201811614989A CN109560972A CN 109560972 A CN109560972 A CN 109560972A CN 201811614989 A CN201811614989 A CN 201811614989A CN 109560972 A CN109560972 A CN 109560972A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- communication distance
- physical topology
- nodes
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
- H04W64/003—Locating users or terminals or network equipment for network management purposes, e.g. mobility management locating network equipment
Abstract
The invention relates to an Ad Hoc network physical topology non-collaborative inference method, and belongs to the technical field of wireless networks. The method comprises the following steps: s1: the nodes in the Ad Hoc network are distinguished and positioned by adopting radio positioning; s2: acquiring the size of a network deployment area according to the node distinguishing and positioning information; s3: calculating the important communication distance of the node according to the size of the network deployment area and the node distinguishing and positioning information; s4: and deducing the network physical topology according to the node distinguishing positioning information and the important communication distance of the node. The invention realizes the automatic inference of the network physical topology under the condition of unknown relevant parameters such as the communication power of the nodes, and the like, and compared with the prior method, the invention improves the structural effectiveness of the network physical topology and reduces the computational complexity of the realization process.
Description
Technical field
The present invention relates to radio network technique fields more particularly to a kind of Ad Hoc network physical topology non-cooperating formula to push away
Disconnected and optimization construction method.
Background technique
Ad Hoc network can realize rapid deployment and without setting up network facilities the features such as makes it in civilian and military
On be all widely used.
The existing research for network topology focuses mainly on logical topology, main in carrying out physical topology analytic process
To be made based on the longest distance of situation or the minimum spanning tree constructed using network node known to node maximum communication distance
For maximum communication distance.Since dangerous area would generally be deployed to, in the feelings of the relevant parameters such as unknown node power of communications
Under condition, it is difficult to obtain the maximum communication distance of node.Use the longest distance of minimum spanning tree does not have as maximum communication distance
Position change occurs every time for the variation for considering the case where individual node is detached from network and cannot successfully managing node location, node
Change will reconfigure minimum spanning tree and calculate longest distance, lead to the increase of computation complexity.
Summary of the invention
In view of above-mentioned analysis, the present invention is intended to provide a kind of Ad Hoc network physical topology non-cooperating formula estimating method,
To solve to have not been obtained the physical topology inference problems of network node or above-mentioned other portions in the case of node device messaging parameter
Divide problem.
The purpose of the present invention is mainly achieved through the following technical solutions:
It include following step the embodiment of the invention provides a kind of Ad Hoc network physical topology non-cooperating formula estimating method
It is rapid: positioning S1: being distinguished using node of the radio-positioning to Ad Hoc network；S2: positioning letter is distinguished according to the node
Breath obtains network and disposes area size；S3: area size is disposed according to the network and the node is distinguished location information and calculated
The important communication distance of egress；S4: inferred according to the important communication distance that the node distinguishes location information and the node
Network physical topology.
Further, geometry control is carried out based on network physical topology of the delaunay triangulation rule to deduction, rejected not
Qualified link completes the optimization of inferred results.
Further, the step S1 is specifically included: being connect using WiMAX receiver to signal in working frequency range
It receives；Signal detection and pretreatment are carried out to the signal received；Using compound angle positioning or digital to node
It is positioned and is distinguished.
Further, the compound angle positioning is based on direction-finding station, by multiple radio monitoring websites to same
Signal carries out direction finding, is positioned using the intersection of direction finding x-ray angle；The digital is based on signal and reaches monitoring station
Time, crossing location is carried out by time gap.
Further, in the step S2, the image information and signal of communication that location information obtains are distinguished according to the node
Estimate the network deployment area size.
Further, in the step S3, according between communication distance formula fitting network connectivity efficiency and important communication distance
Relationship, obtain calculating important communication distance according to the network connectivity efficiency after fitting function.
Further, the calculation formula of the important communication distance:Be guaranteed the minimum of network-in-dialing
Communication distance value；Wherein, n node is deployed in C cell respectively, and all nodes are randomly dispersed in R=[0, l]dRegion
Interior, wherein l is the side length of deployment region, and the communication distance of each node is r, important communication distance rcWith nodes number
There are r with deployment region size for amountc dN=α ldInl relationship, d=2,
Further, the network connectivity efficiency be network in directly connection or multi-hop switching node logarithm and total node pair
Several ratio, calculation formula are as follows:Wherein, n is the sum of nodes, and m is that network is in non-
The quantity of subnet under full-mesh state, i are the number of subnet, niFor the number of nodes for including in subnet i.
Further, in the step S4, according to the node distinguish location information calculate egress between it is European away from
From comparing to determine link between node with the presence or absence of the deduction for completing physical topology by the important communication distance.
Further, when the Euclidean distance between the node be less than given threshold when, determine network physical topological node it
Between company side exist, otherwise it is described even side be not present；The given threshold is the important communication distance of the node.
Above-mentioned technical proposal has the beneficial effect that: the embodiment of the invention discloses a kind of Ad Hoc network physical topologies
Non-cooperating formula estimating method is the following steps are included: S1: distinguishing positioning using node of the radio-positioning to Ad Hoc network；
S2: location information is distinguished according to the node and obtains network deployment area size；S3: area size is disposed according to the network
The important communication distance that location information calculates egress is distinguished with the node；S4: according to the node distinguish location information and
The important communication distance of the node infers network physical topology.The present invention, which solves, has not been obtained node device messaging parameter feelings
Change in location occurs every time for the physical topology inference problems and node of condition lower network node will reconfigure minimum generation
Tree carries out longest distance to calculate the problem of increasing computation complexity.By seeking can be achieved to important communication distance
Connect the judgement on side between node, and then the location information of combination node can realize the deduction of network topology, root on the basis of deduction
Company side ineligible present in network is deleted according to the dependency rule of topology control, realizes the excellent of network physical topology
Change.
Other features and advantages of the present invention will illustrate in the following description, also, partial become from specification
It obtains it is clear that understand through the implementation of the invention.The objectives and other advantages of the invention can be by written explanation
Specifically noted structure is achieved and obtained in book, claims and attached drawing.
Detailed description of the invention
Attached drawing is only used for showing the purpose of specific embodiment, and is not to be construed as limiting the invention, in entire attached drawing
In, identical reference symbol indicates identical component.
Fig. 1 is the planar structure schematic diagram of the Ad Hoc network structure of the embodiment of the present invention；
Fig. 2 is a kind of Ad Hoc network physical topology non-cooperating formula estimating method flow chart of the embodiment of the present invention；
Fig. 3 is the flow diagram that the network physical topology of the embodiment of the present invention is inferred and optimized；
Fig. 4 is the network of triangle schematic diagram of the embodiment of the present invention constructed in the graphic；
Fig. 5 is that two adjacent triangles of the embodiment of the present invention constitute convex quadrangle schematic diagram；
Fig. 6 is that two adjacent triangles of the embodiment of the present invention constitute schematic diagram after convex quadrangle transformation diagonal line；
Fig. 7 is the network connectivity efficiency of the embodiment of the present invention with k value change curve；
Fig. 8 is the network connectivity efficiency and k value relationship fitted figure of the embodiment of the present invention；
Fig. 9 is the different number of nodes lower network connected ratios of the embodiment of the present invention with k value change curve；
Figure 10 is the network connectivity efficiency change curve of 100 experimental results of the embodiment of the present invention；
Figure 11 is the network connectivity efficiency change curve of 1000 experimental results of the embodiment of the present invention；
Figure 12 is the network physical topological structure schematic diagram of the deduction of the embodiment of the present invention；
Figure 13 is the network physical topological structure schematic diagram of the optimization of the embodiment of the present invention；
Figure 14 is the inferred results structural schematic diagram based on MST of the embodiment of the present invention；
Figure 15 is the inferred results structural schematic diagram based on DTG of the embodiment of the present invention.
Specific embodiment
Specifically describing the preferred embodiment of the present invention with reference to the accompanying drawing, wherein attached drawing constitutes the application a part,
And it is not intended to limit the scope of the present invention together with embodiments of the present invention for illustrating the principle of the present invention.
Abbreviation and Key Term definition
Ad Hoc network: the multi-hop that is made of one group of wireless communication node, non-stop layer, self-organizing wireless network, also known as
For multihop network, foundation-free facility network or self-organization network.
Physical topology: wired or wireless physical connection mode between the networking components such as host, interchanger, router.
Ad Hoc network physical topology: it is made of physical communication link between wireless communication node in Ad Hoc network
Topological diagram.
Physical communication link: in network wireless communication node each other within the scope of counterparting communications i.e. think two nodes it
Between there are a physical communication links.
Ad Hoc network structure is broadly divided into layering and two kinds of plane, and technical concept of the invention is mainly for planar junction
Structure, that is, homogeneous network, the node in network use omnidirectional antenna, and node is homogeneity node.Ad Hoc as shown in Figure 1
The planar structure schematic diagram of network structure.The physical topology of network is the set for connecting side between node and node, in node location
In situation known to information, the deduction of physical topology is realized, it is important to which the company's of completion line set is sought.Connect seeking for line set
Key is the judgement of communication distance threshold value, can predicate node in the case that the Euclidean distance between node is less than threshold value
Between company side exist, given threshold is the important communication distance of node herein, and important communication distance is associated with network connectivity efficiency
Closely.By the judgement for seeking can be achieved connecting side between node to important communication distance, and then combine the location information of node
The deduction that network topology can be achieved is deleted according to the dependency rule of topology control on the basis of deduction and is not inconsistent present in network
The optimization of network physical topology is realized on the side of conjunction condition.
Fig. 2 is a kind of Ad Hoc network physical topology non-cooperating formula estimating method flow chart of the invention.
A specific embodiment of the invention, as shown in Fig. 2, disclosing a kind of Ad Hoc network physical topology non-cooperating
Formula estimating method the following steps are included:
S1 distinguishes positioning using node of the radio-positioning to Ad Hoc network；
S2 distinguishes location information according to the node and obtains network deployment area size；
S3 disposes area size according to the network and the node distinguishes location information and calculates the important logical of egress
Communication distance；
S4 infers network physical topology according to the important communication distance that the node distinguishes location information and the node.
It is carried out in physical topology analytic process for existing network topology, in relevant parameters such as unknown node power of communications
In the case where, it is difficult to change in location occurs every time for the maximum communication distance and node for obtaining node will reconfigure minimum
Spanning tree carries out longest distance to calculate the problem of increasing computation complexity.Compared with the conventional method, the present invention realizes section
Network physical topology is inferred under point maximum communication distance unknown situation, or efficiently solves the minimum constructed using network node
The longest distance of the spanning tree problem big as the computation complexity of maximum communication distance.
It should be noted that network physical topology as shown in connection with fig. 3 infers and the flow diagram of optimization, method into
Step refining is as follows:
The step S1 further comprises: being received using broadband receiver to signal in working frequency range；To receiving
Signal carry out signal detection and pretreatment, reject garbage signal, such as noise interference signal；Using compound angle positioning side
Method or digital method are positioned and are distinguished to node.
The step S2 further comprises: according to the image information of acquisition and obtaining signal to the progress of deployment region size
Estimation.
The step S3 further comprises: counterweight on the basis of deployment region size and network node quantity have obtained
Transmission range is wanted to be calculated；Specifically, it is calculated using important communication range formula to network connectivity efficiency and important communication distance
Between relation curve be fitted, seek fitting function；Based on being carried out to important communication distance by the analysis of network connectivity efficiency
It calculates.
The step S4 further comprises: reading the location information of node, counts to the Euclidean distance between node
It calculates；The size for comparing Euclidean distance Yu important communication distance, if Euclidean distance be less than important communication distance if predicate node it
Between there are a physical link, be otherwise not present；Construct adjacency matrix, the connected relation between memory node；According to the position of node
Confidence breath and adjacency matrix infer physical topology.
The step S5 further comprises: being optimized according to topology control rule to the physical topology of acquisition, i.e. basis
The minimum maximized principle in angle constructs delaunay (Delaunay) triangle according to the inferred results in step 4.
A specific embodiment of the invention, based on delaunay triangulation rule to the network physical topology of deduction into
The control of row geometry, rejects ineligible link, completes the optimization of inferred results.
Specifically, most using the intersection of the topological inferred results and the delaunay network of triangle of building as optimization
Final topology inferred results；The building of the delaunay network of triangle is based on empty circle characteristic and minimum angle maximization principle, including with
Lower step:
1, for all nodes existing in network, a triangular is constructed, so that all nodes are comprised in
In triangular, all nodes are put into triangle chained list；
2, it for all nodes in node set, is sequentially inserted into, searching out circumscribed circle in the chained list of triangle includes
It is inserted into the triangle of node, the triangle comprising node is referred to as to influence triangle, deletes the common edge influenced in triangle, will
Insertion point and the whole nodes for influencing triangle connect, and realize insertion of the node in delaunay triangle chained list；
3, the triangle being partially formed is optimized according to minimum angle maximization principle, to two adjacent triangle structures
At convex quadrangle analyzed, exchange the diagonal line in quadrangle, minimum angle is selected in six interior angles no longer to increase the case where
As optimum results, the triangle of formation is added in delaunay triangle chained list；
4, circulation executes above-mentioned step two, completes until all nodes are inserted into.
It will be clear that meet delaunay triangle subdivision, need to meet two important rules: (1) empty circle is special
Property: the triangulation network constructed in the graphic be it is unique, in network any 4 points cannot be concyclic, in the building of delaunay triangle
Other nodes are not present in net within the scope of the circumscribed circle of any triangle；With node a, for b, c, schematic diagram as shown in figure 4,
Other nodes are not present in node a, the triangle of b, c building.(2) minimum angle maximization principle: two adjacent triangle structures
At convex quadrangle, after exchanging diagonal line, the minimum angle in six interior angles no longer becomes larger.As shown in Fig. 5 and Fig. 6, by diagonal line
After bc is changed to ad, minimum angle becomes larger.During constructing delaunay network of triangle, Bowyer-Watson algorithm is used for reference,
It will be understood by those in the art that details are not described herein, specific steps are as described above.The present embodiment is by obtaining delaunay triangle
Building connection line set in side is connected present in shape net, and then is sought raw with the intersection of connection line set in topological inferred results
The connection line set of Cheng Xin finally generates final topological diagram according to node location information and new connection line set.
A specific embodiment of the invention, the step S1 are specifically included: using WiMAX receiver to work frequency
Signal is received in section；Signal detection and pretreatment are carried out to the signal received, to reject interference signal；Using
Compound angle positioning or digital are positioned and are distinguished to node.
Preferably, signal detection and pretreatment are carried out to the signal received in step S1, to reject interference letter
Number, following steps can be further refined as:
S11. Signal Pretreatment is carried out to signal in the working frequency range received, deleted not in demand frequency range
Signal, signal after being pre-processed；
S12. signal detection is carried out to signal after the pretreatment, obtains signal detecting result, the signal detecting result
For the arrival moment of TH-PPM-UWB pulse.
Preferably, in step S11, the Signal Pretreatment includes wavelet noise, is made an uproar with removing the high frequency in reception signal
Sound improves signal-to-noise ratio.Signal Pretreatment uses wavelet Denoising Method, for removing signal high-frequency noises in working frequency range.Signal
Detection is using the related method of average is segmented, for detecting the arrival moment of TH-PPM-UWB pulse.Specifically, segmentation is related average
" new method that ultra-broadband signal detects under a kind of negative signal-to-noise ratio " that method is delivered referring to author Jing Zhenhai, Hua Jun, Yang little Niu, this
Place repeats no more.It is noted that TH-PPM-UWB pulse has direction.
A specific embodiment of the invention, the compound angle positioning are based on direction-finding station, pass through multiple radio
Monitoring station carries out direction finding to the same signal, is positioned using the intersection of direction finding x-ray angle；The digital base
Reach the time of monitoring station in signal, crossing location is carried out by time gap.That is, passing through compound angle positioning side
Method or digital method position each node in above-mentioned nodal information testing result.
A specific embodiment of the invention in the step S2, distinguishes the figure that location information obtains according to the node
As information and signal of communication estimate the network deployment area size.That is, being obtained according to the reconnaissance of radio-positioning
Network disposes area size.
A specific embodiment of the invention, during the step S3 is specific, according to communication distance formula fitting network-in-dialing
Relationship between rate and important communication distance, obtain after fitting function according to the network connectivity efficiency calculate important communication away from
From.
It should be noted that analyzing from the angle of the network coverage important communication distance, will be divided by deployment region
For equal-sized C cell, n communication node is deployed in respectively in C cell, all communication nodes have been disposed
Cheng Hou analyzes the quantity of mentioned null cell, is indicated using μ (n, C).It is assumed that a node quilt
The probability for being deployed in i-th of unit isWherein i=1 ..., C.For important communication distance, there are following theorems.
Theorem 1: for n node, it is assumed that the communication distance of each node be r, all nodes be randomly dispersed in R=[0,
l]dRegion in, wherein d=2, it is assumed that rdN=α ldInl, α > 0, r=r (l) < < l, n=n (l) > > 1.If α >
d·αdOr α=d αdAnd r=r (l) > > 1, then entire traffic diagram is full-mesh, wherein αd=2ddd/2。
Theorem 2: it is assumed that n node deployment is in R=[0, l]dRegion in, wherein d=2, r=r (l) < < l, n=n
(l) > > 1.If rdn∈O(ld), then traffic diagram is not connection.
A specific embodiment of the invention, the calculation formula of the important communication distance:It is protected
Demonstrate,prove the minimal communications distance value of network-in-dialing；Wherein, n node is deployed in C cell, all node random distributions respectively
In R=[0, l]dRegion in, the communication distance of each node is r, important communication distance and nodes quantity and deployment
There are r for area sizec dN=α ldInl relationship, d=2,
It should be noted that according to above-mentioned theorem important communication distance and nodes quantity and deployment region size
There are rc dN=α ldInl.It can guarantee that network is in connected state and the value of α is closely related, setTo the public affairs
Formula carry out transformation can obtain important communication distance calculation formula it is as follows:
Important communication distance can pass throughIt seeks, but its specific value still exists tightly with k value
Close association, k value is too small, it cannot be guaranteed that the network of random placement is in connected state every time, k value is excessive and will lead to network
It is middle that there are excessive redundant links.
A specific embodiment of the invention, the network connectivity efficiency be network in directly connection or multi-hop switching section
The ratio of point logarithm and total node logarithm, calculation formula are as follows:Wherein, n is the total of nodes
Number, m are the quantity that network is in subnet under non-full-mesh state, and i is the number of subnet, niFor the number of nodes for including in subnet i
Amount.
Specifically, the building and relevant calculation of network are completed using NetworkX in python environment, deployment region is big
Small is (1 × 1) km2, the case where for number of nodes being 40 tested, and influence of the different value of K to network connectivity efficiency is analyzed.
K value step-length is set as 0.02,10 experiments is carried out every time, network connectivity efficiency is calculated, obtained result is as shown in Figure 7.
As can be seen from Figure 7 with the continuous increase of k value, there are three phases in the variation of network connectivity efficiency:
(1) in the early stage, with the growth of x, y growth is more slow, and the ratio that at this moment curve rises is more gentle；
(2) in mid-term, with the growth of x, the growth rate of y is gradually speeded, curve rapid increase；
(3) after reaching inflection point, as the growth of the growth y of x is more slow, growth rate levels off to 0, and curve is in water
Flat-shaped development.
The curve that network connectivity efficiency and k value are constituted is similar to growth curve.Growth curve function model, is otherwise known as
Logistic function model.The present embodiment selects widely used skin in Logistic function model in the analysis process
You are fitted the scatterplot constituted in network curve model.
The universal model of Peal growth curve are as follows:
In formula, a is constant, f (x)=b0+b1x+b2x2+....A=is acquired by being fitted to the scatterplot in network
0.995, f (x)=- 16.365x+7.033, the matched curve of formation is as shown in Fig. 8.According to fitting obtain above-mentioned function into
Row calculates, and can obtain connected ratio at 95%, k ≈ 0.63, when connected ratio is 99%, k ≈ 0.75, and as k=0.8, network
Connected ratio is 99.8%, i.e., as k >=0.8, network connectivity efficiency substantially remains in 100% or so.
The case where for number of nodes being respectively 20,40,60,80,100, is tested, and is analyzed different k values and is connected to network
The influence of passband.K value step-length is set as 0.04, carries out testing the mean value for seeking network connectivity efficiency, obtained knot 100 times every time
Fruit is as shown in Figure 9.By the Fitting Calculation to each curve, acquires the network connectivity efficiency as k >=0.8 and substantially remain in 100%
Left and right.
It is practical to carry out testing for 100 times and 1000 times respectively in a simulated environment, and to the average value of the connected ratio of network into
Row statistics, obtained statistical result is as shown in Figure 10 and Figure 11, and wherein Figure 10 is the experimental result for running 100 times, and Figure 11 is fortune
The experimental result that row is 1000 times.
Generally speaking, the maximum transmission distance for realizing network-in-dialing state has been carried out point from the angle of network connectivity efficiency
Analysis, with the increase of maximum transmission distance, the connected ratio of network constantly increases and finally stable 100%.Pass through formula rc 2n
=α l2Inl is enabledThe net that can be obtained in the case where known deployment region size and number of nodes according to fitting
The functional relation of network connected ratio and k obtain the important communication distance of node, and experiment shows the connection of network as k >=0.8
Rate will remain in 100% or so, calculate the important communication distance in the case of k=0.8, and then combine the position of node
The deduction of information realization network physical topology.
A specific embodiment of the invention in the step S4, distinguishes location information according to the node and calculates section
Euclidean distance between point whether there is completion object by the link between node that compares to determine of the important communication distance
Manage the deduction of topology.
Specifically, with node a (xa,ya) and node b (xb,yb) for, the Euclidean distance between two nodes can indicate
Are as follows:The calculation formula of important communication distance:
A specific embodiment of the invention determines net when the Euclidean distance between the node is less than given threshold
Company side between network physical topology node exists, and otherwise the even side is not present；The given threshold is the important of the node
Communication distance.
Preferably, in step S4, following steps further can be specifically refined as:
S41, quantity n, location information and the deployment region size for reading node；
S42, the adjacency matrix A for constructing node, are initialized as null matrix, adjacency matrix is represented by following form:In formula, aijIndicate that the connected relation of i-th of node and j-th of node, i, j are any number in 1~n
Value, n indicates node total number, if there are a link, a between i-th of node and j-th of nodeij=1, otherwise, aij=0；
S43, important communication distance when seeking k=0.8
S44, the node in network is traversed, seeks itself and the Euclidean distance in network between other nodes, namely
According to node location information, the Euclidean distance in all nodes between any two nodes is calculated；
Euclidean distance E and r between S45, comparison nodecSize, if E be less than or equal to rcThen determine to deposit between two o'clock
In a link, it will abut against the corresponding numerical value of matrix and be revised as 1；
S46, according to node location coordinate and adjacency matrix, construct topological diagram.
Ad Hoc network physical topology non-cooperating formula of the present invention infer and the technical effect of optimization method by using
Exata software is built the method that simulated environment as shown in Figure 1 is tested and is verified:
Step 1 builds scene: using the random placement model construction plane Ad Hoc network in Exata software；
Step 2 configures basic parameter: disposing 40 nodes, relevant parameter such as 1 institute of table under simulated environment in deployment region
Show.
| Parameter | Numerical value |
| Number of nodes | 40 |
| Deployment region size | (1×1)km2 |
| Routing Protocol | AODV |
| Decline value | 4dB |
| Communication frequency | 2.4GHz |
| Type of service | CBR |
Table 1
Step 3 calculates important communication distance: it is directed to deployment region size and number of nodes, when setting k value as 0.8, and net
Network connected ratio is calculated close to 100% by important communication range formula, and r can be obtainedc≈332m。
Step 4 physical topology is inferred: according to the Euclidean distance between the positional information calculation node between node, being passed through
It whether there is with the link between node that compares to determine of important transmission range, and then complete the deduction of physical topology.Therefore, it ties
It closes node location information and important communication distance carries out physical topology deduction, obtained physical topology figure is as shown in figure 12.
The optimization of step 5 physical topology: according to the maximized principle in minimum angle, moral is constructed according to the inferred results in step 4
Labor interior triangular net.The optimum results obtained hereby based on delaunay triangulation rule are as shown in figure 13.
It should be noted that the topological and inferred results obtained by maximum communication distance obtained based on geometry
It compares, it is known that, it is set as node maximum transmission distancePhysics topological diagram is constructed (when maximum transmission distance is set
It is set toIn the case where, it can be ensured that the network moment is in connected state, but proposes very high want to the power of node
Ask), minimum spanning tree MST (Minimum spanning tree) and delaunay triangulation DTG (Delaunay are used respectively
Triangulation graph) geometry control is carried out, it is that Figure 12 topology is inferred based on the topological diagram 14 that minimum spanning tree generates
As a result proper subclass.The 93.6% company side that topological diagram is generated based on delaunay triangulation is contained in Figure 12, why not
Can be comprising all connecting side, reason, which is to generate based on DTG, does not consider the increase of communication distance to node power in topological diagram
Influence, by the calculation formula in free space loss model can the increasing of proper communication distance be twice when, path loss increases
6dB, the operating power of node need to be increased to 4 times of original power, account for from energy consumption angle, as shown in connection with fig. 1
Company side between node, such as Figure 15 interior joint 17 and node 37 is not present.Remove the company that do not conform to the actual conditions in network
The topological structure on side, formation is as shown in figure 13, and obtained topological structure is the true of the topological diagram obtained by important transmission range
Subset, to demonstrate the reliability of the method for the present invention inferred results.
In conclusion including following the invention discloses a kind of Ad Hoc network physical topology non-cooperating formula estimating method
Step: positioning S1: is distinguished using node of the radio-positioning to Ad Hoc network；S2: it is distinguished and is positioned according to the node
Acquisition of information network disposes area size；S3: area size is disposed according to the network and the node distinguishes location information meter
Calculate the important communication distance of node；S4: it is pushed away according to the important communication distance that the node distinguishes location information and the node
Circuit network physical topology.The present invention carries out in physical topology analytic process for existing network topology, communicates in unknown node
In the case where the relevant parameters such as power, it is difficult to which change in location occurs every time for the maximum communication distance and node for obtaining node all
Minimum spanning tree is reconfigured longest distance is carried out to calculate the problem of increasing computation complexity.Compared with the conventional method,
The present invention, which realizes, infers network physical topology under node maximum communication distance unknown situation, or efficiently solves using network
The longest distance of the minimum spanning tree of the node building problem big as the computation complexity of maximum communication distance.
It will be understood by those skilled in the art that realizing all or part of the process of method in above-described embodiment, can pass through
Computer program is completed to instruct relevant hardware, and the program can be stored in computer readable storage medium.Its
In, the computer readable storage medium is disk, CD, read-only memory or random access memory etc..
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited to
This, anyone skilled in the art in the technical scope disclosed by the present invention, the variation that can readily occur in or replaces
It changes, should be covered by the protection scope of the present invention.
Claims (10)
1. a kind of Ad Hoc network physical topology non-cooperating formula estimating method, which comprises the following steps:
S1: positioning is distinguished using node of the radio-positioning to Ad Hoc network；
S2: location information is distinguished according to the node and obtains network deployment area size；
S3: according to the network dispose area size and the node distinguish location information calculate the important communication of egress away from
From；
S4: network physical topology is inferred according to the important communication distance that the node distinguishes location information and the node.
2. the method according to claim 1, wherein further comprising based on delaunay triangulation rule to pushing away
Disconnected network physical topology carries out geometry control, rejects ineligible link, completes the optimization of inferred results.
3. the method according to claim 1, wherein the step S1 is specifically included:
Signal in working frequency range is received using WiMAX receiver；
Signal detection and pretreatment are carried out to the signal received；
Node is positioned and distinguished using compound angle positioning or digital.
4. according to the method described in claim 3, it is characterized in that, compound angle positioning is passed through based on direction-finding station
Multiple radio monitoring websites carry out direction finding to the same signal, are positioned using the intersection of direction finding x-ray angle；
The digital reaches the time of monitoring station based on signal, carries out crossing location by time gap.
5. the method according to claim 1, wherein distinguishing positioning letter according to the node in the step S2
It ceases the image information obtained and signal of communication estimates the network deployment area size.
6. the method according to claim 1, wherein in the step S3, according to communication distance formula fitting net
Relationship between network connected ratio and important communication distance obtains after fitting function being calculated according to the network connectivity efficiency important logical
Communication distance.
7. according to the method described in claim 6, it is characterized in that, the calculation formula of the important communication distance:Be guaranteed the minimal communications distance value of network-in-dialing；
Wherein, n node is deployed in C cell respectively, and all nodes are randomly dispersed in R=[0, l]dRegion in, Mei Gejie
The communication distance of point is r, and there are r for important communication distance and nodes quantity and deployment region sizec dN=α ldInl is closed
System, d=2,
8. according to the method described in claim 6, it is characterized in that, the network connectivity efficiency be network in directly connection or multi-hop
The ratio of the node logarithm of switching and total node logarithm, calculation formula are as follows:
Wherein, n is the sum of nodes, and m is the quantity that network is in subnet under non-full-mesh state, and i is the volume of subnet
Number, niFor the number of nodes for including in subnet i.
9. the method according to claim 1, wherein distinguishing positioning letter according to the node in the step S4
Breath calculates the Euclidean distance between egress, compares to determine whether link between node is deposited by the important communication distance
In the deduction to complete physical topology.
10. according to the method described in claim 9, it is characterized in that, when the Euclidean distance between the node is less than setting threshold
When value, determine that the company side between network physical topological node exists, otherwise the even side is not present；The given threshold is described
The important communication distance of node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811614989.XA CN109560972B (en) | 2018-12-27 | 2018-12-27 | Non-cooperative inference method for Ad Hoc network physical topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811614989.XA CN109560972B (en) | 2018-12-27 | 2018-12-27 | Non-cooperative inference method for Ad Hoc network physical topology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109560972A true CN109560972A (en) | 2019-04-02 |
| CN109560972B CN109560972B (en) | 2021-07-27 |
Family
ID=65871469
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811614989.XA Active CN109560972B (en) | 2018-12-27 | 2018-12-27 | Non-cooperative inference method for Ad Hoc network physical topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109560972B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113411197A (en) * | 2021-04-28 | 2021-09-17 | 西安电子科技大学 | Non-cooperative key node identification method without prior topological information |
| JP7074941B1 (en) * | 2022-01-31 | 2022-05-24 | 東京瓦斯株式会社 | Topology estimation system and topology estimation method |
| CN114826933A (en) * | 2022-06-29 | 2022-07-29 | 中国人民解放军国防科技大学 | Non-cooperative topology inference method based on unknown node positions |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104661236A (en) * | 2015-02-16 | 2015-05-27 | 河海大学 | Wireless multi-hop network modeling method and simulation platform |
| US20170237647A1 (en) * | 2016-02-17 | 2017-08-17 | Dell Products L.P. | Virtual network function resource allocation and management system |
| CN107888425A (en) * | 2017-11-27 | 2018-04-06 | 北京邮电大学 | The network splitting and disposing method and apparatus of GSM |
-
2018
- 2018-12-27 CN CN201811614989.XA patent/CN109560972B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104661236A (en) * | 2015-02-16 | 2015-05-27 | 河海大学 | Wireless multi-hop network modeling method and simulation platform |
| US20170237647A1 (en) * | 2016-02-17 | 2017-08-17 | Dell Products L.P. | Virtual network function resource allocation and management system |
| CN107888425A (en) * | 2017-11-27 | 2018-04-06 | 北京邮电大学 | The network splitting and disposing method and apparatus of GSM |
Non-Patent Citations (1)
| Title |
|---|
| NIU ZHAO: "《Research Non-cooperative Topology Inference Method Based on Node Location Information》", 《IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113411197A (en) * | 2021-04-28 | 2021-09-17 | 西安电子科技大学 | Non-cooperative key node identification method without prior topological information |
| JP7074941B1 (en) * | 2022-01-31 | 2022-05-24 | 東京瓦斯株式会社 | Topology estimation system and topology estimation method |
| CN114826933A (en) * | 2022-06-29 | 2022-07-29 | 中国人民解放军国防科技大学 | Non-cooperative topology inference method based on unknown node positions |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109560972B (en) | 2021-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110138764B (en) | Attack path analysis method based on hierarchical attack graph | |
| Frikha et al. | Reinforcement and deep reinforcement learning for wireless Internet of Things: A survey | |
| Rajaram et al. | Multi-hop optimized routing algorithm and load balanced fuzzy clustering in wireless sensor networks | |
| CN102546059B (en) | Non-supervision clustering-based distributed cooperative spectrum sensing method for cognitive self-organizing network | |
| CN109560972A (en) | Non-cooperative inference method for Ad Hoc network physical topology | |
| Shi et al. | Coverage in battery-free wireless sensor networks | |
| CN103747537B (en) | Wireless sensor network outlier data self-adaption detecting method based on entropy measurement | |
| Jain | A coherent approach for dynamic cluster-based routing and coverage hole detection and recovery in bi-layered WSN-IoT | |
| CN109688540A (en) | Ad Hoc network physical topology non-cooperative inference system | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| Mittal et al. | Data clustering in wireless sensor network implemented on self organization feature map (SOFM) neural network | |
| CN108289285A (en) | A kind of ocean wireless sensor network is lost data and is restored and reconstructing method | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| Boualem et al. | A fuzzy/possibility approach for area coverage in wireless sensor networks | |
| Bharany et al. | Energy Efficient Clustering Protocol for FANETS Using Moth Flame Optimization. Sustainability 2022, 14, 6159 | |
| CN109451429A (en) | Ad Hoc network virtual backbone node identification method | |
| CN109526016B (en) | Ad Hoc network virtual backbone node identification system | |
| Jiang et al. | Dynamic spectrum access for femtocell networks: A graph neural network based learning approach | |
| Xiao et al. | Adaptive freeshape clustering for balanced energy saving in the WirelessHART networks | |
| Cai et al. | Sensor network traffic load prediction with markov random field theory | |
| CN107241778B (en) | WSN weighted transmission topology discovery method and system based on data tracing | |
| Lam et al. | A high energy efficiency approach based on fuzzy clustering topology for long lifetime in wireless sensor networks | |
| CN112188518A (en) | Sensor node communication optimization method and device and readable storage medium | |
| Singh et al. | Performance improvement in AODV routing protocol with artificial intelligence | |
| Bhowmik et al. | A fuzzy communication model of sensor nodes in wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |