CN102209362A - Mobile ad-hoc network system and routing setup method - Google Patents
Mobile ad-hoc network system and routing setup method Download PDFInfo
- Publication number
- CN102209362A CN102209362A CN2010101415047A CN201010141504A CN102209362A CN 102209362 A CN102209362 A CN 102209362A CN 2010101415047 A CN2010101415047 A CN 2010101415047A CN 201010141504 A CN201010141504 A CN 201010141504A CN 102209362 A CN102209362 A CN 102209362A
- Authority
- CN
- China
- Prior art keywords
- node
- resource
- weights
- request packet
- package
- 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
Images
Abstract
The invention provides a mobile ad hoc network system and a routing setup method. The mobile ad hoc network system comprises a plurality of nodes, wherein each node judges a parent node of each node according to request packet resources in a received request packet and the node resources of each node to set up a transmission path among the nodes. Moreover, unnecessary transmission paths are screened according to a group data sheet of each node through a node which belongs to a specified multicast group.
Description
Technical field
The present invention relates to a kind of mobile ad hoc network system, relate in particular to optimized mobile ad hoc network system of a kind of variability resource distribution and method for routing foundation.
Background technology
In present network development, (Mobile Ad Hoc Network, MANET) system is a kind of wireless network communications system of putting basic environment that do not need to build in advance to mobile ad-hoc network.In mobile ad hoc network system, neither one centre management mechanism, each node limited bandwidth of shared in common of working in coordination, each node be a main frame also be a router.Any node all can be collected or send other nodes, and all nodes all possess mobility, can support (non-broadcast type) transmission that comprises great deal of nodes in the same area.Mode with can multiplely jump (multihop) under the Routing protocol of cooperation is sent to the recipient with data.
And the challenge that this kind network system is faced promptly to be all nodes all moving, change to be difficult to expection.Therefore, need dynamically set up the path, and plan range vector Routing Protocol (Ad Hoc On-DemandDistance Vector, the AODV) problem of technology.Yet, AODV only can set up one can communication the path, but various change resources in the network (but for example electric weight, load utilized bandwidth) are not listed in and are considered.IETF (Internet Engineering Task Force) MANET Group has classified AODV as the standard of clean culture in this kind network (unicast) at present, it needs the periodic maintenance routed path, but it is subject to environmental variations and could effectively operates under can not be too greatly.If all nodes are all moving, then this mode is wasted resource on the contrary.In addition, other comprise the resource allocation notion mechanics of communication (as, in the general packet radio service technology (General Packet Radio Service, GPRS)), all be with the fixed backbone network, build in advance and put the resource map and carry out in the mode of central authorities control.
Summary of the invention
The invention provides a kind of method for routing foundation of mobile ad hoc network system, effective configuration network resource decides which kind of resource of configuration according to system requirements, reaches that overall network power consumption is minimum, load expends various objectives such as minimum.
The invention provides a kind of mobile ad hoc network system, it does not need to set up in advance overall network resource map, does not need central keyholed back plate.
The present invention proposes a kind of method for routing foundation of mobile ad hoc network system, and wherein mobile ad hoc network system comprises a plurality of nodes, and these nodes comprise that one specifies the start node of the group that multicasts.At first, by start node broadcast request package, and via other nodes difference transfer request packages, wherein the routing table of each node writes down the node resource of each node respectively, and Request Packet comprises the Request Packet resource.Each node can be judged the father node of each node according to the node resource of the Request Packet resource in the Request Packet that it received and each node, to set up the transmission path between these nodes.In addition, according to group's tables of data of each node, specify the node of the group that multicasts to screen unwanted transmission path by belonging to.
In an embodiment of the present invention, above-mentioned node resource comprises resource weights, resource cost amount weights, outside weights, package transmission energy and package forwarding energy.The surplus resources of resource weights representation node, resource cost amount weights are represented each node spent resource when receiving Request Packet, and outside weights are to carry out an assessment algorithm and obtain.And the Request Packet resource comprises the outside weights and the available surplus yield of the source node that transmits Request Packet.Available surplus yield is that the resource weights by source node deduct resource cost amount weights and obtained.
In an embodiment of the present invention, the step of the father node of above-mentioned each node of judgement comprises: when these nodes when wherein a destination node receives Request Packet, destination node can check whether its routing table has node resource.If the routing table of destination node does not have node resource, set up node resource.According to the assessment algorithm, calculate the external assessment weights, to compare external assessment weights and outside weights.If the external assessment weights are greater than outside weights, replace outside weights with outside appraisal right value, and the external assessment weights are write in the corresponding field of routing table of destination node, and, the father node of destination node is made as the source node of Request Packet.
In an embodiment of the present invention, above-mentioned assessment algorithm is:
Q＝min{M
U，(T
U-X
UV)，T
V}。
Wherein, Q represents external assessment weights, M
URepresent the outside weights of the source node U of Request Packet, T
URepresent the available surplus yield of Request Packet, X
UVRepresent source node U to transmit transfer resource the expend amount weights of Request Packet to destination node V, T
URepresent the available surplus yield of destination node.
In an embodiment of the present invention, above-mentioned by belonging to the step that the node of specifying the group that multicasts screens unwanted transmission path, inspect its tables of data that multicasts separately by each node except start node, whether belong to decision node and specify the group that multicasts.Specify the node of the group that multicasts to transmit response packet respectively by belonging to,, determine the package of each node to transmit energy with the response packet resource and the node resource of foundation response packet to its father node separately.Above-mentioned response packet resource comprises father node and the package transmission energy that sends back the source node of answering package.Do not receive and belong to the response packet that node transmitted of specifying the group that multicasts if do not belong to the node of specifying the group that multicasts, then do not belong to and specify the node of the group that multicasts to transmit another response packet to its father node.
In an embodiment of the present invention, in the method for routing foundation of above-mentioned mobile ad hoc network system, the node that receives response packet is inspected the package transmission energy in the response packet, and transmits energy and compare with the package in himself the routing table.If the package transmission energy is transmitted energy greater than package, then replace package and transmit energy, and insert to the corresponding field of routing table with the package transmission energy.
In an embodiment of the present invention, above-mentioned after each node except start node is inspected the step of its tables of data that multicasts separately, belong to specify the group that multicasts node can with its separately the member's flag settings in the routing table for enabling.
In an embodiment of the present invention, in the method for routing foundation of above-mentioned mobile ad hoc network system, each node except start node is inspected the member's mark in himself the routing table when receiving response packet.If the member is labeled as non-enabling, then with member's flag settings for enabling, and set up another response packet and be sent to its father node.
The present invention proposes a kind of mobile ad hoc network system, comprises a plurality of nodes.These nodes comprise a routing table separately.And comprise a start node and a plurality of communication node in these nodes.Start node belongs to specifies the group that multicasts, and is used for the broadcast request package.Request Packet comprises the Request Packet resource.Above-mentioned communication node then is used for distinguishing the transfer request package.Wherein, each communication node is judged these communication nodes father node separately according to the node resource of the routing table of the Request Packet resource in the Request Packet that it received and each communication node, to set up the transmission path between these communication nodes and the start node.And,, specify the communication node of the group that multicasts to screen unwanted transmission path by belonging to according to group's tables of data of each communication node.
Based on above-mentioned, the present invention is with the computing assessment foundation of variable resource distribution as route choosing footpath, and effectively the configuration network resource decides to dispose which kind of resource according to system requirements, and then reaches that overall network power consumption is minimum, load expends various objectives such as minimum.
For above-mentioned feature and advantage of the present invention can be become apparent, embodiment cited below particularly, and conjunction with figs. is described in detail below.
Description of drawings
Fig. 1 is the flow chart of method for routing foundation of the mobile ad hoc network system of one embodiment of the invention.
Fig. 2 is the tabular schematic diagram of the route of one embodiment of the invention.
Fig. 3 is the schematic diagram of the Request Packet form of one embodiment of the invention.
Fig. 4 is the method flow diagram of setting up network topology of one embodiment of the invention.
Fig. 5 is the schematic diagram of the response packet form of one embodiment of the invention.
Fig. 6 A, Fig. 6 B and Fig. 6 C are the schematic diagrames of setting up route of one embodiment of the invention.
Fig. 7 A～Fig. 7 F is the schematic diagram of setting up network topology of one embodiment of the invention.
Fig. 8 A, Fig. 8 B are the schematic diagrames of the screening transmission path of one embodiment of the invention.
Main description of reference numerals:
S105～S115: each step of the method for routing foundation of the mobile ad hoc network system of one embodiment of the invention;
S405～S425: each step of the method for setting up network topology of one embodiment of the invention;
601～607,611,612: node.
Embodiment
Fig. 1 is the flow chart of method for routing foundation of the mobile ad hoc network system of one embodiment of the invention.In the present embodiment, comprise a plurality of nodes in the mobile ad hoc network system, these nodes comprise that one specifies the start node of the group that multicasts, to be begun to carry out method for routing foundation by start node.Please refer to Fig. 1, in step S105, begin to broadcast outward a Request Packet by start node, and via other nodes difference transfer request packages.
At this, the routing table of each node in the mobile ad hoc network system has all write down the node resource of each node.Node resource comprises resource weights, resource cost amount weights, outside weights, package transmission energy and package forwarding energy.The surplus resources of resource weights representation node, resource cost amount weights representation node spent resource when receiving Request Packet, outside weights are to carry out an assessment algorithm and obtain.The form of routing table below is described for an embodiment.
Fig. 2 is the tabular schematic diagram of the route of one embodiment of the invention.Comprise start node field, meeting field, resource weights field, external weight value field, father node field, transmission of power field in the routing table, transmit energy field and member's tag field.
The start node field is in order to the address of the start node that writes down the group that multicasts under this node, the meeting that the meeting field multicasts in order to record (Session) sequence number, resource weights hurdle value is in order to record resource weights, the external weight value field is in order to write down outside weights (at this, outside weights obtain according to an assessment algorithm), the father node field is in order to the address of the father node that writes down this node, the transmission of power field is in order to the father node transmission package that writes down this node required package transmission energy during a node so far, transmits the energy field and transmits energy in order to the package that writes down this node and transfer to next node.Member's tag field is in order to record member mark.
Begin externally to broadcast a Request Packet to its transmissive node by start node, and the node that receives Request Packet is transmitted this Request Packet again to other nodes, to set up transmission paths all in the mobile ad hoc network system with fixed energies.The form of Request Packet below is described for an embodiment.
Fig. 3 is the schematic diagram of the Request Packet form of one embodiment of the invention.Request Packet comprises destination address field (DAF), source address field, the source field that multicasts, meeting field, external weight value field and available surplus resources field.
Destination address field (DAF) is in order to the address of node of record desire broadcasting, source address field transmits the address of the node (source node) of this Request Packet in order to record, the source field that multicasts is in order to the multicast address of start node of group of record, the meeting sequence number that the meeting field multicasts in order to record, the external weight value field is in order to the address of the source node of record request package, and available surplus resources field is in order to the available surplus yield of the source node of record request package (deducting resource cost amount weights by the resource weights of source node is obtained).
Then, in step S110, each node can according to the Request Packet resource that Request Packet write down that it received with and separately node resource judge oneself father node, to set up the transmission path between these nodes.
For instance, Fig. 4 is the method flow diagram of setting up network topology (Network topology) of one embodiment of the invention.Please refer to Fig. 4, in step S405, the node that receives Request Packet can check whether node resource is arranged in the routing table.
If do not write down node resource in the routing table, then shown in step S410, set up node resource.For example, the initial value that the node that receives Request Packet can be set outside weights is 0, and captures the available resources of node at that time moment and come as the resource weights, is non-enabling with the member's flag settings in the routing table again.Afterwards, execution in step S415.And if write down node resource, then execution in step S415 in the routing table.
In step S415, the node that receives Request Packet can calculate the external assessment weights according to the assessment algorithm, to compare external assessment weights and outside weights.In the present embodiment, the assessment algorithm is as follows:
Q＝min{M
U，(T
U-X
UV)，T
V}。
Wherein, Q represents external assessment weights, M
URepresent the outside weights of the source node U of Request Packet, T
URepresent the available surplus yield (deducting resource cost amount weights by the resource weights of source node is obtained) of Request Packet, X
UVRepresent source node U to transmit transfer resource the expend amount weights of Request Packet to destination node V, T
URepresent the available surplus yield of destination node V.
If the external assessment weights are greater than the outside weights in the routing table, then shown in step S420, replace outside weights, and the external assessment weights are write in the corresponding field of routing table of destination node with outside appraisal right value, and, the father node of destination node is made as the source node of Request Packet.On the other hand, if the external assessment weights are less than or equal to the outside weights in the routing table, then shown in step S425, give up this Request Packet.
Each receives the node of Request Packet after executing above-mentioned steps S405～step S425, sets up a new Request Packet again, and the source address field in this new Request Packet is inserted the address of this node itself, and broadcasts outward with fixed energies.And the node that receives this Request Packet equally also can be carried out above-mentioned steps S405～step S425.By that analogy, finish until network topology foundation.
Afterwards, in step S115,, specify the node of the group that multicasts to screen unwanted transmission path by belonging to according to the group data table of each node.At this, node promptly can enter step S115 when it satisfies specified conditions after receiving request instruction and carrying out forwarding.For example, after node (can utilize timer to do in fact) through after a while after receiving request instruction, i.e. execution in step S115.
Whether particularly, each node except that start node is inspected its tables of data that multicasts separately, belong to decision node and specify the group that multicasts.By belong to the node of specifying the group that multicasts with its separately the member's flag settings in the routing table for enabling.And, specify the node of the group that multicasts to transmit a response packet respectively by belonging to its father node separately, with the response packet resource of foundation response packet and the node resource of each node, determine the package of each node to transmit energy.Above-mentioned response packet resource comprises father node and the package transmission energy that sends back the source node of answering package.Do not receive and belong to one of them response packet that is transmitted of node of specifying the group that multicasts if do not belong to the node of specifying the group that multicasts, then transmit another response packet to its father node.
Fig. 5 is the schematic diagram of the response packet form of one embodiment of the invention.Response packet comprises destination address field (DAF), source address field, the source field that multicasts, meeting field and send the energy field.
Destination address field (DAF) is in order to the address of the father node of the source node of this response packet of record transmission, source address field transmits the node of the source node of this response packet in order to record, the source field that multicasts is in order to the multicast address of start node of group of record, the meeting sequence number that the meeting field multicasts in order to record sends the package transmission energy that is write down in the routing table of energy field in order to the source node of this response packet of record transmission.
That is to say, belong to the node of specifying the group that multicasts and transmit response packet to its father node, is effectively in order to notify its father node transmission path between the two, and the package transmission energy of self.Do not belong to the node of specifying the group that multicasts and then only can when receiving response packet, transmit response packet again to its father node.In view of the above, can delete the multicast node of group of non-appointment effectively, and only keep the multicast node of group of the non-appointment that is used between appointment multicasts the node of group, passing on.When the multicast node of group of non-appointment receives response packet, represent that this node is to be used for carrying out the node that package passes on.
In addition, the node that receives response packet can be inspected the package transmission energy in the response packet, and transmits energy and compare with the package in himself the routing table.If the package transmission energy is transmitted energy greater than package, then replace package and transmit energy, and insert to the corresponding field of routing table with the package transmission energy.In view of the above, the destination node side of this response packet can use enough energy therewith the source node of response packet carry out the transmission of package.
In addition, each node except that start node can be inspected the member's mark in himself the routing table when receiving response packet.If the member is labeled as non-enabling, then with member's flag settings for enabling, and set up another response packet and be sent to its father node.
Fig. 6 A, Fig. 6 B and Fig. 6 C are the schematic diagrames of setting up route of one embodiment of the invention.In the present embodiment, node 601～node 607 belongs to specifies the group that multicasts, and it is represented with the black round dot.In addition, all the other non-appointments multicast the node of group then with the representative of white round dot.
According to above-mentioned steps S105 and step S110, can obtain network topology as shown in Figure 6A, wherein, node 601 is a start node.Afterwards, shown in Fig. 6 B, can screen unwanted node according to step S115.At this, the multicast node of group of non-appointment only keeps node 611 and node 612, and node 602～node 607, node 611 and node 612 point to its father node (start node 601 does not have father node) with a dotted arrow respectively.In addition, in Fig. 6 C, transmit the scope of energy with the package of dashed circle 621～dashed circle 625 difference representation nodes 601, node 612, node 602, node 605 and node 611.
Fig. 7 A～Fig. 7 F is the schematic diagram of setting up network topology of one embodiment of the invention.In following examples, with B
iThe resource weights of representation node i are with R
iThe resource cost amount weights of representation node i are with M
iThe outside weights of representation node i are with T
iThe available surplus yield of representation node i is with X
UVRepresentation node V calculate according to the Request Packet (being sent) that it received by node U and the available surplus yield of the transfer resource amount of expending.
In Fig. 7 A, mobile ad hoc network system comprises node 1～node 5, and node 1 is a start node.Wherein, node 1 its B
1=85, R
1=2, M
1=83 (B
1-R
1).Node 2 its B
2=83, R
2=2, M
2=0.Node 3 its B
3=85, R
3=1, M
3=0.Node 4 its B
4=80, R
4=1, M
4=0.Node 5 its B
5=80, R
5=1, M
5=0.
In Fig. 7 B, by node 1 broadcast request package to node 2 to node 3.Wherein, RREQ
12Representative is sent to the Request Packet of node 2, RREQ
13Representative is sent to the Request Packet of node 3.Request Packet RREQ
12Its M
1=83, T
1=83 (B
1-R
1), X
12=10.Request Packet RREQ
13Its M
1=83, T
1=83 (B
1-R
1), X
13=20.X wherein
12And X
13Be respectively that intensity by received Request Packet estimates and gets.
Similarly, node 3 is receiving Request Packet RREQ
13The time, calculate external assessment weights, i.e. a min{M according to above-mentioned assessment algorithm
1=83, (T
1-X
13)=63, T
3=84}=63 (Q＞M
3).Therefore, the outside weights M of node 3
3=63.And, the father node of node 3 is made as node 1.
Please refer to Fig. 7 C,, point to the father node (node 1) of node 2 and node 3 respectively with the dotted line arrow at this.In Fig. 7 C, come the transfer request package by node 3, wherein, RREQ
32Representative is sent to the Request Packet of node 2, RREQ
35Representative is sent to the Request Packet of node 5.Request Packet RREQ
32Its M
3=63, T
3=84 (B
3-R
3), X
32=15.Request Packet RREQ
35Its M
3=63, T
3=84, X
35=10.Node 2 is receiving Request Packet RREQ
32The time, can calculate external assessment weights, i.e. a min{M according to above-mentioned assessment algorithm
3=63, (T
3-X
32)=69, T
2=83}=63.Because external assessment weights 63 greater than the outside weights 73 of node 2, are not therefore given up Request Packet RREQ
32In like manner, node 5 obtains outside weights M according to the assessment algorithm
5=63, and, the father node of node 5 is made as node 3.
Please refer to Fig. 7 D,, point to the father node (node 3) of node 5 with the dotted line arrow at this.In Fig. 7 D, come the transfer request package by node 2, wherein, RREQ
24Representative is sent to the Request Packet of node 4, RREQ
23Representative is sent to the Request Packet of node 3.Request Packet RREQ
24Its M
2=73, T
2=83 (B
2-R
2), X
24=12.Request Packet RREQ
23Its M
2=73, T
2=83, X
23=15.Node 4 is receiving Request Packet RREQ
24The time, can obtain outside weights M according to above-mentioned assessment algorithm
4=71, and, the father node of node 4 is made as the address of node 2.
In addition, node 3 is receiving Request Packet RREQ
23The external assessment weights that obtained are 68 (min{M
2=73, (T
2-X
23)=68, T
3=84}), it is greater than the M in the routing table that is recorded in node 3
3(=63) therefore replace 63 with 68, and insert in the routing table of node 3.And, the father node of node 3 is changed to node 2.
Please refer to Fig. 7 E,, point to the father node (node 2) of node 3 with the dotted line arrow at this.In Fig. 7 E, because node 3 has been changed its father node, therefore by node 3 transfer request package again.Wherein, RREQ
32' representative is sent to the Request Packet of node 2, RREQ
35' representative is sent to the Request Packet of node 5.Request Packet RREQ
32' its M
3=68, T
3=83, X
32=15.Request Packet RREQ
35' its M
3=68, T
3=82, X
35=10.Node 2 is receiving Request Packet RREQ
32The time, can calculate external assessment weights, i.e. a min{M according to above-mentioned assessment algorithm
3=68, (T
3-X
32)=68, T
2=83}=68.Because external assessment weights 68 greater than the outside weights 73 of node 2, are not therefore given up Request Packet RREQ
32'.In like manner, node 5 obtains outside weights M according to the assessment algorithm
5=68.At last, then shown in Fig. 7 F, wherein the dotted line arrow is to point to the father node place to the transmission path between the node 1～5.
It should be noted that the node that receives Request Packet just can continue other programs again after satisfying specified conditions.For example, after after a while, node can transmit a response packet respectively to its father node.Below illustrate for an embodiment again.
Fig. 8 A, Fig. 8 B are the schematic diagrames of the screening transmission path of one embodiment of the invention.Accept above-mentioned Fig. 7 A～Fig. 7 F, in the present embodiment, suppose that node 1, node 2, node 4 and node 5 belong to one and specify the group that multicasts, and node 3 does not add this group that multicasts.In following examples, with W
iThe package transmission energy of representation node i is with F
iThe package of representation node i is transmitted energy, with G
iMember's mark (G of representation node i
iG is enabled in=1 representative
i=0 represents not enabled).
Please be simultaneously with reference to Fig. 7 F, Fig. 8 A and Fig. 8 B, in Fig. 7 F, node 1 its W
1=0, F
1=0, G
1=1.Node 2 its W
2=10, F
2=0, G
2=1.Node 3 its W
3=15, F
3=0, G
3=0.Node 4 its W
4=12, F
4=0, G
4=0.Node 5 its W
5=10, F
5=0, G
5=1.
In Fig. 8 A, transmit a response packet to its father node by belonging to the node of specifying the group that multicasts.Wherein, RPLY
12Representation node 2 is sent to the response packet of node 1, RPLY
42Representation node 4 is sent to the response packet of node 2, RPLY
53Representation node 5 is sent to the response packet of node 3.
Response packet RPLY
12Be in order to the notice node 1 " W of node 2
2=10 ", receive response packet RPLY when node 1
12The time, just insert to F 10
1Corresponding forwarding energy field, at this moment, the F of node 1
1=10.That is to say that node 1 is transmitted energy F with package
1=10 can be sent to package node 2.
Response packet RPLY
42Be in order to the notice node 2 " W of node 4
4=12 ", receive response packet RPLY when node 2
42The time, just insert to F 12
2Corresponding forwarding energy field, at this moment, the F of node 2
2=12.
Response packet RPLY
53Be in order to the notice node 3 " W of node 5
5=10 ", receive response packet RPLY when node 3
53The time, just insert to F 10
3Corresponding forwarding energy field, at this moment, the F of node 3
3=10.
Then, shown in Fig. 8 B, do not broadcast the node in the group, yet node 3 has been received the response packet RPLY that node 5 is transmitted though node 3 is not a designated group
53, representation node 3 is the father node of node 5, it is the role who is used for serving as forwarding in this appointment multicasts group.In view of the above, node 3 also can send a response packet RPLY
32To its father node (node 2).
Response packet RPLY
32Be in order to the notice node 2 " W of node 3
3=15 ", receive RPLY when node 2
32The time, it can remove to compare the F in the node 2
2At this, RPLY
32W
3(=15) are greater than the F in the node 2
2Therefore (=12) are with the F of node 2
2Be updated to 15.This is because be 10 get final product if node 2 only is sent to package node 4 required energy, yet node 2 also can be sent to package node 3, is 15 and be sent to node 3 required energy, just the therefore package of new node 2 forwarding energy more.
After above-mentioned transmission response packet, when satisfied specified conditions (for example through after a while), can begin to carry out multicasting of package.
Particularly, begin to transmit the package that multicasts by start node.When other nodes receive when multicasting package, node need be inspected its routing table, and whether seek has the record node resource.If do not have, then give up this package that multicasts.If have, but this node is not when entering the step that package multicasts as yet, and the package that then this multicasted is temporarily preserved, and waits and carries out subsequent step again after entering package and multicasting, and judges that member's flag settings is for enabling or non-enabling.If the member is labeled as non-enabling, then give up this package that multicasts.Package sends with the package forwarding energy of routing table if member's flag settings for enabling, then multicasts this.
In sum, the present invention has following advantage at least:
1, with the computing assessment foundation of variable resource distribution as route choosing footpath.
2, decentralized architecture does not need to set up in advance overall network resource map, does not need central keyholed back plate.
3, effective configuration network resource decides which kind of resource of configuration according to system requirements, reaches that overall network power consumption is minimum, load expends various objectives such as minimum.
4, must not be dependent on prior collection route information.
5, each node is only known its source node and neighbours' existence, therefore is easier to the extended network scale.
6, set up route with choosing (On-demand) 0, and the design of new routing table, make its suitable high mobility network.
7, node move or partly package bumps and still can set up transmission path between these nodes.
Though the present invention discloses as above with embodiment; but it is not in order to qualification the present invention, any those skilled in the art, without departing from the spirit and scope of the present invention; can change arbitrarily or be equal to replacement, so protection scope of the present invention should be as the criterion with the scope that the application's claims are defined.
Claims (15)
1. the method for routing foundation of a mobile ad hoc network system, wherein this mobile ad hoc network system comprises a plurality of nodes, and described node comprises the start node of specifying the group that multicasts, and this method for routing foundation comprises:
By this start node broadcast request package, and pass on this Request Packet respectively via other nodes, wherein the routing table of each node writes down the node resource of each node respectively, and this Request Packet comprises the Request Packet resource;
Each node is judged the father node of each node according to the node resource of the Request Packet resource in the Request Packet that it received and each node, to set up the transmission path between the described node; And
According to the group data table of each node, screen unwanted transmission path by belonging to the multicast node of group of this appointment.
2. the method for routing foundation of mobile ad hoc network system according to claim 1, wherein this node resource comprises resource weights, resource cost amount weights, outside weights, package transmission energy and package forwarding energy, these resource weights are represented surplus resources, these resource cost amount weights are represented each node spent resource when receiving this Request Packet, and these outside weights are to assess algorithm and obtain;
And this Request Packet resource comprises these outside weights and the available surplus yield of the source node of the described node that transmits this Request Packet, and wherein this available surplus yield is that these resource weights by this source node deduct these resource cost amount weights and obtained.
3. the method for routing foundation of mobile ad hoc network system according to claim 2, wherein judge to comprise the step of this father node of each node:
When described node when wherein a destination node receives this Request Packet, this destination node checks whether its routing table has this node resource;
If the routing table of this destination node is this node resource not, set up this node resource;
According to this assessment algorithm, calculate the external assessment weights, with relatively these external assessment weights and this outside weights; And
If these external assessment weights are greater than these outside weights, replace this outside weights with these external assessment weights, and these external assessment weights are write in the corresponding field of routing table of this destination node, and, the father node of this destination node is made as the source node of this Request Packet.
4. the method for routing foundation of mobile ad hoc network system according to claim 3 is wherein set up the step of this node resource, comprising:
The initial value of setting these outside weights is 0;
Set this resource weights; And
Set this member and be labeled as non-enabling.
5. the method for routing foundation of mobile ad hoc network system according to claim 3, wherein this assessment algorithm is:
Q＝min{M
U，(T
U-X
UV)，T
V)；
Wherein, Q represents this external assessment weights, M
URepresent these outside weights of the source node U of this Request Packet, T
URepresent this available surplus yield of this Request Packet, X
UVRepresent this source node U to transmit transfer resource the expend amount weights of this Request Packet to this destination node V, T
URepresent this available surplus yield of this destination node.
6. the method for routing foundation of mobile ad hoc network system according to claim 3 wherein by belonging to this appointment step that the node of group screens unwanted transmission path that multicasts, comprising:
Each node except that this start node is inspected its tables of data that multicasts separately, whether belongs to this appointment group that multicasts to judge described node;
Transmit response packet respectively to its father node separately by belonging to the multicast node of group of this appointment, with according to the response packet resource of this response packet and the node resource of each node, determine the package of each node to transmit energy, wherein this response packet resource comprises this father node and this package transmission energy of the source node that transmits this response packet;
Do not receive and belong to multicast one of them response packet that is transmitted of node of group of this appointment if do not belong to the multicast node of group of this appointment, then do not belong to the multicast node of group of this appointment and transmit another response packet to its father node.
7. the method for routing foundation of mobile ad hoc network system according to claim 6 also comprises:
The node that receives this response packet is inspected this package transmission energy in this response packet, and transmits energy and compare with this package in himself the routing table; And
If this package transmission energy is transmitted energy greater than this package, then replace this package and transmit energy, and insert to the corresponding field of this routing table with this package transmission energy.
8. the method for routing foundation of mobile ad hoc network system according to claim 6 wherein after each node except that this start node is inspected the step of its tables of data that multicasts separately, also comprises:
Belong to this appointment multicast group node with its separately the member's flag settings in the routing table for enabling.
9. the method for routing foundation of mobile ad hoc network system according to claim 6 also comprises:
Each node except that this start node is inspected this member's mark in himself the routing table when receiving this response packet; And
If this member is labeled as non-enabling, then with this member's flag settings for enabling, and set up another response packet and be sent to its father node.
10. mobile ad hoc network system comprises:
A plurality of nodes, wherein each node comprises routing table, described node comprises: start node, it belongs to specifies the group that multicasts, the broadcast request package, wherein this Request Packet comprises the Request Packet resource; And a plurality of communication nodes pass on this Request Packet respectively;
Wherein, each communication node is judged described communication node father node separately according to the node resource of the routing table of the Request Packet resource in the Request Packet that it received and each communication node, to set up the transmission path between described communication node and this start node; And,, screen unwanted transmission path by belonging to the multicast communication node of group of this appointment according to the group data table of each communication node.
11. mobile ad hoc network system according to claim 10, wherein this node resource comprises resource weights, resource cost amount weights, outside weights, package transmission energy and package forwarding energy, these resource weights are represented surplus resources, these resource cost amount weights are represented each node spent resource when receiving this Request Packet, and these outside weights are to assess algorithm and obtain;
This Request Packet resource comprises these outside weights and the available surplus yield of the source node of the described node that transmits this Request Packet, and wherein this available surplus yield is that these resource weights by this source node deduct these resource cost amount weights and obtained.
12. mobile ad hoc network system according to claim 11, wherein each communication node checks whether this routing table of self has this node resource when receiving this Request Packet, if this routing table this node resource is not set up this node resource; And according to this assessment algorithm, calculate the external assessment weights, with relatively these external assessment weights and this outside weights, if these external assessment weights are greater than these outside weights, replace this outside weights with these external assessment weights, and these external assessment weights are write in the corresponding field of this routing table, and, self this father node is made as the source node of this Request Packet.
13. mobile ad hoc network system according to claim 11, wherein this assessment algorithm is:
Q＝min{M
U，(T
U-X
UV)，T
V}；
Wherein, Q represents this external assessment weights, M
URepresent these outside weights of the source node U of this Request Packet, T
URepresent this available surplus yield of this Request Packet, X
UVRepresent this source node U to transmit transfer resource the expend amount weights of this Request Packet to this destination node V, T
URepresent this available surplus yield of this destination node.
14. mobile ad hoc network system according to claim 11, wherein each described communication node also comprises and inspects its tables of data that multicasts separately, whether belongs to this appointment group that multicasts to judge described communication node; Transmit response packet respectively to its father node separately by belonging to the multicast communication node of group of this appointment, with according to the response packet resource of this response packet and the node resource of each communication node, determine the package of each communication node to transmit energy, wherein this response packet resource comprises this father node and this package transmission energy of the source node that transmits this response packet; Do not receive and belong to multicast one of them response packet that is transmitted of communication node of group of this appointment if do not belong to the multicast communication node of group of this appointment, then do not belong to the multicast communication node of group of this appointment and transmit another response packet to its father node.
15. mobile ad hoc network system according to claim 14, the communication node that wherein receives this response packet is inspected this package transmission energy in this response packet, and transmits energy and compare with this package in himself the routing table; If this package transmission energy is transmitted energy greater than this package, then replace this package and transmit energy, and insert to the corresponding field of this routing table with this package transmission energy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101415047A CN102209362A (en) | 2010-03-31 | 2010-03-31 | Mobile ad-hoc network system and routing setup method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101415047A CN102209362A (en) | 2010-03-31 | 2010-03-31 | Mobile ad-hoc network system and routing setup method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102209362A true CN102209362A (en) | 2011-10-05 |
Family
ID=44697978
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101415047A Pending CN102209362A (en) | 2010-03-31 | 2010-03-31 | Mobile ad-hoc network system and routing setup method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102209362A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6628620B1 (en) * | 2002-04-29 | 2003-09-30 | Harris Corporation | Hierarchical modile ad-hoc network and methods for route error recovery therein |
| CN101040486A (en) * | 2004-10-12 | 2007-09-19 | 国际商业机器公司 | Method, system and program product for automated topology formation in dynamic distributed environments |
| CN101119364A (en) * | 2007-09-13 | 2008-02-06 | 上海大学 | Authenticating Ad Hoc group cipher key negotiation protocol |
| CN101494599A (en) * | 2008-09-28 | 2009-07-29 | 天津大学 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
-
2010
- 2010-03-31 CN CN2010101415047A patent/CN102209362A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6628620B1 (en) * | 2002-04-29 | 2003-09-30 | Harris Corporation | Hierarchical modile ad-hoc network and methods for route error recovery therein |
| CN101040486A (en) * | 2004-10-12 | 2007-09-19 | 国际商业机器公司 | Method, system and program product for automated topology formation in dynamic distributed environments |
| CN101119364A (en) * | 2007-09-13 | 2008-02-06 | 上海大学 | Authenticating Ad Hoc group cipher key negotiation protocol |
| CN101494599A (en) * | 2008-09-28 | 2009-07-29 | 天津大学 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Local coordination based routing and spectrum assignment in multi-hop cognitive radio networks | |
| Ni et al. | Joint roadside unit deployment and service task assignment for Internet of Vehicles (IoV) | |
| Crowcroft et al. | Modelling incentives for collaboration in mobile ad hoc networks | |
| CN104205665B (en) | Including cellular network and it is the cellular communication system of at least one mobile device service | |
| CN1855867B (en) | Method and apparatus for distributing mobile station information in a wireless mesh network | |
| CN103648143B (en) | A kind of prolongation IPv6 wireless sensor network life method and device | |
| CN102158812B (en) | Wireless Mesh network multicasting communication method of AC-AP (Access Controller-Access Point) framework | |
| Tan et al. | QSDN-WISE: A new QoS-based routing protocol for software-defined wireless sensor networks | |
| CN102857988B (en) | Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network | |
| Chen et al. | GAR: Group aware cooperative routing protocol for resource-constraint opportunistic networks | |
| CN101873273A (en) | Routing forwarding method, routing node and wireless communication network | |
| Manikannan et al. | Optimized mobility management for RPL/6LoWPAN based IoT network architecture using the firefly algorithm | |
| TWI426811B (en) | Mobile ad hoc network and method for establishing routing thereof | |
| CN102067514A (en) | Method and apparatus for multicast tree management in multi-hop relay communication system | |
| CN102883403A (en) | Construction method for mobile ad hoc network | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| Din et al. | Hierarchical architecture for 5g based software-defined intelligent transportation system | |
| CN101827422B (en) | Simple network data collecting method of mobile wireless sensor | |
| Khabbaz et al. | Which vehicle to select? | |
| CN102572015A (en) | Implementation method for dynamic IPv6 address configuration of mobile ad hoc network | |
| Jia et al. | A BUS‐aided RSU access scheme based on SDN and evolutionary game in the Internet of Vehicle | |
| CN106792969B (en) | A kind of energy efficient hybrid wireless sensor network routing method | |
| JP4757770B2 (en) | Communication route selection control device, wireless device, and communication route selection method | |
| Srinidhi et al. | Hybrid energy efficient and QoS aware algorithm to prolong IoT network lifetime | |
| Tripathi et al. | DDOS: data dissemination with optimized and secured path using modified particle swarm optimization in vehicular communication network (VCN) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20111005 |