CN104093182A - Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network - Google Patents
Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network Download PDFInfo
- Publication number
- CN104093182A CN104093182A CN201410230508.0A CN201410230508A CN104093182A CN 104093182 A CN104093182 A CN 104093182A CN 201410230508 A CN201410230508 A CN 201410230508A CN 104093182 A CN104093182 A CN 104093182A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- field intensity
- optimal path
- parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a method for acquiring a plurality of reliable communication paths based on the field intensity in a multi-layer wireless network, and belongs to the technical field of wireless communication. First, each node of a wireless network receives radio frequency signals sent by other nodes and acquires neighbor field intensity information; a forward optimal path set and a forward optimal path from a source node to a destination node are acquired through calculation by use of a multi-point shortest path algorithm; a reverse optimal path set and a reverse optimal path from the destination node to the source node are acquired through calculation by use of a multi-point optimal path algorithm; sub-optimal paths are worked out based on a forward optimal path weight and a reverse optimal path weight; and a plurality of optimal paths of the wireless network are determined by testing the optimal paths and the sub-optimal paths. The amount of calculation and the spatial complexity in the process of optimal path acquiring are reduced, the energy consumption of a system is reduced, and the communication reliability of the wireless network is improved.
Description
Technical field
A kind of method that the present invention relates to obtain based on field intensity in multilayer wireless network many reliable communication paths, belongs to wireless communication technology field.
Background technology
Very extensive in the application of communication technical field multipath computational methods, its advantage has been to improve throughput and the reliability of network, and the application of multipath simultaneously has also brought problem how to obtain many optimal paths.KSP algorithm, i.e. K bar shortest path first, is that a kind of solution is obtained assigned source node to the algorithm of the mulitpath problem of destination node in network topology, by this algorithm can be in network topology the K paths of way to acquire weight and ascending order.K bar shortest path first, as a kind of algorithm of practicality, is widely applied to the multiple fields of the calculating of communication route, artificial intelligence, economic theory research, has very high using value.
Between node, in the topology of single-link, the overall procedure that KSP algorithm is realized is as follows, comprises following content:
Call dijkstra's algorithm and calculate the first shortest path;
Whether the quantity in the path that judgement calculates meets the demands, if met, exits algorithm, stops calculating; If do not met, continue to calculate;
Call KSP algorithm, in the topology of single-link between node, calculate next shortest path, judge.
Because needs Multi-nesting is used dijkstra's algorithm, KSP algorithm ubiquity algorithm time complexity and the high problem of space complexity.
Wireless multitiered network is widely used in the numerous areas such as radio meter register, wireless sensor network.Owing to facing the restrictions such as the unstable and communication environment variation of inter-node communication, need to be in the computational process of route, many preferred alternative routes are provided, after communication link failure in selected route, provide interchangeable route to carry out data transmission procedure again.Due to radio node, will meet the demands such as low-power consumption, low cost, mostly there is the limited problem of system resource in radio node, therefore needs many route selection algorithms that a kind of time complexity and space complexity are low.
Summary of the invention
A kind of method that the object of the invention is to propose to obtain based on field intensity in multilayer wireless network many reliable communication paths, is meeting under the prerequisite of performance, solves computer memory complexity problems of too.In computational process, by calculating positive and negative twocouese shortest path, to obtaining sub-optimal path after the summation of twocouese shortest path, and gained path is soundd out.
In the multilayer wireless network that the present invention proposes, based on field intensity, obtain the method in many reliable communication paths, comprise following steps:
(1) in network, choose source node and destination node, receive the radiofrequency signal that in short-range wireless networking, transmitting terminal sends, calculate each inter-node communication field intensity, the communication field intensity of node and other each node forms field intensity sequence and is designated as Q
m, a plurality of node field intensity sequence set become neighbours' field intensity set, if do not have link to be directly connected between node, in neighbours' field intensity set, do not carry out record, and in calculating, its field intensity value is made as " infinity ";
(2) by multiple spot shortest path first, calculating source node to the set of forward optimal path and the set of forward optimal path weights of other each nodes, wherein, is forward optimal path and forward optimal path weights by source node to the result of calculation of destination node.
(3) by multiple spot shortest path first, calculating destination node to the reverse optimal path set of each node and oppositely optimal path weights set, wherein, is reverse optimal path and reverse optimal path weights by destination node to the result of calculation of source node;
(4) calculate source node to the forward optimal path weights of each node except destination node and destination node, arrive corresponding each node reverse optimal path weights weights with, the path of weights and result optimum is sub-optimal path;
(5) pass through forward optimal path, oppositely optimal path and sub-optimal path are soundd out result and are adjusted routine weight value, sound out successful routine weight value and increase, and sound out failed path weights and reduce, and obtain many routes that weights sort by path.
Above-mentioned multiple spot shortest path first, described in comprise start node, end node, intermediate node, it is characterized in that:
(1) for each node in wireless network, set up one group of state recording, state recording comprises front order parameter, path weight value parameter, jumping figure parameter, label parameter; Wherein, node before preorder Parametric Representation present node, the path weight value of path weight value Parametric Representation from start node to present node, the jumping figure of jumping figure Parametric Representation from start node to present node, label parameter represents the state of node, the label parameter of each node is in " forever " or " temporarily " state, after the label parameter of a node is " forever ", will no longer change;
(2) state recording of all nodes of initialization, is made as " infinitesimal " by the path weight value parameter of each node, and label parameter is made as " temporarily ", and jumping figure parameter is made as 0;
(3) label parameter of start node is changed to " forever " state.
(4) the node state record that all label parameters that renewal is directly connected with start node are " temporarily ", read the field intensity value of the node that in neighbours' field intensity set, start node is " temporarily " to all label parameters, according to path weight value computational methods, upgrade path weight value parameter, and upgrade front order parameter and jumping figure parameter;
(5) at above-mentioned label parameter, be chosen distance start node V in the node of " temporarily "
sthe highest node of path weight value.Using this node as new start node, and repetitive process (3) is to (5), when the label parameter of all nodes is after " forever ", order parameter from end node starts to extract is successively till start node, and this node listing is the optimal path from start node to end node; The path weight value parameter of end node is optimal path weights.
Above-mentioned path weight value computational methods, is characterized in that:
(1) two hop weight increases and reduces with two node communication field intensity values;
(2), under multiple jump condition, every increase by is jumped path weight value and is reduced;
(3) path weight value is by formula
determine, wherein s
ibe two node communication field intensity values, N is the total jumping figure in path, and c is fixed constant.
In the multilayer wireless network that the present invention proposes, based on field intensity, obtain the method in many reliable communication paths, have the following advantages:
(1) the present invention uses multiple spot shortest path computational methods by positive and negative twocouese, with respect to traditional KSP algorithm, has reduced the number of times that calls D-algorithm, has reduced system operand;
(2) the present invention, by using neighbours' field intensity set, uses state recording in multiple spot shortest path computational methods, has reduced memory cost, has reduced algorithm space complexity;
(3) the present invention is by calculating many optimal paths, and the reliability that has improved wireless communication is surveyed in the walking along the street footpath of going forward side by side;
Accompanying drawing explanation
Fig. 1 is forward optimal path computation schematic diagram of the present invention;
Fig. 2 is reverse optimal path computation schematic diagram of the present invention.
Embodiment
In the multilayer wireless network that the present invention proposes, based on field intensity, obtain the method in many reliable communication paths, first in wireless network, each node receives the radiofrequency signal that other nodes send, and obtains neighbours' field intensity information; By multiple spot shortest path first, calculate the set of forward optimal path and the forward optimal path to destination node by source node; Then by multiple spot optimal path algorithm, calculate by destination node to the reverse optimal path set of source node and reverse optimal path; By forward optimal path weights with reverse optimal path weights with calculate sub-optimal path; By optimal path and sub-optimal path are soundd out to definite many optimal paths of wireless network;
In above-mentioned many route computing methods, to source node in network and destination node both forward and reverse directions, use multiple spot shortest path first to obtain the method for many optimal paths, comprise following steps:
(1) in network, choose source node V
awith destination node V
b, receive the radiofrequency signal that in short-range wireless networking, transmitting terminal sends, calculate each inter-node communication field intensity, node V
mwith node V
nbetween communication field intensity be designated as q
mN, node V
mbe designated as Q with the communication field intensity composition field intensity sequence of other each point
m, a plurality of node field intensity sequence set become neighbours' field intensity set, if node V
mwith V
nbetween do not have link to be directly connected, in neighbours' field intensity set, do not carry out record, in calculating, its field intensity value is made as " infinity ";
(2) by multiple spot shortest path first, calculate source node V
ato other each nodes V
mthe set of forward optimal path and forward optimal path weights set P
m, wherein, by source node V
ato destination node V
bresult of calculation be that forward optimal path and forward optimal path weights are P
b.
(3) by multiple spot shortest path first, calculate destination node V
bto each node V
mreverse optimal path set and reverse optimal path weights set P
m', wherein, by destination node V
bto source node V
aresult of calculation be reverse optimal path and oppositely optimal path weights be P
a';
(4) calculate source node to the forward optimal path weights P of each node except destination node
mwith the reverse optimal path weights P of destination node to corresponding each node
m' weights and, the path of weights and result optimum is sub-optimal path;
(5) pass through forward optimal path, oppositely optimal path and sub-optimal path are soundd out result and are adjusted routine weight value, sound out successful routine weight value and increase, and sound out failed path weights and reduce, and obtain many routes that weights sort by path.
Above-mentioned multiple spot shortest path first, described in comprise start node, end node, intermediate node, it is characterized in that:
(1) for each node in wireless network, set up one group of state recording, state recording comprises front order parameter, path weight value parameter, jumping figure parameter, label parameter; Wherein, node before preorder Parametric Representation present node, the path weight value of path weight value Parametric Representation from start node to present node, the jumping figure of jumping figure Parametric Representation from start node to present node, label parameter represents the state of node, the label parameter of each node is in " forever " or " temporarily " state, after the label parameter of a node is " forever ", will no longer change;
(2) state recording of all nodes of initialization, is made as " infinitesimal " by the path weight value parameter of each node, and label parameter is made as " temporarily ", and jumping figure parameter is made as 0;
(3) by starting point V
slabel parameter change to " forever " state.
(4) upgrade and start node V
sthe all label parameters that are directly connected are the node state record of " temporarily ", read start node V in neighbours' field intensity set
sto all label parameters, be the field intensity value of the node of " temporarily ", according to path weight value computational methods, upgrade path weight value parameter, and upgrade front order parameter and jumping figure parameter;
(5) at above-mentioned label parameter, be chosen distance start node V in the node of " temporarily "
sthe highest node of path weight value.Using this node as new start node, and repetitive process (3) is to (5), when the label parameter of all nodes is after " forever ", from end node V
0before starting to extract successively, order parameter is to V
still, this node listing is from start node V
sto end node V
0optimal path; V
0path weight value parameter be optimal path weights.
In above-mentioned path weight value computational methods, two hop weights increase and reduce with two node communication field intensity values; Under multiple jump condition, every increase by is jumped path weight value and is reduced; Path weight value is by formula
determine, wherein s
ibe two node communication field intensity values, N is the total jumping figure in path, and c is fixed constant.
Below introduce in detail one embodiment of the present of invention:
The present invention, by calculating positive and negative twocouese multiple spot shortest-path method, provides a kind of method that obtains many reliable communication paths in multilayer wireless network based on field intensity.
The method of many routes of calculating in multilayer wireless network of this example, the topological sum scene facing meets following prerequisite:
(1) this routine research object is undirected topological diagram;
(2) the number n of the number m>=node on the limit that topological diagram comprises;
(3) weight on the limit that topological diagram comprises is integer, and weight w>0;
(4) calculate any two points between path do not allow into ring, namely in path, do not comprise duplicate node;
In wireless network, each node receives the communication field intensity of each node around, forms field intensity sequence, and this field intensity sequence is designated as Q
m=[q
m1, q
m2..., q
mN], wherein M, N represent node ID, q
mNrepresent node M and node N communication field intensity.By each node of radio communication, field intensity sequence transmission is arrived to Centroid, a plurality of node field intensity sequence set that Centroid receives become neighbours' field intensity set, have indicated field intensity value between node in Fig. 1 and Fig. 2;
For each node in network is set up one group of state recording S
1, each state recording comprises following content:
(1) PreNode, front order parameter, for recording the preorder node ID of this node of optimal path;
(2) Weight, path weight value parameter, for the weighted value of record path;
(3) JumpNum, jumping figure parameter, for record path process jumping figure;
(4) StateParam, label parameter, for indicating path " forever " or " temporarily " state;
The state recording of all nodes of initialization, is made as " infinitesimal " by the path weight value parameter of each node, and label parameter is made as " temporarily ", and jumping figure parameter is made as 0;
With node V
afor start node, V
bfor end node, application path weight value is by formula
wherein get c=10, the V calculating according to multiple spot shortest path first
ain node state record, path weight parameter is forward optimal path weights, obtains state recording result as follows.
| Node ID | PreNode | Weight | JumpNum | StateParam |
| A | ? | 0 | 0 | Forever |
| B | C | 75 | 3 | Forever |
| C | E | 55 | 2 | Forever |
| D | A | 40 | 1 | Forever |
| E | A | 30 | 1 | Forever |
| F | E | 60 | 2 | Forever |
From end node V
bbefore starting to extract successively, order parameter is to start node V
atill, this node listing A-E-C-B is from start node V
ato end node V
bforward optimal path, weights are 75.
For each node in network is set up another group state recording S
2, each state recording comprises data item and state recording S
1middle data item is identical, with node V
bfor start node, V
afor end node, apply same path weight value computing formula, the V calculating according to multiple spot shortest path first
bin node state record, path weight parameter is reverse optimal path weights, obtains state recording result as follows.
| Node ID | PreNode | Weight | JumpNum | StateParam |
| A | E | 75 | 3 | Forever |
| B | ? | 0 | 0 | Forever |
| C | B | 20 | 1 | Forever |
| D | F | 50 | 2 | Forever |
| E | C | 45 | 2 | Forever |
| F | B | 30 | 1 | Forever |
From end node V
abefore starting to extract successively, order parameter is to V
btill, this node listing B-C-E-A is from start node V
bto end node V
areverse optimal path, weights are 75.
At state recording S
1in except node V
awith node V
bin each outer nodes records, path weight parameter Weight is the forward optimal path weights P of each node
m, Fig. 1 shows the node V calculating
ato node V
dforward optimal path be A-D, weights P
d=40, node V
ato node V
eforward optimal path be A-E, weights P
e=30.At state recording S
2in except node V
awith node V
bin each outer nodes records, path weight parameter Weight is the reverse optimal path weights P of each node
m', Fig. 2 shows the node V calculating
bto node V
dreverse optimal path be D-F-B, weights P
d'=50, node V
bto node V
eoptimal path be E-C-B, weights are P
e'=45.Calculate source node to the forward optimal path weights P of each node except destination node
mwith the reverse optimal path weights P of destination node to corresponding each node
m' weights and, can obtain through node V
done compared with shortest path, be A-D-F-B, weights and be P
d+ P
d'=90, through node V
eone compared with shortest path, be A-E-C-B, weights and be P
e+ P
e'=75, the rest may be inferred.To each weights and sorting, and reject the path of repeating, the sub-optimal path that can obtain weights and result optimum is A-D-F-B and A-E-F-B;
By to forward optimal path, oppositely optimal path and sub-optimal path are soundd out result and are adjusted routine weight value, sound out successful routine weight value and increase, sound out failed path weights and reduce, get the mulitpath of souning out rear weights optimum and obtain many routes of weights sequence by path.
Claims (4)
1. in multilayer wireless network, based on field intensity, obtain the method in many reliable communication paths, it is characterized in that: described method comprises following steps:
(1) in network, choose source node and destination node, receive the radiofrequency signal that in short-range wireless networking, transmitting terminal sends, calculate each inter-node communication field intensity, the communication field intensity of node and other each node forms field intensity sequence and is designated as Q
m, a plurality of node field intensity sequence set become neighbours' field intensity set;
(2) by multiple spot shortest path first, calculate source node to the set of forward optimal path and the set of forward optimal path weights of other each nodes, described source node is forward optimal path and forward optimal path weights to the result of calculation of destination node;
(3) by multiple spot shortest path first, calculate destination node to the reverse optimal path set of each node and oppositely optimal path weights set, described destination node is reverse optimal path and reverse optimal path weights to the result of calculation of source node;
(4) calculate source node to the forward optimal path weights of each node except destination node and destination node, arrive corresponding each node reverse optimal path weights weights with, the path of weights and result optimum is sub-optimal path;
(5) pass through forward optimal path, oppositely optimal path and sub-optimal path are soundd out result and are adjusted routine weight value, sound out successful routine weight value and increase, and sound out failed path weights and reduce, and obtain many routes that weights sort by path.
2. in multilayer wireless network according to claim 1, based on field intensity, obtain the method in many reliable communication paths, it is characterized in that: between described node, do not have link to be directly connected, in neighbours' field intensity set, do not carry out record, in calculating, its field intensity value is made as " infinity ".
3. in multilayer wireless network according to claim 1, based on field intensity, obtain the method in many reliable communication paths, it is characterized in that: described multiple spot shortest path first, comprises start node, end node, intermediate node;
(1) for each node in wireless network, set up one group of state recording, state recording comprises front order parameter, path weight value parameter, jumping figure parameter, label parameter; Wherein, node before preorder Parametric Representation present node, the path weight value of path weight value Parametric Representation from start node to present node, the jumping figure of jumping figure Parametric Representation from start node to present node, label parameter represents the state of node, the label parameter of each node is in " forever " or " temporarily " state, after the label parameter of a node is " forever ", will no longer change;
(2) state recording of all nodes of initialization, is made as " infinitesimal " by the path weight value parameter of each node, and label parameter is made as " temporarily ", and jumping figure parameter is made as 0;
(3) label parameter of start node is changed to " forever " state.
(4) the node state record that all label parameters that renewal is directly connected with start node are " temporarily ", read the field intensity value of the node that in neighbours' field intensity set, start node is " temporarily " to all label parameters, according to path weight value computational methods, upgrade path weight value parameter, and upgrade front order parameter and jumping figure parameter;
(5) at above-mentioned label parameter, be the highest node of path weight value of chosen distance start node in the node of " temporarily ".Using this node as new start node, and repetitive process (3) is to (5), when the label parameter of all nodes is after " forever ", order parameter from end node starts to extract is successively till start node, and this node listing is the optimal path from start node to end node; The path weight value parameter of end node is optimal path weights.
4. in multilayer wireless network according to claim 3, based on field intensity, obtain the method in many reliable communication paths, it is characterized in that: described path weight value computational methods are as follows:
(1) two hop weight increases and reduces with two node communication field intensity values;
(2), under multiple jump condition, every increase by is jumped path weight value and is reduced;
(3) path weight value is by formula
determine, wherein s
ibe two node communication field intensity values, N is the total jumping figure in path, and c is fixed constant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410230508.0A CN104093182B (en) | 2014-05-28 | 2014-05-28 | A kind of method for obtaining a plurality of reliable communication path in multilayer wireless network based on field strength |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410230508.0A CN104093182B (en) | 2014-05-28 | 2014-05-28 | A kind of method for obtaining a plurality of reliable communication path in multilayer wireless network based on field strength |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104093182A true CN104093182A (en) | 2014-10-08 |
| CN104093182B CN104093182B (en) | 2018-01-23 |
Family
ID=51640849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410230508.0A Active CN104093182B (en) | 2014-05-28 | 2014-05-28 | A kind of method for obtaining a plurality of reliable communication path in multilayer wireless network based on field strength |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104093182B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106304230A (en) * | 2016-09-28 | 2017-01-04 | 北京远东仪表有限公司 | Wireless self-networking method and device based on instant route |
| CN107154862A (en) * | 2016-03-04 | 2017-09-12 | 上海海岸展览服务有限公司 | A kind of go-between recommends method and system |
| CN107889183A (en) * | 2017-10-27 | 2018-04-06 | 深圳友讯达科技股份有限公司 | Data transmission method and device |
| CN111555971A (en) * | 2020-04-26 | 2020-08-18 | 新分享科技服务(深圳)有限公司 | Information distribution platform, system and information distribution method |
| CN116720638A (en) * | 2023-04-13 | 2023-09-08 | 广东工业大学 | Method and system for adjusting inverse shortest path weight based on improved evolutionary algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1663182A (en) * | 2002-06-18 | 2005-08-31 | Atb自动化技术两合公司 | Method for determining an optimal transmission path in a data network |
| CN101288323A (en) * | 2005-08-23 | 2008-10-15 | 西门子公司 | Method and arrangement for determination of radio coverage in a multi-cellular mobile radio system |
| CN101438541A (en) * | 2006-09-20 | 2009-05-20 | 松下电器产业株式会社 | Relay transmission device and relay transmission method |
-
2014
- 2014-05-28 CN CN201410230508.0A patent/CN104093182B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1663182A (en) * | 2002-06-18 | 2005-08-31 | Atb自动化技术两合公司 | Method for determining an optimal transmission path in a data network |
| CN101288323A (en) * | 2005-08-23 | 2008-10-15 | 西门子公司 | Method and arrangement for determination of radio coverage in a multi-cellular mobile radio system |
| CN101438541A (en) * | 2006-09-20 | 2009-05-20 | 松下电器产业株式会社 | Relay transmission device and relay transmission method |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107154862A (en) * | 2016-03-04 | 2017-09-12 | 上海海岸展览服务有限公司 | A kind of go-between recommends method and system |
| CN106304230A (en) * | 2016-09-28 | 2017-01-04 | 北京远东仪表有限公司 | Wireless self-networking method and device based on instant route |
| CN106304230B (en) * | 2016-09-28 | 2019-06-21 | 北京远东仪表有限公司 | Based on the wireless self-networking method and device routed immediately |
| CN107889183A (en) * | 2017-10-27 | 2018-04-06 | 深圳友讯达科技股份有限公司 | Data transmission method and device |
| CN111555971A (en) * | 2020-04-26 | 2020-08-18 | 新分享科技服务(深圳)有限公司 | Information distribution platform, system and information distribution method |
| CN116720638A (en) * | 2023-04-13 | 2023-09-08 | 广东工业大学 | Method and system for adjusting inverse shortest path weight based on improved evolutionary algorithm |
| CN116720638B (en) * | 2023-04-13 | 2024-03-26 | 广东工业大学 | Method and system for adjusting inverse shortest path weight based on improved evolutionary algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104093182B (en) | 2018-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Banerjee et al. | Effective fault detection and routing scheme for wireless sensor networks | |
| CN104093182A (en) | Method for acquiring a plurality of reliable communication paths based on field intensity in multi-layer wireless network | |
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN101232517B (en) | Method for disposing poly concourse nodes irrespective of geographical position | |
| CN103906164A (en) | Maritime search and rescue wireless sensor network topology structure and topology control method thereof | |
| CN102740394B (en) | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm | |
| Ben-Moshe et al. | Centdian Computation in Cactus Graphs. | |
| CN103281708A (en) | Wireless sensor node deploying method | |
| CN105407049B (en) | Delay-tolerant network max-flow method for routing based on time aggregation figure | |
| CN103369670A (en) | Improved DV-hop (distance vector-hop) location method based on hop count optimization | |
| CN107222925A (en) | A kind of node positioning method based on cluster optimization | |
| CN108667668A (en) | The access method for routing of base is connected under a kind of urban road scene based on car networking | |
| CN103747498B (en) | Direction angle-based wireless sensor network routing void optimization method | |
| CN105553841B (en) | A kind of efficient distributed intelligence method for routing can effectively prevent signaling storm | |
| Hnaif et al. | A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology. | |
| Cao et al. | A mobility-supported routing mechanism in industrial IoT networks | |
| CN105262534A (en) | Route method and route device applicable to satellite communication network | |
| CN102550070A (en) | Estimation method for loss rates in a packetized network | |
| Wang et al. | A machine learning based connectivity restoration strategy for industrial IoTs | |
| CN104581937A (en) | Node positioning method based on RSSI (received signal strength indicator) | |
| CN106162792B (en) | The limited many-one data routing method of wireless sensor network interior joint degree | |
| Wagh et al. | Optimal route selection for vehicular adhoc networks using lion algorithm | |
| CN104618852A (en) | Hierarchical clustering-based data aggregating method and system | |
| Kumar et al. | Distance based (DBCP) cluster protocol for heterogeneous wireless sensor network | |
| Sharma et al. | Heterogeneous clustering for energy optimization in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 518109 Guangdong Province, Shenzhen New District of Longhua City, Dalang street, Huarong Road Building Technology Industrial Park 2 building, fourth floor Applicant after: SHENZHEN NEOWAY TECHNOLOGY CO., LTD. Address before: 518109 Guangdong city of Shenzhen province Baoan District Longhua Dalang Huarong Road Building Technology Industrial Park 2 Building 4 layer Applicant before: Shenzhen Neoway Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |