scispace - formally typeset
Search or ask a question
Topic

Packet loss

About: Packet loss is a research topic. Over the lifetime, 21235 publications have been published within this topic receiving 302453 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The authors describe the IP service-level requirements for a transported video service and explain MPEG encoding to help readers better understand the impact that packet loss has on viewers' QoE.
Abstract: In this first part of a two-part article, the authors consider the network factors that impact the viewers' quality of experience (QoE) for IP-based video-streaming services such as IPTV. They describe the IP service-level requirements for a transported video service and explain MPEG encoding to help readers better understand the impact that packet loss has on viewers' QoE.

77 citations

Journal ArticleDOI
TL;DR: This work presents a system level design methodology for clustered wireless sensor networks based on a semi-random communication protocol called SERAN, a mathematical model that allows to optimize the protocol parameters, and a network initialization and maintenance procedure.
Abstract: We present a system level design methodology for clustered wireless sensor networks based on a semi-random communication protocol called SERAN, a mathematical model that allows to optimize the protocol parameters, and a network initialization and maintenance procedure. SERAN is a two-layer (routing and MAC) protocol. At both layers, SERAN combines a randomized and a deterministic approach. While the randomized component provides robustness over unreliable channels, the deterministic component avoids an explosion of packet collisions and allows our protocol to scale with network size. The combined result is a high reliability and major energy savings when dense clusters are used. Our solution is based on a mathematical model that characterizes performance accurately without resorting to extensive simulations. Thanks to this model, the user needs only to specify the application requirements in terms of end-to-end packet delay and packet loss probability, select the intended hardware platform, and the protocol parameters are set automatically to satisfy latency requirements and optimize for energy consumption.

77 citations

Journal ArticleDOI
Tie Qiu1, Xize Liu1, Lin Feng1, Yu Zhou1, Kaiyu Zheng1 
TL;DR: Simulation results show that the proposed protocol can construct a reliable tree-based network quickly and the success rate of packet in ETSP is much higher compared with ad~hoc on demand distance vector routing and destination sequenced distance vectors routing.
Abstract: Tree networks are widely applied in sensor networks of Internet of Things (IoTs). This paper proposes an efficient tree-based self-organizing protocol (ETSP) for sensor networks of IoTs. In ETSP, all nodes are divided into two kinds: network nodes and non-network nodes. Network nodes can broadcast packets to their neighboring nodes. Non-network nodes collect the broadcasted packets and determine whether to join the network. During the self-organizing process, we use different metrics, such as number of child nodes, hop, communication distance, and residual energy to reach available sink nodes’ weight; the node with max weight will be selected as a sink node. Non-network nodes can be turned into network nodes when they join the network successfully. Then, a tree-based network can be obtained one layer by one layer. The topology is adjusted dynamically to balance energy consumption and prolong network lifetime. We conduct experiments with NS2 to evaluate ETSP. Simulation results show that our proposed protocol can construct a reliable tree-based network quickly. With the network scale increasing, the self-organization time, average hop, and packet loss ratio will not increase more. Furthermore, the success rate of packet in ETSP is much higher compared with $ad~hoc$ on demand distance vector routing and destination sequenced distance vector routing.

76 citations

Proceedings ArticleDOI
01 Jan 2001
TL;DR: This work has built a wireless video system using an off-the-shelf error resilient low bit rate video codec with implementations of UDP Lite and PPP Lite, which are modifications to transport and link layer protocols respectively.
Abstract: The current generation of wireless links pose a significant challenge for sending video streams, as these links have low bit rate and high error rate compared to wired links. Sending high bit rate delay-sensitive traffic over wireless links requires appropriate error resilient video compression algorithms and transport/link layer protocols. We have built a wireless video system using an off-the-shelf error resilient low bit rate video codec with our implementations of UDP Lite and PPP Lite, which are modifications to transport and link layer protocols respectively. The flexible checksumming schemes in these protocols allow error-resilient application policies to be reflected in the networking stack. We conducted simulations and experimental evaluations of this wireless video system using quantitative performance metrics (i.e., throughput, jitter, packet loss, and end-to-end latency).

76 citations

Proceedings ArticleDOI
01 Nov 1991
TL;DR: By integrating network-control into the image data compressional algorithm, the strong interactions between the coder and the network can be exploited and the available network bandwidth can be used best.
Abstract: The advantages of packet video, constant image quality, service integration and statistical multiplexing, areovershadowed by packet loss, delay and jitter. By integrating network-control into the image data compressionalgorithm, the strong interactions between the coder and the network can be exploited and the available network bandwidth can be used best . In order to enable video transmission over today's networks without reservation orpriorities and in the presence of high packet loss rates, congestion avoidance techniques need to be employed. This isachieved through rate and flow control, where feedback from the network is used to adapt coding parameters and varythe output rate. From the coding point of view the network is seen as data buffer. Analogously to constant bit rateapplications, where a controller measures buffer fullness, we attempt to avoid network congestion (eq. buffer overflow)by monitoring the network and adapting the coding parameters in real-time. 1. INTRODUCTION

76 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
96% related
Wireless ad hoc network
49K papers, 1.1M citations
96% related
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023133
2022325
2021694
2020846
20191,033
2018993