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.
In this paper, a CMOS analog-to-digital converter (ADC) for Ultra Wide Band (UWB) applications with a 6-bit 1GSPS at 1.8 V is described. The architecture of the proposed ADC is based on a fully folded ADC using resistive interpolation technique for low power consumption. To reduce the power consumption, a folder reduction technique to decrease the number of folding blocks (NFB) is proposed. Further,...
DHT-based peer-to-peer networks represent a particular environment with specific security problems. Some types of malicious activity in this kind of networks can cause the same problems as Byzantine failure in distributed computer systems. In this work we propose to integrate solutions for Byzantine Agreement (BA) used in distributed computing environment and reputation mechanisms designed for P2P...
In a realistic sensor network, in particular with a non-uniform deployment, sensor nodes inevitably have varying workloads. This causes a natural problem that some sensor nodes are subject to excessive power consumption and thus become hot. These hot nodes deplete much earlier resulting in system performance degradation. This paper proposes a systematic approach to design a hotness-aware sensor network...
LSP path selection problem in MPLS network has been a hot research field. For unicast, there are already many algorithms to solve it, making the network more resource balanced and useable. Among these algorithms, Minimal Interference Routing Algorithm (MIRA) is the most valued one. This paper presents a novel algorithm for multicast LSP setting up problem based on MIRA, which replaces Maxflow with...
The paper describes basic principles of packet classification based on geometric classification algorithm. Packet classification is very important in IP networks for arranging different priority streams regards to importance of separate data. Our goal is oriented towards comparison abilities between geometric packet classification algorithm and algorithm based on decision trees. To be comparison procedure...
Expected growth in use and implementation of wireless sensor networks (WSNs) in different environments and for different applications creates new security challenges. In WSNs, a malicious node may initiate incorrect path information, change the contents of data packets, and even hijack one or more genuine network nodes. As the network reliability completely depends on individual nodespsila presence...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and tori. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message...
We present a simple algorithm for emulating an N processor CRCW PRAM on an N node butterfly. Each step of the PRAM is emulated in time O(log N) with high probability, using FIFO queues of size O(1) at each node. The only use of randomization is in selecting a hash function to distribute the shared address space of the PRAM onto the nodes of the butterfly. The routing itself is both deterministic and...
We present a randomized parallel algorithm for finding a simple cycle separator in a planar graph. The size of the separator is O(√n) and it separates the graph so that the largest part contains at most 2/8 ?? n vertices. Our algorithm takes T = O(log2(n)) time and P = O(n + f1+ε) processors, where n is the number of vertices, f is the number of faces and ε is any positive constant. The algorithm...
In this paper, We consider the problem of sorting n2 numbers, initially distributed randomly in an n × n mesh-connected processor array with one element per processor. We show a lower bound, based on distance arguments, of 4n routing steps on mesh-connected processors operating in an SIMD mode with no wraparounds in rows or columns, We present an algorithm using a novel approach, which is optimal...
This paper develops a new distributed BFS algorithm for an asynchronous communication network. This paper presents two new BFS algorithms with improved communication complexity. The first algorithm has complexity O((E+V1.5)??logV) in communication and O(V1.5??logV) in time. The second algorithm uses the technique of the first recursively and achieves O(E??2 √logVloglogV) in communication and O(V??2√logVloglogV)...
We establish new upper bounds on the complexity of several "rectangle" problems. Our results include, for instance, optimal algorithms for range counting and rectangle searching in two dimensions. These involve linear space implementations of range trees and segment trees. The algorithms we give are simple and practical; they can be dynamized and taken into higher dimensions. Also of interest...
As the final stage in laying out a chip, the logic of the integrated circuit is assembled into one (not necessarily rectangular) module which must then be connected to pads lying along a rectangular frame. A placement for the module must be determined to assure the feasibility of the (river) routing from the logic inside to the pads on the periphery. We first show how to solve the routing problem...
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.