By Topic

Adaptive RS codes for message delivery over an encrypted mobile network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Grushevsky, Y.L. ; C4 Syst., Gen. Dynamics, Taunton, MA ; Elmasry, G.F.

The authors present a hybrid automatic repeat request technique using adaptive Reed-Solomon (RS) codes with packet erasure. This technique suits the transport layer in tactical mobile wireless networks with type I encryption, where encryption erasures the entire Internet protocol packet. The novelty of the presented technique is the multifaceted optimisation of Reed-Solomon codes at the transport layer for delivery assurance, speed of service (SoS) and network throughput. With this technique, the transport layer in tactical networks can meet the stringent requirements of quality of service imposed by the tactical network user, even under adverse conditions. These requirements define a high level of reliability (delivery assurance), a specific SoS and optimum use of the limited bandwidth (BW) of the wireless network, where the probability of packet erasure can be very high. The provided probabilistic analysis shows that focusing on network throughput alone will result in violating SoS and delivery assurance requirements. On the other hand, focusing on SoS and delivery assurance requirements can result in poor network throughput. The multifaceted optimisation technique, which utilises hybrid ARQ for message delivery, is described using a homogeneous Markov chain.

Published in:

Communications, IET  (Volume:3 ,  Issue: 6 )