Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee

Details Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee

2010-04-27

arxiv.org/abs/1004.4713v1

Computer Science

Information Theory

Conference paper submitted to 2010 IEEE Int. Symp. on Information Theory

Scientific paper

Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worst-case system throughput is proposed. The construction is based on Chinese remainder theorem. The Hamming crosscorrelation is proved to be concentrated around the mean. The sequence period is much shorter than existing protocol sequences with the same throughput performance. The new construction reduces the complexity in implementation and also shortens the waiting time until a packet can be sent successfully.

Affiliated with

Also associated with

No associations

Rating

Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-236858