NDLI: A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay

Content Provider	ACM Digital Library
Author	Wang, Chih-Chun Lin, Xiaojun Huang, Po-Kai
Copyright Year	2013
Abstract	Quantifying the end-to-end delay performance in multihop wireless networks is a well-known challenging problem. In this paper, we propose a new joint congestion control and scheduling algorithm for multihop wireless networks with fixed-route flows operated under a general interference model with interference degree κ. Our proposed algorithm not only achieves a provable throughput guarantee (which is close to at least 1/κ of the system capacity region), but also leads to explicit upper bounds on the end-to-end delay of every flow. Our end-to-end delay and throughput bounds are in simple and closed forms, and they explicitly quantify the tradeoff between throughput and delay of every flow. Furthermore, the per-flow end-to-end delay bound increases linearly with the number of hops that the flow passes through, which is order-optimal with respect to the number of hops. Unlike traditional solutions based on the backpressure algorithm, our proposed algorithm combines window-based flow control with a new rate-based distributed scheduling algorithm. A key contribution of our work is to use a novel stochastic dominance approach to bound the corresponding per-flow throughput and delay, which otherwise are often intractable in these types of systems. Our proposed algorithm is fully distributed and requires a low per-node complexity that does not increase with the network size. Hence, it can be easily implemented in practice.
Starting Page	495
Ending Page	508
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2012.2213343
Volume Number	21
Issue Number	2
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-04-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Low-complexity and distributed algorithms Order-optimal delay bound Rate-based scheduling algorithms Supermodular ordering Window-based flow control
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

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

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks With Order-Optimal Per-Flow Delay

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay (2012).

Congestion Control and Rate Based Scheduling Algorithm for Multihop Wireless Networks with Order Optimal per Flow Delay

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay

Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information

Distributed cross-layer algorithms for the optimal control of multihop wireless networks

Throughput-optimal scheduling in multihop wireless networks without per-flow information

Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks

A Note on “Low-Complexity Distributed Scheduling Algorithms for Wireless Networks” [Dec 09 1846-1859]

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay

Similar Documents

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks With Order-Optimal Per-Flow Delay

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay (2012).

Congestion Control and Rate Based Scheduling Algorithm for Multihop Wireless Networks with Order Optimal per Flow Delay

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay

Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information

Distributed cross-layer algorithms for the optimal control of multihop wireless networks

Throughput-optimal scheduling in multihop wireless networks without per-flow information

Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks

A Note on “Low-Complexity Distributed Scheduling Algorithms for Wireless Networks” [Dec 09 1846-1859]

A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay