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.
Transport networks with branching structures are observable not only in nature as in trees, blood vessels, etc. but also in efficiently designed transport systems such as used in railway configurations and postage delivery networks. Mathematically, such a branching transport network is modeled by an optimal transport path between two probability measures (representing the source and the target). An...
Delay/Disruption Tolerant Networks (DNTs) enables nodes to communicate by means of asynchronous sending messages without the need for an end-to-end path. In this paper, we study the problem of multicasting in DTNs. Several schemes have been proposed for multicast routing assuming the group of message receivers is known by sender, and the group members do not change during the process of message delivery...
In this paper a probabilistic reliability analysis approach at high confidence level is presented that employs the modeling and simulations techniques. This not only reduces the cost of testing, but also predicts the physics-of-failures, response of system and quantifies the uncertainty in loading environment. Probabilistic sensitivities may be determined to assess the relative importance of each...
In this paper, we present a simple quantizer ??Sub-optimal?? that can be applied for any probability distribution. The principle and the calculation of this quantizer are detailed. Its implementation shows that this method achieves significant results compared with other quantizer in term of mean square error distortion.
This paper deduces and analyzes the invariant set in quantum Lyapunov control, explores the principles for constructing and adjusting diagonal elements of a diagonal Lyapunov function, and achieves the convergence to any goal state in some invariant subset of closed loop systems by using dynamical system theory and energy-level connectivity graph. Research results show that if a goal state is an eigenstate...
In WSNs (Wireless Sensor Networks), a source node sends its packets via multi-hop relays to a destination node if the source node cannot communicate with the destination node directly. A destination's hop-count with respect to a source is the least number of multi-hop relays required for the source to reach it. Given a WSN whose nodes are distributed randomly according to a homogeneous Poisson point...
Message flooding has been extensively used in wireless mobile ad hoc networks for activities such as route and resource discovery. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we...
Simulation Optimization (SO) is a class of mathematical optimization techniques in which the objective function could only be numerically evaluated through simulation. In this paper, a new SO approach called Golden Region (GR) search is developed for continuous problems. GR divides the feasible region into a number of (sub) regions and selects one region in each iteration for further search based...
The validation of dependability or performance requirements is often done experimentally using simulation experiments. In several applications, the experiments have a binary output which describes whether a requirement is met or not. In highly dependable systems the probability of missing a requirement is 10-6 or below which implies that statistically significant results have to be computed for binomial...
In Mobile Ad hoc Network (MANETs), flooding is the simplest broadcasting mechanism where each node retransmits every uniquely received packet exactly once. Despite its simplicity it could potentially leads to high redundant retransmissions causing high channel contention and thus excessive packet collisions in the network. This phenomenon referred to as broadcast storm problem has been shown to greatly...
Use of simulation technique is becoming more popular in managing design process. However, developing a simulation model can be very tedious and knowledge demanding, and a simulation model developed for one project cannot readily be used for others due to the unique nature of design project. This paper develops a generalized simulation model for the design process which is capable of generating simulation...
Reinforcement learning (RL) is a simulation-based technique to solve Markov decision problems or processes (MDPs). It is especially useful if the transition probabilities in the MDP are hard to find or if the number of states in the problem is too large. In this paper, we present a new model-based RL algorithm that builds the transition probability model without the generation of the transition probabilities;...
In this paper we present a novel technology named probability dynamic relay handover (PDRH) for the benefit of providing a mechanism to recover from selective attacks on some important terminals of JTIDS. The key points of PDRH are the probability model to simulate selective attacks using the theory of scale-free network and addressing for a new relay node. In simulation based on OPNET Modeler 10...
Multistage process fault identification have received much attention recently. In this article, we focus on identifying faults in multistage processes that affect the process mean vector. The new method utilizes Bayesian theory and evaluates the posterior probability of each possible fault scenarios. The scenario associated with the largest posterior probability is identified. Numerical analysis proves...
We estimate the probability that the game of Monopoly between two players playing very simple strategies never ends. Four different estimators, based respectively on straightforward simulation, a Brownian motion approximation, asymptotics for Markov chains, and importance sampling all yield an estimate of approximately twelve percent.
Based on conventional single-threshold energy detection algorithm, we put forward a double-threshold version in cognitive radio system, and then, we analyze the detection probability, false alarm probability, miss probability and their relationships. For further research, we define two parameters for performance evaluation: the probability of collision between the cognitive user and the primary user,...
Spectrum detection technology is one of the key technologies in cognitive radio network (CRN), and its primary task is to identify the existence of spectrum holes and the appearance of authorized users. In order to meet the hard real-time and high reliable requirements of the spectrum detection in CRN, this paper presents a novel wide-band spectrum sensing algorithm, called clustering-based joint...
An important practical application of secure sensor networks is to monitor an area that may be divided into a square grid, where the sensor devices may be placed at the points of intersection with reasonable precision. In this paper, a simulation method to analyze and design such a network is discussed. The use of simulation technique is essential to determine the robustness (in terms of connectivity...
This paper focuses on the resource scheduling of LTE-Advanced system with carrier aggregation. With different fading characters, the aggregated carriers have different coverage between each other. Consequently, the carrier aggregation causes that the number of carriers which users can be scheduled on is various. The allocation fairness can not be achieved with the original proportional fair (PF) scheduling...
This paper examined the social network construction mode based on connected network component under dynamic alliance environment. We assume that firms in one industry participant in alliances dynamically and simulation results show how the alliance network factors influence the social network information sharing performance. Four propositions in a long-term and no extreme value context are built:...
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.