Adaptive connectionless scheduling protocol

• US 20060248197A1
• Filed: 04/27/2005
• Published: 11/02/2006
• Est. Priority Date: 04/27/2005
• Status: Abandoned Application

• Current Assignee: General Electric Company
• Original Assignee: General Electric Company
• Inventors: Van Stralan, Nick Andrew, Hershey, John Erik, Hartman, Michael James, Evans, Scott Charles, Tomlinson, Harold Woodruff Jr.
• Application Number:
  US11/116,915
• Publication Number:
  US 20060248197A1
• Time in Patent Office: Days
• US Class Current: 709/227
• CPC Class Codes: H04L 47/28 in relation to timing considerations
• CPC Class Codes: H04W 28/02 Traffic management, e.g. flow control or congestion control
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 72/535 based on resource usage policies
• CPC Class Codes: H04W 76/28 Discontinuous transmission [DTX]; Discontinuous reception [DRX]
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

A system for transmitting messages among a plurality of nodes is provided. The system includes a media access scheduler for pseudorandomly scheduling discrete message start times for each node of the plurality of nodes to provide access to a shared medium. A method of minimizing power in a distributed network and a method of operating the distributed network is also provided.

Claims

1. A system for transmitting messages among a plurality of nodes, comprising:

a media access scheduler for pseudorandomly scheduling discrete message start times for each node of the plurality of nodes to provide access to a shared medium.

2. The system as recited in claim 1, wherein the plurality of nodes comprises a plurality of wireless sensor nodes.

3. The system as recited in claim 1, wherein the media access scheduler is configured to schedule time intervals based on a parameter of each node of the plurality of nodes.

4. The system as recited in claim 3, wherein the parameter comprises a location identifier for each node of the plurality of nodes and a schedule mapping is performed based upon the location of each node.

5. The system as recited in claim 4, wherein each node of the plurality of nodes is operable to retrieve the geographical location of at least one node of the plurality of nodes.

6. The system as recited in claim 3, wherein the plurality of nodes is operable to synchronize their start times based on the parameter and the message transmission sequence of at least one node of the plurality of nodes.

7. The system as recited in claim 3, wherein the parameter comprises a unique identifier for each node of the plurality of nodes and a schedule mapping is performed based upon the unique identifier that is computed based on a hashing function via a block cipher function.

8. The system as recited in claim 1, wherein the message start times for at least one node of the plurality of nodes is configured to schedule messages received by the at least one node or schedule messages transmitted by the at least one node.

9. The system as recited in claim 1, wherein each node of the plurality of nodes switches scheduling of the message start times between a transmission mode and a reception mode.

10. The system as recited in claim 1, wherein at least one node of the plurality of nodes comprises a scheduled receiver operable to provide a scheduled receiver start time.

11. The system as recited in claim 10, wherein the plurality of nodes is operable to overlap messages with the scheduled receiver start times.

12. The system as recited in claim 10, wherein the scheduled receiver start times are separated by a time interval sufficient to allow at least one node of the plurality of nodes to enter a power saving mode.

13. The system as recited in claim 1, wherein the message start times for each node of the of the plurality of nodes are shared among the plurality of nodes based on a latency requirement of a distributed network of the plurality of nodes or a throughput of the distributed network or a distance between the plurality of nodes in the distributed network.

14. The system as recited in claim 1, wherein the message start times for each node of the plurality of nodes are shared among the plurality of nodes based on accuracy of a clock signal.

15. The system as recited in claim 1, wherein at least one node of the plurality of nodes comprises a scheduled transmitter operable to provide an interleaved scheduled transmitter start time.

16. The system as recited in claim 1, wherein each node of the plurality of nodes is operable to remain in a receiver mode until an acknowledgement from a destination node is received.

17. The system as recited in claim 1, wherein each node of the plurality of nodes is operable to remain in a receiver mode after a transmission by the respective node to await an acknowledgement based on a minimum expected message size of the acknowledgment.

18. The system as recited in claim 1, each node of the plurality of nodes is operable to remain in a receiver mode after a scheduled message start time based on an amount of time for the respective node to reliably detect presence of at least one of the plurality of messages.

19. The system as recited in claim 18, wherein each node of the plurality of nodes remains in the receiver mode for a duration that is increased if a message is detected.

20. The system as recited in claim 1, wherein the plurality of nodes utilizes collision avoidance for increasing a probability of successful packet delivery.

21. The system as recited in claim 1, wherein the plurality of nodes utilizes a multiple access scheme for increasing the probability of successful packet delivery.

22. The system as recited in claim 21, wherein the multiple access scheme comprises code division multiple access scheme.

23. The system as recited in claim 1, wherein the message start times are configured to achieve bounded latency.

24. The system as recited in claim 23, wherein the bounded latency is achieved by forwarding the plurality of messages in one or more desired directions.

25. The system as recited in claim 1, wherein the message start times are based on a square grid, a rectangular grid, a hexagonal grid, or any combinations thereof.

26. The system as recited in claim 1, wherein the message start times are selected such that the plurality of nodes within an area is assigned unique message start times from a set of all possible message start times comprising a frame.

27. The system as recited in claim 26, wherein a subset of the message start times is utilized from the assigned unique message start times assigned to a given node or set of nodes.

28. A device for scheduling messages exchanged among a plurality of nodes, comprising:

a media access scheduler for pseudorandomly scheduling discrete message start times for each node of the plurality of nodes to provide access to a shared medium.

29. A method for scheduling messages in a distributed network, comprising:

scheduling discrete message start times pseudorandomly to provide access to a shared medium for each node of a plurality of nodes based on a parameter.

30. The method as recited in claim 29, comprising receiving a plurality of messages wirelessly.

31. The method as recited in claim 29, comprising computing message start times for a schedule bin via a primitive root.

32. The method as recited in claim 29, wherein scheduling discrete message start times pseudorandomly comprises either providing a scheduled receiver start time for each node of the plurality of nodes or sharing the message start times for each node of the plurality of nodes based on a latency requirement of the distributed network.

33. The method as recited in claim 32, wherein scheduling discrete message start times pseudorandomly comprises either overlapping messages with the scheduled receiver start times or allowing at least one node of the plurality of nodes to enter a power saving mode.

34. The method as recited in claim 33, wherein scheduling discrete message start times pseudorandomly comprises varying the message start time interval based on a throughput of the distributed network or sharing the message start times for each node of the plurality of nodes based on a distance between the plurality of nodes in the distributed network.

35. The method as recited in claim 29, wherein scheduling discrete message start times pseudorandomly comprises sharing the message start times for each node of the plurality of nodes based on clock signal of the plurality of nodes in the distributed network.

36. The method as recited in claim 29, comprising providing an interleaved scheduled transmitter start time.

37. The method as recited in claim 29, comprising maintaining a high power mode for the plurality of sensor nodes during a message interval until a confirmation from a destination node is received.

38. The method as recited in claim 29, wherein scheduling message start times pseudorandomly for the plurality of sensor nodes based on the parameter comprises scheduling message start times based on a geographical location or a unique identifier of each node of the plurality of sensor nodes.

39. The method as recited in claim 38, comprising retrieving the geographical location of at least one sensor node of the plurality of sensor nodes by each node of the plurality of sensor nodes.

40. The method as recited in claim 38, comprising synchronizing the receiver start times of the plurality of sensor nodes based on the geographical location of at least one sensor node of the plurality of sensor nodes.

41. A method of operating a distributed network, comprising:

acquiring a plurality of messages via a plurality of nodes; and

controlling scheduling of message start times pseudorandomly or controlling scheduling of message slots pseudorandomly for the plurality of nodes based on a parameter of each node of the plurality of nodes via a processor, wherein the processor is coupled to the plurality of nodes.

42. A system for transmitting messages among a plurality of nodes, comprising:

a media access scheduler for pseudorandomly scheduling discrete message start times for each node of the plurality of nodes to provide access to a shared medium, wherein the message start times are selected such that the plurality of nodes within an area is assigned unique message slots.

43. The system as recited in claim 42, wherein a subset of message start times is utilized from the assigned unique message start times.

44. The system as recited in claim 43, wherein the subset of message slots in which a node awakens to receive possible messages is based on a schedule mapping determined adaptively based on idle message start times over a previous interval.

45. The system as recited in claim 44, wherein the subset of message slots in which a node awakens to receive or transmit possible messages is based on a schedule mapping determined adaptively based on the schedule mapping determined adaptively based on a field carried with a first packet in a stream of data.

46. A computer readable medium for scheduling messages exchanged among a plurality of nodes, comprising:

code stored on the computer readable medium at least partially defining a media access scheduler for pseudorandomly scheduling discrete message start times for each node of the plurality of nodes to provide access to a shared medium.