# US 2010/0142460 A1 · Neighbor discovery over multiple channels for wireless networks with directional antennas

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0142460 A1
- Document ID: US20100142460A1
- Status: Published application
- Kind: A1
- Application number: 12/522,954
- Filed: 2008-01-16
- Published: 2010-06-10
- Earliest claimed: 2007-01-16
- Assignees: Koninklijke Philips Electronics N.V.
- Inventors: Hong Zhai; Chun-Ting Chou; Richard Chen
- Web page: https://patentgrep.com/patent/US20100142460A1

## CPC

- H04W 84/20: Leader-follower arrangements
- H04W 16/28: using beam steering
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A communication system includes first and second devices, where a processor of at least one of the first device and the second device is configured to establish a superframe having a superframe duration (Ts) and transmit a beacon by the first device during each of the superframe duration (Ts); scan by the second device all sectors (Nbeam) by scanning each sector for a superframe duration (Ts) and repeating a jump sequence. The jump sequence has a sequence duration (Ttotal) which is equal to a sum of a control duration (Tc) of a control channel and durations of data channels (KTd). The processor is further configured to find the first device by the second device during a find time (Tf), where the control duration (Tc) is greater than the durations of data channels (KTd).

## Claims

### Claim 1

A method for communication between a first device having a first directional antenna and a second device having a second directional antenna, the method comprising the acts of:
establishing a superframe having a superframe duration (Ts) and transmitting a beacon by the first device during each of the superframe duration (Ts);
powering on the second device;
scanning by the second device for two scan periods of all sectors (2NbeamTs) in each scan period, the second device scanning all the sectors (Nbeam) by scanning each sector for a superframe duration (Ts);
repeating a jump sequence, the jump sequence having a sequence duration (Ttotal) which is equal to a sum of a control duration (Tc) of a control channel and durations of data channels (KTd);
establishing a new superframe if no existing beacons are detected on the control channel, or joining an existing superframe on the control channel during the control duration (Tc) if existing beacons are detected on the control channel;
scanning by the second device during a duration of a data channel (Td);
finding the first device by the second device during a find time (Tf);
selecting a common channel to start communication with the first device over the common channel and stopping the jump sequence.

### Claim 2 (depends on 1)

The method of claim 1, wherein the control duration (Tc) is greater than the durations of data channels (KTd).

### Claim 3 (depends on 1)

The method of claim 1 wherein, when the first device is repeating the jump sequence, the find time (Tf) is less than or equal to sequence duration (Ttotal) multiplied by time for scanning all the sectors (NbeamTs) divided by the duration of the data channel (Td).

### Claim 4 (depends on 1)

The method of claim 1 wherein, when the first device is communicating with other devices after stopping the jump sequence, the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 5 (depends on 1)

The method of claim 1 wherein, when the first device is communicating with other devices after stopping the jump sequence, the duration of the data channel (Td) satisfies the following relationship:
T
d
≤
T
total
×
T
s
T
f
×
N
beam
where Ttotal=Tc+KTd,
K=number of the data channels,
Tc is a duration of the control channel,
Tf is a time needed for the second device to find the first device, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 6 (depends on 1)

The method of claim 1 wherein, when the first device is repeating the jump sequence or when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, the finding act finds the first device on the control channel by the second device.

### Claim 7 (depends on 1)

The method of claim 1 wherein, when the first device is communicating with other devices after stopping the jump sequence, the finding act finds the first device on the control channel by the second device.

### Claim 8 (depends on 1)

The method of claim 1 wherein, when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, then the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
c
-
KT
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 9

A communication system comprising a first device and a second device, wherein a processor of at least one of the first device and the second device is configured to:
establish a superframe having a superframe duration (Ts) and transmit a beacon by the first device during each of the superframe duration (Ts);
scan by the second device for two scan periods of all sectors (2NbeamTs) in each scan period, the second device scanning all sectors (Nbeam) by scanning each sector for a superframe duration (Ts);
repeat a jump sequence, the jump sequence having a sequence duration (Ttotal) which is equal to a sum of a control duration (Tc) of a control channel and durations of data channels (KTd);
establish a new superframe if no existing beacons are detected on the control channel, or joining an existing superframe on the control channel during the control duration (Tc) if existing beacons are detected on the control channel;
scan by the second device during a duration of a data channel (Td);
find the first device by the second device during a find time (Tf); and
select a common channel to start communication with the first device over the common channel and stopping the jump sequence.

### Claim 10 (depends on 9)

The communication system of claim 9, wherein the control duration (Tc) is greater than the durations of data channels (KTd).

### Claim 11 (depends on 9)

The communication system of claim 9, wherein, when the first device is repeating the jump sequence, the find time (Tf) is less than or equal to sequence duration (Ttotal) multiplied by time for scanning all the sectors (NbeamTs) divided by a duration of a data channel (Td).

### Claim 12 (depends on 9)

The communication system of claim 9, wherein, when the first device is communicating with other devices after stopping the jump sequence, the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 13 (depends on 9)

The communication system of claim 9, wherein, when the first device is communicating with other devices after stopping the jump sequence, the duration of a data channel (Td) satisfies the following relationship:
T
d
≤
T
total
×
T
s
T
f
×
N
beam
where Ttotal=Tc+KTd,
K=number of the data channels,
Tc is a duration of the control channel,
Tf is a time needed for the second device to find the first device, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 14 (depends on 9)

The communication system of claim 9 wherein, when the first device is repeating the jump sequence or when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, the processor is configured to find the first device on the control channel by the second device.

### Claim 15 (depends on 9)

The communication system of claim 9 wherein, when the first device is communicating with other devices after stopping the jump sequence, the processor is configured to find the first device on the control channel by the second device.

### Claim 16 (depends on 9)

The communication system of claim 9 wherein, when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, then the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
c
-
KT
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 17

A computer program product stored on a computer readable medium, the computer program when executed by a processor is configured to:
establish a superframe having a superframe duration (Ts) and transmit a beacon by the first device during each of the superframe duration (Ts);
scan by the second device for two scan periods of all sectors (2NbeamTs) in each scan period, the second device scanning all sectors (Nbeam) by scanning each sector for a superframe duration (Ts);
repeat a jump sequence, the jump sequence having a sequence duration (Ttotal) which is equal to a sum of a control duration (Tc) of a control channel and durations of data channels (KTd);
establish a new superframe if no existing beacons are detected on the control channel, or joining an existing superframe on the control channel during the control duration (Tc) if existing beacons are detected on the control channel;
scan by the second device during a duration of a data channel (Td);
find the first device by the second device during a find time (Tf) which is less than or equal two scan periods of all the sectors (2NbeamTs); and
selecting a common channel to start communication with the first device over the common channel and stopping the jump sequence.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the control duration (Tc) is greater than the durations of data channels (KTd).

### Claim 19 (depends on 17)

The computer program product of claim 17 wherein, when the first device is repeating the jump sequence, the find time (Tf) is less than or equal to sequence duration (Ttotal) multiplied by time for scanning all the sectors (NbeamTs) divided by a duration of a data channel (Td).

### Claim 20 (depends on 17)

The computer program product of claim 17 wherein, when the first device is communicating with other devices after stopping the jump sequence, the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 21 (depends on 17)

The computer program product of claim 17 wherein, when the first device is communicating with other devices after stopping the jump sequence, the duration of a data channel (Td) satisfies the following relationship:
T
d
≤
T
total
×
T
s
T
f
×
N
beam
where Ttotal=Tc+KTd,
K=number of the data channels,
Tc is a duration of the control channel,
Tf is a time needed for the second device to find the first device, and
Nbeam is a total number of sectors scanned by the second device.

### Claim 22 (depends on 17)

The computer program product of claim 17 wherein, when the first device is repeating the jump sequence or when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, the processor is configured to find the first device on the control channel by the second device.

### Claim 23 (depends on 17)

The computer program product of claim 17 wherein, when the first device is communicating with other devices after stopping the jump sequence, the processor is configured to find the first device on the control channel by the second device.

### Claim 24 (depends on 17)

The computer program product of claim 17 wherein, when the jump sequence for the second device has a different start time than a start time of the jump sequence for the first device, then the find time (Tf) satisfies the following relationship:
T
f
≤
T
total
×
T
s
T
c
-
KT
d
×
N
beam
where Ttotal=Tc+KTd,
K is a number of the data channels,
Tc is a duration of the control channel,
Ts is the superframe duration,
Td is a duration of the data channel, and
Nbeam is a total number of sectors scanned by the second device.
