IP Library › Granted Patent US 8,335,511
Granted Patent B2
US 8,335,511 · App. 11/332,482 · Granted Dec 18, 2012

Ad-hoc network for routing in consideration of mobility and routing method thereof

Assignees: Samsung Electronics Co., Ltd.; George Mason Intellectual Properties, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,335,511
App. No.
11/332,482
Granted
Dec 18, 2012
Kind
B2
Abstract

An ad-hoc network and routing method that takes account of mobility are provided. The ad-hoc network includes at least one node, which calculates a probability that a neighbor node is present in a transmission range of the node, generates a message containing the calculated probability, and transmits the message to the neighbor node. The at least one node may also update the message with a lower probability of the calculated probability and a probability contained in the message, and transmit the updated message to the neighbor node. The node may also determine as a route a path along which a message is transmitted from the message containing the highest probability among probabilities contained in messages that are received.

Claims (143)

1. An ad-hoc network, comprising:

at least one node configured to:

calculate a probability that a neighbor node is present in a transmission range over a given time duration using predictive information about future mobility;

generate a first message containing the calculated probability; and

transmit the first message to the neighbor node,

wherein the probability is calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and

in response to the link stability metric for a plurality of neighbor nodes being equal, the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

2. The ad-hoc network of claim 1 , wherein the first message comprises a Route Reply (RREP) message and/or a periodically broadcast message, comprising the predicted probability.

3. The ad-hoc network of claim 1 , wherein the at least one node is further configured to:

receive a second message containing a set route; and

transfer data along the set route.

4. The ad-hoc network of claim 1 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

5. The ad-hoc network of claim 4 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

6. The ad-hoc network of claim 1 , wherein the at least one node is further configured to:

periodically transmit status information to the neighbor node; and

periodically update status information received from the neighbor node.

7. An ad-hoc network, comprising:

at least one node configured to:

receive a message comprising a first probability that a neighbor node is present in a transmission range over a given time duration;

compare the first probability from the received message with a second probability that the neighbor node is present in the transmission range;

update the message with the lesser of the first probability and the second probability; and

transmit the updated message to neighbor nodes,

wherein the first probability is calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and in response to the link stability metric for a plurality of neighbor nodes being equal: the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

8. The ad-hoc network of claim 7 , wherein the message comprises a Route Reply (RREP) message and/or a periodically broadcast message, comprising the predicted probability.

9. The ad-hoc network of claim 7 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

10. The ad-hoc network of claim 9 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

11. The ad-hoc network of claim 9 , wherein the at least one node is further configured to:

periodically transmit status information to the neighbor node; and

periodically update status information received from the neighbor node.

12. An ad-hoc network, comprising:

at least one node configured to:

receive at least one message comprising a probability that a neighbor node is present in a transmission range over a given time duration,

select a route according to the highest probability among the probabilities contained in the at least one message,

generate a reply message containing the selected route, and

transmit the reply message,

wherein the probability is calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and

in response to the link stability metric for a plurality of neighbor nodes being equal:

the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

13. The ad-hoc network of claim 12 , wherein the at least one message comprises a Routing REQuest (RREQ) message.

14. The ad-hoc network of claim 12 , wherein the reply message comprises a Routing REPly (RREP) message.

15. The ad-hoc network of claim 12 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

16. The ad-hoc network of claim 15 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

17. The ad-hoc network of claim 12 , wherein the at least one node is further configured to:

periodically transmit status information to the neighbor node; and

periodically update status information received from the neighbor node.

18. The ad-hoc network of claim 12 , wherein the highest probability of the probabilities contained in the at least one message comprises a route stability metric for establishing the selected route.

19. The routing method of claim 18 , wherein a path having a smallest hop count is selected as the route in response to there being routes with an identical route stability metric.

20. A routing method for use in an ad-hoc network, the method comprising:

calculating a probability that a neighbor node is present in a transmission range;

generating a first message comprising the calculated probability; and

transmitting the first message to the neighbor node,

wherein the probability is calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and

in response to the link stability metric for a plurality of neighbor nodes being equal:

the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

21. The routing method of claim 20 , wherein the first message comprises a Routing Reply (RREP) message and/or a periodically broadcast message, comprising the predicted probability.

22. The routing method of claim 20 , further comprising:

receiving a second message containing a set route; and

transferring data along the set route.

23. The routing method of claim 22 , wherein the second message comprises a Routing REPly (RREP) message.

24. The routing method of claim 20 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

25. The routing method of claim 24 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

26. The routing method of claim 24 , wherein:

status information is transmitted periodically to the neighbor node; and

status information received from the neighbor node is updated periodically.

27. A routing method for an ad-hoc network, the method comprising:

receiving a message comprising a first probability that a neighbor node is present in a transmission range;

comparing the first probability from the received message with a second probability that the neighbor node is present in the transmission range;

updating the message with the lesser of the first probability and the second probability; and

transmitting the updated message to neighbor nodes,

wherein the first probability and the second probability are calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and in response to the link stability metric for a plurality of neighbor nodes being equal:

the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

28. The routing method of claim 27 , wherein the message comprises a Routing Reply (RREP) message and/or a periodically broadcast message, comprising the predicted probability.

29. The routing method of claim 27 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

30. The routing method of claim 29 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

31. The routing method of claim 29 , wherein:

status information is transmitted periodically to the neighbor node; and

status information received from the neighbor node is updated periodically.

32. A routing method for an ad-hoc network, the method comprising:

receiving at least one message comprising a probability that a neighbor node is present in a transmission range;

selecting a route according to the highest probability among the probabilities contained in the at least one message;

generating a reply message containing the selected route; and

transmitting the reply message,

wherein the probabilities are calculated using information received from a global positioning system,

wherein the probability that the neighbor node is present in the transmission range comprises a link stability metric for determining whether to maintain a link,

wherein the link stability metric is a primary metric,

wherein a hop count is a secondary metric, and

wherein, a route with a higher link stability metric is selected preferentially, and in response to the link stability metric for a plurality of neighbor nodes being equal:

the hop count of each of the plurality of neighbor nodes are compared; and

a route with a smaller hop count is selected,

wherein the link stability metric is set to a route stability metric,

the route stability metric sets a stable route by predicting the mobility of nodes placed between a source node A and a destination node D based on the calculated probability

wherein when the link stability metric is less than an effective value, a node predicts a link breakage to another node.

33. The routing method of claim 32 , wherein the at least one message comprises a Routing REQuest (RREQ) message.

34. The routing method of claim 32 , wherein the reply message comprises a Routing REPly (RREP) message.

35. The routing method of claim 32 , wherein the link stability metric is calculated using status information that is received from a global positioning system.

36. The routing method of claim 35 , wherein the status information comprises a position moving along an X-axis, a velocity moving along the X-axis, an acceleration along the X-axis, a position moving along a Y-axis, a velocity moving along the Y-axis, and an acceleration along the Y-axis.

37. The routing method of claim 35 , wherein:

status information is transmitted to the neighbor node periodically; and

status information received from the neighbor node is updated periodically.

38. The routing method of claim 32 , wherein the highest probability of the probabilities contained in the at least one message comprises a route stability metric for establishing the selected route.

39. The routing method of claim 38 , wherein a path having a smallest hop count is selected as the route in response to there being at least one identical route stability metric.

40. The ad-hoc network of claim 1 , wherein the effective value is a threshold before a neighbor node moves out of its transmission range.

41. The ad-hoc network of claim 1 , wherein when the link stability metric is greater than an effective value, the source node A predicts that a link to another node remains stable as that other node does not move out of a transmission range in a next status and maintains an established route.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 1, 2012
From: MARK, BRIAN L.
To: GEORGE MASON UNIVERSITY
Reel/Frame 029053/0481 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 1, 2012
From: GEORGE MASON UNIVERSITY
To: GEORGE MASON INTELLECTUAL PROPERTIES, INC.
Reel/Frame 029053/0538 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 13, 2009
From: SINGH, SHUBHRANSHU; ROH, YONG-SUNG; KIM, JAE-HOON; KANG, KYUNG-LIM; CHOI, YOUNG-GON; KIM, JUNG-HO; MARK, L. BRIAN
To: SAMSUNG ELECTRONICS CO., LTD.; GEORGE MASON UNIVERSITY
Reel/Frame 022394/0583 →
Priority Claims (1)
KR 10-2005-0004124 · Jan 17, 2005 · national
Continuity (1)
Related Publication 20060165025A1 · Jul 27, 2006