ACM Home Page
Please provide us with feedback. Feedback
Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis
Full text PdfPdf (363 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing table of contents
Lausanne, Switzerland
SESSION: Fairness and Scheduling table of contents
Pages: 58 - 70  
Year of Publication: 2002
ISBN:1-58113-501-7
Authors
V. Kanodia  Rice University, Houston, TX
A. Sabharwal  Rice University, Houston, TX
B. Sadeghi  Rice University, Houston, TX
E. Knightly  Rice University, Houston, TX
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513800.513808
What is a DOI?

ABSTRACT

Wireless emph ad hoc networks based on the IEEE 802.11 protocol can incur severe unfairness even in simple topologies. In particular, two topological properties that we define in a graph-theoretic framework and refer to as information asymmetry and perceived collisions result in significant performance degradations and unfairness. In this paper, we present the design and analysis of Distributed Wireless Ordering Protocol (DWOP), a distributed scheduling and media access algorithm targeted towards ensuring that packets access the medium in an order defined by an ideal reference scheduler such as FIFO, Virtual Clock, or Earliest Deadline First. In this way, DWOP enables QoS differentiation as well as fairness when combined with TCP. Our key technique is piggybacking head-of-line packet priorities in IEEE 802.11 control messages so that nodes can assess the relative priority of their own queued packets. With a graph-theoretic problem formulation, we design DWOP to achieve the exact reference ordering in fully connected graphs, and to have well-characterized deviations from the reference order in more complex topologies. A simple theoretical model indicates that the scheme attains rapid convergence for newly arriving nodes, and extensive simulations indicate that nearly exact reference ordering can be achieved, even in complex asymmetric and perceived collision topologies.


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
 
2
3
 
4
E. Castillo. Extreme Value Theory in Engineering Academic Press, 1988.
 
5
S. Golestani. A self-clocked fair queueing scheme for broadband applications. In Proc. IEEE INFOCOM 1994.
 
6
 
7
IEEE. IEEE standard 802.11: Wireless LAN medium simuaccess control (MAC) and physical layer (PHY) specifications, 1997.
8
9
 
10
 
11
H. Luo and S. Lu, A self-coordinating approach to distributed fair queueing in ad hoc wireless networks. In Proc. IEEE Infocom, 2001.
12
13
 
14
 
15
T. Ozugur, M. Naghshineh, P. Kermani, and J. Copeland. Fair media access for wireless LANs. In Proc. IEEE GLOBECOM, 1999.
 
16
N. Vaidya and P. Bahl. Fair scheduling in broadcast environments, Aug. 1999. Microsoft Research Tech. Rep. MSR-TR-99--61.
17
 
18
L. Zhang. A New Architecture for Packet Switched Network Protocols. PhD dissertation, Massachusetts Institute of Technology, July 1989.

CITED BY  16
 
 
 
 
 
 
 
 

Collaborative Colleagues:
V. Kanodia: colleagues
A. Sabharwal: colleagues
B. Sadeghi: colleagues
E. Knightly: colleagues

Peer to Peer - Readers of this Article have also read: