Contention in multi-hop wireless networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Contention in multi-hop wireless networks: model and fairness analysis

Full text

Pdf (435 KB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems table of contents

Tenerife, Canary Islands, Spain

SESSION: Fairness table of contents

Pages 21-29

Year of Publication: 2009

ISBN:978-1-60558-616-8

Authors

Vinay Kolar	RWTH Aachen University, Aachen, Germany
Karthik Bharath	University of Connecticut, Storrs, CT, USA
Nael B. Abu-Ghazaleh	State University of New York, Binghamton, NY, USA
Janne Riihijarvi	RWTH Aachen University, Aachen, Germany

Sponsor

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 5, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1641804.1641812 What is a DOI?

ABSTRACT

In multi-hop wireless networks with Carrier Sense Multiple Access (CSMA), unfairness may arise due to a number of reasons. A majority of the existing work focuses on fairness issues due to hidden terminals and the impact on backoff mechanisms. This paper focuses on the unfairness arising due to unequal contention opportunities at a node; some nodes rarely observe an idle channel since two or more interferers that are not in range with each other can transmit together. Contention unfairness is unrelated to hidden terminals. In order to understand the impact of contention and gain insight into developing solutions for contention unfairness, we develop a model from first principles for contention in IEEE 802.11 networks. The accuracy of the model is validated through simulations and the results show that such unfairness is a common phenomenon. Based on the insights gained from the model, we propose and evaluate a distributed scheme that reduces the effect of unfairness due to contention. Simulation results show that the proposed scheme achieves an average improvement of 25% in fairness, with a small reduction in overall throughput.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	I. Aad, Q. Ni, C. Barakat, and T. Turletti. Enhancing IEEE 802.11 MAC in congested environments. In Computer Communications 28 (2005), 2005.
	2	ath5k: Linux driver for atheros cards. http://madwifi.org/wiki/About/ath5k.
	3	B. Bensaou, Y. Wang, and C. C. Ko. Fair medium access in 802.11 based wireless ad-hoc networks. In MobiHoc '00, 2000.
	4	V. Bharghavan, A. Demers, S. Shenker, and L. Zhang. MACAW: a media access protocol for wireless LAN's. SIGCOMM Comput. Commun. Rev., 24(4):212--225, 1994.
	5	R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin. Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. on Communication, 1987.
	6	C. Chaudet, I. G. Lassous, E. Thierry, and B. Gaujal. Study of the impact of asymmetry and carrier sense mechanism in IEEE 802.11 multi-hops networks through a basic case. In PE-WASUN '04, pages 1--7, 2004.
	7	J. Deng, P. K. Varshney, and Z. J. Haas. A New Backoff Algorithm for the IEEE 802.11 Distributed Coordination Function. In CNDS 2004, 2004.
	8	M. Garetto, T. Salonidis, and E. W. Knightly. Modeling Per-flow Throughput and Capturing Starvation in CSMA Multi-hop Wireless Networks. IEEE INFOCOMM, 2006.
	9	M. Garetto, J. Shi, and E. W. Knightly. Modeling media access in embedded two-flow topologies of multi-hop wireless networks. In MobiCom '05, pages 200--214, New York, NY, USA, 2005. ACM Press.
	10	R. Gupta and J. Walrand. Approximating maximal cliques in ad-hoc networks. In PIMRC, 2004.
	11	M. Heusse, F. Rousseau, R. Guillier, and A. Duda. Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs. In SIGCOMM '05, pages 121--132, 2005.
	12	R. Jain, D.-M. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer system. Technical Report 301, Digital Equipment Corporation, 1984.
	13	E. P. C. Kao. An Introduction to Stochastic Processes, chapter 3.4. Duxbury Press; 1st edition (June 21, 1996), 1996.
	14	V. Kolar and N. Abu-Ghazaleh. Scheduling aware network flow models for multi-hop wireless networks. pages 1--8, June 2008.
	15	T. Nandagopal, T.-E. Kim, X. Gao, and V. Bharghavan. Achieving MAC layer fairness in wireless packet networks. In MobiCom, 2000.
	16	Qualnet network simulator. http://www.scalable-networks.com/.
	17	S. Razak, N. B. Abu-Ghazaleh, and V. Kolar. Modeling of two-flow interactions under SINR model in Multi-hop Wireless Networks. In Proc. LCN, pages 297--304, 2008.
	18	The IEEEWorking Group. IEEE 802.11 Wireless Local Area Networks, 2002.
	19	F. A. Tobagi and J. M. Brazio. Throughput analysis of multihop packet radio network under various channel access schemes. IEEE INFOCOM, 1983.
	20	F. A. Tobagi and L. Kleinrock. Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution. IEEE Trans. on Communications, 23(12):1417--1433, 1975.
	21	M. Tortorella. Numerical solutions of renewal-type integral equations. INFORMS J. on Computing, 17(1):66--74, 2005.
	22	X. Wang and K. Kar. Throughput Modelling and Fairness Issues In CSMA/CA Based Ad-Hoc Networks. In INFOCOM, 2005.
	23	X. Yang and N. H. Vaidya. Priority scheduling in wireless ad hoc networks. In MobiHoc '02, 2002.