Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Comulative Acknowledgement Multicast Repetition Policy for Wireless LANs or Ad Hoc Network Clusters

Published

Author(s)

Leonard E. Miller, B-J Kwak

Abstract

For a wireless LAN or a cluster of nodes in an ad hoc wireless network, multicast transmissions from a controlling station must be acknowledged by the nodes that are addressed. To ensure reliable reception at all the nodes, the multicast packet may be repeated on different transmissions, or on the same transmission as a form of diversity, or both. In this paper, policies for repeat transmissions of multicast packets are analyzed in terms of the average number of repeat transmissions required and the corresponding efficiency of the signaling on the multicast channel. The analytical results are parametric in packet/ACK error probabililty, the number of nodes, and the number of required ACKs. It is shown that a policy of accumulating ACKs and addressing only unacknowledged nodes on repeated non-diversity transmissions is more efficient than simply using a higher order of diversity on the multicast transmissions. Methods are shown for avoiding unnecessary repetitions in the case of a missing node.
Proceedings Title
IEEE International Conference on Communications
Conference Dates
April 28-May 2, 2002
Conference Title
International Conference on Communications

Keywords

diversity, efficiency, multicast, probability, repetititon

Citation

Miller, L. and Kwak, B. (2002), Comulative Acknowledgement Multicast Repetition Policy for Wireless LANs or Ad Hoc Network Clusters, IEEE International Conference on Communications, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151172 (Accessed December 6, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created May 2, 2002, Updated February 19, 2017