Method of sending data

Information

  • Patent Application
  • 20070230425
  • Publication Number
    20070230425
  • Date Filed
    February 06, 2007
    17 years ago
  • Date Published
    October 04, 2007
    17 years ago
Abstract
A method of sending data from a source node in a wireless communications network is provided. In an example, the method includes selecting one of a plurality of available routing paths, from the source node to a destination node, on which to send data based on routing criteria specified by the source node.
Description

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will become more fully understood from the detailed description given herein below and the accompanying drawings which are given by way of illustration only, wherein like reference numerals designate corresponding parts in the various drawings, and wherein:



FIG. 1 illustrates a conventional Ad-hoc On-demand Distance Vector (AODV) network.



FIG. 2 illustrates a conventional message routing process within the AODV network of FIG. 1.



FIG. 3 illustrates a routing path selection process according to an example embodiment of the present invention.


Claims
  • 1. A method of sending data from a source node in a wireless communications network, comprising: first selecting one of a plurality of available routing paths, from the source node to a destination node, on which to send data based on routing criteria specified by the source node.
  • 2. The method of claim 1, wherein the routing criteria is given by a price function.
  • 3. The method of claim 2, wherein the price function includes at least one of (i) a current primary routing path status of the plurality of available routing paths, (ii) a number of hops associated with each of the plurality of available routing paths, (iii) a user-defined priority value associated with each of the plurality of available routing paths, (iv) a known delay from the source node to the destination node along each of the plurality of available routing paths and (v) a known bandwidth from the source node to the destination node along each of the plurality of available routing paths.
  • 4. The method of claim 3, wherein the routing criteria includes a plurality of parameters prioritized in a hierarchical order and including at least two of (i), (ii), (iii), (iv) and (v).
  • 5. The method of claim 4, wherein (iii) is ranked higher in the hierarchical order than (i) or (ii).
  • 6. The method of claim 4, wherein (ii) is ranked higher in the hierarchical order than (i).
  • 7. The method of claim 2, further comprising: second selecting another of the plurality of available routing paths; andsecond sending data from the source node to the destination node along the second selected routing path.
  • 8. The method of claim 7, wherein the second selecting step is performed periodically.
  • 9. The method of claim 8, wherein the second selecting step is performed in response to performance degradation on the first selected routing path.
  • 10. The method of claim 1, wherein the routing criteria includes a plurality of parameters prioritized in a hierarchical order.
  • 11. The method of claim 1, further comprising: first sending data from the source node to the destination node along the first selected routing path.
  • 12. The method of claim 1, further comprising: determining a number of the available routing paths; andperforming the first selecting step if the number is greater than 1.
  • 13. The method of claim 1, wherein the wireless communications network is a Ad-hoc On-demand Distance Vector (AODV) network.
Priority Claims (1)
Number Date Country Kind
200610071408.3 Mar 2006 CN national