CN109474970A - A kind of method for routing suitable for cordless communication network - Google Patents
A kind of method for routing suitable for cordless communication network Download PDFInfo
- Publication number
- CN109474970A CN109474970A CN201811493522.4A CN201811493522A CN109474970A CN 109474970 A CN109474970 A CN 109474970A CN 201811493522 A CN201811493522 A CN 201811493522A CN 109474970 A CN109474970 A CN 109474970A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- communication network
- itself
- connection
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of method for routing suitable for cordless communication network, wherein, comprising: when node sends data to destination node, source node and destination node 1 are jumped: what source node searched itself is directly connected to table, it was found that then data directly transmit with destination node there are straight connection relationship；Source node and destination node 2 are jumped: what source node searched itself is directly connected to table, do not find that there are direct-connected relationships with destination node, that then searches itself is indirectly connected with table, relationship is indirectly connected with if it find that existing with destination node, then data are needed through 1 sending of relaying, and relay node is the node direct-connected simultaneously with source node and destination node.Method for routing suitable for cordless communication network of the invention had both reduced the network overhead that usually routing iinformation occupies, and multinode will not generate and outer addressing overhead again when communicated (in jumping 3) simultaneously, maintained cordless communication network even running.
Description
Technical field
The invention belongs to wireless communication fields, are related to a kind of method for routing relevant to wireless data communication network.
Background technique
With the arrival of digital times, no matter in civilian Internet of Things direction or in military data chain direction, in more piece
How reliable, efficient wireless routing algorithm progress data are utilized under point, indirectly connected radio data network communication requirement environment
Interaction is always one of wireless data communication network research emphasis.It is at present a kind of maturation for big well known ICP/IP protocol
Route test agreement, be widely used on internet.But the protocol development original intention is based on wired network infrastructure
On, less to channel capacity, channel time delay consideration although magnanimity node intercommunication can be supported, drawback is for net
The accessing cost for data of network maintenance is larger, each node requires one more huge routing table of storage and timing is needed to carry out
It updates.Valid data amount and few in the major applications scene of wireless data communication for interaction, number of nodes is general
Also few, but data transmission is needed to simplify, effectively, in real time.If wireless network indiscriminately imitates ICP/IP protocol and carries out routing communication,
Not only there is very big network overhead for safeguarding routing update, and real-time is not also high, hence it is evident that lose more than gain.
Various routing algorithms are proposed for wireless data communication at present thus, can be mainly divided into two major classes: first Ying Lu
By that should be routed with after.Should first route it is similar with TCP/IP Routing Protocol, each node store a routing table, include and from
The routing iinformation of other nodes in own communication range.And is changed according to node and constantly update routing table.The association of Typical Representative
View is DSDV (target sequence distance vector) agreement.After should route each node without timed maintenance routing table, only node needs
Routing addressing is just carried out when communicating.The agreement of Typical Representative is AODV (self network organized and distance vector) agreement.
All there is respective drawback in above-mentioned two classes routing algorithm, should first route each node will fixed time broadcast it is complete complete
Routing iinformation, thus bring channel overhead is larger.Should then route before arbitrary node initiates data transmission every time must initiate
Broadcast addressing, foundation could be unfolded communication, lead to data delay after shaking hands；And works as multinode and communicate simultaneously, while initiating wide
It is larger to will lead to network transient overhead when broadcasting addressing, is easy to cause network congestion.
Summary of the invention
The purpose of the present invention is to provide a kind of method for routing suitable for cordless communication network, which is characterized in that is used for
The drawbacks of solving above-mentioned two classes Routing Protocol.
A kind of method for routing suitable for cordless communication network of the present invention, wherein include: to establish oneself to each node
No. id, each node internal storage space establish itself be directly connected to table and be indirectly connected with table, be directly connected to table and
It is indirectly connected with sheet format, each bit is used to characterize the connection relationship with corresponding node；Node is in reception state, timing
By Radio Link broadcast itself be directly connected to table and be indirectly connected with table to can be direct-connected node；Each node receive with
The connection table information that its direct-connected node is sent, then by update itself be directly connected to table and be indirectly connected with table；When node is to mesh
When marking node transmission data, comprising: source node and destination node 1 are jumped: source node searches the table that is directly connected to of itself, discovery and mesh
Node is marked there are straight connection relationship, then data directly transmit；Source node and destination node 2 are jumped: source node searches the direct of itself
Connection table does not find that there are direct-connected relationships with destination node, then that searches itself is indirectly connected with table, if it find that and destination node
In the presence of the relationship that is indirectly connected with, then data are needed through 1 sending of relaying, relay node be with source node and destination node simultaneously
Direct-connected node；Source node and destination node 3 are jumped: source node searches being directly connected to table and being indirectly connected with table for itself, does not send out
Now with destination node there are connection relationship, then searches and to be indirectly connected with table with its direct-link node, find certain nodes and mesh at this time
Mark node, which exists, is indirectly connected with relationship, then data are needed through 2 sendings of relaying, and the first relay node is direct with source node
Connection and the node being indirectly connected with destination node, the second relay node are straight simultaneously with the first relay node and destination node
Node even.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein 0 to 31 this 32 numbers
Word successively represents No. id of each node, each node is directly connected to table and in succession what internal storage space established itself
Connect table.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein each connection table
It is the storage unit of 1 32bit, a bit respectively represents 0 to 31 nodes from 0 to 31, and it is corresponding with No. id of node, each
Bit are used to characterize the connection relationship with corresponding node.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein all connection tables
Initial value is all 0.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein timing is cleared up invalid
Connection table.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein when between certain time
When interior connection table any update does not occur, then connection table is reset.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein jump this process 3
In, the judgement of first step source node carries out three and jumps relaying, then starts routing, specifies the first relay node, and information is transmitted in first
It carries out secondary relaying again after node, is equivalent to 2 jumps for the first relay node at this time, that is, searches being indirectly connected with for itself
Table come specify next time relay node.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein source node and target
Jump of node 4 or more: local can be calculated first with itself connection table and other node connection tables of local node storage
The connection quantity of node is that local maxima if it is maximum then automatically becomes local cluster head, otherwise compared with other nodes
As ordinary node, cluster head undertakes the relay services of 4 jumps or more.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein further include: communication matter
The factor is measured, wherein the communication quality factor is calculated by the direct-connected quantity of node, the parameter weightings such as node signal field strength, communication disruption number
It obtains, in 2 jumps or more routing, if routed path is not unique, passes through communication quality selecting predictors optimal path.
One embodiment of the method for routing according to the present invention suitable for cordless communication network, wherein further include: inverse path
Feedback mechanism starts inverse path feedback mechanism to original if routing procedure relay node finds next node communication disruption
Node feeding back relays failure information, reselects new routed path.
Method for routing suitable for cordless communication network of the invention had both reduced the network that usually routing iinformation occupies and had opened
Pin, multinode will not generate and outer addressing overhead again when communicated (in jumping 3) simultaneously, and cordless communication network is maintained steadily to transport
Row.
Detailed description of the invention
Fig. 1 show all connection table schematic diagrames that each node includes；
Fig. 2 show communication node connection and routing schematic diagram；
Fig. 3 show cluster head and adaptively generates and extend routing algorithm schematic diagram.
Specific embodiment
To keep the purpose of the present invention, content and advantage clearer, with reference to the accompanying drawings and examples, to of the invention
Specific embodiment is described in further detail.
Fig. 1 show all connection table schematic diagrames that each node includes, and Fig. 2 show communication node connection and routing
Schematic diagram, Fig. 3 show cluster head and adaptively generate and extend routing algorithm schematic diagram, as shown in Figure 1 to Figure 3, each in Fig. 1
Small lattice represent 1bit, and the idx (x represents 0 to 31) in small lattice indicates that the small lattice are corresponding with idx, and four-headed arrow represents in Fig. 2 Fig. 3
Two nodes can be direct-connected by Radio Link, otherwise needs to connect by other node-routings.
As shown in Figure 1 to Figure 3, a kind of method for routing suitable for cordless communication network of the present invention includes:
1, No. id that oneself is established to each node, in the present invention, this 32 numbers of use 0 to 31 successively represent each
No. id of node.Each node internal storage space establish itself be directly connected to table and be indirectly connected with table, be directly connected to
It table and is indirectly connected with sheet format and sees Fig. 1.It is also established simultaneously for other 31 nodes and is directly connected to table and in succession correspondingly
Connect table.Each connection table is substantially exactly the storage unit of 1 32bit, and a bit respectively represents 0 to 31 sections from 0 to 31
Point, corresponding with No. id of node, each bit for characterizing, (1 representative has connection, and 0 represents with the connection relationship of corresponding node
It is connectionless).The initial value of all connection tables is all 0.The update of connection table is described in detail with step 3 is maintained in.
2. each node is generally in reception state, but needs periodically to broadcast two companies of itself by Radio Link
Table is connect to node that can be direct-connected with it, this broadcasts as the major cost for realizing network routing.Since two connection tables account in total
With 64bit, so the expense very little that the broadcast of single single node occupies.The expense of whole network is equal to 64bit* number of nodes * T, T
For fixed time broadcast interval.Fixed time interval determines to be obtained by the node stability estimation of network itself, in present invention specific implementation
Primary using 1s transmission, the network that can calculate 32 nodes in the present invention is per second for safeguarding opening for network routing
Pin is only 2Kb.
3, each node once receives the connection table information that the node direct-connected with it is sent, then will update the direct of itself
Connection table and it is indirectly connected with table.It is directly connected to table by Fig. 2A node and for being indirectly connected with the update of table, passes through Radio Link
Perception, A node receives B node message, and is directly connected to table by what reception B node was sent, it is known that B node is the straight of its
Connecting node is connect, and C, D node being connected directly with B node are indirectly connected with node for A node.Assuming that No. id of B node is
5, C, No. id of D node is 7,9, then A node is directly connected to the 5th position 1 of table, is indirectly connected with the 7th, 9 positions 1 of table, other
Invariant position (connection epitope number is also started counting from 0).The B node two received is finally opened connection table update A node locally to deposit
Being directly connected to of the correspondence B node of storage and is indirectly connected with table at table.In addition it is the validity in order to ensure connection table, needs timing clear
Invalid connection table is managed, i.e., each connection table has corresponding monitoring and clearing control signal.When being connected in certain time interval
When table does not occur any update, then connection table is reset, realizes the maintenance function to connection table.
4, it when node sends data to destination node, is jumped individually below with 1, situations point more than 2 jumps, 3 jumps and 4 jumps
Specific route implementing is not introduced.
Source node and destination node 1 are jumped: source node searches the table that is directly connected to of itself, and there are direct-connected with destination node for discovery
Relationship is connect, then data directly transmit, and are not necessarily to relay node.
Source node and destination node 2 are jumped: source node searches the table that is directly connected to of itself, does not find to exist with destination node straight
Even relationship, then that searches itself is indirectly connected with table.It is indirectly connected with relationship if it find that existing with destination node, then data need logical
1 sending of relaying is crossed, relay node is the node direct-connected simultaneously with source node and destination node.
Source node and destination node 3 are jumped: source node searches being directly connected to table and being indirectly connected with table for itself, do not find and
Destination node is then searched and to be indirectly connected with table with its direct-link node there are connection relationship.Certain nodes and target section are found at this time
Point exist is indirectly connected with relationship, then data need by relaying 2 times sending, relay node 1 be with source node be directly connected to
And the node being indirectly connected with destination node.Relay node 2 is the node direct-connected simultaneously with relay node 1 and destination node.3
During jumping this, source node knows that destination node can be finished into 3, it is also known that relay node 1, but do not know relay node
2, therefore three jump routings are actually to be divided into the progress of two steps, the judgement of first step source node can carry out three jump relayings, then start road
By specifying the first relay node, information is transmitted to after the first relay node carries out secondary relaying again, saves at this time to the first relaying
2 jumps are equivalent to for point, that is, that searches itself is indirectly connected with table to specify the relay node of next time.In this way when twice relaying terminate
3 jumps routing is completed afterwards.Although source node fails the node of specified complete routing, substantial road in initial routing
It is unique by path, broadcast addressing process, not additional network overhead is not present.
By taking Fig. 2 as an example, if A node is want to communicate with E node, it search itself be directly connected to table and to be indirectly connected with table equal
E is not found, then searches the table that is indirectly connected with of the B node direct-connected with it, and discovery B node is indirectly connected in E node, Ke Yiqi
Dynamic routing, specifying relay node 1 is B node, and after information is transmitted to B node, B node is again started up routing, and specifying D is relaying section
Point 2.
Source node and the jump of destination node 4 or more: the present invention can carry out algorithm extension to meet higher hop count demand.It is first
First with itself connection table and other node connection tables of local node storage can calculate the connection quantity of local node with
It is that local maxima if it is maximum then automatically becomes local cluster head compared with other nodes (with the node that this node is direct-connected),
Otherwise it is used as ordinary node.Cluster head mainly undertakes the relay services of 4 jumps or more.By taking Fig. 3 as an example, when B node passes through network data
When exchange perception itself is maximum for part connection, cluster head is automatically become, can be selected after A node starts routing failure to F node
Select starting broadcast addressing, B node undertakes routing addressing task as cluster head, i.e., A node starting broadcast it is target-seeking after, if B node
F node can be routed to, then B node feeds back to A node, and starts routing, repeat broadcast is otherwise carried out by cluster head B node, this
Sample can be avoided each node and carry out broadcast addressing, the as far as possible overhead of reduction Web broadcast generation.
5, in order to guarantee the communication reliability of routing, the communication quality factor and inverse is additionally added in Routing Protocol of the invention
Path feedback mechanism.Wherein the communication quality factor is added by the direct-connected quantity of node, the parameters such as node signal field strength, communication disruption number
Power is calculated.In 2 jumps or more routing, if routed path is not unique, pass through the optimal road of communication quality selecting predictors
Diameter.By taking Fig. 3 as an example, the illustratively selection of optimal path, it is assumed that A node is want to communicate with D node, and the path that it can choose has
A-B-D and A-G-D, A node can connection quantity to B, G node, the communication quality between A, B and A, G carries out tradeoff can be with
The communication quality factor of both links is calculated, the big path of quality factor is optimal path.In the present example it is assumed that A, B and A, G
Between communication quality it is suitable, then the connection quantity due to B is more, for balanced node load, optimal path should select A-
G-D., whereas if the well communication quality between A, G of A, B communication quality, then, optimal path should select A-B-D.If road
Next node communication disruption is found by process relay node, then starts inverse path feedback mechanism to origin node and feeds back relaying failure
Information reselects new routed path.
The present invention is that the own characteristic of foundation wireless data chain and route need are proposed.Applying has 32 at one
It on the wireless data catenary system of node, supports 3 to jump communication function, also supports the extension function of 4 jumps or more.Each node is without depositing
Store up whole network routing table, it is only necessary to establish, safeguard and regularly send two 32bit connection tables.When node needs to carry out
As long as the when destination node of communication does not need to carry out routing broadcast addressing within jumping three yet, the routed path of optimization is directly established
It is communicated, not additional network overhead and data delay.Since the node in wireless data chain is relatively fewer, usually communicate
Within range is jumped 3, so what the present invention can be fabulous applies under wireless data catenary system.
Although being not limited only to the quantity node it should be noted that the present invention is applied in the network of 32 nodes
Network, number of nodes is corresponding with the bit wide of connection table, when network applied to different number of nodes, only modifies all connections
The bit wide of table.If number of nodes is excessively huge, whole network can be divided into several subnets, each subnet it is specified or
Cluster head is competed out, using cascade mode, i.e., the cluster head of each subnet is as whole net node independent, whole net and subnet
It is internal to apply this routing algorithm respectively.
Method for routing suitable for cordless communication network of the invention had both reduced the network overhead that usually routing iinformation occupies,
Multinode will not generate and outer addressing overhead again when communicated (in jumping 3) simultaneously, maintain cordless communication network even running.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (10)
1. a kind of method for routing suitable for cordless communication network characterized by comprising
Establish oneself No. id to each node, each node internal storage space establish itself be directly connected to table and
It is indirectly connected with table, be directly connected to table and is indirectly connected with sheet format, each bit connection for being used to characterize with corresponding node is closed
System；
Node is in reception state, periodically broadcasts being directly connected to table and being indirectly connected with table to can be straight for itself by Radio Link
Node even；
Each node receives the connection table information that the node direct-connected with it is sent, then by update itself be directly connected to table and
Connect connection table；
When node sends data to destination node, comprising:
Source node and destination node 1 are jumped: source node searches the table that is directly connected to of itself, and discovery connects pass there are direct-connected with destination node
System, then data directly transmit；
Source node and destination node 2 are jumped: source node searches the table that is directly connected to of itself, does not find that there are direct-connected passes with destination node
System, then that searches itself be indirectly connected with table, is indirectly connected with relationship if it find that existing with destination node, then data needs pass through
It is issued after 1 time, relay node is the node direct-connected simultaneously with source node and destination node；
Source node and destination node 3 are jumped: source node searches being directly connected to table and being indirectly connected with table for itself, does not find and target
Node is then searched and to be indirectly connected with table with its direct-link node, find that certain nodes are deposited with destination node at this time there are connection relationship
In the relationship that is indirectly connected with, then data are needed through 2 sendings of relaying, the first relay node be directly connected to source node and
The node being indirectly connected with destination node, the second relay node are the section direct-connected simultaneously with the first relay node and destination node
Point.
2. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that 0 to 31 this 32 numbers
Word successively represents No. id of each node, each node is directly connected to table and in succession what internal storage space established itself
Connect table.
3. being suitable for the method for routing of cordless communication network as claimed in claim 2, which is characterized in that each connection table is
The storage unit of 1 32bit, a bit respectively represents 0 to 31 nodes from 0 to 31, corresponding with No. id of node, each
Bit are used to characterize the connection relationship with corresponding node.
4. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that at the beginning of all connection tables
Initial value is all 0.
5. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that timing is cleared up invalid
Connection table.
6. being suitable for the method for routing of cordless communication network as claimed in claim 5, which is characterized in that work as certain time interval
When interior connection table does not occur any update, then connection table is reset.
7. being suitable for the method for routing of cordless communication network as claimed in claim 4, which is characterized in that jump this process 3
In, the judgement of first step source node carries out three and jumps relaying, then starts routing, specifies the first relay node, and information is transmitted in first
It carries out secondary relaying again after node, is equivalent to 2 jumps for the first relay node at this time, that is, searches being indirectly connected with for itself
Table come specify next time relay node.
8. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that source node and target section
4 jump of point or more: local section can be calculated first with itself connection table and other node connection tables of local node storage
Whether local maxima if it is maximum then automatically becomes local cluster head to the connection quantity of point with other nodes compared with, otherwise makees
For ordinary node, cluster head undertakes the relay services of 4 jumps or more.
9. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that further include: communication matter
The factor is measured, wherein the communication quality factor is calculated by the direct-connected quantity of node, the parameter weightings such as node signal field strength, communication disruption number
It obtains, in 2 jumps or more routing, if routed path is not unique, passes through communication quality selecting predictors optimal path.
10. being suitable for the method for routing of cordless communication network as described in claim 1, which is characterized in that further include: inverse path
Feedback mechanism starts inverse path feedback mechanism to original if routing procedure relay node finds next node communication disruption
Node feeding back relays failure information, reselects new routed path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811493522.4A CN109474970A (en) | 2018-12-07 | 2018-12-07 | A kind of method for routing suitable for cordless communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811493522.4A CN109474970A (en) | 2018-12-07 | 2018-12-07 | A kind of method for routing suitable for cordless communication network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109474970A true CN109474970A (en) | 2019-03-15 |
Family
ID=65675797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811493522.4A Pending CN109474970A (en) | 2018-12-07 | 2018-12-07 | A kind of method for routing suitable for cordless communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109474970A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110809305A (en) * | 2019-11-11 | 2020-02-18 | 天津津航计算技术研究所 | Multi-node low-overhead wireless routing method |
| WO2021134718A1 (en) * | 2019-12-31 | 2021-07-08 | 华为技术有限公司 | Multi-hop path data transmission method and device |
| CN113115398A (en) * | 2021-03-01 | 2021-07-13 | 北京遥测技术研究所 | Aircraft cluster networking routing method based on software defined network |
| CN113596857A (en) * | 2021-09-28 | 2021-11-02 | 正链科技(深圳)有限公司 | Distributed network and construction method thereof |
| CN113873611A (en) * | 2021-09-24 | 2021-12-31 | 天津津航计算技术研究所 | Wireless network cluster head self-adaptive competition method |
| CN115767565A (en) * | 2022-10-17 | 2023-03-07 | 北京交通大学 | Hierarchical networking-based multilevel network construction method and hierarchical resource scheduling method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1703697A (en) * | 2002-09-18 | 2005-11-30 | 斯凯瑞网络有限公司 | Systems, methods and programming for routing and indexing globally addressable objects and associated business models |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| US20120127855A1 (en) * | 2009-07-10 | 2012-05-24 | Nokia Siemens Networks Oy | Method and device for conveying traffic |
-
2018
- 2018-12-07 CN CN201811493522.4A patent/CN109474970A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1703697A (en) * | 2002-09-18 | 2005-11-30 | 斯凯瑞网络有限公司 | Systems, methods and programming for routing and indexing globally addressable objects and associated business models |
| US20120127855A1 (en) * | 2009-07-10 | 2012-05-24 | Nokia Siemens Networks Oy | Method and device for conveying traffic |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
Non-Patent Citations (1)
| Title |
|---|
| 李志明等: "以太网链路层虚拟交换机拓扑发现算法研究与实现", 《微计算机信息》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110809305A (en) * | 2019-11-11 | 2020-02-18 | 天津津航计算技术研究所 | Multi-node low-overhead wireless routing method |
| CN110809305B (en) * | 2019-11-11 | 2023-06-09 | 天津津航计算技术研究所 | Multi-node low-overhead wireless routing method |
| WO2021134718A1 (en) * | 2019-12-31 | 2021-07-08 | 华为技术有限公司 | Multi-hop path data transmission method and device |
| CN114846903A (en) * | 2019-12-31 | 2022-08-02 | 华为技术有限公司 | Data transmission method and device of multi-hop path |
| CN114846903B (en) * | 2019-12-31 | 2024-08-27 | 华为技术有限公司 | Data transmission method and device for multi-hop path |
| CN113115398A (en) * | 2021-03-01 | 2021-07-13 | 北京遥测技术研究所 | Aircraft cluster networking routing method based on software defined network |
| CN113873611A (en) * | 2021-09-24 | 2021-12-31 | 天津津航计算技术研究所 | Wireless network cluster head self-adaptive competition method |
| CN113873611B (en) * | 2021-09-24 | 2023-10-31 | 天津津航计算技术研究所 | Adaptive competition method for wireless network cluster head |
| CN113596857A (en) * | 2021-09-28 | 2021-11-02 | 正链科技(深圳)有限公司 | Distributed network and construction method thereof |
| CN113596857B (en) * | 2021-09-28 | 2022-02-01 | 正链科技(深圳)有限公司 | Distributed network and construction method thereof |
| CN115767565A (en) * | 2022-10-17 | 2023-03-07 | 北京交通大学 | Hierarchical networking-based multilevel network construction method and hierarchical resource scheduling method |
| CN115767565B (en) * | 2022-10-17 | 2024-08-02 | 北京交通大学 | Hierarchical networking-based multi-level network construction method and hierarchical resource scheduling method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109474970A (en) | A kind of method for routing suitable for cordless communication network | |
| CN1926820B (en) | Method, communication device and system for checking neighbor node using NDP in wireless multi-hop network | |
| CN101124568B (en) | System and method for routing ISIS traffic through unidirectional links of a computer network | |
| CN103534993B (en) | Connect the system of selection of Tag switching route and the device in low-power network territory | |
| US7894378B2 (en) | Method for updating a multicast state of a multicast group | |
| US8009615B2 (en) | Multi-hop ad-hoc wireless networks that support non-multi-hop wireless terminals | |
| EP1826964B1 (en) | Configuration of a mobile adhoc network | |
| US20110002226A1 (en) | Method for Discovering Routes in Wireless Communications Networks | |
| CN104378297A (en) | Message forwarding method and device | |
| CN101521895A (en) | Forwarding method used for constructing multi-hop routing in wireless self-organizing network | |
| CN105827748A (en) | Method for traversing Symmetric NAT (Network Address Translator) device by SIP (Session Initiation Protocol) based on ICE (Interactive Connectivity Establishment) | |
| CN102957589A (en) | Method, network node and system for service data transmission | |
| CN102984781B (en) | Neighbor node judgment method for wireless ad hoc network route | |
| CN104301252A (en) | Data sending system and method | |
| CN102196458A (en) | Networking method and devices of wireless broadband sensor network | |
| KR20050076176A (en) | System and method for communicating between ipv6 mobile ad-hoc network and external network | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| CN104469877A (en) | 433M wireless automatic networking method and system | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN105119828A (en) | Fast wireless network routing achievement method | |
| CN103763750A (en) | Method for fast achieving packet forwarding in wireless ad hoc network of TDMA protocol | |
| CN103023775A (en) | Router in OSPF (open shortest path first) network and processing method thereof | |
| US20070115828A1 (en) | Method for sending requests in a network | |
| CN105050148A (en) | Implementation method for routing of wireless sensor network | |
| CN102035730A (en) | Fusion network system architecture supporting WLAN to cross MANET for communication and on-demand routing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190315 |