NDLI: Diversity backpressure routing with mutual information accumulation in wireless ad-hoc networks

Content Provider	IEEE Xplore Digital Library
Author	Hao Feng Molisch, A.F.
Copyright Year	2012
Description	Author affiliation: University of Southern California (Hao Feng; Molisch, A.F.)
Abstract	We suggest and analyze algorithms for routing in ad-hoc networks that exploit mutual-information accumulation at receiving nodes, and are capable of routing multiple data streams (commodities) when only mean channel state information is present, and that only locally. The algorithm is a generalization of the DIVBAR algorithm, which in turn is based on backpressure routing. Packets are transmitted by each node on the links seeing the largest "backpressure", a measure for the differential queue lengths for a specific commodity at the considered nodes times the success probability for packets on that link. In contrast to traditional DIVBAR, nodes store and exploit partially received packets, thus increasing the probability of successful reception at retransmission, where the information is stored in separate "partial queues" at each node. We present two variants of our algorithm: DIVBAR-RMIA, which clears the partial queues whenever a packet is firstly decoded by one or more receiving nodes; DIVBAR-MIA, which retains the information about a specific packet in the partial queues until the packet has reached its destination. We prove that DIVBAR-RMIA performs strictly better than conventional DIVBAR (under some mild assumptions about the channel states), and that DIBVAR-MIA performs at least as well as DIVBAR-RMIA. Simulations not only confirm these results, but also demonstrate the impact of packet entropy on the achievable throughput.
Starting Page	4055
Ending Page	4060
File Size	259397
Page Count	6
File Format	PDF
ISBN	9781457720529
ISSN	15503607
e-ISBN	9781457720536
e-ISBN	9781457720512
DOI	10.1109/ICC.2012.6364636
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-10
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Throughput Routing Algorithm design and analysis Receivers Ad hoc networks Entropy Wireless networks Lyapunov Drift DIVBAR Algorithm (Renewal) Mutual Information Accumulation Backpressure
Content Type	Text
Resource Type	Article

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

Diversity Backpressure Scheduling and Routing with Mutual Information Accumulation in Wireless Ad-hoc Networks

Skip-ahead routing in wireless networks

On Route Discovery Success in Ad hoc Networks

Throughput Enhancement through Efficient Channel Assignment in Multi-radio Ad Hoc Networks

Towards Throughput and Delay Optimal Routing for Wireless Ad-Hoc Networks

Integration of Multi-path Optimized Link State Protocol with Max-weight Scheduling

Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks

Throughput maximizing routing in a MANET: protocol and analysis

A Power-aware Adaptive Dynamic Routing Scheme for Wireless Ad Hoc Networks

Diversity backpressure routing with mutual information accumulation in wireless ad-hoc networks

Similar Documents

Diversity Backpressure Scheduling and Routing with Mutual Information Accumulation in Wireless Ad-hoc Networks

Skip-ahead routing in wireless networks

On Route Discovery Success in Ad hoc Networks

Throughput Enhancement through Efficient Channel Assignment in Multi-radio Ad Hoc Networks

Towards Throughput and Delay Optimal Routing for Wireless Ad-Hoc Networks

Integration of Multi-path Optimized Link State Protocol with Max-weight Scheduling

Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks

Throughput maximizing routing in a MANET: protocol and analysis

A Power-aware Adaptive Dynamic Routing Scheme for Wireless Ad Hoc Networks

Diversity backpressure routing with mutual information accumulation in wireless ad-hoc networks