Dynamic Scrambling Techniques for Reducing Killer Packets in a Wireless Network
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Dec 10, 2009
app pub date -
Jun 6, 2008
filing date -
Jun 6, 2008
priority date (Note) -
Abandoned
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully