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 routing policy Size Interval Task Assignment (SITA) isolates small arrivals from large arrivals, while choosing intervals to balance the workload of each server. It works well for highly variable arrivals, but the isolation can cause server idle-ness. To improve this, we suggest a scheme to add pooling to these SITA-like systems, which can result in better performance. We propose a routing policy,...
Due to intermittent connectivity and uncertain node mobility, opportunistic message forwarding algorithms have been widely adopted in delay tolerant networks (DTNs). While existing work proposes practical forwarding algorithms in terms of increasing the delivery rate and decreasing data overhead, little attention has been drawn to the control overhead induced by the algorithms. The control overhead...
Dual stripline routing is more and more widely used in the modern high speed PCB design due to its cost advantage of reduced overall layer count. However, the major challenge of a successful dual stripline design is to handle the additional interferences introduced by the signals on adjacent layers. This paper studies the crosstalk effect of the dual stripline with both parallel and angled routing,...
The Vehicle Routing Problem lies at the heart of distribution management. There are several versions of the problem, and a wide variety of exact and approximate algorithms have been proposed for its solution. This paper introduces a decision-making approach for selecting the optimal number of vehicles used in solving the vehicle routing problem with (without) time conditions. To solve the VRP problem,...
The Disruption Tolerant Networks (DTNs) are especially useful in providing mission critical services such as in emergency networks or battlefield scenarios. However, DTNs are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary nodes launch blackhole attacks by dropping packets in the networks. The traditional approaches of securing routing protocols can not...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it manages the distribution of goods to make an efficient transportation system. Considering a practical application, this paper solves a vehicle routing problem with stochastic demand (VRPSD) in which the customer demand has been modeled as a stochastic variable as opposed to conventional VRP. To deal...
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...
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,...
Data aggregation is an essential paradigm for energy efficient routing in energy constraint wireless sensor networks (WSN). Data aggregation in WSN can be treated as searching for the Minimum Steiner Tree (MST) including source nodes and sink node. In this paper, we propose a Data-aggregation Algorithm based on Adaptive Ant Colony System (AACS) algorithm. In this algorithm, Directed Diffusion (DD)...
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.