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 PDF

Info

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
Application number
CN201610421288.9A
Other languages
Chinese (zh)
Inventor
刘立芳
陆春燕
齐小刚
胡绍林
杨国平
Original Assignee
西安电子科技大学
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 西安电子科技大学 filed Critical 西安电子科技大学
Priority to CN201610421288.9A priority Critical patent/CN106211219A/en
Publication of CN106211219A publication Critical patent/CN106211219A/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/04Arrangements for maintaining operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02Services making use of location information
    • H04W4/025Services making use of location information using location based information parameters

Abstract

The invention discloses the lost contact node dynamic testing method of a kind of Adhoc net, according to 3 nodes, the lost contact node dynamic testing method of described Adhoc net judges that mobile node whether lost contact and multiple node obtain two kinds of models of lost contact node in network, for the network of different scales with joint movements speed, according to the whether lost contact of the node in the geographical position periodic detection network of node;Each mobile node is equipped with a GPS device, obtains node coordinate in real time, then judges 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 in the communication range of any node, then node lost contact.Each mobile node of the present invention is equipped with a GPS device, can obtain the geographical position of node in real time, and time delay is substantially reduced, and the result obtained is more accurate.

Description

A kind of lost contact node dynamic testing method of Adhoc net

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 (Multi-hop Network), without base Infrastructure net (Infrastructureless Network) or self-organization network (Self-organizing Network), be a little To point, because it does not relies on the infrastructure being pre-existing 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;

N1It is a removable node, N2, N3It is all stationary nodes, node N1Random mobile, node N2,N3Communication range For 400m, every time interval t decision node N1Whether lost contact;At t1Moment, as node N1The position p moved to1Time, calculate p1 To N2Distance find p1To N2Distance more than node N2Communication range, it can thus be appreciated that now N1Neither at node N2Scope In communication, the most no longer node N3Communication range in, node N1It is judged as lost contact node;At t2Moment works as node N1Move to Position p2, calculate p2To N3Distance find calculate p2To N3Distance more than N3Communication range, it can thus be appreciated that N1At node N3 Communication range in, then node N1It is judged as non-lost contact node.t3Moment N1Again out of N2, N3Communication 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 x-axis Sequence, then sort by y-axis, 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 sequence1、N2、N3、N4、N5、N6、N7、N8;Then from node The node N that in network, abscissa is minimum1Start to judge successively the state of each node;Decision node N1State time, by x coordinate Scope be limited toIn, judge N according to x coordinate order successively1Whether can be with N2、N3、N4Connect, until N5 Coordinate range exceedsAnd can be with N1The node N connected2、N3、N4And N1Status indication be 1, and by flag tag be Judged.Then judge that remaining node also not judged, next node are N by above-mentioned steps5

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 sub-clustering 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 Location-Unknowns 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 self-position according to localization method.The present invention is also easy to expand to three-dimensional Situation, as long as changing by the position of node as the method for expressing (x of three-dimensional into0,y0,z0), and by two node (x0,y0,z0) and (x1, y1,z1) distance computing formula change the distance computing formula of calculating of three-dimensional 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 providesiThe 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 i-thiTime, node n Coordinate beNode N is at tiThe state in moment is Sn

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, N1It is a removable node, N2, N3It is all stationary nodes, node N1Random mobile, node N2, N3 Communication range be 400m, every time interval t decision node N1Whether lost contact.At t1Moment, as node N1The position moved to p1Time, from the result of calculation in table 1, now N1Neither at node N2Range communication in, the most no longer node N3Communication model In enclosing, node N1It is judged as lost contact node.In the t2 moment as node N1The position p moved to2, can by the result of calculation in table 1 Know N1At node N3Communication range in, then node N1It is judged as non-lost contact node.t3Moment N1Again out of N2, N3Communication 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 above-mentioned 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 x-axis Sequence, then sort by y-axis, 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 tiTime each node position view, first by node according to x coordinate sort, after sequence For N1、N2、N3、N4、N5、N6、N7、N8.Then the node N that abscissa is minimum from meshed network1Start to judge each node successively State.Decision node N1State time, the scope of x coordinate is limited toIn, suitable according to x coordinate successively Sequence judges N1Whether can be with N2、N3、N4Connect, until N5Coordinate range exceedsAnd can be with N1The node N connected2、N3、 N4And N1Status indication be 1, and by flag tag for judge.Then remaining joint also not judged is judged by above-mentioned steps Point, next node is N5

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.

Communication range 400m Node density 50/3KM*3KM Nodes 100、200、300、400、500 Maximal rate 10m/s、20m/s、30m/s、40m/s、50m/s Motion model Random point bit model Routing Protocol AODV Number of run 10 Mobile node percentage ratio 20%

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 constant-velocity towards target, after arrival Repeat above-mentioned 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 sub-clustering 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 three-dimensional 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)

1. the lost contact node dynamic testing method of an Adhoc net, it is characterised in that the lost contact node of described Adhoc net is dynamic By 3 nodes, detection method judges that mobile node whether lost contact and multiple node obtain two kinds of models of lost contact node in network, For network and the joint movements speed of different scales, according to the node in the geographical position periodic detection network of node whether Lost contact.
2. the lost contact node dynamic testing method of Adhoc net as claimed in claim 1, it is characterised in that described Adhoc net The each mobile node of lost contact node dynamic testing method is equipped with GPS device, and GPS device obtains node coordinate in real time, according to coordinate The node that whether has lost contact in network is judged with the communication range of each node;A certain node is in the communication of other any node Scope then node not lost contact, node is not in the communication range of any node, then node lost contact.
3. the lost contact node dynamic testing method of Adhoc net as claimed in claim 1, it is characterised in that described 3 nodes, There are 1 mobile node, 2 stationary nodes, obtain the coordinate of mobile node every time interval t, by whether calculating a certain This node whether lost contact is judged in the range of node communication.
4. the lost contact node dynamic testing method of Adhoc net as claimed in claim 3, it is characterised in that N1It is one may move Node, N2, N3It is all stationary nodes, node N1Random mobile, node N2, N3Communication range be 400m, sentence every time interval t Disconnected node N1Whether lost contact;At t1Moment, as node N1The position p moved to1Time, calculate p1To N2Distance find p1To N2's Distance is more than node N2Communication range, now N1Neither at node N2Range communication in, the most no longer node N3Communication range In, node N1It is judged as lost contact node;At t2Moment works as node N1The position p moved to2, calculate p2To N3Distance find meter Calculate p2To N3Distance more than N3Communication range, N1At node N3Communication range in, then node N1It is judged as non-lost contact joint Point, t3Moment N1Removal N2, N3Communication range, become lost contact node.
5. the lost contact node dynamic testing method of Adhoc net as claimed in claim 1, it is characterised in that the plurality of node Obtain lost contact node in network to include:
For the node n of some state to be detected, the coordinate of node n isThe communication range of node is R, may and it The abscissa of the node connected and the scope of vertical coordinate are respectivelyWithThen joint is calculated Point n with this in the range of the distance of other nodes, the computing formula of distance isIf apart from little Just can be attached thereto in communication range so node n of other nodes, distance cannot be with more than the communication range of other nodes Connected;If there being node to be connected with node n, the node being connected with node n is removed from the node set of state to be determined, if Do not find, be lost contact node by this vertex ticks, continue to judge the node of other states to be detected.
6. the lost contact node dynamic testing method of Adhoc net as claimed in claim 1, it is characterised in that described determine possibility The range of nodes being connected with a certain node, by all nodes according to first sorting by x-axis, then sorts by y-axis, from x coordinate minimum Node starts, and from left to right, judges the state of each node, time complexity N*log2n successively.
7. the lost contact node dynamic testing method of Adhoc net as claimed in claim 6, it is characterised in that first by node according to x Coordinate sorts, and is N after sequence1、N2、N3、N4、N5、N6、N7、N8;Then the node N that abscissa is minimum from meshed network1Start Judge the state of each node successively;Decision node N1State time, the scope of x coordinate is limited toIn, N is judged successively according to x coordinate order1Whether can be with N2、N3、N4Connect, until N5Coordinate range exceedsAnd can be with N1 The node N connected2、N3、N4And N1Status indication be 1, and by flag tag for judge;Then judge that remaining is not also sentenced Disconnected node, next node is N5
8. the lost contact node dynamic testing method of Adhoc net as claimed in claim 7, it is characterised in that farther include:
Input: coordinate array position [N] of N number of node, communication range R;
Output: lost contact node set Disconnectedset
CN201610421288.9A 2016-06-14 2016-06-14 A kind of lost contact node dynamic testing method of Adhoc net CN106211219A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610421288.9A CN106211219A (en) 2016-06-14 2016-06-14 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) 2016-06-14 2016-06-14 A kind of lost contact node dynamic testing method of Adhoc net

Publications (1)

Publication Number Publication Date
CN106211219A true CN106211219A (en) 2016-12-07

Family

ID=57453121

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610421288.9A CN106211219A (en) 2016-06-14 2016-06-14 A kind of lost contact node dynamic testing method of Adhoc net

Country Status (1)

Country Link
CN (1) CN106211219A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252495A (en) * 2008-03-06 2008-08-27 北京航空航天大学 Wireless sensor network local type node managing method
CN102209331A (en) * 2011-05-31 2011-10-05 河海大学常州校区 Node positioning method of irregular transmission model in wireless sensor network
CN103167042A (en) * 2013-04-07 2013-06-19 常熟理工学院 Medical real-time monitoring system based on all IP (internet protocol) wireless sensor network
US20150365285A1 (en) * 2014-06-11 2015-12-17 Amplisine Labs, LLC Ad hoc wireless mesh network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101252495A (en) * 2008-03-06 2008-08-27 北京航空航天大学 Wireless sensor network local type node managing method
CN102209331A (en) * 2011-05-31 2011-10-05 河海大学常州校区 Node positioning method of irregular transmission model in wireless sensor network
CN103167042A (en) * 2013-04-07 2013-06-19 常熟理工学院 Medical real-time monitoring system based on all IP (internet protocol) wireless sensor network
US20150365285A1 (en) * 2014-06-11 2015-12-17 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. Energy-efficient distributed clustering in wireless sensor networks
Zhao et al. Collaborative signal and information processing: an information-directed approach
Bholowalia et al. EBK-means: A clustering technique based on elbow method and k-means 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 cluster-tree 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 ZigBee-based long-thin wireless sensor networks
Zhang et al. Fine-grained localization for multiple transceiver-free objects by using RF-based 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 warfare-worthy 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 self-assembly of ad hoc wireless sensor networks
Chandrashekar et al. Providing full connectivity in large ad-hoc 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 multi-dimensional scaling
Xing et al. Square region-based coverage and connectivity probability model in wireless sensor networks
Ratnaraj et al. OEDSR: Optimized energy-delay sub-network 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