Loading...
Please wait, while we are loading the content...
Similar Documents
Self-coordinating Localized Fair Queueing in Wireless Ad Hoc Networks (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Luo, Haiyun Cheng, Jerry Lu, Songwu |
| Abstract | Distributed fair queueing in a multihop, wireless ad-hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad-hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we re-examine the fairness notion in an ad-hoc network using a graph-theoretic formulation, and extract the fairness requirements that an ad-hoc fair queueing algorithm should possess. To meet these requirements, we propose Maximize-Local-Minimum Fair Queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose Enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad-hoc networks. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Self-coordinating Localized Fair Queueing Wireless Ad Hoc Network Wireless Ad-hoc Network Spatial Channel Reuse Fairness Notion Ad-hoc Network Wireless Channel Maximize-local-minimum Fair Queueing Location-dependent Channel Contention Graph-theoretic Formulation Several Reason Simultaneous Transmission Explicit Information Emlm-fq Achieves Statistical Short-term Throughput Enhanced Mlm-fq Scarce Resource Delay Bound Extensive Simulation Wireless Channel Capacity Self-coordinating Localized Design Fair Bandwidth Sharing Spatial Locality Ad-hoc Fair Distributed Scheduling Problem Fairness Requirement Global Fair Channel Access Local Scheduler Scheduling Decision |
| Content Type | Text |
