Mobility

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

Free registration required

Executive Summary

The authors suggest and analyze algorithms for routing in multi-hop wireless ad-hoc networks that exploit mutual information accumulation as the physical layer transmission scheme, and are capable of routing multiple packet streams (commodities) when only the average channel state information is present and that only locally. The proposed algorithms are modifications of the DIVersity BAckpRessure (DIVBAR) algorithm, under which the packet whose commodity has the largest "Backpressure metric" is chosen to be transmitted and is forwarded through the link with the largest differential backlog (queue length). In contrast to traditional DIVBAR, each receiving node stores and accumulates the partially received packet in a separate "Partial packet queue", thus increasing the probability of successful reception during a later possible retransmission.

  • Format: PDF
  • Size: 853.51 KB