Power management

• US 7,751,357 B2
• Filed: 02/06/2007
• Issued: 07/06/2010
• Est. Priority Date: 02/06/2006
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Olympus Corporation
• Inventors: Heidari-Bateni, Ghoabad, Muqattash, Alaa
• Primary Examiner(s): Chang; Kent
• Assistant Examiner(s): Elhag; Magdi
• Application Number:
  US11/671,955
• Publication Number:
  US 20070197186A1
• Time in Patent Office: 1,246 Days
• Field of Search: 455/574, 455/502, 455/343.4, 455/343.1, 455/343.2, 455/343.3, 455/69, 455/41.2, 370/311, 370/124, 370/312, 370/432, 370/350, 370/503, 370510-514, 370/321, 370/324, 370/336, 370/337, 370/338
• US Class Current: 370/311
• CPC Class Codes: H04W 48/16 Discovering, processing access restriction or access information
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 52/0229 where the received signal is a wanted signal
• CPC Class Codes: H04W 56/00 Synchronisation arrangements
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

According to an embodiment of the invention the timing of one or more local communication windows can be defined using equations such that one or more local communication windows for two or more devices overlap. For example the periods between two consecutive local communication windows can be defined using a periodic equation such as: LAP Cycle Period=Δ*2ⁿ. In this equation n=0, 1, 2, . . . , N, where N and Δ can be fixed. For example, N and Δ can be numbers that are predetermined for a given network, a given set of network devices, etc. In one embodiment every device can become active every Δ*2ⁿ superframes. The frequency (n) can be determined based on, for example, incoming or outgoing message traffic, power consumption needs, etc.

Claims

1. A method for a network device to perform network communications on an autonomous peer network, the network device having a neighborhood of neighbor devices, the method comprising:

the network device broadcasting a first schedule for its own periodic local communication windows to the neighborhood;

the network device receiving schedules for neighbor devices'"'"' periodic local communication windows from neighbor devices of the neighborhood;

the network device examining the received schedules for neighbor devices'"'"' periodic local communication windows and the first schedule of its own periodic local communication windows and determining a schedule for global communication windows corresponding to a schedule of local communication windows having a lowest frequency of occurrence of the examined schedules; and

during a scheduled global communication window, the network device broadcasting a second schedule of periodic local communication windows to the neighborhood.

2. The method of claim 1, further comprising:

the network device waking from a hibernation state at a predetermined time for a scheduled local communication window;

the network device receiving a transmission from another device in the set of neighbor network devices during the scheduled local communication window; and

the network device returning to the hibernation state after the scheduled local communication window.

3. The method of claim 2, wherein the network device'"'"'s own periodic local communication windows and the global communication windows have frequencies defined by equations.

4. The method of claim 3, wherein the equation defining frequency of the global communication windows is Δ

*2^m, where Δ

is a first integer equal to a minimum period between global communication windows and m is a second integer.

5. The method of claim 3, wherein the equation defining frequency of the network device'"'"'s own local communication windows is Δ

*2ⁿ, where Δ

is a first integer equal to a minimum period between local communication windows and n is a second integer.

6. The method of claim 5, wherein n is determined, at least in part, based on message traffic.

7. The method of claim 5, wherein n is determined, at least in part, based on power consumption needs.

8. The method of claim 5, wherein n is determined, at least in part, based on a devices available battery life.

9. The method of claim 3, wherein the equation defining the frequency of the global communication windows is Δ

*2^m and the equation defining the local communication windows is Δ

*2ⁿ, where Δ

is a first integer equal to a minimum period between global communication windows to a minimum period between local communication windows, m is a second integer and n is a third integer, and where n is less than m.

10. The method of claim 9, wherein n is equal to the largest value of n for the neighborhood.

11. The method of claim 2 further comprising selecting an Active Cycle Start Time that is advertised for a particular beaconing group.

12. The method of claim 11, further comprising a device selecting an Active Cycle Start Time if no beacon is received.

13. A network device having a neighborhood of neighbor devices comprising a computer readable medium having computer executable program code embodied thereon, the computer executable program code configured to cause the network device to perform a method for network communications on an autonomous peer network, the method comprising:

the network device broadcasting a first schedule for its own periodic local communication windows to the neighborhood;

the network device receiving schedules for neighbor devices'"'"' periodic local communication windows from neighbor devices of the neighborhood;

the network device examining the received schedules for neighbor devices'"'"' periodic local communication windows and the first schedule of its own periodic local communication windows and determining a schedule for global communication windows corresponding to a schedule of local communication windows having a lowest frequency of occurrence of the examined schedules; and

during a scheduled global communication window, the network device broadcasting a second schedule of periodic local communication windows to the neighborhood.

14. The device of claim 13, wherein the computer executable program code is further configured to perform the steps of:

the network device waking from a hibernation state at a predetermined time for a scheduled local communication window;

the network device receiving a transmission from another device in the set of neighbor network devices during the scheduled local communication window; and

the network device returning to the hibernation state after the scheduled local communication window.

15. The device of claim 14, wherein the network device'"'"'s own periodic local communication windows and the global communication windows have frequencies defined by equations.

16. The network device of claim 15, wherein the equation defining the frequency of the global communication windows is Δ

*2^m, where Δ

is a first integer equal to a minimum period between global communication windows m is a second integer.

17. The network device of claim 15, wherein the equation defining the frequency of the local communication windows is Δ

*2ⁿ, where Δ

is a first integer equal to a minimum period between local communication windows and n is a second integer.

18. The network device of claim 17, wherein n is determined, at least in part, based on message traffic.

19. The network device of claim 17, wherein n is determined, at least in part, based on power consumption needs.

20. The network device of claim 17, wherein n is determined, at least in part, based on a devices available battery life.

21. The network device of claim 15, wherein the equation defining the frequency of the global communication windows is Δ

*2^m and the equation defining the frequencies of the local communication windows is Δ

*2^n, where Δ

is a first integer equal to a minimum period between global communication windows to a minimum period between local communication windows, m is a second integer and n is a third integer, and where n is less than m.

22. The network device of claim 21, wherein n is equal to the largest value of n for the neighborhood.

23. The network device of claim 13, wherein the computer executable program code is further configured to cause the network device to perform the step of selecting an Active Cycle Start Time that is advertised for a particular beaconing group.

24. The network device of claim 23, wherein the computer executable program code is further configured to cause the network device to perform the step of selecting an Active Cycle Start Time if no beacon is received.