This survey gives a comprehensive review of recent advances related to the topic of VoIP QoE (Quality of user' Experience). It starts by providing some insight into the QoE arena and outlines the principal building blocks of a VoIP application. The sources of impairments over data IP networks are identified and distinguished from signal-oriented sources of quality degradation observed over telecom networks. An overview of existing subjective and objective methodologies for the assessment of the QoE of voice conversations is then presented outlining how subjective and objective speech quality methodologies have evolved to consider time-varying QoS transport networks. A description of practical procedures for measuring VoIP QoE and illustrative results is then given. Utilization methodology of several speech quality assessment frameworks is summarized. A survey of emerging single-ended parametric-model speech quality assessment algorithms dedicated to VoIP service is then given. In particular, after presenting a primitive single-ended parametric-model algorithm especially conceived for the evaluation of VoIP conversations, new artificial assessors of VoIP service are detailed. In particular, we describe speech quality assessment algorithms that consider, among others, packet loss burstiness, unequal importance of speech wave, and transient loss of connectivity. The following section concentrates on the integration of VoIP service over mobile data networks. The impact of quality-affecting phenomena, such as handovers and CODEC changeover are enumerated and some primary subjective results are summarized. The survey concludes with a review of open issues relating to automatic assessment of VoIP.
Maintenance is a core challenge in all routing protocols. The utilization of IPv6 for Low Power and Lossy Networks (6LowPAN) resulted in the recent standardization of a dedicated routing protocol called RPL (Routing Protocol for Low Power and Losy Neworks). In 6LowPAN, a critical challenge exists in decreasing packet loss under the stringent energy-efficiency mandate to increase network longevity. Moreover, the challenge of failed nodes/links, and operating in a lossy environment where connections require rapid maintenance, present significant challenges. Recent attempts at routing maintenance in RPL presented advancements in handling failures, yet under reactive mechanisms that respond to failures and attempt to reduce network down-time. In this paper we design and implement a proactive RPL (Pro-RPL) maintenance scheme that enables the network to selectively predict and mitigate failures before they impact network connectivity. In Pro-RPL we capitalize on a suffering index that is associated with RPL nodes, and monitors their tendency to result in a failure. This dynamic monitoring is decentralized in nature, and presents a conforming yardstick across RPL nodes, to eliminate overhead in implementation and potential control-traffic over the network. We evaluate the efficiency of Pro-RPL in reducing packet loss, energy consumption and extending network lifetime via extensive simulations with the Cooja Simulator over the Contiki OS.
Wireless sensor networks are now in widespread use to monitor regions, detect events and acquire information. Since the deployed nodes are separated, they need to cooperatively communicate sensed data to the base station. To maximise WSN lifetime, it is essential to minimise the number of bits sent and received by each device. To reduce the amount of sending data, an aggregation approach can be applied along the path from sensors to the sink. Data aggregation in wireless sensor networks is employed to reduce the communication overhead and prolong the network lifetime. However, an adversary may compromise some sensor nodes, and use them to forge false values as the aggregation result. In this paper two secure and energy-efficient data aggregation schemes have been proposed; these schemes can detect the malicious nodes. The goal of the algorithms used in these schemes is to ensure that the base station (BS) does not accept any forged aggregation results. The proposed two protocols present different trade-offs between computations, communication, and security and can fit a wide variety of application areas.