Departmental Papers (ESE)

Document Type

Journal Article

Date of this Version

October 2006

Comments

Copyright 2006 IEEE. Reprinted from IEEE Transactions on Information Theory, Volume 51, Issue 10, October 2006, pages 4701-4713.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Abstract

The goal of this correspondence is to minimize delay in real-time multiple-access channel (MAC) layer multicast by exploiting the broadcast nature of wireless medium and limited loss tolerance of the applications. Multiple transmissions of a packet at the MAC layer significantly reduces the delay than that when only one transmission is allowed. But each additional transmission consumes additional power and increases network load. Therefore, the goal is to design a policy that judiciously uses the limited transmission opportunities so as to deliver each packet in the minimum possible time to the required number of group members. The problem is an instance of the stochastic shortest path problem, and using this formulation computationally simple, closed-form transmission strategies have been obtained in important special cases.

Keywords

broadcast property, dynamic programming, threshold policies, wireless multicast

Share

COinS

Date Posted: 07 December 2006

This document has been peer reviewed.