A Virtual Backbone Network Algorithm Suitable for Mobile Ad Hoc Networks
A virtual backbone network and mobile ad hoc network technology, applied in the field of virtual backbone network algorithm, can solve the problems of network maintenance overhead increase, network performance degradation, etc., and achieve the effect of strong invulnerability and fast convergence speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0042] Example 1: The node f in the figure is in the non-backbone state, and its operations are as follows:
[0043] ■Step 1. Wait for a short period of time (such as a time slot).
[0044] ■Step 2. The node finds that rule one is met. That is: there is a neighbor node e that is not connected to the network around it, and there are N online (e)={f,c}. and:
[0045] A.f and c are not backbone nodes
[0046] B. r(f)=1, r(c)=1
[0047] C.ID(f)=6>ID(c)=3
[0048] D.N. twohop-backbone (f), N twohop-backbone (f) The number of backbone nodes within the two-hop range of each node in the set is less than D=16.
[0049] The state of this node is set to "backbone state", and the end is completed.
example 2
[0050] Example 2: The node h in the figure is not connected to the network, and its operations are as follows:
[0051] ■Step 1. Wait for a short period of time (such as a time slot).
[0052] ■Step 2. If this node is not the initiating node, go to the next step.
[0053] ■Step 3. Neighbor N of this node online (e)={f,c}, they are all backbone nodes, choose a node (for example f), and submit an access application to it, and the node will turn into a non-backbone state after success. Example 3: Node i in the graph is in the non-backbone state, and its operations are as follows:
[0054] ■Step 1. Wait for a short period of time (such as a time slot).
[0055]■Step 2. If there are no unconnected nodes around this node, rule 1 is not satisfied, the next step.
[0056] ■Step 3. If the node satisfies rule five;
[0057] That is: node i finds that the minimum number of backbone hops between two surrounding backbone nodes j and b is 4, exceeding P=3, and at the same time N twoho...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


