CN105578555A - Routing method of wireless ad hoc network, node apparatus and system - Google Patents
Routing method of wireless ad hoc network, node apparatus and system Download PDFInfo
- Publication number
- CN105578555A CN105578555A CN201410549565.5A CN201410549565A CN105578555A CN 105578555 A CN105578555 A CN 105578555A CN 201410549565 A CN201410549565 A CN 201410549565A CN 105578555 A CN105578555 A CN 105578555A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- total
- route requests
- upper hop
- 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 routing method in a wireless ad hoc network. He method comprises the following steps that a source node sends a routing request and the routing request carries link quality information; an intermediate node receives the routing request, calculates quality of a link between a previous jump of node and the intermediate node, updates the link quality information in the routing request and forwards the updated routing request; a destination node receives the forwarded routing request, calculates the quality of the link between the previous jump of node and the destination node, selects the routing through combining the link quality information in the routing request and a hop and replies the routing. The invention also provides a corresponding node apparatus and a wireless ad hoc network system. Through comprehensively considering factors of the link quality and the hop, an optimal routing between a source and the destination node is provided so that data transmission is accelerated and end-to-end time delay is reduced.
Description
Technical field
The present invention relates to wireless communication field, particularly relate to the method for routing of mobile Ad hoc network, node apparatus and system.
Background technology
The multihop self-organizing network that mobile ad-hoc network consists of wireless link multiple node, has the features such as non-stop layer node, network topology dynamic change, wireless transmission bandwidth be limited.It does not rely on any fixing network infrastructure, can realize quickly networking.Therefore this technology for widening application of mobile communication, can be widely used in military communication, earthquake relief work, sensor network etc.In mobile ad-hoc network, due to factors such as the topologies change between node are very fast, Radio Resource is limited, a kind of routing algorithm that is efficient, that can adapt to topologies change fast seems particularly important.Routing algorithm conventional in wireless self-organization network can be divided into two large classes: Active routing algorithm (Table-Driven) and On-demand routing algorithm (On-Demand).
In reactiver outing, each node comprises local maintenance one and arrives the route information table of other all nodes, and with other this routing iinformations of node periodical exchange.When node has data to need to send, direct table of query and routing.Therefore reactiver outing can ensure good real-time and service quality, but needs the cost maintaining routing information that cost is larger.Typical Active routing algorithm has: DSDV (Destination-SequenceDistance-VectorRouting, aim sequence distance vector route) agreement, WRP (WirelessRoutingProtocol, wireless routing) agreement, OLSR (OptimizedLinkStateRouting, the Link State optimized) agreement, FSR (FisheyeStateRouting, flake state) agreement etc.
Different from reactiver outing, on-demand routing does not need periodic broadcast routing update information, only just can set up route when node has communication requirement, therefore greatly reduce the expense sending control packet and bring, but its routing iinformation set up may be a part for whole network topological information.Typical On-demand routing algorithm has: AODV (AdhocOn-DemandDistanceVectorRouting, Adhoc demand distance vector) agreement, DSR (DynamicSourceRouting, DSR) agreement, ABR (Associability-basedRouting, associating stability route) agreement etc.Compared with reactiver outing, on-demand routing can reduce network overhead, improves router efficiency, it is generally acknowledged that on-demand routing is more suitable for multi-hop wireless self-organizing network, and therefore on-demand routing has also become the emphasis of research.
In traditional batch design, each layer function is separate, and overall performance of network is left in the basket.In existing Routing for On-Demand Protocol in MANET, no matter be reactiver outing or on-demand routing, majority adopts the shortest jumping figure as routing criterion, do not consider the performance of physical layer and Media Access Control (MAC).Due to the time variation of wireless link, the route elected so not necessarily Optimization route.
Summary of the invention
For overcoming above-mentioned shortcoming, the present invention proposes the method for routing in a kind of mobile Ad hoc network, comprising: source node sends route requests, carries link quality information in described route requests; Intermediate node receives described route requests, calculates and the internodal link-quality of upper hop, and upgrades the link quality information in described route requests, then forwards the route requests after upgrading; Destination node receives the route requests forwarded, and calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Preferably, described link quality information comprises signal-tonoise information and/or transmission rate information; Further, described transmission rate information comprises minimum speed limit and total speed.
Preferably, the link quality information that described intermediate node upgrades in described route requests specifically comprises: the transmission rate between described intermediate node computes and upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.Further, the transmission rate between described intermediate node computes and upper hop node specifically comprises: physical layer calculates the SNR between upper hop node, reports MAC layer; MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.With further, describedly to determine and number of time slots available between upper hop node specifically comprises: described intermediate node is according to the resource service condition table stored, the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain available time slot number.
Preferably, described destination node selects route specifically to comprise: the final speed V calculating each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, is specially:
V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; The final speed V of more each route, selects the route that wherein final speed is the fastest.
Based on identical design, the present invention also proposes the node apparatus in a kind of mobile Ad hoc network, comprising: the first module, when described node apparatus is as source node, for sending route requests, carries link quality information in described route requests; Second module, when described node apparatus is as intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading; 3rd module, when described node apparatus is used for as destination node, for calculating and the internodal link-quality of upper hop, receiving the route requests forwarded, selecting route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Preferably, described link quality information comprises minimum speed limit and total speed.
Further, the link quality information that described second module upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.Further, the transmission rate that described second module calculates between upper hop node specifically comprises: physical layer calculates the SNR between upper hop node, reports MAC layer; MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.Wherein to determine and number of time slots available between upper hop node specifically comprises: inquire about the sent resource of upper hop node and self can receive the common factor of resource, obtaining available time slot number.
Preferably, described 3rd module specifically comprises according to selecting route: the final speed V calculating each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, is specially:
V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; The final speed V of more each route, selects the route that wherein final speed is the fastest.
Based on identical design, the present invention also proposes a kind of mobile Ad hoc network system, and described system comprises source node, intermediate node and destination node, described source node, for sending route requests, carries link quality information in described route requests; Described intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading; Described destination node, for receiving the route requests of forwarding, calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Preferably, described link quality information comprises minimum speed limit and total speed.
Preferably, the link quality information that described intermediate node upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.Further, the transmission rate between described intermediate node computes and upper hop node specifically comprises: physical layer calculates the SNR between upper hop node, reports MAC layer; MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.Wherein, describedly to determine and number of time slots available between upper hop node specifically comprises: described intermediate node is according to the resource service condition table stored, and the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain available time slot number.
Preferably, described destination node selects route specifically to comprise: the final speed V calculating each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, is specially:
V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; The final speed V of more each route, selects the route that wherein final speed is the fastest.
The method for routing of mobile Ad hoc network that the present invention proposes, node apparatus and system, make the node in self-organizing network when there being transfer of data to need to set up route, no longer simple using the shortest jumping figure as routing criterion, but consider link-quality, optimum route between providing source and destination node, thus speeding up data transmission, reduce end-to-end time delay.
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) of the method for routing that the present invention proposes;
Fig. 2 is the network topological diagram of embodiment 1.
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.
The present invention propose method for routing, be applicable to multiple node composition mobile ad-hoc network interior joint between Route establishment.
Please refer to accompanying drawing 1, the key step of the method comprises:
Step 1: source node sends route requests, carries link quality information in described route requests;
When source node has data to need to mail to destination node, first construct route requests (RouteRequest, RREQ) message, in this message, comprise the link quality information on link, such as signal-tonoise information, transmission rate information etc.This sentences minimum speed limit and total speed is example, and namely RREQ message comprises minimum speed limit and total speed two fields; At source node end, these two field initialization values can be set to 0.
Step 2: intermediate node receives described route requests, calculates and the internodal link-quality of upper hop, and upgrades the link quality information in described route requests, then forwards the route requests after upgrading;
Based on the hypothesis in step 1, after each intermediate node receives RREQ message herein, first set up the reverse route arriving source node, then the transmission rate between itself and upper hop node is calculated, and the minimum speed limit in this transmission rate and RREQ message is compared, if this speed is less than minimum speed limit, then this speed is replaced with the minimum speed limit in RREQ, and upgrade the total rate information on link; Otherwise the total rate information directly upgraded on link; Wherein said total speed be in this route each jump speed and.Then the RREQ message after this renewal is forwarded.
In the communication process of RREQ, can arranging as follows of intermediate node computes transmission rate: first calculated the SNR between upper hop node by physical layer, and report MAC layer.MAC layer is after receiving RREQ message, calculate the signal to noise ratio (SignaltoNoiseRatio in a period of time, SNR) mean value, a kind of suitable Modulation and Coding Scheme (ModulationandCodingScheme is selected by this SNR mean value, MCS), then obtain according to the mapping relations one by one of MCS and transmission block size (TransportBlockSize, TBSize) bit number that a time slot can send.Finally, node needs to judge available number of time slots between upper hop node, node is according to the resource service condition table stored, the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain utilizing number of time slots, this number of time slots is multiplied by the bit number that a time slot can send just to obtain for the bit number of transmission, more just can to obtain transmission rate divided by the time.After MAC calculates transmission rate, report network layer together with RREQ message.
Step 3: destination node receives the route requests forwarded, calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Like this, when RREQ arrives destination node, the minimum speed limit on whole piece link and total rate information is contained.Destination node is when the RREQ from many routes, calculate the rate information with upper hop respectively, then the minimum speed limit in each bar route is multiplied by weighted factor to add total speed and be multiplied by divided by total jumping figure the final speed that weighted factor β obtains this route, that is: V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; Then the final rate information of more different route, selects a link with the fastest transmission rate and replys route replies message.Wherein α and β can be pre-configured by system, can also be drawn by node according to certain algorithm adaptive polo placement.
After source node receives route replies message, a link with very fast transmission rate is just set up between a source node and a destination node.
Said method has following features, and first, the transmission rate information carried in routing request packet on path; The second, report signal to noise ratio by physical layer, transmission rate that transmission rate that Medium Access Layer calculates single link, network layer consider whole piece link, each layer cooperates mutually, jointly completes Route Selection; Three, the node in network, when carrying out Route Selection, considers jumping figure, have also contemplated that the transmission rate on link.
Utilize above-mentioned method for routing can obtain following beneficial effect: the first, to solve the link transmission quality difference problem that in mobile ad-hoc network, existing route brings as routing criterion because of the shortest jumping figure of consideration; The second, only need carry minimum transmission rate and the total rate information of link in routing request packet and link information on whole piece link just can be provided, save Internet resources; Three, the path set up all has transmission rate faster, thus improves the throughput of mobile ad-hoc network;
The method for routing that the present invention proposes is explained below by way of instantiation:
Embodiment:
Please refer to accompanying drawing 2, source node S initiates routing inquiry to destination node D.
(1) node S is initiated to the route requests of destination node D as source node;
(2) node A, G, F is as the neighbor node of S, after receiving the RREQ that S sends, calculates the transmission rate between S to A, S to G, S to F on link respectively; For node A, add up the average SNR in a period of time between S to A on link by the MAC layer of A, select corresponding MCS by this average SNR, then obtain by MCS the bit number TBSize that each time slot can carry.Then node A checks the local resource service condition table stored, select S can sending time slots and A can the common factor of receiving slot, this available timeslot number is multiplied by TBSize to obtain for the bit number of transmission, then the transmission rate between S to A to be calculated divided by the time.Node G and node F calculates the transmission rate on link in the same way.
(3) transmission rate calculated is reported network layer together with RREQ message by the MAC layer of node A, G, F, by network layer, transmission rate is write into (minimum speed limit field and overall transmission rate field are all this transmission rate) in RREQ message, then forward RREQ message;
(4) after node D receives the RREQ message from E, find node for the purpose of oneself, now opening timing device, continue to wait for the RREQ message from other paths;
(5) after Node B and E receive the RREQ message from A and G respectively, the transmission rate between A and B, between G and E is calculated equally by MAC layer, and speed is reported the network layer of B and E, upgrade minimum speed limit and overall transmission rate field also continuation forwarding RREQ by network layer;
(6) node C calculates transmission rate between B and C and report network layer, and network layer upgrades transmission rate information and also forwards RREQ;
(7) finish node D can receive the RREQ message come from S → F → D, S → G → E → D and S → A → B → C → D tri-paths, the MAC layer of node D is calculating F → D, after transmission rate on these three single links of E → D, C → D, report the network layer of D respectively.By the minimum transmission rate on network layer calculating S → F → D, S → G → E → D and S → A → B → C → D tri-paths of D and overall transmission rate;
(8) node D is when selecting route, according to the jumping figure on the balanced link of formula below and transmission rate relation: the overall transmission rate in the minimum transmission rate * α+route in final speed=route/total jumping figure * β, wherein alpha+beta=1.
The final speed of node D more several routes, therefrom selects the routing reply route replies that final speed is maximum.
When node S receives route replies, one leads to D by S and the path with very fast transmission rate is just set up.
Based on identical design, the present invention also proposes the node apparatus in a kind of mobile Ad hoc network, comprising: the first module, when described node apparatus is as source node, for sending route requests, carries link quality information in described route requests; Second module, when described node apparatus is as intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading; 3rd module, when described node apparatus is used for as destination node, for calculating and the internodal link-quality of upper hop, receiving the route requests forwarded, selecting route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Preferably, described link quality information comprises minimum speed limit and total speed.
Further, the link quality information that described second module upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.Further, the transmission rate that described second module calculates between upper hop node specifically comprises: physical layer calculates the SNR between upper hop node, reports MAC layer; MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.Wherein to determine and number of time slots available between upper hop node specifically comprises: inquire about the sent resource of upper hop node and self can receive the common factor of resource, obtaining available time slot number.
Preferably, described 3rd module specifically comprises according to selecting route: the final speed V calculating each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, is specially:
V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; The final speed V of more each route, selects the route that wherein final speed is the fastest.
Based on identical design, the present invention also proposes a kind of mobile Ad hoc network system, and described system comprises source node, intermediate node and destination node, described source node, for sending route requests, carries link quality information in described route requests; Described intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading; Described destination node, for receiving the route requests of forwarding, calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
Preferably, described link quality information comprises minimum speed limit and total speed.
Preferably, the link quality information that described intermediate node upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.Further, the transmission rate between described intermediate node computes and upper hop node specifically comprises: physical layer calculates the SNR between upper hop node, reports MAC layer; MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.Wherein, describedly to determine and number of time slots available between upper hop node specifically comprises: described intermediate node is according to the resource service condition table stored, and the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain available time slot number.
Preferably, described destination node selects route specifically to comprise: the final speed V calculating each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, is specially:
V=V
min* α+V
total/ N* β, wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1; The final speed V of more each route, selects the route that wherein final speed is the fastest.
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 (19)
1. the method for routing in mobile Ad hoc network, is characterized in that, comprising:
Source node sends route requests, carries link quality information in described route requests;
Intermediate node receives described route requests, calculates and the internodal link-quality of upper hop, and upgrades the link quality information in described route requests, then forwards the route requests after upgrading;
Destination node receives the route requests forwarded, and calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
2. method according to claim 1, is characterized in that, described link quality information comprises signal-tonoise information and/or transmission rate information.
3. method according to claim 2, is characterized in that, described transmission rate information comprises minimum speed limit and total speed.
4. method according to claim 3, is characterized in that, the link quality information that described intermediate node upgrades in described route requests specifically comprises:
Transmission rate between described intermediate node computes and upper hop node, compares with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replaces described minimum speed limit, and upgrades total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.
5. method according to claim 4, is characterized in that, the transmission rate between described intermediate node computes and upper hop node specifically comprises:
Physical layer calculates the SNR between upper hop node, reports MAC layer;
MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.
6. require the method described in 5 according to right, it is characterized in that, describedly to determine and number of time slots available between upper hop node specifically comprises: described intermediate node is according to the resource service condition table stored, the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain available time slot number.
7. the method according to claim 3 ~ 6 any one, is characterized in that, described destination node selects route specifically to comprise:
Calculate the final speed V of each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, be specially: V=V
min* α+V
total/ N* β,
Wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1;
The final speed V of more each route, selects the route that wherein final speed is the fastest.
8. the node apparatus in mobile Ad hoc network, is characterized in that, described node apparatus comprises:
First module, when described node apparatus is as source node, for sending route requests, carries link quality information in described route requests;
Second module, when described node apparatus is as intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading;
3rd module, when described node apparatus is used for as destination node, for calculating and the internodal link-quality of upper hop, receiving the route requests forwarded, selecting route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
9. node apparatus according to claim 8, is characterized in that, described link quality information comprises minimum speed limit and total speed.
10. node apparatus according to claim 9, it is characterized in that, the link quality information that described second module upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.
11. node apparatus according to claim 10, is characterized in that, the transmission rate that described second module calculates between upper hop node specifically comprises:
Physical layer calculates the SNR between upper hop node, reports MAC layer;
MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.
12. to require the node apparatus described in 11 according to right, it is characterized in that, describedly to determine and number of time slots available between upper hop node specifically comprises: inquire about the sent resource of upper hop node and self can receive the common factor of resource, obtaining available time slot number.
13. node apparatus according to claim 9 ~ 12 any one, is characterized in that, described 3rd module specifically comprises according to selection route:
Calculate the final speed V of each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, be specially: V=V
min* α+V
total/ N* β,
Wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1;
The final speed V of more each route, selects the route that wherein final speed is the fastest.
14. 1 kinds of mobile Ad hoc network systems, described system comprises source node, intermediate node and destination node, it is characterized in that:
Described source node, for sending route requests, carries link quality information in described route requests;
Described intermediate node, for receiving described route requests, calculating and the internodal link-quality of upper hop, and upgrading the link quality information in described route requests, then forwards the route requests after upgrading;
Described destination node, for receiving the route requests of forwarding, calculates and the internodal link-quality of upper hop, selects route, reply route replies in conjunction with the link quality information in route requests and jumping figure.
15. systems according to claim 14, is characterized in that, described link quality information comprises minimum speed limit and total speed.
16. systems according to claim 15, it is characterized in that, the link quality information that described intermediate node upgrades in described route requests specifically comprises: calculate the transmission rate between upper hop node, compare with the minimum speed limit carried in described route requests, if be less than described minimum speed limit, replace described minimum speed limit, and upgrade total speed; Otherwise directly upgrade total speed; Described total speed is each hop rate rate sum.
17. systems according to claim 16, is characterized in that, the transmission rate between described intermediate node computes and upper hop node specifically comprises:
Physical layer calculates the SNR between upper hop node, reports MAC layer;
MAC layer statistics signal to noise ratio mean value, determines Modulation and Coding Scheme, obtains according to the mapping relations of Modulation and Coding Scheme and transfer resource the bit number that a time slot can send; Determine and number of time slots available between upper hop node; The bit number that a time slot can send is multiplied by available number of time slots, then obtains transmission rate divided by the time; The transmission rate calculated and the route requests received are reported network layer.
18. to require the system described in 17 according to right, it is characterized in that, describedly to determine and number of time slots available between upper hop node specifically comprises: described intermediate node is according to the resource service condition table stored, the sent resource of inquiry upper hop node and the common factor that self can receive resource, obtain available time slot number.
19. systems according to claim 15 ~ 18 any one, is characterized in that, described destination node selects route specifically to comprise:
Calculate the final speed V of each route according to the minimum speed limit in whole piece route, total speed and total jumping figure, be specially: V=V
min* α+V
total/ N* β,
Wherein, V
minfor the minimum speed limit in whole piece route; V
totalfor the summation of hop rate rate each in whole piece route; N is total jumping figure; α and β is respectively weighted factor, and alpha+beta=1;
The final speed V of more each route, selects the route that wherein final speed is the fastest.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549565.5A CN105578555A (en) | 2014-10-16 | 2014-10-16 | Routing method of wireless ad hoc network, node apparatus and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410549565.5A CN105578555A (en) | 2014-10-16 | 2014-10-16 | Routing method of wireless ad hoc network, node apparatus and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105578555A true CN105578555A (en) | 2016-05-11 |
Family
ID=55888090
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410549565.5A Withdrawn CN105578555A (en) | 2014-10-16 | 2014-10-16 | Routing method of wireless ad hoc network, node apparatus and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105578555A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108055676A (en) * | 2017-11-06 | 2018-05-18 | 江苏省邮电规划设计院有限责任公司 | 4G system D2D route selection methods based on terminal rank and number of nodes |
| CN108093454A (en) * | 2017-12-07 | 2018-05-29 | 中国科学院上海微系统与信息技术研究所 | A kind of implementation method of cross-layer routing criterion |
| CN109714078A (en) * | 2019-03-11 | 2019-05-03 | 北京智芯微电子科技有限公司 | The signaling interaction method and system of data upstream transmission |
| CN110505112A (en) * | 2019-07-09 | 2019-11-26 | 星融元数据技术(苏州)有限公司 | A kind of network performance monitoring method, device and storage medium |
| CN111193667A (en) * | 2019-12-26 | 2020-05-22 | 南京创维信息技术研究院有限公司 | Routing method, leaf node and storage medium of ad hoc network |
| CN113347679A (en) * | 2021-05-31 | 2021-09-03 | 浙江大华技术股份有限公司 | Data transmission method and device, storage medium and electronic device |
| CN113965507A (en) * | 2020-06-29 | 2022-01-21 | 中兴通讯股份有限公司 | Communication method, device, control end, system and storage medium |
| CN114025313A (en) * | 2021-11-04 | 2022-02-08 | 北京科技大学 | Wireless routing method, electronic equipment and computer storage medium |
| CN117580125A (en) * | 2023-11-16 | 2024-02-20 | 中山大学 | Underwater sensor network routing protocol system based on weighted link quality |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101765180A (en) * | 2008-12-25 | 2010-06-30 | 上海寰创通信科技有限公司 | Mesh routing method supporting Qos guarantee |
| CN101854697A (en) * | 2010-06-09 | 2010-10-06 | 中兴通讯股份有限公司 | Multi-constraint quality-of-service control routing method and system for wireless mesh network |
| CN102340840A (en) * | 2011-10-19 | 2012-02-01 | 北京握奇数据系统有限公司 | Method, device and node for establishing route |
| CN102387559A (en) * | 2010-09-03 | 2012-03-21 | 中兴通讯股份有限公司 | Cross-layer route optimization method and device for wireless Mesh network |
-
2014
- 2014-10-16 CN CN201410549565.5A patent/CN105578555A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101765180A (en) * | 2008-12-25 | 2010-06-30 | 上海寰创通信科技有限公司 | Mesh routing method supporting Qos guarantee |
| CN101854697A (en) * | 2010-06-09 | 2010-10-06 | 中兴通讯股份有限公司 | Multi-constraint quality-of-service control routing method and system for wireless mesh network |
| CN102387559A (en) * | 2010-09-03 | 2012-03-21 | 中兴通讯股份有限公司 | Cross-layer route optimization method and device for wireless Mesh network |
| CN102340840A (en) * | 2011-10-19 | 2012-02-01 | 北京握奇数据系统有限公司 | Method, device and node for establishing route |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108055676A (en) * | 2017-11-06 | 2018-05-18 | 江苏省邮电规划设计院有限责任公司 | 4G system D2D route selection methods based on terminal rank and number of nodes |
| CN108093454A (en) * | 2017-12-07 | 2018-05-29 | 中国科学院上海微系统与信息技术研究所 | A kind of implementation method of cross-layer routing criterion |
| CN109714078A (en) * | 2019-03-11 | 2019-05-03 | 北京智芯微电子科技有限公司 | The signaling interaction method and system of data upstream transmission |
| CN109714078B (en) * | 2019-03-11 | 2021-03-26 | 北京智芯微电子科技有限公司 | Signaling interaction method and system for data uplink transmission |
| CN110505112A (en) * | 2019-07-09 | 2019-11-26 | 星融元数据技术(苏州)有限公司 | A kind of network performance monitoring method, device and storage medium |
| CN111193667A (en) * | 2019-12-26 | 2020-05-22 | 南京创维信息技术研究院有限公司 | Routing method, leaf node and storage medium of ad hoc network |
| CN113965507A (en) * | 2020-06-29 | 2022-01-21 | 中兴通讯股份有限公司 | Communication method, device, control end, system and storage medium |
| CN113347679A (en) * | 2021-05-31 | 2021-09-03 | 浙江大华技术股份有限公司 | Data transmission method and device, storage medium and electronic device |
| CN114025313A (en) * | 2021-11-04 | 2022-02-08 | 北京科技大学 | Wireless routing method, electronic equipment and computer storage medium |
| CN114025313B (en) * | 2021-11-04 | 2022-08-05 | 北京科技大学 | Wireless routing method, electronic equipment and computer storage medium |
| CN117580125A (en) * | 2023-11-16 | 2024-02-20 | 中山大学 | Underwater sensor network routing protocol system based on weighted link quality |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105578555A (en) | Routing method of wireless ad hoc network, node apparatus and system | |
| JP4425863B2 (en) | Packet transfer system and radio base station | |
| US8139504B2 (en) | System, device, and method for unifying differently-routed networks using virtual topology representations | |
| Asokan | A review of Quality of Service (QoS) routing protocols for mobile Ad hoc networks | |
| Tarique et al. | Minimum energy hierarchical dynamic source routing for mobile ad hoc networks | |
| MadhanMohan et al. | Power controlled routing in wireless ad hoc networks using cross layer approach | |
| CN106658635A (en) | Hierarchical routing method based on service quality in wireless multi-hop network | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| Peng et al. | An energy-aware random multi-path routing protocol for MANETs | |
| KR100690632B1 (en) | Channel decision method for mobile ad hoc network | |
| CN112383947B (en) | Wireless ad hoc network mixed routing protocol method based on network environment | |
| Chinara et al. | Topology control by transmission range adjustment protocol for clustered mobile ad hoc networks | |
| Song et al. | Dingo‐optimization‐based task‐offloading algorithm in multihop V2V/V2I‐enabled networks | |
| JP2007221568A (en) | Transfer delay control method and radio terminal | |
| Selvakumar et al. | Sustain route by tabu and amplifing qos with distributed scheduling in WMN | |
| Banik et al. | Design of QoS Routing Framework based on OLSR Protocol | |
| Raju et al. | A unified approach to enhance the performance of zrp for manets on an urban terrain | |
| CN104869605A (en) | Emergency communication-based AODV route stability algorithm improvement method | |
| Feng et al. | Performance analysis of IEEE 802.11 s wireless mesh network on RM-AODV path selection protocol | |
| Huang et al. | Zone-based hierarchical routing in two-tier backbone ad hoc networks | |
| Mello et al. | A survey on wireless routing protocols (AODV, DSR, DSDV) | |
| Lingam et al. | Energy efficient shortest path routing | |
| Nwelih et al. | Analysis and performance evaluation of mobile ad-hoc network (MANET) protocols based on selected criteria | |
| eddine Bemmoussat et al. | Cluster based routing protocol in wireless mesh network | |
| Ying et al. | QoS routing in ad-hoc network |
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 |
Application publication date: 20160511 |
|
| WW01 | Invention patent application withdrawn after publication |