NDLI: On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

Please wait, while we are loading the content...

Implicit source routes for on-demand ad hoc network routing

Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks

SEEDEX: a MAC protocol for ad hoc networks

Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure

The quest for security in mobile ad hoc networks

Performance of a new Bluetooth scatternet formation protocol

A probabilistic analysis for the range assignment problem in ad hoc networks

An adaptive MAC and idrectional routing protocol for ad hoc wireless network using ESPAR antenna

Neighborhood aware source routing

Geometric spanner for routing in mobile networks

Medium access and radio resource management for ad hoc networks based on UTRA TDD

Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices

Secure pebblenets

A pseudo random coordinated scheduling algorithm for Bluetooth scatternets

On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

Ad hoc relay wireless networks over moving vehicles on highways

Making link-state routing scale for ad hoc networks

A comparison of TCP performance over three routing protocols for mobile ad hoc networks

Effects of wireless physical layer modeling in mobile ad hoc networks

Maximum flow-life curve for a wireless ad hoc network

Testbed on a desktop: strategies and techniques to support multi-hop MANET routing protocol development

JUMP mode---a dynamic window-based scheduling framework for Bluetooth scatternets

Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm

Highly-resilient, energy-efficient multipath routing in wireless sensor networks

On the performance of ad hoc networks with beamforming antennas

Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks

Time synchronization in ad hoc networks

Comparison between graph-based and interference-based STDMA scheduling

Position-aware ad hoc wireless networks for inter-vehicle communications: the Fleetnet project

Geographical region summary service for geographical routing

Parallel processing over mobile ad hoc networks of handheld machines

Throughput of ideally routed wireless ad hoc networks

Application of the ASN.1 specification technique to the Bluetooth service discover protocol

Selection diversity forwarding in a multihop packet radio network with fading channel and capture

Constructing minimum energy mobile wireless networks

Location based localized alternate, disjoint, multi-path and component routing schemes for wireless networks

Multiuser receiver aware multicast protocols for wireless ad-hoc networks

Distributed assignment of encoded MAC addresses in sensor networks

Security-aware ad hoc routing for wireless networks

On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

Content Provider	ACM Digital Library
Author	Bensaou, Brahim Huang, Xiao Long
Abstract	This paper addresses the problem of fairness in wireless ad-hoc networks. Usually, the problem of fairness in wireless ad-hoc networks is addressed in a classic approach inherited from wired networks. The common assumption is that nodes/flows have pre-assigned fair shares. The task becomes then to modify wired networks' fair queueing algorithms to address wireless network nature. Wired networks have efficient means of allocating fiar shares through admission control and additionally, the fair shares remain constant throughout the session duration due to the static nature of the nodes. In ad-hoc networks, it is meaningless to assume statically pre-assigned fair shares, since on one hand, not only the nodes move, but also the routers are mobile, and on the other hand, contention is location dependent, such that in terms of absolute guarantees, fairness would at most mean "avoiding starvation": thus applying rate proportional fiar queueing algorithms is beyond the original goal of such algorithm, viz. flow isolation/protection and bandwidth guarantee. In this work we argue in favor of multi-level scheduling for wireless ad-hoc networks with max-min fair allocation of the fair shares at the lower-most layer (MAC layer). This paper, mainly lays down the theoretical framework by which one can calculate the fair shares that would achieve max-min fairness in an ad-hoc network. We design distributed algorithms that allow each node to determine its max-min per-link fair share in a global ad-hoc network without knowledge of the global topology of the network. The results are then used in conjunction with a novel practical scheduling algorithm for IEEE 802.11 to show how fairness is achieved.
Starting Page	221
Ending Page	231
Page Count	11
File Format	PDF
ISBN	1581134282
DOI	10.1145/501445.501447
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-10-01
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Admission control Per-link/per-flow fairness Ad-hoc networks Max-min fairness Scheduling Distributed algorithms
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in