Method and apparatus for sharing channel occupancy time
US-2024389148-A1 · Nov 21, 2024 · US
US9288709B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9288709-B2 |
| Application number | US-201313763680-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 10, 2013 |
| Priority date | Feb 10, 2013 |
| Publication date | Mar 15, 2016 |
| Grant date | Mar 15, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method of adjusting a carrier sense threshold to avoid hidden nodes during wireless broadcast. The method includes monitoring a load of the peer-to-peer network before broadcasting a message from a node. The method also includes adjusting a carrier sense threshold (CST) based on the load of the peer-to-peer network to avoid broadcast message collisions due to one or more hidden nodes.
Opening claim text (preview).
What is claimed is: 1. A method of wireless communication in a peer-to-peer network, comprising: monitoring a load of the peer-to-peer network before broadcasting a message from a node; and adjusting a carrier sense threshold (CST) based on the load of the peer-to-peer network before broadcasting the message, to avoid broadcast message collisions due to one or more hidden nodes, wherein the adjusting comprises— lowering the CST to increase a carrier sense range if the load of the peer-to-peer network increases, and increasing the CST to decrease the carrier sense range if the load of the peer-to-peer network decreases. 2. The method of claim 1 , in which the load of the peer-to-peer network comprises an amount of broadcast activity from neighbor nodes. 3. The method of claim 2 , in which monitoring the load of the peer-to-peer network comprises counting successfully received messages from the neighbor nodes. 4. The method of claim 2 , in which monitoring the load of the peer-to-peer network comprises counting a percentage of time a channel is busy. 5. The method of claim 4 , in which the channel is determined to be busy when a noise level on the channel exceeds a current CST. 6. An apparatus for wireless communication in a peer-to-peer network, comprising: means for monitoring a load of the peer-to-peer network before broadcasting a message from a node; and means for adjusting a carrier sense threshold (CST) based on the load of the peer-to-peer network before broadcasting the message, to avoid broadcast message collisions due to one or more hidden nodes, wherein the means for adjusting comprises: means for lowering the CST to increase a carrier sense range when the load of the peer-to-peer network increases, and means for increasing the CST to decrease the carrier sense range when the load of the peer-to-peer network decreases. 7. An apparatus for wireless communication in a peer-to-peer network, comprising: a memory; and at least one processor coupled to the memory and configured to: monitor a load of the peer-to-peer network before broadcasting a message from a node; and adjust a carrier sense threshold (CST) based on the load of the peer-to-peer network before broadcasting the message, to avoid broadcast message collisions due to one or more hidden nodes, wherein the at least one processor is configured to adjust the CST by being configured to: lower the CST to increase a carrier sense range when the load of the peer-to-peer network increases, and increase the CST to decrease the carrier sense range when the load of the peer-to-peer network decreases. 8. The apparatus of claim 7 , in which the load of the peer-to-peer network comprises an amount of broadcast activity from neighbor nodes. 9. The apparatus of claim 8 , in which the at least one processor is further configured to monitor the load of the peer-to-peer network by counting successfully received messages from the neighbor nodes. 10. The apparatus of claim 8 , in which the at least one processor is further configured to monitor the load of the peer-to-peer network by counting a percentage of time a channel is busy. 11. The apparatus of claim 10 , in which the at least one processor is further configured to determine that the channel is busy when a noise level on the channel exceeds a current CST. 12. A non-transitory computer-readable medium storing computer executable code for wireless communication, comprising code for: monitoring a load of a peer-to-peer network before broadcasting a message from a node; and adjusting a carrier sense threshold (CST) based on the load of the peer-to-peer network before broadcasting the message, to avoid broadcast message collisions due to one or more hidden nodes, wherein the code for adjusting the CST comprises code for: lowering the CST to increase a carrier sense range when the load of the peer-to-peer network increases, and increasing the CST to decrease the carrier sense range when the load of the peer-to-peer network decreases.
using carrier sensing, e.g. carrier sense multiple access [CSMA] · CPC title
based on communication conditions (dynamic wireless traffic scheduling definition based on channel quality criteria H04W72/54) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.