×

Predictive routing technique in the ad hoc wireless network

  • US 7,944,899 B2
  • Filed: 03/28/2008
  • Issued: 05/17/2011
  • Est. Priority Date: 08/15/2007
  • Status: Active Grant
First Claim
Patent Images

1. A method implemented by a forwarding node in an ad hoc network, comprising:

  • collecting a first set of node information pertaining to a first neighbor node, wherein the first set of node information comprises;

    first power information comprising a first power level required to transmit information to the first neighbor node and a first energy source weight factor corresponding to a type of energy source of the first neighbor node, andfirst history information indicating previous time periods during which the first neighbor node has been available for at least one prior communication, wherein the time periods are one selected from a group consisting of a time of a day and a day of a week;

    calculating a first availability probability for the first neighbor node, using the first history information and a current time period;

    calculating a first overall availability probability for the first neighbor node using the first availability probability and the first power information;

    collecting a second set of node information pertaining to a second neighbor node, wherein the second set of node information comprises;

    second power information comprising a second power level required to transmit information to the second neighbor node and a second energy source weight factor corresponding to a type of energy source of the second neighbor node, andsecond history information indicating previous time periods during which the second neighbor node has been available for at least one prior communication, wherein the time periods are one selected from a group consisting of a time of the day and a day of the week;

    calculating a second availability probability for the second neighbor node, using the second history information and the current time period;

    calculating a second overall availability probability for the second neighbor node using the second availability probability and the second power information;

    selecting a first routing path to a destination node that includes the first neighbor node as a hop when the first overall availability probability is greater than the second overall availability probability; and

    upon selecting the first routing path, forwarding a packet to the destination node via the first routing path.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×