Dynamic Scrambling Techniques for Reducing Killer Packets in a Wireless Network

• US 20090303972A1
• Filed: 06/06/2008
• Published: 12/10/2009
• Est. Priority Date: 06/06/2008
• Status: Abandoned Application

• Current Assignee: Itron Networked Solutions, Inc. (Itron, Inc.)
• Original Assignee: Silver Spring Networks, Inc. (Itron, Inc.)
• Inventors: Vaswani, Raj, Flammer, George III
• Application Number:
  US12/135,060
• Publication Number:
  US 20090303972A1
• Time in Patent Office: Days
• US Class Current: 370/338
• CPC Class Codes: H04B 1/7143 Arrangements for generation of hop patterns
• CPC Class Codes: H04B 1/715 Interference-related aspects
• CPC Class Codes: H04B 2001/7154 with means for preventing interference
• CPC Class Codes: H04L 25/03866 using scrambling

Abstract

Techniques are disclosed in which a parameter used for scrambling packet data is changed. If the initial scrambling of a packet causes a killer packet to be generated, the packet is re-scrambled using a different value for the parameter, so that a killer packet is avoided. In a network that employs frequency-hopping spread spectrum communications, a channel identifier can be employed as an input to the scrambling algorithm. In this implementation, a given packet of data will be transmitted on one channel with a first sequence of bits when it is scrambled, and on another channel with a different sequence of bits. If the scrambled packet for one of these channels results in a killer packet, it is statistically unlikely that it will also be a killer packet when it is re-transmitted on the other channel.

Claims

1. A transmitting node for use in a wireless communications network that communicates data packets between a transmitting node and a receiving node, comprising:

a data scrambling unit that receives packet data and modifies said data in accordance with the value of a parameter of a scrambling algorithm;

a parameter value generating device that generates different values that are known a priori at the receiving node, and inputs individual generated values to said data scrambling unit as said parameter value; and

a transmitter that transmits said modified data to the receiving node via said wireless communications network.

2. The node of claim 1, wherein said parameter value is varied on a periodic basis.

3. The node of claim 2, wherein said wireless communications network employs frequency hopping transmissions, and wherein said parameter is an identifier associated with the frequency of a transmission channel.

4. The node of claim 2, wherein said scrambling parameter is a seed value with which the scrambling algorithm is initialized.

5. The node of claim 2, wherein said scrambling parameter is a time code.

6. A system for communicating data packets between a transmitting node and a receiving node in a wireless communications network that employs frequency hopping, wherein packets are transmitted via different frequency channels during successive periods of time, each said node comprising:

a data scrambling unit that receives packet data and modifies said data in accordance with an input seed value;

a transceiver that transmits and/or receives modified data communicated via said wireless communications network; and

a channel identifier that generates a value indicating the frequency channel being employed for data communications at any given instant of time, and inputs said value to said data scrambling unit as said seed value, to thereby cause data to be scrambled in different manners in accordance with the channel via which it is transmitted.

7. A method for communicating data packets between a transmitting node and a receiving node in a wireless communications network, comprising the following steps:

scrambling packet data in accordance with a first value for a scrambling parameter that is input to a scrambling algorithm, to produce a first set of scrambled data;

determining whether said first set of scrambled data contains a sequence of data bits that cannot be reliably detected at said receiving node;

scrambling said packet data in accordance with a second value for said scrambling parameter, to produce a second set of scrambled data if a determination is made that said first set of scrambled data contains a sequence of bits that cannot be reliably detected; and

transmitting a packet containing said second set of scrambled data to said receiving node.

8. The method of claim 7, wherein said determining step is performed at said transmitting node.

9. The method of claim 7, wherein said receiving node performs the following operations:

descrambling data of a received packet in accordance with each of said first and second values for said scrambling parameter, to produce two descrambled packets from said received packet;

selecting one of said two descrambled packets as containing reliable data; and

processing said selected packet to decode the data contained therein.

11. The method of claim 7, further including the steps of transmitting a packet containing said first set of scrambled data to said receiving node, and wherein said receiving node performs said determining step in response to receiving said packet containing said first set of scrambled data.

12. The method of claim 7, wherein the determination whether a sequence of data bits cannot be reliably detected is based upon whether the sequence contains a predetermined number of successive bits all having the same value.

13. The method of claim 7, wherein said scrambling parameter is a seed value with which the scrambling algorithm is initialized.

14. The method of claim 13, wherein said wireless communications network employs frequency hopping transmissions, and wherein said parameter is an identifier associated with the frequency of a transmission channel.

15. The method of claim 7, wherein said wireless communications network employs frequency hopping transmissions, and wherein said parameter is an identifier associated with the frequency of a transmission channel.