CN105578556A - Wireless ad-hoc network system and routing method thereof - Google Patents
Wireless ad-hoc network system and routing method thereof Download PDFInfo
- Publication number
- CN105578556A CN105578556A CN201410549555.1A CN201410549555A CN105578556A CN 105578556 A CN105578556 A CN 105578556A CN 201410549555 A CN201410549555 A CN 201410549555A CN 105578556 A CN105578556 A CN 105578556A
- Authority
- CN
- China
- Prior art keywords
- node
- hop
- delete
- transit
- connected degree
- 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.)
- Withdrawn
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a wireless ad-hoc network system. Each node of the system broadcasts neighbor node information to each other. According to a received broadcast message of each neighbor node, a local routing list is maintained. Each node selects and maintains a relaying node of the node itself according to the received broadcast message and notifies the relaying node. A routing message is forwarded by the relaying node. The invention also provides a responsive routing method. By using the system and the method provided in the invention, routing establishing time can be shortened and routing cost is reduced.
Description
Technical field
The present invention relates to wireless communication field, particularly relate to wireless ad hoc network systems and method for routing thereof.
Background technology
Route technology is the very crucial technology of ad hoc network, all extremely important to the performance of the efficiency of data retransmission, time delay and whole system.Common route technology comprises AODV (AdhocOnDemandDistanceVector), DSR (DynamicSourceRouting), DSDV (DestinationSequencedDistanceVector), OLSR (OptimizedLinkStateRouting) etc., wherein AODV and DSR is on-demand routing, when having data sending request and table of query and routing does not have initiate route requests when route, routing cost is less, but business setup delay is longer; DSDV and OLSR is reactiver outing, node needs periodic broadcast message, can make the routing table of each node maintenance self, can directly send by table of query and routing when there being service request, the shorter business setup delay had, but the expense of route is larger.
In common routing algorithm, Active routing algorithm is all the routing iinformation needing each node periodically to broadcast self usually, or select part transit node periodically to forward the whole network route messages, can cause there is a large amount of route messages in network in transmission like this, take more empty overhead; And On-demand routing algorithm normally sends route requests when there being service request, source node sends the route request information of inundation, and relative Active routing algorithm, has less expense, but also causes the increase of link setup time delay.Therefore routing algorithm is normally compromised in expense and link setup speed.
Above routing algorithm does not utilize MANET own characteristic, just simple routing algorithm, the feature of MANET itself can be utilized to carry out cross-layer optimizing to routing algorithm, can reach more excellent performance in actual MANET.
Summary of the invention
For overcoming above problem, the present invention proposes a kind of wireless ad hoc network systems, and each node of described system broadcasts mutually its neighborhood information, and the broadcast according to the neighbors received safeguards local routing table; The transit node of oneself is selected and safeguarded to described each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
Preferably, described local routing table comprises a hop node and the two hop node information of this node.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or, search the node that Connected degree in S1 is maximum, node maximum for wherein link metric be selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
Preferably, each node of described system as communicated with double bounce or a hop node, then directly carries out route according to local routing table.
Preferably, each node of described system as communicated with the above node of double bounce, then carries out on-demand routing and searches.
Based on identical design, the present invention also proposes a kind of method for routing of wireless self-networking, and each node of described MANET broadcasts mutually its neighborhood information, and the broadcast according to the neighbors received safeguards local routing table; The transit node of oneself is selected and safeguarded to described each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
Preferably, described local routing table comprises a hop node and the two hop node information of this node.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or, search the node that Connected degree in S1 is maximum, node maximum for wherein link metric be selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
Preferably, described each node as communicated with double bounce or a hop node, then directly carries out route according to local routing table.
Preferably, described each node as communicated with the above node of double bounce, then carries out on-demand routing and searches.
The system and method that the present invention proposes can make Route establishment time shorten, greatly reduces routing cost simultaneously.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the FB(flow block) that transit node of the present invention is selected;
Fig. 2 is that the node of the embodiment of the present invention 4 opens up benefit schematic diagram.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments; It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
For the feature of MANET self, the present invention has carried out cross-layer optimizing on existing route algorithm, propose a kind of wireless ad hoc network systems, comprising: each node broadcasts mutually its neighborhood information, the broadcast according to the neighbors received safeguards local routing table; The transit node of oneself is selected and safeguarded to each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
Wherein local routing table can comprise a hop node and the two hop node information of this node.Route messages comprises route request information and/or route response message.
Wherein transit node selection and safeguard and can design as follows: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Selection and the maintenance of transit node can also design like this: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or, search the node that Connected degree in S1 is maximum, node maximum for wherein link metric be selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Selection and the maintenance of transit node also can design like this: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
Each node of this system as communicated with double bounce or a hop node, then directly carries out route according to local routing table; As communicated with the above node of double bounce, then carry out searching by on-demand routing.
Also by reference to the accompanying drawings enforcement of the present invention is specifically described below by each embodiment:
Embodiment 1: neighborhood information broadcast and local routing table are set up
The information of neighbor nodes of broadcast oneself mutually between each node in setting network, then each node can both know a hop neighbor and two neighbours of oneself by the broadcast receiving neighbor node, thus set up local routing table, comprise a hop node and double bounce nodal information in this routing table.Like this, to the routing addressing within double bounce, just can come by searching local routing table, and no longer need high-rise route requests of initiating, thus the time of link establishment within shortening double bounce, avoid routing cost simultaneously.
In order to reduce the signaling consumption that path finding brings, define the transit node of route messages in network, this category node, after receiving route messages, if judge that the jumping figure that route messages is propagated does not exceed maximum hop count, then can forward; If not transit node, after receiving route messages, only upgrade the route of oneself this locality, do not forward.Each node can calculate oneself transit node according to the broadcast of the periphery neighbor node received, and inform selected node by the form of broadcast, the transit node of each sensor selection problem has difference, and the number of the transit node of each sensor selection problem also may be multiple simultaneously.
Below the system of selection of transit node is specifically described.
Embodiment 2: the selection of transit node
Assuming that the set of a hop neighbor of node x is S1, the set of two-hop neighbors is S2, does not wherein comprise node x self in S2, does not comprise the element in all S1 simultaneously; Transit node set is S3.Definition D (s), s ∈ S1 is the Connected degree of node s, and the number of the symmetrical nodes beyond the S1 of expression node s, the link of symmetrical nodes that is between two nodes is two-way.Definition C (s), s ∈ S1 is the link metric value (LinkMetric) of node s, represents the link metric value of link between node x to node s, link metric value, as the weight evaluating every bar link, can represent link achievable rate or link-quality etc.
Please refer to accompanying drawing 1, the system of selection of the transit node of node x is as follows:
Step 1: the D (s) calculating each node in S1;
Step 2: search for S2 interior joint provides the node that uniquely can reach link in S1, and join in S3 by this node, upgrades S1 and S2.That is: if the node s in S1 is node z1, z2 in two-hop neighbors ... unique reached at link is provided, then node s is added transit node set, and by z1, z2 ... delete from S2, node s deletes from S1;
Step 3: the D (s) upgrading each node in S1;
Step 4: judge whether S2 travels through, traversal then terminates; Otherwise, can following steps be taked to node also not capped in S2:
Step 5: select to there is maximum link metric node as transit node in S1, join in transit node S set 3, delete two nodes that this node covers simultaneously in S2, and delete this node in S1; If the node with maximum link metric is multiple, then can select wherein Connected degree maximum as transit node.
Step 6, circulation step 1 ~ 5, until S2 is empty.
In MANET, each node all needs to select and safeguards oneself transit node, when source node has route requests, only carried out the broadcast of route messages (comprising route request information and/or route response message) by these transit nodes, greatly can reduce routing cost like this.
Embodiment 3: route querying within double bounce
The step of the path finding within double bounce is as follows:
Step 1: by receiving the broadcast of neighbor node, each symmetrical neighbours are added in routing table as 1 hop neighbor;
Step 2: the neighbor list messages broadcasted by the neighbor node received, adds in routing table using the symmetrical nodes that non-1 jumps as 2 hop neighbors;
Can determine that one of each node jumps and two-hop neighbors by above two steps, and by constantly receiving the renewal that broadcast carries out routing table.Neighbours within node needs with double bounce communicate, then directly can inquire about stored routing table and carry out sending.
Embodiment 4: the above route querying of double bounce
If node needs to communicate with the node exceeded beyond double bounce, then carry out on-demand routing and search.
Please refer to accompanying drawing 2, each circle represents a node, and line represents two nodes and can communicate mutually, namely there is symmetric links; The metric of this link of digitized representation on line.
First, the process of transit node is selected to be introduced to node x: set up a hop neighbor node set S1={1,2,3,4,5,6}, two hop neighbor node set S2={7,8,9,10,11,12,13}, arrange transit node S set 3={}, selection course is as follows:
1, the degree of each node in S1 is calculated: D (1)=1, D (2)=1, D (3)=2, D (4)=2, D (5)=1 and D (6)=2;
2, first judge to provide a hop node that uniquely can reach link as two hop neighbors, node 2,3,4 eligible, joined in transfer set, S3={2,3,4}, S1={1,5,6}, S2={7,8}
3, the degree of each node is upgraded, D (1)=1, D (5)=1, D (6)=2;
4, select the node 6, S3={2 in S1 with maximal metric value, 3,4,6}, S2={}, find and terminate.Herein, if air exercise metric node have multiple, can select wherein Connected degree larger enter S3.Certainly, also directly can being set as that the node selecting to have maximum Connected degree enters S3, therefrom selecting to have larger metric when having multiple.
Next, by the reception of broadcast, node x can set up following local routing table:
| ID | Next Hop | Hop Count |
| 1 | 1 | 1 |
| 2 | 2 | 1 |
| 3 | 3 | 1 |
| 4 | 4 | 1 |
| 5 | 5 | 1 |
| 6 | 6 | 1 |
| 7 | 6 | 2 |
| 8 | 6 | 2 |
| 9 | 4 | 2 |
| 10 | 4 | 2 |
| 11 | 3 | 2 |
| 12 | 3 | 2 |
| 13 | 2 | 2 |
Then, assuming that node x needs the route searching out node 17.
Node x sends route request information.
Each transit node is transmitted to route request information:
Node 4 is as one of transit node, need to forward this route request information, node 9 searches the neighbor list within the double bounce of oneself after have received route request information, find that node 17 is oneself two neighbours' message, then can reply route response message to node x immediately, advised nodes x can by oneself forwarding the message to node 17, and node x receives opening timing device T2 after route corresponding message;
Node 10 also can receive route request information simultaneously, due to the transit node that node 10 is nodes 4, so this message is transmitted to node 15, node 15 inquires about the neighbor list within the double bounce of oneself after receiving route requests, find that node 17 is oneself two-hop neighbors, then reply route response message to node x;
Therefore can receive two route response message at node x place, node x can select suitable route according to specific criterion, such as, the route response arrived at first can be selected to set up route, or selects the maximum route response of LinkMetric to set up route.
Can be found out by above embodiment, the present invention has following beneficial effect:
1, the feature of MANET self is utilized, cross-layer optimizing is carried out to routing algorithm, jumping and the two-hop neighbor node situation that each node utilizes self to scan, direct renewal route form, high level is not needed to initiate route requests again, make the link establishment time shorten within double bounce, and do not take routing cost;
2, improve for On-demand routing algorithm, each node needs to select and safeguards oneself transit node, when source node has route requests, is only carried out the broadcast of route messages by these transit nodes, greatly reduces the expense that route is brought like this;
3, optimize further for on-demand routing, because each node can safeguard the neighbor node situation of double bounce within self, if so when node receives the route request information of other nodes, if judge jump in oneself one or route corresponding message can be replied directly to source node in two-hop neighbors list, and by the mode of timing window, routing reply message can be screened at source node end, the effect brought like this is route response faster, more excellent Path selection.Also can reduce routing cost greatly, because if find maximum 8 destination nodes of jumping, RouteRequest max-forwards number of times is set to 6 simultaneously.
Based on identical design, the present invention also proposes a kind of method for routing of wireless self-networking, and each node of described MANET broadcasts mutually its neighborhood information, and the broadcast according to the neighbors received safeguards local routing table; The transit node of oneself is selected and safeguarded to described each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
Preferably, described local routing table comprises a hop node and the two hop node information of this node.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or, search the node that Connected degree in S1 is maximum, node maximum for wherein link metric be selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
Preferably, selection and the maintenance of described transit node comprise: set a hop node set of node as S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2; Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node; To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; If S2 is empty, then transit node is selected to terminate; Otherwise, search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
Preferably, described each node as communicated with double bounce or a hop node, then directly carries out route according to local routing table.
Preferably, described each node as communicated with the above node of double bounce, then carries out on-demand routing and searches.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can have been come by the hardware that program command is relevant, aforesaid program can be stored in a computer read/write memory medium, this program, when performing, performs the step comprising said method embodiment; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
Last it is noted that above embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to previous embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein portion of techniques feature; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (16)
1. a wireless ad hoc network systems, each node of described system broadcasts mutually its neighborhood information, and the broadcast according to the neighbors received safeguards local routing table; It is characterized in that, comprising:
The transit node of oneself is selected and safeguarded to described each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
2. system according to claim 1, is characterized in that, described local routing table comprises a hop node and the two hop node information of this node.
3. system according to claim 1, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
4. system according to claim 1, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1;
Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or,
Search the node that Connected degree in S1 is maximum, node maximum for wherein link metric is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
5. system according to claim 1, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
6. the system according to Claims 1 to 5 any one, is characterized in that, also comprises: each node of described system as communicated with double bounce or a hop node, then directly carries out route according to local routing table.
7. the system according to Claims 1 to 5 any one, is characterized in that, also comprises: each node of described system as communicated with the above node of double bounce, then carries out on-demand routing and searches.
8. the system according to Claims 1 to 5 any one, is characterized in that, described route messages comprises route request information and/or route response message.
9. a method for routing for wireless self-networking, each node of described MANET broadcasts mutually its neighborhood information, and the broadcast according to the neighbors received safeguards local routing table; It is characterized in that, comprising:
The transit node of oneself is selected and safeguarded to described each node according to the broadcast received, and notify described transit node; Route messages is forwarded by described transit node.
10. method according to claim 9, is characterized in that, described local routing table comprises a hop node and the two hop node information of this node.
11. methods according to claim 9, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search the node that Connected degree in S1 is maximum, be selected into S3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
12. methods according to claim 9, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the Connected degree of each node in S1, described Connected degree is the symmetrical nodes number of this hop node beyond S set 1;
Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search S1 link and measure maximum node, node maximum for wherein Connected degree is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty; Or,
Search the node that Connected degree in S1 is maximum, node maximum for wherein link metric is selected into S3, from S1, delete the node chosen, from S2, delete the node choosing node to reach; Upgrade the Connected degree of each node in S1; Until S2 is empty.
13. methods according to claim 9, is characterized in that, selection and the maintenance of described transit node comprise:
If a hop node set of node is S1, two hop node set are S2, and transit node is combined into S3, wherein, do not comprise this node itself and one hop node in S2;
Calculate the link metric of each node in S1, described link metric is the metric of link between node and each hop node;
To search in S1 as the node in S2 provides the node of unique reachable path, be selected into transit node S set 3; From S1, delete the node chosen, from S2, delete the node choosing node to reach;
If S2 is empty, then transit node is selected to terminate; Otherwise,
Search S1 link and measure maximum node, be selected into S3, from S1, delete the node that this is chosen, from S2, delete the node that it can reach; Until S2 is empty.
14. methods according to claim 9 ~ 13 any one, is characterized in that, also comprise: described each node as communicated with double bounce or a hop node, then directly carries out route according to local routing table.
15. methods according to claim 9 ~ 13 any one, is characterized in that, also comprise: described each node as communicated with the above node of double bounce, then carries out on-demand routing and searches.
16. methods according to claim 9 ~ 13 any one, it is characterized in that, described route messages comprises route request information and/or route response message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549555.1A CN105578556A (en) | 2014-10-16 | 2014-10-16 | Wireless ad-hoc network system and routing method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549555.1A CN105578556A (en) | 2014-10-16 | 2014-10-16 | Wireless ad-hoc network system and routing method thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105578556A true CN105578556A (en) | 2016-05-11 |
Family
ID=55888091
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410549555.1A Withdrawn CN105578556A (en) | 2014-10-16 | 2014-10-16 | Wireless ad-hoc network system and routing method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105578556A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023116805A1 (en) * | 2021-12-23 | 2023-06-29 | 东莞市李群自动化技术有限公司 | Network domain control method and apparatus, network system, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
| CN101547491A (en) * | 2009-04-15 | 2009-09-30 | 电子科技大学 | Routing method for mobile ad hoc network system |
| CN104113855A (en) * | 2014-07-15 | 2014-10-22 | 厦门大学 | Channel-based routing algorithm of wireless self-organizing network |
-
2014
- 2014-10-16 CN CN201410549555.1A patent/CN105578556A/en not_active Withdrawn
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
| CN101547491A (en) * | 2009-04-15 | 2009-09-30 | 电子科技大学 | Routing method for mobile ad hoc network system |
| CN104113855A (en) * | 2014-07-15 | 2014-10-22 | 厦门大学 | Channel-based routing algorithm of wireless self-organizing network |
Non-Patent Citations (4)
| Title |
|---|
| YING GE; T. KUNZ; L. LAMONT: "Quality of Service Routing in Ad-Hoc Networks Using OLSR", 《IEEE CONFERENCES》 * |
| 吴继春: "Ad Hoc网络路由协议的研究与NS2仿真", 《中国优秀硕士学位论文全文数据库》 * |
| 郑伟明: "OLSR路由协议研究及仿真", 《中国优秀硕士学位论文全文数据库》 * |
| 陈晨: "在两跳拓扑环境下对AODV协议的改进", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023116805A1 (en) * | 2021-12-23 | 2023-06-29 | 东莞市李群自动化技术有限公司 | Network domain control method and apparatus, network system, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105517098A (en) | Wireless self-networking system and routing method thereof | |
| US8139504B2 (en) | System, device, and method for unifying differently-routed networks using virtual topology representations | |
| CN100442786C (en) | Tree structure based routing method | |
| CN106332213B (en) | A method of reducing ZigBee wireless-transmission network hop count | |
| US20110149858A1 (en) | Mesh routing method and mesh routing apparatus in beacon enabled wireless ad-hoc networks | |
| CN105578558A (en) | Wireless ad-hoc network routing method | |
| US9277503B2 (en) | Dynamic zone routing in a mobile ad hoc network based on maximum available network device battery power | |
| CN105792312A (en) | Ad-hoc network routing method based on combination of active and passive ways | |
| CN101827421B (en) | DSR cooperative routing method based on channel state information and router | |
| CN105578555A (en) | Routing method of wireless ad hoc network, node apparatus and system | |
| CN108495249B (en) | Ad hoc network method for routing based on location information low-power consumption | |
| Shanmugam et al. | A dynamic probabilistic based broadcasting scheme for manets | |
| US20120155322A1 (en) | Method And Apparatus For Network Node Discovery | |
| Ramalakshmi et al. | Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | |
| CN101471864B (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| KR101455505B1 (en) | Energy effective routing method and apparatus in wireless ad-hoc network | |
| CN105578556A (en) | Wireless ad-hoc network system and routing method thereof | |
| KR101610108B1 (en) | Ad-hoc Network System for Avoiding a High Temperature and Method for Establishing Routing Path | |
| US10813033B1 (en) | Partitioned network routing | |
| CN109714260A (en) | Implementation method based on UCDS algorithm building virtual backbone network in OLSR Routing Protocol | |
| Gui et al. | A framework for self-healing and optimizing routing techniques for mobile ad hoc networks | |
| CN112423356B (en) | Unmanned equipment cluster AODV routing method based on energy balance | |
| CN104869605A (en) | Emergency communication-based AODV route stability algorithm improvement method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20160511 |