DocumentCode
1939067
Title
Packet combining considerations for random-access networks
Author
Block, Frederick J.
Author_Institution
MIT Lincoln Lab., Lexington, MA, USA
fYear
2010
fDate
Oct. 31 2010-Nov. 3 2010
Firstpage
724
Lastpage
730
Abstract
If the channel is particularly poor, a radio may be unable to decode any individual packet reception. Packet combining utilizes retransmission diversity to improve the probability that a message can be decoded. In cases where the transmitter is known to the receiver (e.g., communication using a dedicated time slot), the receiver can request that the transmitter resend the message. However, in random access networks, a receiver may hear packets from many transmitters. If a received message is not decodable, the receiver may not know the identity of the transmitter and thus be unable to request a retransmission directly. The lack of a positive acknowledgment may cause the transmitter to eventually repeat the message, but without any explicit control signaling between the two radios, the receiver may be unaware that the new attempt can be combined with one of its previous receptions. In this paper, techniques to identify which received packets should be combined are considered. The packet matching techniques are limited to those utilizing information contained only in the individual receptions and so are suitable for random-access networks.
Keywords
decoding; packet radio networks; receivers; subscriber loops; transmitters; dedicated time slot; packet combining considerations; packet matching; random-access networks; receiver; transmitter; AWGN; Approximation methods; Decoding; Encoding; Radio transmitters; Receivers;
fLanguage
English
Publisher
ieee
Conference_Titel
MILITARY COMMUNICATIONS CONFERENCE, 2010 - MILCOM 2010
Conference_Location
San Jose, CA
ISSN
2155-7578
Print_ISBN
978-1-4244-8178-1
Type
conf
DOI
10.1109/MILCOM.2010.5680296
Filename
5680296
Link To Document