Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

AN EFFICIENT MECHANISM TO COMPUTE CHANNEL SEQUENCE FOR FREQUENCY HOPPING COMMUICATION NETWORKS

IP.com Disclosure Number: IPCOM000247951D
Publication Date: 2016-Oct-13
Document File: 6 page(s) / 123K

Publishing Venue

The IP.com Prior Art Database

Related People

Huimin She: AUTHOR [+4]

Abstract

Presented herein is an efficient mechanism to generate non-repeated pseudo-random channel sequences for frequency hopping networks. The inputs are: (1) a list of available channels; (2) a unique identifier (e.g., MAC address) of the node; and/or (3) slot number or current time. The output is a channel number for an arbitrary time slot or the entire channel hopping sequence. The method has very low computation complexity and requires very little memory. It efficiently utilizes the full frequency band and complies with regulatory rules.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 39% of the total text.

Page 01 of 6

AN EFFICIENT MECHANISM TO COMPUTE CHANNEL SEQUENCE FOR FREQUENCY HOPPING COMMUICATION NETWORKS

AUTHORS:

Huimin She

Yuzhuo Yang
Zhanglong Xia
Chuanwei Li

CISCO SYSTEMS, INC.

ABSTRACT

    Presented herein is an efficient mechanism to generate non-repeated pseudo- random channel sequences for frequency hopping networks. The inputs are: (1) a list of available channels; (2) a unique identifier (e.g., MAC address) of the node; and/or (3) slot number or current time. The output is a channel number for an arbitrary time slot or the entire channel hopping sequence. The method has very low computation complexity and requires very little memory. It efficiently utilizes the full frequency band and complies with regulatory rules.

DETAILED DESCRIPTION

    Frequency hopping, also known as channel hopping, is a method of transmitting radio signals by rapidly switching a carrier among multiple frequency channels, using a pseudo-random sequence known to both the transmitter and the receiver. Compared with fixed frequency transmissions, frequency-hopped transmissions have advantages, such as being resistant to interference and difficult to intercept. Therefore, frequency-hopped transmissions are widely used in many applications, such as the Internet of Things and Smart Utility Networks.

    In frequency hopping networks, before a node can communicate with a peer node, the node first needs to know the channel hopping sequence of the peer node. The transmitter-receiver pair must be on the same channel during the transmission. Moreover,

Copyright 2016 Cisco Systems, Inc.

1


Page 02 of 6

according to Federal Communications Commission (FCC) rules (FCC-Part-15.247), the frequency hopping mechanism shall use all available channels equally on average in a pseudo-random sequence. Therefore, one of the main challenges of frequency hopped transmissions is computing the pseudo-random channel sequence. To determine a channel-hopping sequence, there are usually tradeoffs between the required computational and storage resources, and the quality of the generated channel sequence.

    Presented herein is an efficient mechanism to generate channel sequences for frequency hopping networks. This method generates a non-repeated pseudo-random sequence that both complies with regulatory rules and efficiently utilizes the full frequency band. Moreover, it requires very little computation and storage resources.

    This method is an efficient way to determine the frequency hopping sequence, and it meets the following criteria:


1) Equally use all available channels.


2) Be a pseudo-random sequence.

3) Be independent for different nodes.

The following terms, where referenced herein, are defined as follows:


- Channel table: Contains a list of channels that are available for usage (some channels may be explicitly excluded).


- Channel hopping sequence: A list of channels that a node follows when listening for transmissions.


- Time slot: At the beginning of a slot, the node switches to the next channe...