A Dynamic Programming Algorithm to Select Optimal High-priority Voice Segments using Arduino
; Soares, S.S.
; Reis, M. C. R
; Neves, F.N.
A Dynamic Programming Algorithm to Select Optimal High-priority Voice Segments using Arduino, Proc IEEE Conf. on Computer as a Tool (EUROCON), Ohrid, Macedonia, FYOM, Vol. , pp. 271 - 276, July, 2017.
Digital Object Identifier: 10.1109/EUROCON.2017.8011118
Prioritization of voice packets is useful to cope with packet losses in VoIP services by providing a mechanism to priority-enabled networks for dropping first the least important content, in order to reconstruct the best quality signal for user perception. A contribution to an efficient solution for voice packet prioritization is proposed in this paper, using an Arduino platform to implement a dynamic programming algorithm that is capable of finding the most important voice segments to convey in the payload of high-priority VoIP packets. Despite the fairly high complexity of the algorithm versus the limited computational resources of Arduino, the efficient implementation developed in this work demonstrates that the Mean Opinion Score (MOS) of voice signals is consistently improved when losses are primarily affecting the least important segments. The paper also discusses technological aspects relate to the choice of the Arduino DUE platform rather than UNO, MEGA, ZERO or 101 boards.