CN106211219A  A kind of lost contact node dynamic testing method of Adhoc net  Google Patents
A kind of lost contact node dynamic testing method of Adhoc net Download PDFInfo
 Publication number
 CN106211219A CN106211219A CN201610421288.9A CN201610421288A CN106211219A CN 106211219 A CN106211219 A CN 106211219A CN 201610421288 A CN201610421288 A CN 201610421288A CN 106211219 A CN106211219 A CN 106211219A
 Authority
 CN
 China
 Prior art keywords
 node
 lost contact
 coordinate
 adhoc
 communication range
 Prior art date
Links
 238000004891 communication Methods 0 abstract 3
 230000002829 reduced Effects 0 abstract 1
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W24/00—Supervisory, monitoring or testing arrangements
 H04W24/04—Arrangements for maintaining operational condition

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W84/00—Network topologies
 H04W84/18—Selforganising networks, e.g. adhoc networks or sensor networks

 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/025—Services making use of location information using location based information parameters
Abstract
Description
Technical field
The invention belongs to radio network technique field, particularly relate to the lost contact node dynamic testing method of a kind of Adhoc net.
Background technology
Ad hoc net is the wireless network of a dispersal pattern, is also called multihop network (Multihop Network), without base Infrastructure net (Infrastructureless Network) or selforganization network (Selforganizing Network), be a little To point, because it does not relies on the infrastructure being preexisting in, the router of such as wired network, the connecing of structural wireless network Access point.On the contrary, each node is by participating in route for other node for data forwarding, so adhoc net is to connect based on network to move Which node for data forwarding is state determine by.Owing to Ad Hoc network is by mobile node oneself independent assortment, do not rely on wired Equipment, therefore, has the stronger property organized certainly, is well suited for the severe communication environment in battlefield.The finiteness of the energy and the movement of node Property cause node may to separate with network at any time, when network failure, detection lost contact node for improve network reliable Property, effectiveness is most important, in order to takes to strengthen and launches the measure such as power to ensure the reliability of network, accessibility and handling up Amount.
It is not enough that the reason causing node lost contact is probably node electricity, it is also possible to the lost contact caused due to node motion. The method of existing detection lost contact node, mostly based on Topology Discovery, utilizes topology discovery algorithm to update network topology Relational matrix, then sets up adjacency matrix, isolates unreachable subnet by the method for topological separation, then according to node or link Probability of malfunction failure judgement node.This method when node motion speed quickly time can cause the Topology Discovery program can not be timely With new adjacency matrix, accuracy declines.The method given out a contract for a project is utilized to monitor lost contact node in real time, in order to be applicable to catenet, fall Low traffic, author utilize clustering algorithm by network cluster dividing, bunch in set up the spanning tree with bunch head as root, from leaf node Starting to progressively transmitting neighbor information to root node, root node arranges neighbor information, judges lost contact node with this.
Summary of the invention
It is an object of the invention to provide the lost contact node dynamic testing method of a kind of Adhoc net, it is intended to solve owing to opening up Flutter discovery procedure to have time delay and cause the relatively low problem of algorithm accuracy.
The present invention is achieved in that the lost contact node dynamic testing method that a kind of Adhoc nets, the mistake of described Adhoc net By 3 nodes, interlink point dynamic testing method judges that mobile node whether lost contact and multiple node obtain lost contact node in network Two kinds of models, for network and the joint movements speed of different scales, according in the geographical position periodic detection network of node Node whether lost contact.
Further, the lost contact each mobile node of node dynamic testing method of described Adhoc net is equipped with a GPS device, Obtain node coordinate in real time, then judge the node whether having lost contact in network according to the communication range of coordinate He each node； A certain node is in the communication range then node not lost contact of other any node, and node is not at the communication range of any node In, then node lost contact.
Further, in the case of described 3 nodes, there are 1 mobile node, 2 stationary nodes, obtain every time interval t Take the coordinate of mobile node, in the range of a certain node communication, whether judge this node whether lost contact by calculating；
N_{1}It is a removable node, N_{2}, N_{3}It is all stationary nodes, node N_{1}Random mobile, node N_{2,}N_{3}Communication range For 400m, every time interval t decision node N_{1}Whether lost contact；At t_{1}Moment, as node N_{1}The position p moved to_{1}Time, calculate p_{1} To N_{2}Distance find p_{1}To N_{2}Distance more than node N_{2}Communication range, it can thus be appreciated that now N_{1}Neither at node N_{2}Scope In communication, the most no longer node N_{3}Communication range in, node N_{1}It is judged as lost contact node；At t_{2}Moment works as node N_{1}Move to Position p_{2}, calculate p_{2}To N_{3}Distance find calculate p_{2}To N_{3}Distance more than N_{3}Communication range, it can thus be appreciated that N_{1}At node N_{3} Communication range in, then node N_{1}It is judged as nonlost contact node.t_{3}Moment N_{1}Again out of N_{2}, N_{3}Communication range, become lose Interlink point.
Further, the plurality of node obtains lost contact node in network and includes:
For the node n of some state to be detected, the coordinate of node n isThe communication range of node is R, can The abscissa of the node that can connect with it and the scope of vertical coordinate are respectivelyWithThen Calculate node n with this in the range of the distance of other nodes, the computing formula of distance isIf Distance just can be attached thereto less than communication range so node n of other nodes, if distance is more than the communication model of other nodes Enclose and cannot be attached thereto；If there being node to be connected with node n, by the node that is connected with node n from the set of node of state to be determined Conjunction being removed, if not finding, being lost contact node by this vertex ticks, continue to judge the node of other states to be detected.
Further, described determine the range of nodes may being connected with a certain node, by all nodes according to first arranging by xaxis Sequence, then sort by yaxis, from the beginning of the node that x coordinate is minimum, from left to right, judging the state of each node successively, the time is complicated Degree N*log2n.
Further, first node is sorted according to x coordinate, be N after sequence_{1}、N_{2}、N_{3}、N_{4}、N_{5}、N_{6}、N_{7}、N_{8}；Then from node The node N that in network, abscissa is minimum_{1}Start to judge successively the state of each node；Decision node N_{1}State time, by x coordinate Scope be limited toIn, judge N according to x coordinate order successively_{1}Whether can be with N_{2}、N_{3}、N_{4}Connect, until N_{5} Coordinate range exceedsAnd can be with N_{1}The node N connected_{2}、N_{3}、N_{4}And N_{1}Status indication be 1, and by flag tag be Judged.Then judge that remaining node also not judged, next node are N by abovementioned steps_{5}。
Farther include:
Input: coordinate array position [N] of N number of node, communication range R；
Output: lost contact node set Disconnectedset
Sort(position.x)；// node coordinate pressed abscissa sequence
The present invention provides the lost contact node dynamic testing method that Adhoc nets, and each mobile node is equipped with a GPS system, Can obtain the geographical position of node in real time, time delay is substantially reduced, and the result obtained is more accurate.
The method of the present invention only need to periodically obtain the geographical position of mobile node, and by calculating Distance Judgment between node Whether lost contact, fairly simple.And topological separation algorithm is based on topology discovery algorithm, topology discovery algorithm is also a research Direction, is used for setting up relational matrix and adjacency matrix.Algorithm based on spanning tree is firstly the need of by network cluster dividing, after subclustering Spanning tree is set up again by transmitting information to gather information to root node in each bunch, relative complex.
The present invention is compared with topological separation algorithm, and speed is under the speed of 20m/s, and the accuracy rate of topological separation algorithm exists Less than 80%, and the algorithm of the present invention is more than 90%.It can thus be appreciated that speed on the impact of the algorithm in the present invention than topology Separation algorithm is little.And topological separation algorithm is applicable to mininet, and the algorithm in the present invention under catenet, accuracy rate is also The highest.And spanning tree algorithm is when there being 30 nodes in network, and when having 3 mobile nodes, Average Accuracy is 77%, accurately Rate is minimum.
The algorithm of the present invention just can obtain result it is not necessary to send data according only to the communication range of geographical position and node Bag.Topological separation algorithm needs to use topology discovery algorithm, and node each for mininet periodically finds topology, catenet The traffic is reduced by the method for level.Although the method for spanning tree greatly reduces the traffic by setting up spanning tree, but Still thousands of packets can be produced.
The present invention proposes the communication range according to geographical position and node and carrys out decision node whether lost contact, respectively illustrates Judge the state of a node and the situation of the state of multiple node, and by reducing algorithm complex by coordinate sequence, according to Simulation result understands, and this method is used in due to the mobile node lost contact caused, and this method traffic is few, and accuracy rate height also can For catenet.Method in the present invention is also easy to the situation expanding to detect power off, as long as will determine that lost contact Can standard change a certain node in the distance according to two nodes is whether less than communication range into and receive to another node the other side that gives out a contract for a project Arrive.And obtain node coordinate except being equipped with GPS device to each node, it is also possible to use relative position algorithm.Position relatively is calculated Method refers to exist in network node known to a small amount of position (referred to as anchor node or beaconing nodes), and its position can be positioned by GPS The means such as equipment obtain.The node of other LocationUnknowns in addition to anchor node is referred to as unknown node, and unknown node saves from anchor Point obtains relevant information, and completes the location of selfposition according to localization method.The present invention is also easy to expand to threedimensional Situation, as long as changing by the position of node as the method for expressing (x of threedimensional into_{0},y_{0},z_{0}), and by two node (x_{0},y_{0},z_{0}) and (x_{1}, y_{1},z_{1}) distance computing formula change the distance computing formula of calculating of threedimensional coordinate into
Accompanying drawing explanation
Fig. 1 is network model's schematic diagram of 3 nodes that the embodiment of the present invention provides.
Fig. 2 is the t that the embodiment of the present invention provides_{i}The position view of each node of moment.
Fig. 3 is the algorithm accuracy rate contrast schematic diagram that the embodiment of the present invention provides；
In figure: the accuracy rate of (a) inventive algorithm；The fault diagnosis accuracy rate of (b) topological separation algorithm.
Detailed description of the invention
In order to make the purpose of the present invention, technical scheme and advantage clearer, below in conjunction with embodiment, to the present invention It is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not used to Limit the present invention.
The present invention is equipped with a GPS device to each mobile node, can obtain node coordinate in real time, then according to coordinate and The communication range of each node judges the node whether having lost contact in network.If a certain node is in the logical of other any node Letter scope then this node not lost contact, if this node is not in the communication range of any node, then node lost contact.
Below in conjunction with specific embodiment, the application principle of the present invention is explained in detail.
1, problem describes
There is mobile node in netting due to adhoc, topology frequently change can be caused.In order to grasp the state of node, Mei Geshi Between be spaced t the node in network is carried out dynamic monitoring, find out lost contact node.Assume to detect time t in ith_{i}Time, node n Coordinate beNode N is at t_{i}The state in moment is S_{n}。
Introducing two kinds of models separately below, the first is in the case of only 3 nodes, has a mobile node, sentences This node disconnected whether lost contact.The second is in the case of having a lot of nodes, obtains the lost contact node in network.
1.1 states judging individual node
In the case of 3 nodes, having 1 mobile node, 2 stationary nodes, in order to dynamically detect the shape of mobile node State, needs to obtain the coordinate of mobile node every time interval t, by calculating whether it sentences in the range of a certain node communication This node disconnected whether lost contact.
As it is shown in figure 1, N_{1}It is a removable node, N_{2}, N_{3}It is all stationary nodes, node N_{1}Random mobile, node N_{2}, N_{3} Communication range be 400m, every time interval t decision node N_{1}Whether lost contact.At t_{1}Moment, as node N_{1}The position moved to p_{1}Time, from the result of calculation in table 1, now N_{1}Neither at node N_{2}Range communication in, the most no longer node N_{3}Communication model In enclosing, node N_{1}It is judged as lost contact node.In the t2 moment as node N_{1}The position p moved to_{2}, can by the result of calculation in table 1 Know N_{1}At node N_{3}Communication range in, then node N_{1}It is judged as nonlost contact node.t_{3}Moment N_{1}Again out of N_{2}, N_{3}Communication Scope, becomes lost contact node.
Table 1 example
1.2 states judging multiple node
In order to judge the state of all nodes in network, if to all nodes all according to the method for abovementioned individual node, Judge whether it can connect with other any node, a lot of double counting can be produced.And for the joint of some state to be detected Point n, the most within the specific limits, node at a distance can not connect the node that can connect with him with him, the most first may be with it In the range of the node being connected narrows down to one.The coordinate of node n isThe communication range of node is R, may with it even On the abscissa of node and the scope of vertical coordinate be respectivelyWithThen this joint is judged Whether point is connected with the node in the range of this.If there being node to be connected with this node, the node these being attached thereto is to be determined The node set of state being removed, if not finding, being lost contact node by this vertex ticks, continue to judge other shapes to be detected The node of state.
The range of nodes may being connected with a certain node for the determination being more prone to, by all nodes according to first by xaxis Sequence, then sort by yaxis, the node minimum from x coordinate starts said process, from left to right, judges the shape of each node successively State, time complexity N*log2n.
Such as Fig. 2, it is a certain moment t_{i}Time each node position view, first by node according to x coordinate sort, after sequence For N_{1}、N_{2}、N_{3}、N_{4}、N_{5}、N_{6}、N_{7}、N_{8}.Then the node N that abscissa is minimum from meshed network_{1}Start to judge each node successively State.Decision node N_{1}State time, the scope of x coordinate is limited toIn, suitable according to x coordinate successively Sequence judges N_{1}Whether can be with N_{2}、N_{3}、N_{4}Connect, until N_{5}Coordinate range exceedsAnd can be with N_{1}The node N connected_{2}、N_{3}、 N_{4}And N_{1}Status indication be 1, and by flag tag for judge.Then remaining joint also not judged is judged by abovementioned steps Point, next node is N_{5}。
False code is as follows:
2 simulation results and method comparison
2.1 simulation result
Different joint movements speed and network size, based on opnet, are emulated by emulation, make with Average Accuracy For evaluation index.Average Accuracy is defined as:
ADA=detects detection number of times × 100% (2) of successful number of times/total
The parameter used in simulation process is as shown in table 2.
The mobility model of node uses random waypoint model, random waypoint model be by David B Johnson and DavidA.Maltz et al. proposes, and the emulation by MANET agreement is widely used afterwards.The motion that this model describes is, node Moving in a certain territorial scope, from the off, each node first stops a time out, then selects next target, In (0, maximal rate), randomly choose the speed of this time movement simultaneously, then move with this constantvelocity towards target, after arrival Repeat abovementioned steps pause and select.
Simulation result is as shown in table 3, and simulation result shows when network size increases, and Average Accuracy declines.This be due to When network size increases, the calculating time of algorithm increases, and adds GPS device and obtains the time delay in geographical position, and network state is Probability through changing increases.In table, the contrast of the accuracy rate under friction speed shows when the maximal rate of node motion increases, Average Accuracy declines.This is because node speed increases, the rate of change of topology also can increase.
Table 3 experimental result
2.2 method comparison
The problem that the present invention solves is only to find out the node lost contact caused due to node motion, and topological separation algorithm and life Become tree algorithm can find out the node lost contact caused due to node motion and other reasons simultaneously.Below from realizing difficulty, accurately Rate and three aspects of the traffic compare the algorithm of the present invention and topological separation algorithm and spanning tree algorithm.
2.2.1 difficulty is realized
The method of the present invention only need to periodically obtain the geographical position of mobile node, and by calculating Distance Judgment between node Whether lost contact, fairly simple.And topological separation algorithm is based on topology discovery algorithm, topology discovery algorithm is also a research side To, it is used for setting up relational matrix and adjacency matrix.Algorithm based on spanning tree firstly the need of by network cluster dividing, after subclustering Spanning tree is set up again by transmitting information to gather information to root node in each bunch, relative complex.
2.2.2 accuracy rate
Fig. 3 (a) is the accuracy rate of the algorithm of the present invention, and Fig. 3 (b) is topological separation algorithm in heterogeneous networks scale and Fault diagnosis accuracy rate under big speed, contrast understands, and speed is under the speed of 20m/s, and the accuracy rate of topological separation algorithm exists Less than 80%, and the algorithm of the present invention is more than 90%.It can thus be appreciated that speed on the impact of the algorithm in the present invention than topology Separation algorithm is little.And topological separation algorithm is applicable to mininet, and the algorithm in the present invention under catenet, accuracy rate is also The highest.And spanning tree algorithm is when there being 30 nodes in network, and when having 3 mobile nodes, Average Accuracy is 77%, accurately Rate is minimum.
2.2.3 the traffic
The algorithm of the present invention just can obtain result it is not necessary to send data according only to the communication range of geographical position and node Bag.Topological separation algorithm needs to use topology discovery algorithm, and node each for mininet periodically finds topology, catenet The traffic is reduced by the method for level.Although the method for spanning tree greatly reduces the traffic by setting up spanning tree, but Still thousands of packets can be produced.
The present invention proposes the communication range according to geographical position and node and carrys out decision node whether lost contact, respectively illustrates Judge the state of a node and the situation of the state of multiple node, and by reducing algorithm complex by coordinate sequence, according to Simulation result understands, and this method is used in due to the mobile node lost contact caused, and this method traffic is few, and accuracy rate height is also Catenet can be used for.Method in the present invention is also easy to the situation expanding to detect power off, as long as will determine that mistake Whether the standard of connection changes a certain node into from a certain node in the communication range of another node is given out a contract for a project the other side to another node Can receive, and except using GPS device to obtain node coordinate, it is also possible to using relative position algorithm, the present invention also can expand Exhibition is to threedimensional situation.
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all essences in the present invention Any amendment, equivalent and the improvement etc. made within god and principle, should be included within the scope of the present invention.
Claims (8)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

CN201610421288.9A CN106211219A (en)  20160614  20160614  A kind of lost contact node dynamic testing method of Adhoc net 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

CN201610421288.9A CN106211219A (en)  20160614  20160614  A kind of lost contact node dynamic testing method of Adhoc net 
Publications (1)
Publication Number  Publication Date 

CN106211219A true CN106211219A (en)  20161207 
Family
ID=57453121
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

CN201610421288.9A CN106211219A (en)  20160614  20160614  A kind of lost contact node dynamic testing method of Adhoc net 
Country Status (1)
Country  Link 

CN (1)  CN106211219A (en) 
Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

CN101252495A (en) *  20080306  20080827  北京航空航天大学  Wireless sensor network local type node managing method 
CN102209331A (en) *  20110531  20111005  河海大学常州校区  Node positioning method of irregular transmission model in wireless sensor network 
CN103167042A (en) *  20130407  20130619  常熟理工学院  Medical realtime monitoring system based on all IP (internet protocol) wireless sensor network 
US20150365285A1 (en) *  20140611  20151217  Amplisine Labs, LLC  Ad hoc wireless mesh network 

2016
 20160614 CN CN201610421288.9A patent/CN106211219A/en active Search and Examination
Patent Citations (4)
Publication number  Priority date  Publication date  Assignee  Title 

CN101252495A (en) *  20080306  20080827  北京航空航天大学  Wireless sensor network local type node managing method 
CN102209331A (en) *  20110531  20111005  河海大学常州校区  Node positioning method of irregular transmission model in wireless sensor network 
CN103167042A (en) *  20130407  20130619  常熟理工学院  Medical realtime monitoring system based on all IP (internet protocol) wireless sensor network 
US20150365285A1 (en) *  20140611  20151217  Amplisine Labs, LLC  Ad hoc wireless mesh network 
Similar Documents
Publication  Publication Date  Title 

Youssef et al.  Overlapping multihop clustering for wireless sensor networks  
Dimokas et al.  Energyefficient distributed clustering in wireless sensor networks  
Zhao et al.  Collaborative signal and information processing: an informationdirected approach  
Bholowalia et al.  EBKmeans: A clustering technique based on elbow method and kmeans in WSN  
Tseng et al.  Location tracking in a wireless sensor network by mobile agents and its data fusion strategies  
Gandham et al.  Distributed minimal time convergecast scheduling in wireless sensor networks  
Öztürk et al.  Artificial bee colony algorithm for dynamic deployment of wireless sensor networks  
Chang et al.  CODA: A continuous object detection and tracking algorithm for wireless ad hoc sensor networks  
Velmani et al.  An efficient clustertree based data collection scheme for large mobile wireless sensor networks  
Yadav et al.  Localization scheme for three dimensional wireless sensor networks using GPS enabled mobile sensor nodes  
Pan et al.  Address assignment and routing schemes for ZigBeebased longthin wireless sensor networks  
Zhang et al.  Finegrained localization for multiple transceiverfree objects by using RFbased technologies  
Tran et al.  OCO: Optimized communication & organization for target tracking in wireless sensor networks  
Khoufi et al.  Survey of deployment algorithms in wireless sensor networks: coverage and connectivity issues and challenges  
Hara  Quantifying impact of mobility on data availability in mobile ad hoc networks  
Pinto et al.  An approach to implement data fusion techniques in wireless sensor networks using genetic machine learning algorithms  
Abuarqoub et al.  Dynamic clustering and management of mobile wireless sensor networks  
Misra et al.  Information warfareworthy jamming attack detection mechanism for wireless sensor networks using a fuzzy inference system  
Förster et al.  Optimal cluster sizes for wireless sensor networks: An experimental analysis  
Sohrabi et al.  Methods for scalable selfassembly of ad hoc wireless sensor networks  
Chandrashekar et al.  Providing full connectivity in large adhoc networks by dynamic placement of aerial platforms  
Alaybeyoglu et al.  Tracking fast moving targets in wireless sensor networks  
Wu et al.  Mobile sensor networks self localization based on multidimensional scaling  
Xing et al.  Square regionbased coverage and connectivity probability model in wireless sensor networks  
Ratnaraj et al.  OEDSR: Optimized energydelay subnetwork routing in wireless sensor network 
Legal Events
Date  Code  Title  Description 

C06  Publication  
PB01  Publication  
C10  Entry into substantive examination  
SE01  Entry into force of request for substantive examination 