IP Library Granted Patent US 12,739,070
Granted Patent B2
US 12,739,070 · App. 18/475,252 · Granted Sep 15, 2026

Methods and apparatus to perform short-range wireless communication

Inventors: Anshu Agarwal (Bangalore, IN); Kaushal Billore (Bangalore, IN); Suranjan Chakraborty (Bangalore, IN); Amit Singh Chandel (Bangalore, IN); Prasanna Desai (Elfin Forest, CA); Chandrashekar Gowda (Bangalore, IN); Vishal Dhull (Bengaluru, IN); Mallari Hanchate (Bangalore, IN); Mythili Hegde (Santa Clara, IN); Vishnu K (Bangalore, IN); Srinivas Krovvidi (Thrissur, IN); Naveen Manohar (Bangalore, IN); Mayur Maheshwari (Bangalore, IN); Yogesh Malkhede (Bangalore, IN); Barath C. Petit (Bangalore, IN); Balvinder Pal Singh (Bhilai, IN); Sudhakaran Subramanian (Bangalore, IN); Rahul Tiwari (Bangalore, IN); Padmavathi Tiwari (Bangalore, IN); Divya Lakshmi Saranya Vemuri (Bangalore, IN); Ingolf Karls (Feldkirchen, DE); Ehud Reshef (Qiryat Tivon, IL)
Assignee: Intel Corporation
H04L5/0012H04W72/1263H04W72/54
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 12,739,070
App. No.
18/475,252
Filed
Sep 27, 2023
Granted
Sep 15, 2026
Kind
B2
Examiner
LY, ANH VU H
Art Unit
2472
USPC
370/329
Abstract

An apparatus for a communication device, the apparatus may include a processor configured to: obtain channel metrics for a plurality of radio communication channels, each obtained channel metric is associated with a respective radio communication channel of the plurality of radio communication channels, generate a plurality of channel hopping sequences, each channel hopping sequence is representative of an allocation of the plurality of radio communication channels for a plurality of time slots, wherein a number of time slots allocated for each radio communication channel within each channel hopping sequence is based on the respective obtained channel metric, and select one of the plurality of channel hopping sequences based on a predefined criterion to communicate with a further communication device.

Claims (47)

1 . An apparatus for a communication device, the apparatus comprising:

a processor configured to:

obtain channel metrics for a plurality of radio communication channels, each obtained channel metric is associated with a respective radio communication channel of the plurality of radio communication channels;

generate a plurality of channel hopping sequences, each channel hopping sequence is representative of an allocation of the plurality of radio communication channels for a plurality of time slots, wherein a number of time slots allocated for each radio communication channel within each channel hopping sequence is based on the respective obtained channel metric;

select one of the plurality of channel hopping sequences based on a predefined criterion to communicate with a further communication device; and

wherein the processor is configured to generate the plurality of hopping sequences using a pinwheel scheduling algorithm configured to schedule the plurality of radio communication channels into the plurality of time slots.

2 . The apparatus of claim 1 ,

wherein the processor is further configured to, for an N number of the plurality of radio communication channels, generate a plurality of different repetition interval sets that are schedulable, each repetition interval set comprises N number of integers ranked in a predefined order, each integer is representative of a number of occurrences within a plurality of occurrences;

wherein the processor is further configured to generate a ranked channel set comprising information representative of the plurality of radio communication channels that are ranked in the predefined order, wherein the plurality of radio communication channels are ranked based on their respective obtained channel metrics.

3 . The apparatus of claim 2 ,

wherein the processor is further configured to generate the plurality of channel hopping sequences according to a greedy algorithm applied based on each of the plurality of different repetition interval sets and the ranked channel set.

4 . The apparatus of claim 3 ,

wherein each generated channel hopping sequence is representative of the plurality of time slots allocated for the plurality of radio communication channels, such that each radio communication channel is allocated to the number of time slots that is based on a respective integer of a respective repetition interval set.

5 . The apparatus of claim 3 ,

wherein the processor is further configured to obtain a candidate channel hopping sequence according to the greedy algorithm applied based on one of the plurality of different interval sets and the ranked channel set;

wherein the processor is further configured to remap at least one of the time slots from a first radio communication channel of the plurality of radio communication channels to a second radio communication channel of the plurality of radio communication channels of the candidate channel hopping sequence based on the obtained channel metric associated with the first radio communication channel and the second communication channel.

6 . The apparatus of claim 3 ,

wherein the processor is further configured to determine to remap the at least one of the time slots based on the obtained channel metric associated with the respective radio communication channel allocated for the at least one of the time slot and a predetermined channel metric threshold.

7 . The apparatus of claim 1 ,

wherein the selected channel hopping sequence is configured to cause the communication device to use respective radio communication channels at respective time slots to communicate with the further communication device.

8 . The apparatus of claim 1 ,

wherein the predefined criterion is based on calculated entropies for each generated channel hopping sequence.

9 . The apparatus of claim 1 ,

wherein the predefined criterion is based on estimated throughputs for each generated channel hopping sequence.

10 . The apparatus of claim 9 ,

wherein the predefined criterion is based on a weighed combination of a first metric associated with a calculated entropy and a second metric associated with an estimated throughput for each generated channel hopping sequence.

11 . The apparatus of claim 1 ,

wherein each obtained channel metric associated with the respective radio communication channel is based on at least one channel measurements comprising any of a signal to noise ratio, a received signal strength indicator (RSSI), a packet error rate (PER), a bit error rate (BER), a presence of radio communication channels associated with other radio access technologies, an estimated network traffic classification, a quality of service (QoS) metric, or a measurement reports received from other communication devices.

12 . The apparatus of claim 1 ,

wherein the plurality of radio communication channels are communication channels according to a protocol of the Bluetooth Special Interest Group.

13 . A non-transitory computer-readable medium comprising one or more instructions which, if executed by a processor, cause the processor to:

obtain channel metrics for a plurality of radio communication channels, each obtained channel metric is associated with a respective radio communication channel of the plurality of radio communication channels;

generate a plurality of channel hopping sequences, each channel hopping sequence is representative of an allocation of the plurality of radio communication channels for a plurality of time slots, wherein a number of time slots allocated for each radio communication channel within each channel hopping sequence is based on the respective obtained channel metric;

select one of the plurality of channel hopping sequences based on a predefined criterion to communicate with a further communication device; and

wherein the instructions causing the processor to generate the plurality of hopping sequences using a pinwheel scheduling algorithm configured to schedule the plurality of radio communication channels into the plurality of time slots.

14 . The non-transitory computer-readable medium of claim 13 ,

wherein the selected channel hopping sequence is configured to cause a communication device including the processor to use respective radio communication channels at respective time slots to communicate with the further communication device.

15 . A method, comprising:

obtaining channel metrics for a plurality of radio communication channels, each obtained channel metric being associated with a respective radio communication channel of the plurality of radio communication channels;

generating a plurality of channel hopping sequences, each channel hopping sequence being representative of an allocation of the plurality of radio communication channels for a plurality of time slots, wherein a number of time slots allocated for each radio communication channel within each channel hopping sequence is based on the respective obtained channel metric; and

selecting one of the plurality of channel hopping sequences based on a predefined criterion to communicate with a further communication device; and

further comprising generating the plurality of hopping sequences using a pinwheel scheduling algorithm configured to schedule the plurality of radio communication channels into the plurality of time slots.

16 . The method of claim 15 , further comprising:

causing, according to the selected channel hopping sequence, a communication device to use respective radio communication channels at respective time slots to communicate with the further communication device.

17 . The method of claim 15 , wherein the predefined criterion is based on calculated entropies for each generated channel hopping sequence.

18 . The method of claim 15 , wherein the predefined criterion is based on estimated throughputs for each generated channel hopping sequence.

19 . The method of claim 15 , wherein the predefined criterion is based on a weighed combination of a first metric associated with a calculated entropy and a second metric associated with an estimated throughput for each generated channel hopping sequence.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2026
From: INTEL CORPORATION
To: INTEL PRODUCTS IP LLC
Reel/Frame 075992/0281 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2023
From: AGARWAL, ANSHU; BILLORE, KAUSHAL; CHAKRABORTY, SURANJAN; CHANDEL, AMIT SINGH; DESAI, PRASANNA; GOWDA, CHANDRASHEKAR; DHULL, VISHAL; HANCHATE, MALLARI; HEGDE, MYTHILI; K, VISHNU; KROVVIDI, SRINIVAS; MANOHAR, NAVEEN; MAHESHWARI, MAYUR; MALKHEDE, YOGESH; PETIT, BARATH C.; SINGH, BALVINDER PAL; SUBRAMANIAN, SUDHAKARAN; TIWARI, RAHUL; TIWARI, PADMAVATHI; VEMURI, DIVYA LAKSHMI SARANYA; KARLS, INGOLF; RESHEF, EHUD
To: INTEL CORPORATION
Reel/Frame 065115/0757 →
Priority Claims (1)
EP 22205839 · Nov 7, 2022 · regional
Continuity (1)
Related Publication 20240154741A1 · May 9, 2024
References Cited (9)
US 6240125B1 · Andersson et al. · 2001 [cited by applicant]
US 6501785B1 · Chang · 2002 [cited by examiner]
US 7957451B1 · Baugh · 2011 [cited by examiner]
US 20110255570A1 · Fujiwara · 2011 [cited by examiner]
US 20170126275A1 · Kwon · 2017 [cited by examiner]
US 20190222256A1 · Nammi · 2019 [cited by applicant]
US 20230353191A1 · Lee · 2023 [cited by examiner]
CN 113037327A · 2021 [cited by applicant]
European Search Report issued for the corresponding EP patent application No. EP 22205839, dated Mar. 28, 2023, 7 pages (For informational purposes only). [cited by applicant]