CN108811029A - A kind of car networking method for routing recognizing interactive degree based on node - Google Patents
A kind of car networking method for routing recognizing interactive degree based on node Download PDFInfo
- Publication number
- CN108811029A CN108811029A CN201810401262.7A CN201810401262A CN108811029A CN 108811029 A CN108811029 A CN 108811029A CN 201810401262 A CN201810401262 A CN 201810401262A CN 108811029 A CN108811029 A CN 108811029A
- Authority
- CN
- China
- Prior art keywords
- node
- interactive degree
- cognition
- interaction
- interactive
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- 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
Abstract
The present invention provides a kind of car networking method for routing recognizing interactive degree based on node, includes the following steps, step 1, the initialization of urban road network；Step 2, node connection is established；Step 3, relay node is screened；Step 4, message dilivery is completed；Delivery ratio is high, and network overhead is few, and end-to-end time delay is low, effectively improves the efficiency of data transmission in car networking environment, adapts to the multiple factors of data transmission in urban road network environment.
Description
Technical field
The invention belongs to car networking field of communication technology, it is related to a kind of method for routing of vehicle node communication, specially one
Kind recognizes the car networking method for routing of interactive degree based on node.
Background technology
With the fast development of car networking technology in recent years, urban transportation interconnection is gradually in a manner of intelligent and Collaborative
Running.But it is similar with other opening dynamic networks, since urban traffic network is changeable with topological structure dynamic, vehicle interaction
The features such as time is of short duration and vehicle node is unevenly distributed often will appear interruption and the report of network connection and data communication
Literary data are difficult to by suitably relaying phenomena such as reaching destination node.
And there is delay-tolerant network (Delay Tolerant Network, DTN) network topology time variation and network to connect
The features such as logical intermittent, and for the agreement in DTN networks with " storage-carrying-forwarding (store-carry-forward) "
Mode transmission data.Therefore DTN technologies are extended and are applied in urban traffic network, message will be effectively improved
The accessibility and reliability of data delivery.In the urban traffic network of application DTN technologies, how data biography is effectively carried out
It is defeated, it is challenging problem.
Invention content
For problems of the prior art, the present invention provides a kind of car networking routing recognizing interactive degree based on node
Method, delivery ratio is high, and network overhead is few, and end-to-end time delay is low, effectively improves the efficiency of data transmission in car networking environment, adapts to
The multiple factors of data transmission in urban road network environment.
The present invention is to be achieved through the following technical solutions：
A kind of car networking method for routing being recognized interactive degree based on node, is included the following steps,
Step 1, the initialization of urban road network；
Group division is carried out to the vehicle in urban road network, and each node maintenance three in urban road network is made to open
Table：Recognize interactive degree table, interaction times table and interaction time table；Content closes present node in the form of key-value pair in table
The information of connection carries out quantization storage, and the historical behavior information of node is recorded with this；It recognizes in interactive degree table, by urban road network
Historical behavior information quantization between interior joint is as the cognition interactive degree between node；According to the vehicle in urban road network into
The node type of row group division Hou Ge groups, corresponds to respective initialization interactive degree respectively；
Step 2, node connection is established；
When the node A and node B in urban road network is within mutual communication range, then by needing to carry out
The node A of data forwarding initiates the connection request, connects and reaches if node B receives the request, forms connection pair；
Node A and node B to primary about increasing with the interaction times of another end node in the interaction times table safeguarded,
And it being updated to current time about the interaction time with another end node in the interaction time table safeguarded, then update is tieed up
About the metric with another end node in the cognition interactive degree table of shield；
Step 3, relay node is screened；
On the basis of two nodes are established and connected, the node A for carrying out data forwarding is needed to judge that the node B being attached thereto is
It is no to carry out message transmission with other nodes, it finds the node in new communication context again if transmitting and executes step
Rapid 2 obtain connection, otherwise enter relay node screening and judge；
About the cognition interactive degree of message dilivery terminal and connecting in the cognition interactive degree table maintained by comparing node A
The cognition interactive degree about message dilivery terminal maintained in the node B connect carries out screening judgement；
Illustrate that frequency of interaction and the delivery success rate of node B and message dilivery terminal are higher if the former is smaller, saves
Point A gives message dilivery to current connected node B；
Disconnected if the latter is smaller, posterior nodal point A find again other nodes in range execute step 2 establish connect
It connects and repeats above-mentioned screening and judge, up to finding next-hop node, otherwise to move in the form of carrying and store always；
Step 4, message dilivery is completed；
Node B after screening is successfully received the message that node A is delivered, then node B compares message field and judges certainly
Body whether be message dilivery terminal；
If then assert that all relay nodes that message is passed through contribute this transmission, node B passes through message field
Obtain all relay nodes for being passed through of message, and according to the distance apart from itself, i.e., roundup propagate hop count and physics away from
From updating the cognition interactive degree about all relay nodes on path that this node is maintained one by one；
If not then initiating the connection request by the node B after screening, step 2 is executed up to message dilivery to terminal.
Preferably, in step 1, group division is carried out to the vehicle in urban road network, is divided into private car and taxi
Vehicle, police car and enforcement vehicle and three node types of public transport, and according to the confidence level, characteristic distributions and traveling according to vehicle
The difference of route assigns different initialization interactive degree.
Further, according to the node type after division, it is respectively 0.5,0.6 and to correspond to respective initialization interactive degree respectively
0.7。
Preferably, in step 2, if the letter for containing another end node in the cognition interaction table that node A or node B are safeguarded
Breath illustrates to have before two nodes interactive；Then according to the sequence of formula (1) (2) (3) to cognition interactive degree table in about with it is another
The metric of end node is updated；
Wherein, index indicates active index, i.e. frequency of interaction between two nodes；T refers to current time, tlast_updateRefer to
Generation last 2 interaction times；Add is indicated by the associated interactive increment of active index；CIbaseIndicate that last update is deposited
The cognition interactive degree about the node of storage, and assign weight e for it-t；CI be update after cognition interactive degree table in about with it is another
The metric of end node.
Preferably, in step 2, if not including in the cognition interaction table of present node has the information for connecting another end node,
Unprecedented interaction before illustrating two nodes, at this time according to the initialization interactive degree of node type, it is recognized interactive degree table into
The following update of row；
Wherein, CI is to be recognized in interactive degree table about the metric with another end node, CI after updatingini_typeFor node class
The initialization interactive degree of type.
Further, in step 4, according to the following formula one by one update screening posterior nodal point B maintained about all relayings on path
The cognition interactive degree of node；
Wherein：Num_hop refers to that hop count of the corresponding node apart from this node, distance refer to two in transmission path
Physical distance between a node, if CIbaseNot include about certain node on path in the empty i.e. cognition interaction table of present node
Information, then unprecedented interaction before illustrating two nodes carries out just the cognition interactive degree of the node now referring to formula (4)
Beginningization assignment.
Compared with prior art, the present invention has technique effect beneficial below：
The present invention considers the mobility and characteristic distributions of particular vehicle in urban traffic environment, preferably in order to build
Network data transmission environment under urban traffic environment being recognized between natural person and natural person based on social in analogy human society
Know accumulation.It, i.e., will be between nodes by defined cognitive interactive degree (Cognitive Interaction, CI) this concept
Historical behavior information quantization as the cognition interactive degree between node, by the message dilivery between the frequency of interaction and node between node
Success rate carries out nonlinear combination.And the foundation selected accordingly as next-hop node in next messaging procedure.Pass through needle
Group division is carried out to the vehicle in urban road network, and each node maintenance three in urban road network is made to open table：Cognition
Interactive degree table, interaction times table and interaction time table, in table content in the form of key-value pair to the letter associated by present node
Breath carries out quantization storage, and the historical behavior information of node is recorded with this.During data interaction by history meet situation and
History delivers situation and incorporates basis for estimation, and gives corresponding excitation to the node of successful delivery, is finally presented with Probability Forms
The accessibility of message dilivery selects suitably to relay with this.Due to protocol function infiltrate into connection establish, relay node screening,
Message dilivery completes three phases, has fully excavated the influence factor covered in data transmission procedure, to realize between node
Efficiently, low consumption, the interaction of safety, improve network transmission performance and data delivery quality.
Specific implementation mode
With reference to specific embodiment, the present invention is described in further detail, it is described be explanation of the invention and
It is not to limit.
The present invention merges prophet agreement thoughts, and avoidance system " cold start-up " problem fully considers true urban transportation road
In net different vehicle node with having different distributions feature and mobility the case where, whether concern next-hop can be high as relaying
Effect gives the incentive measure of response for participating in the node of interaction and relaying accurately by message dilivery to destination node, from
And active networks interact, and promote information forwarding.Specific steps include：1. node connection establishes 2. relay nodes and screens the throwing of 3. message
Pass completion
Step 1：Connect establishment stage
When the node A of urban transportation Lu Luozhong and node B are within mutual communication range, then by needing to carry out
The node A of data forwarding initiates the connection request, connects and reaches if node B receives the request, forms connection pair.Once connection pair
The malicious act for then assert that " taking Bao Bufa " is not present in node A is constituted, and the malicious act of " refusal interaction " is not present in node B,
Thus assert that the node A and node B for forming the connection pair are willing to participate in network interaction.Two nodes are to the interaction times table safeguarded
In about with the interaction times of another end node increase it is primary and by the interaction time table safeguarded about with another end node
Interaction time be updated to current time, then about the measurement with another end node in the safeguarded cognition interactive degree table of update
Value.
If the information for containing another end node in the cognition interaction table safeguarded, illustrates to have before two nodes interactive.Then
According to the sequence of formula (1) (2) (3) to being updated about the metric with another end node in cognition interactive degree table.Wherein
Index in formula (1) indicates " active index ", that is, refers to the number that two nodes interact in the unit interval, i.e. frequency of interaction, as
The index of node liveness is described.Wherein t refers to current time, tlast_updateRefer to last 2 interaction times；Formula (2)
Middle add is indicated by the associated interactive increment of active index；Formula (3) indicate cognition interactive degree at any time with interaction frequent degree and
Irregularly update, wherein CIbaseIt indicates the cognition interactive degree about the node that last update is stored, and weight is assigned for it
e-t, so that it is reduced increase with time to the influence degree of present cognitive interactive degree, opposite interaction increment add hands over current cognition
The influence degree mutually spent is slowly increased over time.
If not including in the cognition interaction table of present node has the information for connecting another end node, illustrate two nodes before not
Once had it is interactive, at this time according to the initialization interactive degree of node type, in cognition interactive degree table about with another end node
Metric is updated as follows, i.e.,：
Specific CIini_typeValue is with reference to table 1.
The algorithm flow of specific connection establishment stage is described as follows
The vehicle in urban road network is broadly dassified into 3 grades herein, and according to the confidence level of vehicle, point
Cloth feature and the difference of travel route assign different initialization interactive degree, specifically the distribution of private car and taxi and
Travel route has not regulation, and uncertain at network struction initial stage as the confidence in security of relaying；And police car and municipal administration
Although enforcement vehicle accounts for urban transportation vehicle ratio less, but its higher credit grade and longer patrol route make it possess
The good condition as relaying；Last public transport not only has fixed and longer traveling as the main force of Urban Transportation
Route and huge operation radix, and homeostasis is credible.
Initialized for different types of vehicle, contribute to the orderly initialization of network communication, promote private car and
The data transmission carrier that this kind of Base of population of taxi is big, interbehavior is totally different plays an active part in network data forwarding, otherwise
It will be abandoned by data carrying carrier in the selection of next-hop.If node refusal is attached, the cognition of this part is handed over
Mutually degree increases missing, and relative to the cognition increased point of interactive degree, the point of such " passive malice " will be gradually excluded in network
Except communication.By the way that mechanism involvement routing policy is helped to improve frequency of interaction so that network is more active.
1 node interactive degree initial table of table
Step 2：Relay node screening stage
On the basis of two nodes are established and connected, the node A for carrying out data forwarding is needed to judge that the node B being attached thereto is
It is no to carry out message transmission with other nodes, it finds the node in new communication context again if transmitting and executes step
Rapid one obtains connection, otherwise enters relay node screening and judges.
About the cognition interactive degree of message dilivery terminal and connecting in the cognition interactive degree table maintained by comparing node A
The cognition interactive degree about message dilivery terminal maintained in the node B connect carries out screening judgement, illustrates if the former is smaller
The frequency of interaction and delivery success rate of node B and message dilivery terminal are higher, then node A gives message dilivery current connected
Node B；Disconnected if the latter is smaller, posterior nodal point A find again other nodes in range execute step 1 establish
Above-mentioned judgement is connected and repeated until finding suitable next-hop node, is otherwise moved in the form of " carrying storage " always.
The algorithm flow of relay node screening is as follows：
Step 3：Message dilivery completes the stage
Node B after screening is successfully received the message that node A is delivered, then node B compares message field and judges
Whether itself is the terminal of message dilivery, if then assert that all relay nodes that message is passed through contribute this transmission,
Node B obtains all relay nodes that message is passed through by message field, and according to the distance apart from itself, i.e. roundup
Hop count and physical distance are propagated, updates the cognition interactive degree about all relay nodes on path that this node is maintained one by one.
Wherein：Num_hop refers to hop count of the corresponding node apart from this node in transmission path, and distance is referred to
Physical distance between two nodes, if CIbaseNot include about certain section on path in the empty i.e. cognition interaction table of present node
The information of point, then unprecedented interaction before illustrating two nodes, now referring to formula (4) and table 1 in table about the node
Cognition interactive degree carries out initialization assignment.
If not then initiating the connection request by the node B after screening, step 2 is executed up to message dilivery to terminal.
The algorithm flow that message dilivery is completed is as follows：
This method proposes to can be used for car networking ring using the method for routing of the interaction cognition degree based on vehicle node, this method
The selection of data transmission routing strategy, can effectively improve the data transmission efficiency of entire car networking in border.
Claims (6)
1. a kind of car networking method for routing recognizing interactive degree based on node, which is characterized in that include the following steps,
Step 1, the initialization of urban road network；
Group division is carried out to the vehicle in urban road network, and each node maintenance three in urban road network is made to open table：
Recognize interactive degree table, interaction times table and interaction time table；In table content in the form of key-value pair to associated by present node
Information carry out quantization storage, the historical behavior information of node is recorded with this；It recognizes in interactive degree table, it will be in urban road network
Historical behavior information quantization between node is as the cognition interactive degree between node；It is carried out according to the vehicle in urban road network
The node type of group division Hou Ge groups corresponds to respective initialization interactive degree respectively；
Step 2, node connection is established；
When the node A and node B in urban road network is within mutual communication range, then by needing to carry out data
The node A of forwarding initiates the connection request, connects and reaches if node B receives the request, forms connection pair；
Node A and node B, and will to primary about increasing with the interaction times of another end node in the interaction times table safeguarded
It is updated to current time about the interaction time with another end node in the interaction time table safeguarded, then update is safeguarded
It recognizes in interactive degree table about the metric with another end node；
Step 3, relay node is screened；
On the basis of two nodes are established and connected, need whether just the node A for carrying out data forwarding judges the node B being attached thereto
Message transmission is being carried out with other nodes, the node in new communication context is being found again if transmitting and executes step 2
Connection is obtained, otherwise enters relay node screening and judges；
It about the cognition interactive degree of message dilivery terminal and is connected in the cognition interactive degree table maintained by comparing node A
The cognition interactive degree about message dilivery terminal maintained in node B carries out screening judgement；
Illustrate that frequency of interaction and the delivery success rate of node B and message dilivery terminal are higher if the former is smaller, node A will
Message dilivery gives current connected node B；
Disconnected if the latter is smaller, posterior nodal point A find again other nodes in range execute step 2 establish connection simultaneously
Above-mentioned screening is repeated to judge, up to finding next-hop node, otherwise to move in the form of carrying and store always；
Step 4, message dilivery is completed；
Node B after screening is successfully received the message that node A is delivered, then node B controls message field judges that itself is
No is the terminal of message dilivery；
If then assert that all relay nodes that message is passed through contribute this transmission, node B is obtained by message field
All relay nodes that message is passed through, and according to the distance apart from itself, i.e. roundup propagates hop count and physical distance, by
One updates the cognition interactive degree about all relay nodes on path that this node is maintained；
If not then initiating the connection request by the node B after screening, step 2 is executed up to message dilivery to terminal.
2. a kind of car networking method for routing recognizing interactive degree based on node according to claim 1, which is characterized in that step
In rapid 1, group division is carried out to the vehicle in urban road network, is divided into private car and taxi, police car and enforcement vehicle
With three node types of public transport, and according to according to the confidence level of vehicle, characteristic distributions and travel route it is different assign it is each
Different initialization interactive degree.
3. a kind of car networking method for routing recognizing interactive degree based on node according to claim 2, which is characterized in that root
According to the node type after division, it is respectively 0.5,0.6 and 0.7 to correspond to respective initialization interactive degree respectively.
4. a kind of car networking method for routing recognizing interactive degree based on node according to claim 1, which is characterized in that step
In rapid 2, if the information for containing another end node in the cognition interaction table that node A or node B are safeguarded, illustrates have before two nodes
It crosses interactive；Then according to the sequence of formula (1) (2) (3) to being carried out about with the metric of another end node in cognition interactive degree table
Update；
Wherein, index indicates active index, i.e. frequency of interaction between two nodes；T refers to current time, tlast_updateIn reference
Primary 2 interaction times；Add is indicated by the associated interactive increment of active index；CIbaseIndicate what last update was stored
Weight e is assigned about the cognition interactive degree of the node, and for it-t；CI be update after cognition interactive degree table in about with another end segment
The metric of point.
5. a kind of car networking method for routing recognizing interactive degree based on node according to claim 1, which is characterized in that step
In rapid 2, if not including in the cognition interaction table of present node has the information for connecting another end node, illustrate two nodes before not
Had and interacted, and at this time according to the initialization interactive degree of node type, interactive degree table was recognized to it and is updated as follows；
CI=CIini_type (4)
Wherein, CI is to be recognized in interactive degree table about the metric with another end node, CI after updatingini_typeFor node type
Initialize interactive degree.
6. a kind of car networking method for routing recognizing interactive degree based on node according to claim 5, which is characterized in that step
In rapid 4, the cognition interactive degree about all relay nodes on path that posterior nodal point B is maintained is screened in update one by one according to the following formula；
Wherein：Num_hop refers to that hop count of the corresponding node apart from this node in transmission path, distance refer to two sections
Physical distance between point, if CIbaseThe letter about certain node on path is not included in cognition interaction table for empty i.e. present node
Breath, then unprecedented interaction before illustrating two nodes initialize the cognition interactive degree of the node now referring to formula (4)
Assignment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810401262.7A CN108811029B (en) | 2018-04-28 | 2018-04-28 | A kind of car networking method for routing based on node cognition interactive degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810401262.7A CN108811029B (en) | 2018-04-28 | 2018-04-28 | A kind of car networking method for routing based on node cognition interactive degree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108811029A true CN108811029A (en) | 2018-11-13 |
| CN108811029B CN108811029B (en) | 2019-09-24 |
Family
ID=64094092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810401262.7A Active CN108811029B (en) | 2018-04-28 | 2018-04-28 | A kind of car networking method for routing based on node cognition interactive degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108811029B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110248392A (en) * | 2019-04-26 | 2019-09-17 | 长安大学 | Chance retransmission method based on node efficiency in a kind of car networking |
| CN112839321A (en) * | 2020-12-31 | 2021-05-25 | 中国石油大学(华东) | Edge server switching method based on 5G Internet of vehicles relay transmission |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116995A (en) * | 2013-01-09 | 2013-05-22 | 同济大学 | Car networking data transmission route selection optimized method based on electronic eyes |
| CN103475580A (en) * | 2013-09-26 | 2013-12-25 | 中国科学技术大学苏州研究院 | Optimal relay selecting method based on power control technology in internet of vehicles |
| KR101533087B1 (en) * | 2015-02-09 | 2015-07-03 | 성균관대학교산학협력단 | Vehicular ad-hoc network routing method based on ant colony optimization and vehicular ad-hoc network device using the same |
-
2018
- 2018-04-28 CN CN201810401262.7A patent/CN108811029B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116995A (en) * | 2013-01-09 | 2013-05-22 | 同济大学 | Car networking data transmission route selection optimized method based on electronic eyes |
| CN103475580A (en) * | 2013-09-26 | 2013-12-25 | 中国科学技术大学苏州研究院 | Optimal relay selecting method based on power control technology in internet of vehicles |
| KR101533087B1 (en) * | 2015-02-09 | 2015-07-03 | 성균관대학교산학협력단 | Vehicular ad-hoc network routing method based on ant colony optimization and vehicular ad-hoc network device using the same |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110248392A (en) * | 2019-04-26 | 2019-09-17 | 长安大学 | Chance retransmission method based on node efficiency in a kind of car networking |
| CN110248392B (en) * | 2019-04-26 | 2020-09-01 | 长安大学 | Opportunity forwarding method based on node efficiency in Internet of vehicles |
| CN112839321A (en) * | 2020-12-31 | 2021-05-25 | 中国石油大学(华东) | Edge server switching method based on 5G Internet of vehicles relay transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108811029B (en) | 2019-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | Distributed quality-of-service routing in ad hoc networks | |
| CN101136866B (en) | Integrated network communication layer service quality guaranteeing structure and operating method | |
| US7120681B2 (en) | Cluster control in network systems | |
| CN101123498B (en) | A method, device and system for access authentication | |
| CN106487695A (en) | A kind of data transmission method, virtual network managing device and data transmission system | |
| EP3745684B1 (en) | Method for merging two sub-networks into a single ad hoc network implementing the d2hcp protocol | |
| CN102281193B (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| CN108811029B (en) | A kind of car networking method for routing based on node cognition interactive degree | |
| CN104363626B (en) | A kind of VANET credible routing methods based on bayesian theory | |
| CN110490588A (en) | Letter of identity management method, device, computer equipment and storage medium | |
| CN105049347B (en) | A kind of DTN method for routing based on community network task distribution model | |
| CN102065006A (en) | Method for recovering inter-domain failure of cross-domain label switched path | |
| CN102164092B (en) | Method and system for guaranteeing service quality of integrated identification network | |
| CN103648126B (en) | A kind of fault handling method and equipment | |
| CN106211255B (en) | A kind of combined optimization method of Wireless ad hoc networks layer and MAC layer | |
| Yadav et al. | A survey on selfish node detection in manet | |
| CN110401716A (en) | Communication means and system between fringe node | |
| CN105634947A (en) | Message forwarding method based on hotspot in opportunistic mobile social network | |
| CN105898871A (en) | Resource distribution method of multi-hop multi-frequency-point wireless mesh network | |
| CN101651941A (en) | Home agent clustering system and deployment method thereof | |
| CN106034106A (en) | Networking method, networking management method, networking device, networking management device and networking system | |
| CN105991713A (en) | Method and device for processing updating | |
| CN104270315B (en) | The computational methods and system of multicast distribution tree in TRILL radio networks | |
| CN117097488B (en) | Equipment group security verification method based on node path finding | |
| Yadav et al. | Performance of Optimized Security Overhead Using Clustering Technique Based on Fuzzy Logic for Mobile ad hoc Network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |