CN1849597A - Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network - Google Patents
Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network Download PDFInfo
- Publication number
- CN1849597A CN1849597A CN 200480019074 CN200480019074A CN1849597A CN 1849597 A CN1849597 A CN 1849597A CN 200480019074 CN200480019074 CN 200480019074 CN 200480019074 A CN200480019074 A CN 200480019074A CN 1849597 A CN1849597 A CN 1849597A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- network
- reliability
- route
- 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
A system and method for locating optimal routes between source and destination nodes in a communications network, in particular, a wireless ad-hoc communications network by employing a link reliability algorithm that estimates the reliability of links between nodes using a prediction mechanism and a variable-weight filter. The prediction can be based on signal strength, signal-to-noise ratio or any statistic collected at the physical layer that is deemed representative of the quality of a link, and the weighting filter adjusts the predicted value based on the traffic conditions (e.g., idle, light traffic, moderate traffic or heavy traffic) being experienced by the nodes whose link quality is being estimated.
Description
Cross reference
The application is according to be entitled as " the Systemand Method to Improve the Network Performance of a WirelessCommunication Network by Finding an Optimal Route Between a Sourceand a Destination " of 35U.S.C. § 119 (e) requirement to Avinash Joshi, sequence number 60/476,237, be filed in the interim pre-patented claim of determining of the U.S. on June 6th, 2003, be entitled as " A System and Methodfor Providing a Measure of Link Reliability to a Routing Protocol in an AdHoc Wireless Network " at Gu é na ё l T.Strutt, sequence number 60/546,940, be filed in the interim pre-patented claim of determining of the U.S. on February 24th, 2004, and to be entitled as " the System and Method for Characterizing the Quality of a Linkin a Wireless Network " of Avinash Joshi and Gu é na ё l T.Strutt, sequence number 60/546,941, be filed in the right of the interim pre-patented claim of determining of the U.S. on February 24th, 2004, the full content of document is integrated in this by reference.
Technical field
The System and method for that the present invention relates to improve is used for the optimum route between middle source of definite communication network (wireless ad-hoc communication network especially) and the destination node.More specifically, the present invention relates to System and method for, be used for, determine the optimum route between the source and destination node in the communication network by estimating posterior grouping completion rate.
Background technology
Cordless communication network, for example moving wireless telephone network is universal day by day in the past ten years.These cordless communication networks usually are called " cellular network ", because network infrastructure is arranged to the zone that the coverage is divided into a plurality of being called " sub-district ".Terrestrial cellular network comprises a plurality of interconnected base stations, or base node, and it is distributed on the assigned address of whole coverage geographically.Each base node comprises one or more transceiver, its can to send and receiving electromagnetic signals, for example radio frequency (RF) signal of communication from the mobile subscriber's node (for example wireless telephone) that is positioned within the areal coverage.Signal of communication comprises, such as, abide by modulation technique modulation of wanting and the voice data that sends as packet.As those skilled in the art will appreciate that, network node is with the multiplexing form packet communication that transmits and receive data, for example time division multiple access (TDMA) (TDMA) form, CDMA (CDMA) form or frequency division multiple access (FDMA) form, its single transceiver that allows the first node place simultaneously with its areal coverage in a plurality of other node communications.
In recent years, the mobile communications network of " ad-hoc " network of a kind of being called (or being called self-organizing network) is developed.In the network of this type, each mobile node can be operated as the base station or the router of other mobile node, thereby has eliminated the needs to fixing base station architecture.The details of ad-hoc network is illustrated in the U.S. Patent No. 5,943,322 of Mayor, and its full content is integrated in this by reference.
More complicated ad-hoc network is also in development, wherein except that as traditional ad-hoc network, allowing movement station communicates with one another, further allow mobile node to insert fixed network, thereby communicate with other mobile node (for example on the public switch telephone network (PSTN) and) such as the node on other networks such as the Internet.The details of the ad-hoc network of these advanced types is described in sequence number 09/897,790, be entitled as " Ad Hoc Peer-to-Peer Mobile RadioAccess System Interfaced to the PSTN and Cellular Networks ", be filed in the U.S. Patent application in June 29 calendar year 2001, sequence number 09/815,157, be entitled as " TimeDivision Protocol for an Ad-Hoc; Peer-to-Peer Radio Network HavingCoordinating Channel Access to Shared Parallel Data Channels withSeparate Reservation Channel ", be filed in the U.S. Patent application in March 22 calendar year 2001, and sequence number 09/815,164, be entitled as " Prioritized-Routing for an Ad-Hoc; Peer-to-Peer; Mobile Radio Access System ", be filed in the U.S. Patent application in March 22 calendar year 2001, the full content of each document is integrated in this by reference.
As those skilled in the art will appreciate that, because the specific node of ad-hoc network moves, network is necessary to keep the connectivity with these nodes.The packet that sends typically from mobile device " jumpings " to mobile device, the establishment transmission path, i.e. route is up to the arrival final purpose.Yet when equipment moved, the transmission path between the mobile device usually was easy to change, so ad-hoc network service must can adapt to, and to obtain optimal performance, solved the ability of mobile individual equipment and the restriction on the capacity simultaneously.
In typical cordless communication network, as route metric, the route with lower jumping figure typically is preferred route with the jumping figure between source and the purpose.Yet this may cause selecting the route of non-optimum, but this is because may have higher link-quality of jumping figure or the better route of data transfer rate.
The example of the type of Routing Protocol is described in No.5, and in 412,654 the United States Patent (USP), and in the interim pre-patented claim of determining of the U.S. of above-cited sequence number 60/476,237, the full content of two documents is integrated in this by reference.In these technology, each node calculates the route metric of its purpose, might use other alternative route.Its target is to select best route by the route of selecting to have lowest metric.
As No.5, as described in 412,654 the United States Patent (USP), simply, tolerance is exactly jumping figure.Yet, as described in the interim pre-patented claim of determining of U.S. of sequence number 60/476,237, measure and be more detailed value, " link reliability " that depend on based on signal intensity calculates." link reliability " is the more accurate component of route metric, because conduct is to adding substituting of " 1 " for each jumping, if link can not be used its maximum potential, algorithm adds bigger round values (for example, 20).Like this, each node is the round values (for example, 1) of best wireless link distribution minimum, and at Radio Link because, such as, multipath, decay, congested, distance, cover, disturb, or the like and distribute the round values of big (for example, 20) when degenerating.Other example of determining the technology of link-quality is illustrated in the U.S. Patent application of No.2004/0022223 of announcement and No.6, and in 522,881 the United States Patent (USP), the full content of two documents is integrated in this by reference.
Although the technology of describing in the interim pre-patented claim of determining of quoting in the above is suitable for many wireless networks, comprise wireless ad-hoc equity (peer-to-peer) network, in the time of in being used in the network that mainly comprises low-cost broadband wireless device, the particular limitations of this technology may become apparent.For example, fragmentary portfolio mistake, (for example static multipath) that is for example met with in the normal wireless channel generally do not cause regulating link reliability, and this is because signal intensity and signal to noise ratio (S/N ratio) are unaffected.And in the particular condition of attenuation channel, low-cost broadband wireless device can not be followed the tracks of the variation of the signal intensity of receiving end experience aptly.This part is because measure the susceptibility that depends on wireless device, in part because receiver only can carry out fragmentary measurement (a for example particular point in time when receiving grouping), this provides the imperfect information about the actual signal Strength Changes.
Correspondingly, there are needs, are used to use the factor except that jumping figure or received signal intensity, determine the optimum route between the source and destination node in the communication network in efficient mode as tolerance separately to the System and method for that improves.
Summary of the invention
A target of the present invention provides a kind of System and method for of improvement, and it is used for the optimum route between definite communication network (specifically being wireless ad-hoc communication network) source and the destination node.
Another target of the present invention provides a kind of System and method for of improvement, it is used to use factor jumping figure between node or the power control as unique tolerance, carry out optimum Route Selection based on it, determine the optimum route between the source and destination node in the communication network.
These and other target of the present invention is realized basically by a kind of System and method for, it is used for the optimum route between definite communication network (specifically being wireless ad-hoc communication network) source and the destination node, it adopts the link reliability algorithm, this algorithm uses forecasting mechanism and variable weight wave filter, estimates the reliability of the link between the node.Prediction can be based on signal intensity, signal to noise ratio (S/N ratio) or any statistics of collecting in Physical layer, these data are considered to represent link-quality, and the traffic conditions that the weight wave filter is experiencing based on the just estimative node of its link-quality (for example, idle, slight portfolio, moderate or severe portfolio) is regulated predicted value.
Description of drawings
By reading following embodiment together with appended drawing, these and other target of the present invention, advantage and new features will be easier to understand, wherein:
Fig. 1 is the block diagram of exemplary ad-hoc cordless communication network, and this network comprises a plurality of nodes, and it adopts the System and method in accordance with embodiments of the invention;
Fig. 2 is the block diagram of explaining the example of the mobile node that adopts in the network shown in Fig. 1;
Fig. 3 is that the link reliability of prediction of expression packet and hello message is to the figure of signal intensity;
Fig. 4 is the block diagram that the equation of link reliability is calculated in expression, and it abides by embodiments of the invention;
Fig. 5 (a) is the figure of one group of λ that quantizes of the various interarrival time Δ t of explaination; With
Fig. 5 (b) is the figure of explaination variable weight wave filter to the response of the control channel (free time) of the node in the system shown in Fig. 1, slight portfolio, moderate portfolio and severe portfolio operating conditions.
Embodiment
Fig. 1 is the block diagram of the example of explaination ad-hoc packet-switched wireless communication network 100, these network using embodiments of the invention.Particularly, network 100 comprises that a plurality of mobile radio subscriber terminal 102-1 are to 102-n (usually being called node 102 or mobile node 102), and can, but do not require, comprise fixed network 104, its have a plurality of access point 106-1,106-2 ... 106-n (usually being called node 106 or access point 106), to be provided to the access of fixed network 104 to node 102.Fixed network 104 can comprise, such as, core local access network (LAN), and a plurality of server and gateway router, to be provided to the access of other network to network node, for example other ad-hoc network, public switch telephone network (PSTN) and the Internet.Network 100 further can comprise a plurality of fixed router 107-1 to 107-n (usually being called node 107 or fixed router 107), divides into groups with route data between other node 102,106 or 107.Notice that for the purpose of the purpose of this discussion, node discussed above can be referred to as " node 102,106 and 107 ", perhaps is called " node " simply.
As those skilled in the art will appreciate that, node 102,106 and 107 can be each other directly or via one or more other node 102,106 and 107 (at the grouping that sends between node as router operation) communicates, U.S. Patent No. 5 as above-cited Mayor, 943, in 322, and sequence number is 09/897,790,09/815, as described in 157 and 09/815,164 the U.S. Patent application.
As shown in Figure 2, each node 102,106 and 107 comprises transceiver, or modulator-demodular unit 108, its be connected to antenna 110 and can be under the control of controller 112 to receive with 107 and transmission signal, for example signal of packetizing from node 102,106.The data-signal of packetizing can comprise, such as speech, data or multimedia messages, and the control signal of packetizing comprise node updates information.
Each node 102,106 and 107 further comprises storer 114, random-access memory (ram) for example, and except that other thing, it can store the routing iinformation that belongs to other node in its own and network 100.As further showing among Fig. 2, specific node, particularly mobile node 102, can comprise main frame 116, and it can comprise the equipment of any number, for example notebook computer terminal, mobile telephone unit, mobil data unit or any other suitable equipment.Each node 102,106 and 107 also comprises suitable hardware and software, and to carry out Internet protocol (IP) and ARP(Address Resolution Protocol), its purpose can easily be understood for those skilled in the art.Also can comprise suitable hardware and software, to carry out transmission control protocol (TCP) and User Datagram Protoco (UDP) (UDP).
As discussing in the top background parts, for the peak optimizating network performance, allow node to select the technology of optimum link to obtain exploitation, packet promptly sends between each node via these optimum link.Such technology can be estimated link reliability based on signal intensity.Unfortunately, as discussed above such, signal intensity not necessarily provides the accurate measurement to link reliability.More general as the technology of abideing by embodiments of the invention described below than prior art, and can be performed in any basically wireless technology (that is, it is " wireless unknowable (agnostic) ").This ability is favourable, important, because link reliability has determined to be used for the best quantitive measure of Routing Protocol, may require this Routing Protocol to operate on the multiple wireless technology, may be side by side.
As those skilled in the art will appreciate that, to the measurement of the link reliability of the neighbor node probability that to be grouping successfully received by neighbor node.Can pass through to use, such as the received signal intensity or the signal to noise ratio (S/N ratio) of the packet of reception are predicted link reliability.If do not arrive neighbours' active communications, this point is particularly useful.Also can come the measure link reliability by using MAC information.Yet typically, only when having neighbours' active communication link, this can realize with rational degree of accuracy.
The composition of abideing by the link reliability algorithm for estimating of embodiments of the invention comprises forecasting mechanism and variable weight wave filter.Prediction can be based on signal intensity, signal to noise ratio (S/N ratio) or any statistics of collecting in Physical layer, and these data are considered to represent link-quality.When not to the link of having set up of specific node, and when the information that might receive about this node, need predict.This can be by monitoring the grouping of being sent to other node passively, perhaps receive special advertisement/notice packet (" hello " message for example on one's own initiative, it sends on the reservation channel, as described in the interim pre-patented claim of determining of the U.S. of above-cited sequence number 60/476,237) realize.
Target of the present invention is by using the variable weight wave filter to measure posteriority grouping completion rate.Owing to receive and the emission grouping with non-regular intervals,, be necessary to make forgetting factor to adapt to real time step-length (the fixed weight wave filter is realized the arbitrary constant time step) in order to carry out suitable filtering.Otherwise system will descend rapid convergence in the severe traffic conditions, perhaps descend convergence slowly in the moderate traffic conditions.This new method regularization link reliability computing mechanism is about the rate of convergence of time, promptly, the type of the portfolio that itself and transceiver are sending has nothing to do with amount, and the type is uncertain, chaotic (transceiver is not known it and is used for what application) with regard to essence with amount.Especially, the grouping completion rate fixes on irrelevant with the time interval in a way really.May be simpler although watch the amount " x " of grouping in the past and count the number of successful number and failure and derive completion rate from these numbers, the method is inefficient, because it requires " x " the individual affairs in all past of memory.From the viewpoint of time, the method still is coarse, does not betide one hour or last one millisecond because it does not know " x " individual affairs in the past.Therefore, the invention solves this two problems: counting yield is with accurate irrelevant with respect to the time.
Abide by following equation 1 and carry out link reliability calculating:
LR(t
0)＝(1-λ
Δt/ΔT)·X(t
0)+λ
Δt/ΔT·LR(t
-1)
Equation 1-link reliability is estimated
LR (t
0) current link reliability
LR (t
-1) previous link reliability
λ
Δ tCurrent forgetting factor
Δ t=t
0-t
-1Current interarrival time
Δ T reference time unit
X (t
0) current wave filter input (based on prediction)
The output that is described in the wave filter in the equation 1 will converge to average input (X (t
0)).Therefore, if the input of wave filter is a value 0 for the transmission of each failure, and be value 1 for each successful transmission, after the iteration of given number, the output of wave filter will converge to the number of the successfully grouping of emission and the ratio of the number of the grouping of emission.This ratio is the grouping completion rate with regard to its definition.
For programme convenient for the purpose of, forgetting factor can be quantified as a limited number of value, as what present among Fig. 5 (a) of discussing below and 5 (b), thereby make the fixed point in the microprocessor realize becoming possibility.Further notice X (t
0) be prediction, and LR (t
0) be that routing algorithm is in time t
0Make and be used for the value of validation chain road reliability.When condition changed, the grouping completion rate of particular link may change, and routing algorithm will correspondingly be adjusted about the information of this particular link." previous link reliability " value is the value of calculating in the previous iteration of algorithm.(when setting up new link) is necessary for algorithm and introduces initial value when beginning.For conservative estimation, this initial value can be 0 (that is 0% grouping completion rate).For more positive result, this initial value can be set to 50%.In any case initial value is for the convergence of algorithm did not influence.It must explain that the mode of link reliability selects based on routing algorithm.Do not force routing algorithm, but abandon the initial value of another link of having set up, because it has collected the enough information about initialized new link, this will be wise.For each iteration after the initialization, " previous link reliability " is the output (" current link reliability ") of last iteration.
Further notice, network architecture teacher should based on such as the susceptibility of various data transfer rates, travelling performance, or the like the specific wireless characteristic, determine the equation of " predicted value ".Mea at MeshNetworks
TMThe equation that is used to predict in the system is dual: there is conservative prediction to clear operation, and to the positive prediction of active communication link.From the viewpoint of emissive power, suppose that link is symmetrical, two kinds of predictions are all based on the packet signal intensity that receives.If see that from the viewpoint of emissive power link is asymmetric, guarantee that importantly used " received signal intensity " is the measured person of receiver.
Following The Representation Equation is used for the example of predicted value:
The conservative prediction of equation 2-" hello " message
The positive prediction of equation 3-packet
Fig. 3 is the diagrammatic representation of equation 2 and 3.Notice that " actively prediction " mechanism is optional fully.If there is the portfolio that sends, algorithm will give the reliability of each link and keep connectivity.The extra benefit that signal intensity is converted into positive predicted value is that algorithm will be implemented little punishment to the link that is in scope far away.If there has been the mechanism that applies such punishment (for example energy know routing algorithm), for all packets, the link reliability prediction in the equation 1 should be set to LR=100 (prediction of hello message remains unaffected).
Select variable forgetting factor to adapt to various operating conditions, below for example three:
Clear operation: the unit only receives " advertisement/notice " message.Average interarrival time is typically greater than 500ms.
Slight portfolio: the unit sends low volume data.Average interarrival time is typically between 200 to 500ms.
The moderate portfolio: the unit sends the data of moderate.Average interarrival time is typically between 100 to 200ms.
The severe traffic unit sends mass data.Average interarrival time is typically less than 100ms.
By calculating the time between each transmission, node 102,106 or 107 transceiver 108 can correspondingly be selected forgetting factor and abide by equation 1 and calculate new link reliability, and it is expressed as the block diagram among Fig. 4.Especially, X (t
0) be the input of wave filter.Transceiver 108 by for the transmission of each failure of advertisement/notice packet to X (t
0) assignment 0, and by for each successful transmission of advertisement/notice packet or successful reception to X (t
0) the assignment predicted value, upgrade its link reliability and estimate another node.Predicted value is that platform is relevant, can not be generalized to any Physical layer and realize.Predicted value depends on physical layer parameter, and for example signal intensity, SNR or any other obtainable relevant statistics, wireless performance promptly partly rely on thereon.Like this, know radio operation unsuccessful weak signal intensity or SNR for system designer, predicted value should equally low (near 0).Similarly, know that for system designer the strong signal intensity or the SNR of radio operation success, predicted value should be set to distribute to maximal value in the scope of link reliability (for example, 100, its expression 100%).Like this, system designer can be set up the value look-up table that signal intensity or SNR is converted into the link reliability value in the scope of being distributed (such as, between 0 and 100).This look-up table does not show it is how successful that in fact link has, because it only uses physical layer information, but it carries out the vital prediction of proper handling for the mobile node in the wireless ad hoc network.
Fig. 5 (a) shows one group of λ that quantizes
(Δ t/ Δ T)(λ=(2 wherein
6-1)/2
6, and Δ t equals 85ms), and Fig. 5 (b) shows the response of variable weight wave filter to four kinds of above-mentioned operating conditions (that is, clear operation (control channel), slight portfolio, moderate portfolio and severe portfolio).As can recognizing from these figure, for for slow traffic loads such as " control channel " portfolio scene, convergency factor is less than other (for example, for original state " 1 ", using five " 0 " to reach " 0.5 " as value after importing).Algorithm attempts keeping constant convergence time by adjusting rate of convergence for each iteration.In fact, if the interarrival time between the grouping is bigger, then the rate of convergence of per minute group must be very fast.Similarly, if the interarrival time between the grouping is less, then the rate of convergence of per minute group must be slower.
For the purpose of programming conveniently, with λ
(Δ t/ Δ T)Value quantize.In case determined interarrival time, to previous link reliability value LR (t
-1) adding or deduct a value, this value is λ
(Δ t/ Δ T)X (t
0).As those skilled in the art will appreciate that, such multiplication may be difficult to finish in fixed-point processor, particularly because λ
(Δ t/ Δ T)Be greater than 0 and less than 1 real number.If can be with λ
(Δ t/ Δ T)Be expressed as the inverse of 2 power, multiplication becomes simple dextroposition operation.If corresponding to specific λ
(Δ t/ Δ T)Two power be N, then
Use this example, the λ of quantification
(Δ t/ Δ T)Value provides in following table:
| Δt/ΔT | Δt | λ (Δt/ΔT) | N | Round(N) |
| 1 | 85ms | .9844 | 6 | 6 |
| 2 | 170ms | .9690 | 5.01 | 5 |
| 3 | 255ms | .9539 | 4.44 | 4 |
| 4 | 340ms | .9389 | 4.03 | 4 |
| 5 | 425ms | .9243 | 3.72 | 4 |
| 6 | 510ms | .9098 | 3.47 | 3 |
| 7 | 595ms | .8956 | 3.26 | 3 |
| 8 | 680ms | .8816 | 3.08 | 3 |
| 9 | 765ms | .8679 | 2.92 | 3 |
Therefore, in clear operation, use N=3 to carry out link reliability and calculate (it is corresponding to the Δ t greater than 500ms), in slight portfolio, use N=4 (its corresponding to 200ms to the Δ t between the 500ms), in the moderate portfolio, use N=5 (its corresponding to 100ms to the Δ t between the 200ms), and in the severe portfolio, use N=6 (it is corresponding to the Δ t less than 100ms).
Next joint is the explanation that how to allow mobile node (for example, node 102) to set up optimum route together with the variable weight wave filter to forecast model in the wireless ad hoc network 100.
It is critical in following scene that link reliability is estimated: at first, and when setting up link, and secondly, when link breaks.These incidents may take place under the following conditions: at first, and in the time of within remaining on particular neighborhood, secondly, when leaving neighborhood.Possible situation is summarised in the following table 1:
Table 1-case scenario
| The route transition | |||
| Set up new route | Interrupt current route | ||
| Type of sports | Between neighborhood | Enter the field | Withdraw from the field |
| In the neighborhood | Link is adjusted | The link memory | |
Each case scenario is described in each joint below in more detail.
Enter neighborhood:
Describe transceiver and enter within the scope of another unit, that is, and when mobile node 102, such as, when entering the scope of another node 102,106 or 107.
Target: which link the link reliability algorithm for estimating must indicate more desirable with respect to present employee apace.
Mechanism: when handling advertisement/notice packet, the link reliability algorithm for estimating only uses the signal intensity or the SNR of the grouping of reception to predict.
Withdraw from neighborhood:
Describe transceiver and leave scope.
Target: the link reliability algorithm for estimating must will break by the prediction link before failure takes place.This characteristic is the more generally part of mechanism that is called " make-before-break ".
Mechanism: the link reliability algorithm for estimating uses the signal intensity of grouping to predict, and correspondingly reduces the link reliability value.Except that the transmitted in packets person of causing, carry out this reduction by failure.Like this, it lowers the estimation to the reliability of link on one's own initiative, so that the available link that allows other have more desirable prediction is leading.
Link is adjusted:
Although describe purpose within scope, the grouping completion rate reduces.This may be caused by the existence that decays, temporarily can not monitor or disturb.
Target: the link reliability algorithm for estimating must adapt to actual channel condition apace, for example disturbs and coverage.This is the mechanism that the link reliability algorithm for estimating is given failure notification Routing Protocol according to this.
Mechanism: the link reliability algorithm for estimating is regulated link reliability, to match the grouping completion rate of each purpose in real time.
The memory link failure:
Be cut off although describe link, node is still within scope.
Target: algorithm must keep the memory to link failure, to avoid the route instability.
Mechanism: when handling advertisement/notice packet, the link reliability algorithm for estimating uses the signal intensity or the SNR of grouping to predict, thereby upwards drives the link reliability value.The time spent (memory Time To Failure) must be significantly greater than the time (memoryless Time To Failure) that be established to the route of this node for the first time to rebuliding from the failure of route for reliability.
As can recognizing from above, the System and method for computes integer value that presents here (described " link reliability ") is so that Routing Protocol is chosen the best route of its purpose.This technology also can be used for more senior characteristic, and for example data transfer rate is selected, channel is selected or even packet segmentation/connection.Further, can use above-mentioned System and method for independently as each carrier frequency of system operation, for each grouping size interval, determine link reliability for each data transfer rate or for each modulation type or its combination in any.Like this, described System and method for can be by selecting to provide best link reliability person to determine that it should use which preferred channels, segmentation/method of attachment, data transfer rate or modulation type in arbitrary preset time.
As can from top further recognize, for several reasons, the technology of abideing by embodiments of the invention is favourable for the technology of describing in the background parts.At first, but this technology unit testing this means that being easy to checking suitably realizes described algorithm.Can not look to how showing reliable link exactly based on the method for SNR and signal intensity, they only can computed reliability.This technology also is programmable, and can be implemented in the microprocessor, and it can synthesize, and therefore can be implemented among ASIC or the FPGA.This technology still is portable, and this is because it can be used for the packet radio equipment of any kind, regardless of the bandwidth or the decay characteristics of the frequency band of wireless device work.One of characteristic of described algorithm is that portfolio need not constant or is subjected to control.Further, this technology is adaptive, therefore can regulate at the traffic loads or the convergence time of any degree, and filter parameter and interarrival time border can externally be regulated.In addition, this technology is easy to realize that cost of development is minimum.
Although only describe some exemplary embodiments of the present invention above in detail, those skilled in the art will easily recognize, but exemplary embodiment is carried out many modifications, and do not depart from the instruction and the advantage of novelty of the present invention in fact.Correspondingly, all such modifications are wished to be comprised within the scope of the present invention that limits as claims.
Claims (4)
1. method that is used for determining the optimum route between ad-hoc multi-hop equity cordless communication network source and the destination node, described method comprises:
Use forecasting mechanism and variable weight wave filter, estimate the reliability of the link between the node in the described network, to determine optimum route, this optimum route comprises some in the node between described source and the destination node, makes described variable weight wave filter regulate described predicted value based on the traffic conditions that the just estimative node of link-quality is experiencing; With
Select the route between described source and the destination node, this route comprises the node with most preferably link-quality of determining in the described estimating step.
2. the method for claim 1, wherein:
Described predicted value is based in signal intensity and the signal to noise ratio (S/N ratio) at least one.
3. the method for claim 1, wherein:
Described traffic conditions comprises free time, slight portfolio, moderate portfolio or severe portfolio.
4. the method for claim 1, wherein:
Described source and destination node are mobile nodes.
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US47623703P | 2003-06-06 | 2003-06-06 | |
| US60/476,237 | 2003-06-06 | ||
| US60/546,941 | 2004-02-24 | ||
| US60/546,940 | 2004-02-24 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1849597A true CN1849597A (en) | 2006-10-18 |
Family
ID=37078435
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200480019074 Pending CN1849597A (en) | 2003-06-06 | 2004-06-07 | Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1849597A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008125048A1 (en) * | 2007-04-17 | 2008-10-23 | Huawei Technologies Co., Ltd. | Measurement processing method and apparatus |
| CN101022417B (en) * | 2007-03-16 | 2011-01-12 | 华为技术有限公司 | Method for selecting load sharing link and router |
| CN101262428B (en) * | 2008-04-24 | 2011-06-01 | 西南科技大学 | Potential field routing method in sparse ad-hoc network based on multi-target optimization |
| CN101237686B (en) * | 2007-01-30 | 2012-10-10 | 诺基亚西门子通信技术(北京)有限公司 | Method, system, network device and user device for identifying routes in wireless communication network |
| CN108146442A (en) * | 2016-12-02 | 2018-06-12 | 丰田自动车株式会社 | Prediction data generates equipment and vehicle control apparatus |
| CN108401227A (en) * | 2018-03-07 | 2018-08-14 | 乐鑫信息科技（上海）有限公司 | A kind of method and system for establishing connectionless mesh networks routing |
| CN113347679A (en) * | 2021-05-31 | 2021-09-03 | 浙江大华技术股份有限公司 | Data transmission method and device, storage medium and electronic device |
-
2004
- 2004-06-07 CN CN 200480019074 patent/CN1849597A/en active Pending
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101237686B (en) * | 2007-01-30 | 2012-10-10 | 诺基亚西门子通信技术(北京)有限公司 | Method, system, network device and user device for identifying routes in wireless communication network |
| CN101022417B (en) * | 2007-03-16 | 2011-01-12 | 华为技术有限公司 | Method for selecting load sharing link and router |
| WO2008125048A1 (en) * | 2007-04-17 | 2008-10-23 | Huawei Technologies Co., Ltd. | Measurement processing method and apparatus |
| US8432991B2 (en) | 2007-04-17 | 2013-04-30 | Huawei Technologies Co., Ltd. | Measurement processing method and apparatus |
| CN101262428B (en) * | 2008-04-24 | 2011-06-01 | 西南科技大学 | Potential field routing method in sparse ad-hoc network based on multi-target optimization |
| CN108146442A (en) * | 2016-12-02 | 2018-06-12 | 丰田自动车株式会社 | Prediction data generates equipment and vehicle control apparatus |
| CN108146442B (en) * | 2016-12-02 | 2020-08-07 | 丰田自动车株式会社 | Prediction data generation apparatus and vehicle control apparatus |
| CN108401227A (en) * | 2018-03-07 | 2018-08-14 | 乐鑫信息科技（上海）有限公司 | A kind of method and system for establishing connectionless mesh networks routing |
| US11212729B2 (en) | 2018-03-07 | 2021-12-28 | Espressif Systems (Shanghai) Co., Ltd. | Method and system for establishing connectionless mesh network route |
| CN113347679A (en) * | 2021-05-31 | 2021-09-03 | 浙江大华技术股份有限公司 | Data transmission method and device, storage medium and electronic device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10735503B2 (en) | Content delivery in wireless wide area networks | |
| US10021175B2 (en) | Edge server selection for device-specific network topologies | |
| CN101617549B (en) | A method and apparatus for selecting an access point or relay node in a multi-hop wireless network | |
| CN1148892C (en) | Monitoring of CDMA load and frequency reuse based on reverse link signal-to-noise ratio | |
| US20050286440A1 (en) | System and method for adaptive rate selection for wireless networks | |
| US20110151881A1 (en) | Techniques for fractional frequency reuse in wireless networks | |
| CN114051748B (en) | Optimizing cellular networks using machine learning | |
| JP2006527525A (en) | Link reliability measurement method for routing protocols in ad hoc wireless networks | |
| CN101057511A (en) | System and method for providing a congestion-aware routing metric for selecting a route between nodes in a multihopping communication network | |
| CN1679284A (en) | Monitoring link quality in a mobile ad hoc network | |
| US11778019B2 (en) | Content delivery in wireless wide area networks | |
| EP1832048A2 (en) | System and method for managing communication links between nodes in a wireless communication network | |
| Roshdi et al. | Deep reinforcement learning based congestion control for V2X communication | |
| Le et al. | A new evolutionary approach for gateway placement in wireless mesh networks | |
| CN1849597A (en) | Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network | |
| EP2250850A1 (en) | Channel selection in an ad hoc wireless network | |
| Dimakis et al. | GreenLoRaWAN: An energy efficient and resilient LoRaWAN communication protocol | |
| Sakr et al. | Performance evaluation of power efficient mechanisms on multimedia over LTE-A networks | |
| Datta et al. | Packet size optimization for multi hop CDMA wireless sensor networks with nearest neighbors based routing | |
| Chowdhury et al. | XCHARM: A routing protocol for multi-channel wireless mesh networks | |
| Yamazaki et al. | Spectrum sharing exploiting spectrum database for LPWA | |
| Arjona et al. | A Sub-1 GHz Wireless Sensor Network Concentrator Using Multicollectors with Load Balancing for Improved Capacity and Performance | |
| Osman et al. | D2D Underlay Cellular Network optimization Using GA Considering OFDMA-ICI | |
| Fowler et al. | Implementing an adaptive TCP fairness while exploiting 802.11 e over wireless mesh networks | |
| Hui et al. | Vecads: Vehicular context-aware downstream scheduling for drive-thru internet |
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 |