The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Delay/Disruption Tolerant Network (DTN) is characterized with long delay, high bit-error rate, intermittent connectivity and frequent partitions. Due to this, network coding is introduced to improve its transmission performance significantly. Numerous DTN routing algorithms based on network coding have been developed. However, they are susceptible to various malicious attacks. In this paper, we...
Network coding (NC) and erasure coding (EC) share a common principle of encoding incoming data packets at network intermediate nodes so that destination nodes can reconstruct the original data packets using a sufficient number of encoded data packets collected at the destinations. While NC in general reduces the number of packets sent through the network, EC introduces redundancy into the packet streams...
We consider the delay of network coding compared to routing for a family of simple networks with parallel links. We investigate the sub-linear term in the block delay required for unicasting n packets and show that there is an unbounded gap between network coding and routing. In particular, we show that delay benefit of network coding is scaling at least as fast as √n. The main technical contribution...
Sensor networks consist of small motes attached with sensors to measure ambient parameters like temperature, humidity and light. As these motes are unreliable due to wireless link quality and also the data measuring sensors cannot be calibrated accurately for a given applications need. The unique data fusion needs are that parameter being measured is distributed across the network and needs to be...
All high-speed Internet devices need to implement classification, i.e. they must determine whether incoming packet headers belong to a given subset of a search space. To do it, they encode the subset using ternary arrays in special high-speed devices called TCAMs (ternary content-addressable memories). However, the optimal coding for arbitrary subsets is unknown. In particular, to encode an arbitrary...
The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since communication is often the most energy consuming task for a sensor node. This paper tackles this issue by proposing an approach based on Distributed Source Coding (DSC), in which the rate assignments are adapted over time. The...
In this paper, we propose a new analytical model in order to evaluate the throughput of a wireless tandem network coding. Our analytical model is based on a multi-class open queueing network. In this model, we include two basic processes of network coding, i.e., packets combination and packets multicasting, in a suitable way considering the constraints of the queueing networks. To this end, we consider...
Energy management is the key issue in the design and operation of wireless network applications like sensor networks, pervasive computing and ubiquitous computing where the network is primarily driven by battery-powered embedded devices. This paper studies network coding as an energy minimization technique. Network coding reduces the energy consumption by minimizing the number of transmissions required...
Due to their reconfigurability and their high density of resources, SRAM-based FPGAs are more and more used in embedded systems. For some applications (Pay-TV,Banking, Telecommunication ...), a high level of security is needed. FPGAs are intrinsically sensitive to ionizing effects, such as light stimulation, and attackers can try to exploit faults injected in the downloaded configuration. Previous...
Networks on chips (NoCs) provide a mechanism for handling complex communications in the next generation of integrated circuits. At the same time, lower yield in nano-technology, makes self repair communication channels a necessity in design of digital systems. This paper proposes a reliable NoC architecture based on specific application mapped onto an NoC. This architecture is capable of recovering...
A high-speed radix-64 parallel multiplier using novel reduced delay partial product generator is proposed. The use of radix-64 Booth encoder and selector for partial product generation by Sang-Hoon (Sang-Hoon Lee et al., 2002) reduces the number of partial product rows by six fold. The Booth selector selects one among X, 2X, 3X, 4X, 8X, 16X, 24X and 32X where X is the multiplicand. Before selection...
We consider multicast network codes that allow to tradeoff throughput against cost. We construct a single code that enables the source to control the throughput, always achieving the minimum possible cost per transmitted symbol. Nodes in the network perform linear coding operations that are the same for all achievable throughput-cost pairs. On each of their outgoing edges nodes transmit either symbols...
Opportunistic routing (OR) schemes, such as ExOR, have been shown to provide significant throughput gains over traditional best-path routing schemes for wireless networks. Though the performance of OR schemes depend on the bit-rate, they currently use a fixed rate for transmitting packets. While several schemes have been proposed for selecting bit-rate for unicast transmission to a single receiver,...
Wireless network coding has been shown to reduce the number of transmissions by exploiting the broadcast nature of the wireless medium. Multiple packets may be encoded into a single packet when their respective next hops have enough information to decode them. Previous research has shown that packets belonging to different flows may be encoded (interflow coding) when they are passing through a common...
The transport capacity of a class of erasure networks with broadcast and interference constraints is studied in this paper. A memoryless network model is considered, with transmitted symbols constrained to belong to a finite field. Connections between nodes are modeled to be independent erasures, with the probability of the existence of a "link" between any two nodes decaying exponentially...
In this work we investigate the effects of multiple access interference (MAI) and polarization mode dispersion (PMD) in optical code division multiplexing (OCDM) lightpaths. These paths are determined by the data encoding with non-coherent optical orthogonal codes (OOC), using a sequence inversion keying (SIK) optical correlator system. Our results show the impact of MAI effects and PMD constraint...
Message routing strategies are given for networks with certain separator properties. These strategies use considerably less space than complete routing tables, keep node names to O(log n) bits, and still route along near-shortest paths. For any network with separators of size at most a small constant c, a total of O(n log n) items of routing information is stored, and any message is routed along a...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.