Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Compressing MAC Headers on Shared Wireless Media
AU - Arango, Jesus
AU - Faulkner, Matthew
AU - Pink, Stephen
PY - 2009
Y1 - 2009
N2 - This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes could not compress MAC headers because the address fields are needed to identify the intended destination as well as the intended context space under which compressed headers are to be interpreted. We approach this problem by sharing a single context space among participating nodes. The compression context for a new flow between two nodes is initialized and synchronized by transmitting an uncompressed frame with a context label that is randomly selected by the sender. Frames with compressed MAC headers will have no address fields. A receiving node that has a context which matches the label in a compressed frame will be able to decompress the header by expanding the label into the corresponding fields stored in the context. Mechanisms are presented to address label conflicts where a node is receiving compressed frames with the same label from multiple senders. We evaluate our work by simulating an 802.11 network that implements the header compression algorithm. The simulation results show that when MAC headers are compressed there is throughput improvement of up to 15% in the experiments we conducted. This is in addition to the throughput improvement achieved by compressing IP, TCP, UDP and higher level headers.
AB - This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes could not compress MAC headers because the address fields are needed to identify the intended destination as well as the intended context space under which compressed headers are to be interpreted. We approach this problem by sharing a single context space among participating nodes. The compression context for a new flow between two nodes is initialized and synchronized by transmitting an uncompressed frame with a context label that is randomly selected by the sender. Frames with compressed MAC headers will have no address fields. A receiving node that has a context which matches the label in a compressed frame will be able to decompress the header by expanding the label into the corresponding fields stored in the context. Mechanisms are presented to address label conflicts where a node is receiving compressed frames with the same label from multiple senders. We evaluate our work by simulating an 802.11 network that implements the header compression algorithm. The simulation results show that when MAC headers are compressed there is throughput improvement of up to 15% in the experiments we conducted. This is in addition to the throughput improvement achieved by compressing IP, TCP, UDP and higher level headers.
U2 - 10.1007/978-3-642-11723-7_39
DO - 10.1007/978-3-642-11723-7_39
M3 - Conference contribution/Paper
SN - 3-642-11722-8
VL - 28
BT - Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
A2 - Zheng, J.
A2 - Mao, S.
A2 - Midkiff, S.F.
A2 - Zhu, H.
PB - Springer
T2 - First International Conference on Ad Hoc Networks
Y2 - 1 January 1900
ER -