Scheduled service periods in wireless mesh networks
First Claim
Patent Images
1. A computer-implemented method in which a computer system functions as a mesh point (MP) and said MP performs operations comprising:
- entering a light sleep mode;
determining peer MPs of said MP;
determining beacons for said peer MPs of said MP;
wherein said light sleep mode comprises a mode wherein said MP is in an awake state for the beacons for all peers, whereas an MP in sleep mode is not required to wake up for beacons for all peers and wherein an awake period for a MP starts before a first beacon of said MP during said awake period;
entering, by said MP, an Awake state for said beacons of said peer MPs, and wherein an amount of time an MP must be awake is reduced since said awake window for each MP starts before said beacons of said peer MPs such that traffic can be received by all MPs in a single awake beacon; and
wherein said awake state has a duration defined by an awake window element and wherein said awake window element include a Max PSP length field containing a value of a maximum length of a peer service period.
19 Assignments
0 Petitions
Accused Products
Abstract
A method, apparatus and computer program product in which a computer system functions as a mesh point (MP) and provides scheduled service periods in wireless mesh networks is presented. The MP enters a light sleep mode. The MP determines peers of itself and determines beacons for the peers of itself. The MP then enters an Awake state for the beacons of its peers.
55 Citations
15 Claims
-
1. A computer-implemented method in which a computer system functions as a mesh point (MP) and said MP performs operations comprising:
-
entering a light sleep mode; determining peer MPs of said MP; determining beacons for said peer MPs of said MP; wherein said light sleep mode comprises a mode wherein said MP is in an awake state for the beacons for all peers, whereas an MP in sleep mode is not required to wake up for beacons for all peers and wherein an awake period for a MP starts before a first beacon of said MP during said awake period; entering, by said MP, an Awake state for said beacons of said peer MPs, and wherein an amount of time an MP must be awake is reduced since said awake window for each MP starts before said beacons of said peer MPs such that traffic can be received by all MPs in a single awake beacon; and wherein said awake state has a duration defined by an awake window element and wherein said awake window element include a Max PSP length field containing a value of a maximum length of a peer service period. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A non-transitory computer readable storage medium having computer readable code thereon for scheduling service periods in wireless mesh networks, the medium including instructions in which a mesh point (MP) performs operations comprising:
-
entering a light sleep mode; determining peer MPs of said MP; determining beacons for said peer MPs of said MP; wherein said light sleep mode comprises a mode wherein said MP is in an awake state for the beacons for all peers, whereas an MP in sleep mode is not required to wake up for beacons for all peers and wherein an awake period for a MP starts before a first beacon of said MP during said awake period; entering, by said MP an Awake state for said beacons of said peer MPs, and wherein an amount of time an MP must be awake is reduced since an awake window for each MP starts before said beacons of said peer MPs such that traffic can be received by all MPs in a single awake beacon; wherein said awake state has a duration defined by an awake window element and wherein said awake window element include a Max PSP length field containing a value of a maximum length of a peer service period. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A scheduling service periods in wireless mesh networks (MP) comprising:
-
a memory; a processor; a communications interface; an interconnection mechanism coupling the memory, the processor and the communications interface; and wherein the memory is encoded with an application for scheduling service periods in wireless mesh network, that when performed on the processor, provides a process for processing information, the process causing the MP to perform the operations comprising; entering a light sleep mode; determining peer MPs of said MP; determining beacons for said peer MPs of said MP; wherein said light sleep mode comprises a mode wherein said MP is in an awake state for the beacons for all peers, whereas an MP in sleep mode is not required to wake up for beacons for all peers and wherein an awake period for a MP starts before a first beacon of said MP during said awake period; entering, by said MP, an Awake state for said beacons of said peer MPs, and wherein an amount of time an MP must be awake is reduced since said awake window for each MP starts before said beacons of said peer MPs such that traffic can be received by all MPs in a single awake beacon; and wherein said awake state has a duration defined by and awake window element and wherein said awake window element include a Max PSP length field containing a value of a maximum length of a peer service period. - View Dependent Claims (12, 13, 14, 15)
-
Specification