Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bormann, C., Burmeister, C., Degermark, M., Fukushima, H., Hannu, H., Jonsson, L.-E., Hakenberg, R., Koren, T., Le, K., Liu, Z., Martensson, A., Miyazaki, A., Svanbro, K., Wiebke, T., Yoshimura, T., Zheng, H.: RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed. RFC 3095 (Proposed Standard) (July 2001)
CAIDA. Packet Length Distributions (August 2004), http://www.caida.org/analysis/AIX/plen_hist
Casner, S., Jacobson, V.: Compressing IP/UDP/RTP Headers for Low-Speed Serial Links. RFC 2508 (Proposed Standard) (February 1999)
Coulouris, G.F., Dollimore, J., Kindberg, T.: Distributed Systems: Concepts and Design, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (2001)
Degermark, M., Nordgren, B., Pink, S.: IP Header Compression. RFC 2507 (Proposed Standard) (February 1999)
Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)
IEEE. IEEE 802.11 Optimal Performances: RTS/CTS Mechanism vs. Basic Access. In: Proceedings of PIMRC (2002)
Jacobson, V.: Compressing TCP/IP Headers for Low-Speed Serial Links. RFC 1144 (Proposed Standard) (February 1990)
The VINT Project. The ns Manual. Available in html, postscript and PDF (December 2003)
Sprint. IP Monitoring Project (February 2004), http://ipmon.sprint.com/packstat/packetoverview.php
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Arango, J., Faulkner, M., Pink, S. (2010). Compressing MAC Headers on Shared Wireless Media. In: Zheng, J., Mao, S., Midkiff, S.F., Zhu, H. (eds) Ad Hoc Networks. ADHOCNETS 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11723-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-11723-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11722-0
Online ISBN: 978-3-642-11723-7
eBook Packages: Computer ScienceComputer Science (R0)