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.
We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange state information. Since communication costs can be significant, we seek conditions under which communication of state information among nodes can be minimized while still ensuring that the optimization process converges. In prior...
Researching on delay tolerant networks is an emerging field. Many researchers are dedicated to the approach of the routing algorithms and its applications. With sufficient energy in the core-nodes in the networks, a nested source spray and wait routing algorithm, which is ameliorated from source spray and wait routing algorithm, has been put forward in this paper. The simulation results indicate that...
The continuing miniaturization of LSI dimension is causing the increase of process-related variations which significantly affects not only its design turn around time but also its manufacturing yield. Statistical static timing analysis (SSTA) is expected as a promising way to estimate the performance of circuits more accurately considering delay variations. However, LSIs designed using SSTA may have...
In this paper, a new delay-enabled EDCF for the transport of real-time traffic over an IEEE802.11e wireless LAN is proposed. The proposed technique will drop any packet belonging to a conversational class when a maximum queueing delay is reached. The packets belonging to an interactive or a background class are not dropped due to the queuing delay. The performance of this new technique is evaluated...
We propose RPROB, an infinite family of anonymous communication systems, each of which corresponds to a binomial mix. Any instance of RPROB provides resistance against global active adversary with capabilities to monitor every external activity, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB channel that concerns only global delaying adversary. Experimental...
A key challenge of message forwarding in delay tolerant networks (DTNs) is to increase delivery rate and decrease delay and cost. When information for future connectivity is not available, opportunistic routing is preferred in DTNs in which messages are forwarded opportunistic (non-deterministically) to nodes with higher delivery probabilities. Many real objects have non-deterministic but cyclic motions;...
The inherent properties of wireless sensor networks (WSN) disqualify most classic methods targeting timeliness guarantees. Assumptions of such methods as well as a restrictive notion of timeliness borrowed from classic real-time systems clash with the indeterminism of realistic scenarios. In this paper, we introduce a generalized notion of timeliness which allows to provide meaningful performance...
Nowadays, Internet congestion is indicated by dropping packets when the routers buffers are full, or by dropping packets according to an AQM mechanism such as RED. Many mechanisms have been proposed to eliminate or minimize the effect of packet loss and tackle the consequential inefficiency due the retransmission of the dropped packets. Fast congestion notification (FN), that has been evaluated through...
In wireless networks, communication links may be subject to random fatal attacks: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such circumstances, it is critical to quantify how fast and reliably information can be collected over attacked links. In our previous work, we studied such channels by considering...
Congestion in computer network happens when the number of transmission requests exceeds the transmission capacity at a certain network point (called a bottle-neck resource) at a specific time. Congestion usually causes buffers overflow and packets loss. The purpose of congestion management is to maintain a balance between the transmission requests and the transmission capacity so that the bottle-neck...
A finite-source queuing model is very useful in determining performance equations, probability of delay of users who queue for a free server when all servers are busy. The aim of this paper is to critically examine and analyze Stevens' and Sinclair's equation to show that it is a performance equation for the probability of delay in private mobile radio (PMR) systems. We analyze such an equation mathematically...
The effectiveness of queue management mechanisms relies on how good their control decisions will help in satisfying their goals regarding congestion avoidance and control. These decisions are implemented and compelled during the design of the packet mark probability and the mark activation functions. The design of fast congestion notification (FN) drop/mark probability function enables the two control...
The impact of parameter variations on components' and systems' characteristics, especially in the area of IC design, has been discussed for several years. To investigate the influence of parameter variations on system characteristics, standard Monte Carlo simulation is often used when exact results cannot be obtained using a deterministic algorithm. However, this procedure may require a huge number...
We propose XPROB, a generalized pool-based anonymous communication framework. XPROB defines a family of infinite pool-based anonymous communication systems with resistance against global active adversary (adversary with all capabilities to monitor all external activities of system, to delay and to create messages in the system). Our proposal is to solve the limitation of APROB Channel that concerns...
Many models for TCP throughput prediction were proposed in the literature. However, the first ones only considered the most common networks at that time: wired networks. Thus, these models could not predict the behavior of a network that included wireless links. Also, different link layer protocols had to be considered, resulting in different modifications of the former throughput prediction models...
We consider the quickest detection of idle periods in multiple on-off processes. At each time, only one process can be observed, and the observations are random realizations drawn from two different distributions depending on the current state (on or off) of the chosen process. Switching back to a previously visited process is allowed, and measurements obtained during previous visits are taken into...
We present a novel scalable call admission control for VoIP based on blocking probability calculation (BPC). Blocking probabilities were measured carrying VoIP for every router across the source-destination path. Ingress router selects the optimal path for the new request by calculating blocking probabilities across all source-destination paths. A simple algorithm design and evaluation results show...
The non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA...
We propose a novel tag selection algorithm to improve the efficiency of tag arbitration in RFID systems. Based on the probability that a given tag is located in the sensing range of the reader, our algorithm involves two steps. First, tags with higher probabilities are selected and directly arbitrated by their IDs, in order to eliminate the collisions caused by multiple tag replies and reduce the...
The notions of the (strongly) practical stability in probability and in the pth mean, are introduced for some large-scale stochastic systems with Markovian jump parameters and time-varying delays. Sufficient conditions on such practical properties are obtained by using the comparison principle and the Lyapunov function methods.
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.