ProWiN: Methods and Algorithms for Resilient Packet Header Compression

ProWiN：弹性数据包标头压缩的方法和算法

• 批准号: 0627106
• 负责人: Aria Nosratinia
• 金额: $ 16.51万
• 依托单位: University of Texas at Dallas
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2006
• 资助国家: 美国
• 起止时间: 2006-09-15 至 2009-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0627106&HistoricalAwards=false
• 关键词: ProWiN; Methods; Algorithms; Resilient; Packet

Any unneeded bit transmitted from a wireless node harms the network in two ways: it wastes the power and bandwidth of the node itself, and it creates interference for other nodes. Since TCP/IP packets are on average short, existing packet headers of 40-60 bytes can create huge inefficiencies, motivating an ongoing effort in packet header compression. Unfortunately compression and error resilience are at odds: compressing the headers creates dependencies, so the compressed headers are fragile and susceptible to error propagation. This has been the central problem in packet header compression for over a decade.This research applies powerful tools from the statistical theory of communication to the problem of packet header compression/communication. These tools have had a truly amazing track record in various problems in wireless, wireline, and optical communications, audio, image and video compression, as well as mass storage devices. This effort concentrates on the design of systems involving block codes, convolutional codes, and turbo codes and applying them to packet header compression and communication, with a direct impact on the design of better and more efficient wireless networks of the future.

从无线节点传输的任何不需要的比特都会以两种方式损害网络：浪费节点本身的功率和带宽，并对其他节点造成干扰。由于TCP/IP数据包平均长度较短，现有的40-60字节的数据包报头可能造成巨大的效率低下，促使人们不断努力进行数据包报头压缩。不幸的是，压缩和错误恢复是不一致的：压缩报头会产生依赖性，因此压缩的报头是脆弱的，容易受到错误传播的影响。这是十几年来数据包报头压缩的核心问题。本研究将通信统计理论中的强大工具应用于数据包报头压缩/通信问题。这些工具在无线、有线和光通信、音频、图像和视频压缩以及大容量存储设备中的各种问题上都有着令人惊叹的记录。这项工作集中在涉及分组码，卷积码和Turbo码的系统的设计，并将其应用于数据包报头压缩和通信，对未来更好，更高效的无线网络的设计产生直接影响。