Results 1 - 10 of 1,577

Optimal Redundant Transmission for State Estimation with Packet Drops ⋆

by Girish N. Nair Alex
"... Abstract: In networked systems that suffer from data packet drops, transmitting multiple, redundant packets during each sampling interval can improve estimation performance, but at the expense of a higher communication rate. In recent work, this idea was developed to introduce the notion of a dynami ..."
Abstract - Add to MetaCart
dynamic redundant transmission policy, with Markov decision theory used to find the optimal policy numerically. The purpose of this paper is to present an alternative approach to this problem. By relaxing the integer requirement on the number of packets transmitted, it becomes possible to explicitly find

Optimal Redundant Transmission for State Estimation with Packet Drops

by Girish N. Nair, Alexandre Mesquita, Joao P. Hespanha
"... Abstract: In networked systems that suffer from data packet drops, transmitting multiple, redundant packets during each sampling interval can improve estimation performance, but at the expense of a higher communication rate. In recent work, this idea was developed to introduce the notion of a dynami ..."
Abstract - Add to MetaCart
dynamic redundant transmission policy, with Markov decision theory used to find the optimal policy numerically. The purpose of this paper is to present an alternative approach to this problem. By relaxing the integer requirement on the number of packets transmitted, it becomes possible to explicitly find

Avoidance Mechanism of Redundant Transmissions in Content Cruising System

by Takaaki Ishida
"... as a decentralized and autonomous distribution system for location-based contents. The content put into CCS carries itself to the destination location and tries to remain there by continual wireless ad-hoc communications among mobile nodes. Focusing on the density of nodes, to tackle the Broadcast S ..."
Abstract - Add to MetaCart
Storm problem is imperative. CCS has an avoid-ance mechanism of redundant transmissions constructed by cooperation of its pre-loaded algorithms, therefore CCS can avert the Broadcast Storm problem regardless of the increase in the number of nodes. Through the experiments with a network simulator

Redundancy Transmission System Based on Multidisciplinary Object Compatibility Design Optimization

by Biqiang Yu, Wei Li, Ming Zhang
"... Abstract—In studying multidisciplinary design optimization method for non-hierarchic system, Multidisciplinary Object Compatibility Design Optimization method based on simulated annealing algorithm is presented. In order to coordinate the independent optimization of subsystems, the compatibility con ..."
Abstract - Add to MetaCart
program termination and premature convergence will be avoided and ideal global optimal solution will be achieved effectually. Then the method is used in the optimization design of TR-B triple-redundancy transmission system. The multidisciplinary object compatibility design optimization model

Research Article Temporary Redundant Transmission Mechanism for SCTP Multihomed Hosts

by D. Mohana Geetha, S. K. Muthusundar, M. Subramaniam, Kathirvel Ayyaswamy
"... Copyright © 2015 D. Mohana Geetha et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In SCTP’s Concurrent Multipath Transfer, if ..."
Abstract - Add to MetaCart
Concurrent Multipath Transfer using redundant transmission (MSACMT-RTv2). Here the status of multiple paths is analyzed, initially and periodically thereafter transmitted. After examination, paths priority is assigned before transmission. One path is temporarily employed as redundant path for the failure

Adaptive Protocols for Information Dissemination in Wireless Sensor Networks

by Wendi Rabiner Heinzelman, Joanna Kulik, Hari Balakrishnan , 1999
"... In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation) , that eciently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-lev ..."
Abstract - Cited by 671 (10 self) - Add to MetaCart
-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specic knowledge of the data and upon knowledge of the resources

Effective Erasure Codes for Reliable Computer Communication Protocols

by Luigi Rizzo , 1997
"... Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to b ..."
Abstract - Cited by 470 (14 self) - Add to MetaCart
to become uncorrelated thus greatly reducing the effectiveness of retransmissions. In such cases, Forward Error Correction (FEC) techniques can be used, consisting in the transmission of redundant packets (based on error correcting codes) to allow the receivers to recover from independent packet losses

Multi-path Key Establishment for Wireless Sensor Networks Using Just Enough Redundancy Transmission

by Jing Deng, Yunghsiang S. Han
"... Abstract — In random key pre-distribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and loaded on the sensors prior to deployment. After deployment, each sensor tries to find a common key shared by itself and each of its neig ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
the secret. Unfortunately, the possibility of sensors being compromised on the path may render such establishment process insecure. In this work, we propose and analyze a Just Enough Redundancy Transmission (JERT) scheme that uses the powerful Maximum Distance Separable (MDS) codes to address the problem

On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks

by Wei Lou, et al. , 2003
"... Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NPcomp ..."
Abstract - Cited by 158 (23 self) - Add to MetaCart
is NPcomplete. Among various approximation approaches, dominant pruning [7] utilizes 2-hop neighborhood information to reduce redundant transmissions. In this paper, we analyze some deficiencies of the dominant pruning algorithm and propose two better approximation algorithms: total dominant pruning and partial

Image coding based on a fractal theory of iterated contractive image transformations

by Arnaud E. Jacquin - IEEE Trans. Image Process , 1992
"... Abstract-The conception of digital image coding techniques is of great interest in various areas concerned with the storage or transmission of images. For the past few years, there has been a tendency to combine different classical coding tech-niques in order to obtain greater coding efficiency. In ..."
Abstract - Cited by 331 (0 self) - Add to MetaCart
Abstract-The conception of digital image coding techniques is of great interest in various areas concerned with the storage or transmission of images. For the past few years, there has been a tendency to combine different classical coding tech-niques in order to obtain greater coding efficiency
Results 1 - 10 of 1,577