CN101815336A - Multicast routing method based on cooperative sensing in wireless self-organizing network - Google Patents
Multicast routing method based on cooperative sensing in wireless self-organizing network Download PDFInfo
- Publication number
- CN101815336A CN101815336A CN201010034078A CN201010034078A CN101815336A CN 101815336 A CN101815336 A CN 101815336A CN 201010034078 A CN201010034078 A CN 201010034078A CN 201010034078 A CN201010034078 A CN 201010034078A CN 101815336 A CN101815336 A CN 101815336A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- upstream
- collaborative
- multicast tree
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a multicast routing method based on cooperative sensing in a wireless self-organizing network, which belongs to the technical field of self-organizing network. The method mainly comprises an initialization process, a broadcasting tree construction process, a branch trimming process and an optimization process. The invention uses cooperative sensing information between the network nodes, marks the nodes in the broadcasting tree construction process according to a certain rule, modifies the marks in the optimization process, establishes a Steiner tree meeting the set time delay constraint under the condition of low time complicity, and realizes the goals of fast tree construction and low communication cost of the constructed multicast tree. The invention is applicable to the wireless self-organizing network and the network environment for military use, commercial use and the like with nodes having the cooperative sensing capability.
Description
Technical field
The present invention relates to a kind of Route Selection between wireless ad hoc network node, the limited Steiner tree of a kind of wireless self-organization network time delay based on collaborative perception multicast route method particularly is provided.
Background technology
Wireless self-organization network networking mode and the strong characteristics of survivability flexibly makes it many irreplaceable effect be arranged in particular cases, be widely used in national defence war preparedness, disaster assistance etc. and can't obtain the cable network support or the environment of the interim networking of needs just, also can be used as backup network.Therefore, the progress of wireless self-organization network has great facilitation to scientific and technological progress.Routing algorithm and agreement are the keys of guaranteeing the normal operation of mobile ad hoc network as a key factor that influences network performance.To going deep into and extensive studies will provide important scientific basis for the application of mobile ad hoc network in this field.
At present, route technology is as a research topic that key technology has become to attach most importance to of self-organizing network.Compare the singlecast router algorithm, that is that all right is ripe for multicast routing algorithm.In to research based on the multicast forwarding structure of setting, the quality of the multicast tree of building directly affect multicast path by performance, and in wireless network, especially in the stronger self-organizing network of mobility, also require to set up low that the time complexity of multicast tree will try one's best, so that adapt to the frequent variations of network topology.In actual applications, generally require the expense minimum of multicast tree.In network, setting up one is root with the source node, and the problem of generation tree that covers the expense minimum of all destination nodes is summed up as the Steiner tree problem on mathematics, and this is a np complete problem.The amount of calculation that solves the exact algorithm of Steiner problem all is that index increases with the increase of network node, and is not suitable for the network multicast application.Though and heuritic approach all can not obtain optimum Steiner tree under the overwhelming majority's situation, they can find expense near optimum accurate Steiner tree in the short period of time, so they more are of practical significance.
The heuritic approach of finding the solution the Steiner tree problem at present has a lot, wherein the most classical is was published on " MathJaponica " in 1980, the page number is document " An approximate solution for the steiner problemin graphs " the disclosed MPH algorithm (MPH, Minimum cost Path Heuristic) of 573-577.Heuritic approach with Steiner tree problem of delay constraint also is the focus of research at present, be published on " 200614th InternationalConference on Advanced Computing and Communications " such as 2006, the page number is the disclosed CSDCM (CSDCM of document " Anefficient heuristic algorithm for QoS-driven multicast tree generation " of 396-401, Cost Sensitive Delay Constrained Multicast) algorithm and being published in 1999 on " theFifth IEEE Real-Time Technology and Applications Symposium ", the page number is 213-222's " An efficient QoS dependent multicast routing algorithm " disclosed QDMR (QDMR, QoSDependent Multicast Routing) algorithm.In three kinds of algorithms, MPH and CSDCM algorithm the time ask that complexity is O (mn
2), the time complexity of QDMR algorithm be O (| E|logn).Be published in 2005 in " COCOON " meeting, the page number is that the document " Simple Distributed Algorithms for Approximation Minimum Steiner Trees " of 380-389 discloses a kind of heuritic approach of decomposing based on figure, its time complexity in synchronizing network is O (nlogn), and this is the minimum distributed algorithm of time complexity of current solution Steiner tree problem.As can be seen, the greatest drawback of the heuritic approach that exists is that time complexity is higher at present, well do not utilize the collaborative perception information of network node when making up the multicast tree structure, how designing the limited Steiner of wireless self-organization network time delay, to set distributed quick heuritic approach be problem demanding prompt solution.
About the application of collaborative perception, 2008 disclose an application number is 200810059948.9, by the patent that is entitled as " a kind of valid wireless sensor network architecture for collaborative energy sensing " of Microsystem Inst. Branch Center, Jiaxing Center, CAS's application.This patent disclosure a kind of valid wireless sensor network architecture for collaborative energy sensing, have that wireless sense network network overall data converges, characteristics of local collaborative perception and data fusion.Yet, to carry out collaborative perception mainly be in order to reduce the redundancy of perception information to network node in this patent, so that sensing results is passed to the sink node with minimal-overhead, the collaborative perception information with node is not used for making up more rational multicast forwarding structure, does not belong to the multicast route method based on collaborative perception.
Summary of the invention
The object of the present invention is to provide a kind of wireless self-organization network routing method, satisfy the limited constraint of time delay simultaneously, and reduce the time complexity of setting up the Steiner tree based on collaborative perception.
The present invention mainly is higher in order to solve existing Steiner tree heuristic algorithm time complexity, does not utilize the problem of the collaborative perception information of network node when making up the multicast tree structure.
The present invention has studied the construction problem of the limited Steiner tree of time delay in the Ad hoc network in network under the time delay on each Radio Link and the identical situation of other expense.This problem can be expressed as follows with mathematical linguistics: with figure G=(V, E) represent given Ad hoc network, wherein vertex set V represents the node set in the network, limit collection E represents the Radio Link in the network, has a limit between two summits and if only if these two nodes in the other side's transmitting boundary.Source node is S, and the destination node set is limited to Δ for D on the time delay.What we required is to be root with the source node S, covers the Steiner tree of destination node set D, and source node is no more than time delay upper limit Δ to the time delay of each destination node in the tree.
In order to solve above problem, the present invention adopts following technical scheme, and it comprises following components:
A, initialization procedure;
B, broadcasting achievement process;
C, beta pruning process;
D, optimizing process.
Before the technical scheme of introducing us in detail, we provide following rule and mark:
The label rule of a, node
Source node S is designated as 1;
Upstream node is not the destination node that Steiner is ordered, and is designated as 2;
Upstream node is the destination node that Steiner is ordered, and is designated as 3;
The Steiner point is designated as 4.
B, to the definition of node
We use (W
i, ζ
i) identify the node i in the multicast tree.Wherein v is one 5 tuple, ζ
iComprise 5 set.(b1)W
i＝(I
i，II
i，III
i，IV
i，V
i)
I
i: the id of node i number;
II
i: the id of the upstream node of node i number;
III
i: the level of node i in current multicast tree;
IV
i: the reverse level of node i in current multicast tree;
V
i: the label of node i.
(b2)ζ
i＝(A
i，B
i，C
i，F
i，L
i)
A
i={ i
d| the neighbor node of node i, and label is 2 or 3}
b
i=neighbor node of id| node i but non-upstream node, and label is 4}
C
i={ the broad sense downstream node of node i has the node and the broad sense downstream node thereof of identical upstream node with node i for id| node i, the upstream node of node i }
F
i={ id| is owing to delay constraint, and node i can not become the neighbor node in the multicast tree with it }
Wherein the upstream node of node i is meant from source node and can single-hop arrives node i through this upstream node, the downstream node of node i is meant the node that can single-hop arrives through node i from source node, the broad sense downstream node of node i is meant the node that can arrive through node i from source node, obviously, the broad sense downstream node comprises downstream node.The broad sense downstream node set of node i is designated as L (i).C
iAnd F
iBeing called as the forbidding set of node i, also is that node i can not select them as the adjacent node in multicast tree, and forbidding the former is for fear of loop occurring, and the forbidding latter is in order to satisfy delay constraint.
C, to the definition of collaborative bag
In achievement and optimizing process, the informational needs that changes the multicast tree structure obtains by internodal working in coordination with, and works in coordination with the form and the effect of bag in this definition:
The collaborative broadcast packet of node i: (I
i, II
i, III
i, IV
i, C
i, F
i, V
i), the meaning of each symbol is the same, is used for notifying the information of the relevant node i of neighbor node;
The local collaborative bag of confirming: confirm that oneself can concern with current upstream node disassociation;
Local collaborative negative bag: confirm that oneself can not concern with current upstream node disassociation.
The present invention be in the wireless self-organization network based on the multicast route method of collaborative perception, specifically comprise following circulation step:
A, initialization procedure: to each the node v in the network, with A (v), B (v), L (v) and F (v) all be set to empty set, be provided with C (v)=v}, it is empty set that R is set, and d=0 is set, d is the level of node on multicast tree;
B, broadcasting achievement process: this process mainly comprises following detailed circulation step:
(B1) the source node s in the network sends collaborative broadcast packet to neighbor node, and specifying information is (I in the collaborative broadcast packet
S,--, 1,--, S},
1), after its neighbor node ω received collaborative broadcast packet, the neighbor node to oneself sent collaborative broadcast packet simultaneously, and specifying information is (I in the collaborative broadcast packet
ω, S, 2,--, ω,
2).D=2 is set, and this moment, multicast tree was constructed two-layer.
(B2) if all nodes have all had own label in the network, commentaries on classics (B4); Otherwise the arbitrary node i that does not have label in the network after receiving the collaborative broadcast packet of upper strata neighbor node, is selected the upstream node of the node of a label minimum as oneself, and is a plurality of as if having, selection id minimum; Calculate the information of oneself according to the information in the collaborative broadcast packet of the upstream node of oneself selecting, wherein label is selected according to the label rule; D=d+1; If the upstream node label that node i is selected is 4, then node i also will be upgraded two set A of oneself according to definition
iAnd B
iIf the upstream node label that node i is selected is not 4, then do not upgrade two set A of oneself
iAnd B
i
(B3) if the d-1=Δ changes (B4); Otherwise node i sends collaborative broadcast packet to neighbours, changes (B2);
(B4) if there is certain destination node not receive collaborative broadcast packet, then it broadcasts warning message to neighbours: the multicast tree that satisfies delay constraint does not exist, and algorithm finishes; If do not report to the police, do not illustrate that then this directed tree is is root with the source node S, cover the one tree of destination node set D, and source node is no more than time delay upper limit Δ to the time delay of each destination node in the tree.
C, beta pruning process: the tree that top broadcasting is set up carries out beta pruning, exactly the 4-node leaf on the multicast tree is cut from multicast tree, the multicast tree that obtains after the beta pruning is designated as T, the level of node in tree T of the bottom is max among the note tree T, it is with max, also promptly the number of plies of tree is broadcasted, and the arbitrary node e among the tree T will own anti-level IV in multicast tree after receiving broadcasting
eBe updated to IV
e=max-IV
e+ 1, wherein the anti-level of node in multicast tree is that x represents that this node is on the inverse x of multicast tree layer.
D, optimizing process: optimizing process mainly comprises following detailed circulation step:
(D1) from the bottom of tree T, according to anti-level order from small to large, the node i among the tree T sends collaborative broadcast packet to neighbor node, and upstream node h upgrades C after receiving collaborative broadcast packet
h=C
h∪ C
i, and with new C
hSend to i, i upgrades the C of oneself
i=C
h, the non-upstream neighbor node j of other of node i calculates after receiving broadcast packet, if III
j+ IV
i＞Δ+1 then notifies node i to upgrade F
i=F
i∪ { j};
(D2) if except the node among the R, there is not the 4-node among the tree T, also promptly not having label is 4 node, then current multicast tree T is exactly the Steiner tree of satisfying delay constraint; Otherwise, if except the node among the R, still have the 4-node among the tree T, then to arbitrary 4-node k wherein, the own downstream node of its notice is judged: if the downstream node i of k is satisfied
Promptly, except node k, node i does not have other upstream node to select yet, and then node i is replied collaborative negative bag of k; Otherwise, reply collaborative affirmation bag of k;
If k does not receive the collaborative affirmation bag of all downstream nodes, forward (D3) to; Otherwise k sends to the set L (k) of its downstream node all nodes among the L (k) and notifies them to leave, and node k is as a Steiner point of multicast tree, announces to break away from multicast tree, multicast tree be updated to T=T { k};
Each downstream node i of k after receiving that k notifies the information that it leaves, if
Also be that can to select other label be that 2 or 3 node is as its new upstream node, then at A to node i
i(C
i∪ F
i) middle any one node j that selects, in network, to broadcast, the purpose of broadcasting is: notice node j sets up syntople with it, notifies other neighbor node the node among the L (k) to be added in their the forbidding set;
If
Also be that can only to select other label be that 4 node is as its new upstream node, then at B to node i
i(C
i∪ F
i) in select arbitrarily a node j, in network, broadcast, the purpose of broadcasting is: notice node j sets up syntople with it, notifies other neighbor node that all downstream nodes of k are added in their forbiddings set, and the answer by node j, upgrades C
i=C
j{ II
j;
(D3) { k} changes (D2) R=R ∪.
The present invention is directed to the existing multicast path of setting based on Steiner by the high present situation of heuritic approach time complexity, utilize between node collaborative perception information to design a Ad Hoc network multicast routing method based on the Steiner tree to the multicast tree structure, under the prerequisite of Network Synchronization, the time complexity of this method is O (n), compare with existing method, time complexity is minimum.
Description of drawings
Fig. 1 is a network topological diagram, and wherein S is a source node, and circular node is a destination node, and square node is the Steiner point, and the id of digitized representation node number, the id of node S number is 0.Establish time delay threshold value Δ=4 at this.
Fig. 2 (a) has showed the broadcasting achievement process at network shown in Figure 1.
Fig. 2 (b) has showed the beta pruning process at network shown in Figure 1.
Fig. 2 (c) has showed the optimizing process at network shown in Figure 1.
Fig. 2 (d) has showed the multicast tree process that obtains at last at network shown in Figure 1.
Embodiment
Below in conjunction with the drawings and specific embodiments the present invention is elaborated.
Fig. 1 is a network topological diagram, and wherein S is a source node, and circular node is a destination node, and square node is the Steiner point, and the id of digitized representation node number, the id of node S number is 0.Establish time delay threshold value Δ=4 at this.Fig. 2 has showed the process at the achievement and the optimization of network shown in Figure 1.Fig. 2 (a) is the multicast tree of setting up by broadcasting that satisfies delay constraint, and Fig. 2 (b) carries out the multicast tree that beta pruning obtains to the tree among Fig. 2 (a).In optimizing process, the downstream node 6 of 4-node 2 has found new upstream node 1, and the downstream node 7 of 4-node 3 has found new upstream node 4, shown in Fig. 2 (c).4- node 2 and 3 withdraws from multicast tree among Fig. 2 (c), and their downstream nodes 6 and 7 are separately revised incidence relation respectively; 4- node 6 and 8 can not withdraw from multicast tree, obtains a Steiner tree of satisfying delay constraint, shown in Fig. 2 (d).
Claims (1)
1. Wireless Ad Hoc network multicast routing method based on collaborative perception is characterized in that: method for routing comprises initialization procedure, broadcasting achievement process, beta pruning process, four steps of optimizing process; At first provide following rule and definition:
The label rule of a, node
Source node S is designated as 1;
Upstream node is not the destination node that Steiner is ordered, and is designated as 2, is designated as the 2-node;
Upstream node is the destination node that Steiner is ordered, and is designated as 3, is designated as the 3-node;
The Steiner point is designated as 4, is designated as the 4-node.
B, to the definition of node
With (W
i, ζ
i) identify the node i in the multicast tree, wherein v is one 5 tuple, ζ
iComprise 5 set,
(b1)W
i＝(I
i，II
i，III
i，IV
i，V
i)
I
i: the id of node i number;
II
i: the id of the upstream node of node i number;
III
i: the level of node i in current multicast tree;
IV
i: the reverse level of node i in current multicast tree;
V
i: the label of node i;
(b2)ζ
i＝(A
i，B
i，C
i，F
i，L
i)
A
i=neighbor node of id| node i, and label is 2 or 3}
B
i=neighbor node of id| node i but non-upstream node, and label is 4}
C
i={ the broad sense downstream node of node i has the node and the broad sense downstream node thereof of identical upstream node with node i for id| node i, the upstream node of node i }
F
i={ id| is owing to delay constraint, and node i can not become the neighbor node in the multicast tree with it }
Wherein the upstream node of node i is meant from source node and arrives node i through this upstream node single-hop, the downstream node of node i is meant the node that arrives through the node i single-hop from source node, the broad sense downstream node of node i is meant the node that arrives through node i from source node, the broad sense downstream node set of node i is designated as L (i), C
iAnd F
iBe called as the forbidding set of node i, node i can not select them as the adjacent node in multicast tree, and forbidding the former is for fear of loop occurring, and the forbidding latter is in order to satisfy delay constraint;
C, to the definition of collaborative bag
In achievement and optimizing process, the informational needs that changes the multicast tree structure obtains by internodal working in coordination with, and works in coordination with the form and the effect of bag in this definition:
The collaborative broadcast packet of node i: (I
i, II
i, III
i, IV
i, C
i, F
i, V
i), the meaning of each symbol is the same, is used for notifying the information of the relevant node i of neighbor node;
The local collaborative bag of confirming: confirm own and current upstream node disassociation relation;
Local collaborative negative bag: confirm that oneself can not concern with current upstream node disassociation;
A, initialization procedure: to each the node v in the network, be provided with A (v), B (v), L (v) and F (v) for empty set, be provided with C (v)=v}, it is empty set that R is set, and d=0 is set, d is the level of node on multicast tree;
B, broadcasting achievement process:
(B1) source node S in the network sends collaborative broadcast packet to neighbor node, and specifying information is (I in the collaborative broadcast packet
S,--, 1,--, S},
1), after its neighbor node ω received collaborative broadcast packet, the neighbor node to oneself sent collaborative broadcast packet simultaneously, and specifying information is (I in the collaborative broadcast packet
ω, S, 2,--, ω,
2), d=2 is set, this moment, multicast tree was constructed two-layer;
(B2) if all nodes have all had own label in the network, commentaries on classics (B4); Otherwise the arbitrary node i that does not have label in the network after receiving the collaborative broadcast packet of upper strata neighbor node, is selected the upstream node of the node of a label minimum as oneself, and is a plurality of as if having, selection id minimum; Calculate the information of oneself according to the information in the collaborative broadcast packet of the upstream node of oneself selecting, wherein label is selected according to the label rule; D=d+1; If the upstream node label that node i is selected is 4, then node i also will be upgraded two set A of oneself according to definition
iAnd B
iIf the upstream node label that node i is selected is not 4, then do not upgrade two set A of oneself
iAnd B
i
(B3) as if the d-1=Δ, wherein Δ is a time delay upper limit given in advance according to applied environment, changes (B4); Otherwise node i sends collaborative broadcast packet to neighbours, changes (B2);
(B4) if there is certain destination node not receive collaborative broadcast packet, then it broadcasts warning message to neighbours: the multicast tree that satisfies delay constraint does not exist, and algorithm finishes; If do not report to the police, do not illustrate that then this directed tree is is root with the source node S, cover the one tree of destination node set D, and source node is no more than time delay upper limit Δ to the time delay of each destination node in the tree;
C, beta pruning process: the tree that top broadcasting is set up carries out beta pruning, exactly the 4-node leaf on the multicast tree is cut from multicast tree, the multicast tree that obtains after the beta pruning is designated as T, and the level of node in tree T of the bottom is max among the note tree T, and then max is exactly the number of plies of tree; The node of the bottom of tree T is designated as 1 with the anti-level of oneself, wherein the anti-level of node in multicast tree is that x represents that this node is on the inverse x of multicast tree layer, they are broadcasted max in tree then, and the arbitrary node e among the tree T will own anti-level IV in multicast tree after receiving broadcasting
eBe updated to max-IV
e+ 1;
D, optimizing process:
(D1) from the bottom of tree T, according to anti-level order from small to large, the node i among the tree T sends collaborative broadcast packet to neighbor node, and upstream node h upgrades the forbidding set C of oneself after receiving collaborative broadcast packet
hBe C
h∪ C
i, and with new C
hSend to i, i upgrades the forbidding set C of oneself
iBe C
h, the non-upstream neighbor node j of other of node i calculates after receiving broadcast packet, if III
j+ IV
i＞Δ+1 then notifies node i to upgrade its forbidding set F
iBe F
i∪ { j};
(D2) if except the node among the R, there is not the 4-node among the tree T, then current multicast tree T is exactly the Steiner tree of satisfying delay constraint; Otherwise, if except the node among the R, still have the 4-node among the tree T, then to arbitrary 4-node k wherein, its notifies the downstream node of oneself to judge:
If the downstream node i of the k not upstream node of other except that k selects, then node i is replied collaborative negative bag of k; Otherwise, reply collaborative affirmation bag of k;
If k does not receive the collaborative affirmation bag of all downstream nodes, forward (D3) to; Otherwise k sends to the set L (k) of its downstream node all nodes among the L (k) and notifies them to leave, and node k announces to break away from multicast tree as a Steiner point of multicast tree, and multicast tree T is updated to T-{k};
Each downstream node i of k is after receiving that k notifies the information that it leaves, if it is that 2 or 3 node is as its new upstream node that node i is selected other label, then in these selectable new upstream nodes, select any one node j, in network, broadcast, the purpose of broadcasting is: notice node j sets up syntople with it, notifies other neighbor node the node among the L (k) to be added in their the forbidding set;
If it is that 4 node is as its new upstream node that node i can only be selected other label, then in these selectable new upstream nodes, select a node j arbitrarily, in network, broadcast, the purpose of broadcasting is: notice node j sets up syntople with it, notify other neighbor node that all downstream nodes of k are added in their the forbidding set, and the answer by node j, own forbidding is gathered C
iBe updated to C
j-{ II
j;
(D3) { k} changes (D2) R=R ∪.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010034078A CN101815336A (en) | 2010-01-14 | 2010-01-14 | Multicast routing method based on cooperative sensing in wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010034078A CN101815336A (en) | 2010-01-14 | 2010-01-14 | Multicast routing method based on cooperative sensing in wireless self-organizing network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101815336A true CN101815336A (en) | 2010-08-25 |
Family
ID=42622417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010034078A Pending CN101815336A (en) | 2010-01-14 | 2010-01-14 | Multicast routing method based on cooperative sensing in wireless self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101815336A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102638820A (en) * | 2012-03-23 | 2012-08-15 | 山东大学 | Prediction method for link stability of Ad Hoc network |
| CN103413041A (en) * | 2013-08-06 | 2013-11-27 | 北京航空航天大学 | Method for constructing collaborative awareness system on basis of development objects of complex products |
| CN106341858A (en) * | 2016-08-30 | 2017-01-18 | 天津光电华典科技有限公司 | Dynamic self-networking protocol system and method for Internet of Things and industrial intelligence |
| CN106789631A (en) * | 2017-01-20 | 2017-05-31 | 深圳市风云实业有限公司 | A kind of Multicast Routing reconstructing method and routing device |
| US9826412B2 (en) | 2013-10-24 | 2017-11-21 | At&T Intellectual Property I, L.P. | Facilitating adaptive key performance indicators in self-organizing networks |
| CN108768980A (en) * | 2018-05-17 | 2018-11-06 | 南京大学 | A kind of multicast mechanism design method generated based on core constraint |
| CN113194529A (en) * | 2021-06-30 | 2021-07-30 | 广州慧睿思通科技股份有限公司 | Clock alignment method and device for intercom device and storage medium |
-
2010
- 2010-01-14 CN CN201010034078A patent/CN101815336A/en active Pending
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102638820A (en) * | 2012-03-23 | 2012-08-15 | 山东大学 | Prediction method for link stability of Ad Hoc network |
| CN102638820B (en) * | 2012-03-23 | 2015-11-11 | 山东大学 | Ad Hoc network link stability prediction method |
| CN103413041A (en) * | 2013-08-06 | 2013-11-27 | 北京航空航天大学 | Method for constructing collaborative awareness system on basis of development objects of complex products |
| CN103413041B (en) * | 2013-08-06 | 2016-04-06 | 北京航空航天大学 | A kind of collaborative perception system constituting method based on complex product development object |
| US9826412B2 (en) | 2013-10-24 | 2017-11-21 | At&T Intellectual Property I, L.P. | Facilitating adaptive key performance indicators in self-organizing networks |
| CN106341858A (en) * | 2016-08-30 | 2017-01-18 | 天津光电华典科技有限公司 | Dynamic self-networking protocol system and method for Internet of Things and industrial intelligence |
| CN106341858B (en) * | 2016-08-30 | 2019-10-11 | 天津光电华典科技有限公司 | Dynamic ad hoc network protocol system and method for Internet of Things and industrial intelligent |
| CN106789631A (en) * | 2017-01-20 | 2017-05-31 | 深圳市风云实业有限公司 | A kind of Multicast Routing reconstructing method and routing device |
| CN106789631B (en) * | 2017-01-20 | 2020-04-03 | 深圳市风云实业有限公司 | Multicast routing reconstruction method and routing equipment |
| CN108768980A (en) * | 2018-05-17 | 2018-11-06 | 南京大学 | A kind of multicast mechanism design method generated based on core constraint |
| CN113194529A (en) * | 2021-06-30 | 2021-07-30 | 广州慧睿思通科技股份有限公司 | Clock alignment method and device for intercom device and storage medium |
| CN113194529B (en) * | 2021-06-30 | 2021-10-01 | 广州慧睿思通科技股份有限公司 | Clock alignment method and device for intercom device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101815336A (en) | Multicast routing method based on cooperative sensing in wireless self-organizing network | |
| Khan et al. | Fuzzy-TOPSIS based cluster head selection in mobile wireless sensor networks | |
| Lin et al. | An approximation algorithm for the maximum-lifetime data aggregation tree problem in wireless sensor networks | |
| CN104012149A (en) | Network architecture for minimalistic connected objects | |
| Sampath et al. | An ACO algorithm for effective cluster head selection | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| Khan et al. | Performance improvement in wireless sensor and actor networks based on actor repositioning | |
| CN102238683A (en) | Routing information acquisition and transmission method for wireless mesh network | |
| Varsha et al. | Development of QoS optimized routing using Artificial bee colony and TABU-GA with a mobile base station in Wireless Sensor Network | |
| CN103095579A (en) | TRILL network interconnection method and device and system | |
| CN103686675B (en) | A kind of configuring method for neighboring area and device | |
| Wang et al. | Research and improvement of the wireless sensor network routing algorithm GPSR | |
| CN107181614A (en) | A kind of wifi network and its network-building method and data transmission method | |
| Al-Fares et al. | A hierarchical routing protocol for survivability in wireless sensor network (WSN) | |
| CN103763714B (en) | Wireless sensor network optimizing method based on zigbee | |
| Shende et al. | Performance improvement in ZigBee cluster tree network | |
| Stein et al. | Topology control with application constraints | |
| Xu et al. | A low energy adaptive clustering multi-hop routing protocol based on fuzzy decision | |
| Sakai et al. | Fast connected dominating set construction in mobile ad hoc networks | |
| Chandra et al. | Energy efficient relay placement for dual hop wireless transmission | |
| Sui | The research of the route protocols in opportunistic network | |
| Lugo-Cordero et al. | Evolution of optimal heterogeneous wireless mesh networks | |
| CN103581838A (en) | Information sharing method for Ad Hoc network | |
| Kanouni et al. | A new paradigm for multi-path routing protocol for data delivery in wireless sensor networks | |
| Oikonomou et al. | Probabilistic flooding coverage analysis in large scale wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100825 |