966 resultados para Requirement
Resumo:
Multicast in wireless sensor networks (WSNs) is an efficient way to spread the same data to multiple sensor nodes. It becomes more effective due to the broadcast nature of wireless link, where a message transmitted from one source is inherently received by all one-hop receivers, and therefore, there is no need to transmit the message one by one. Reliable multicast in WSNs is desirable for critical tasks like code updation and query based data collection. The erroneous nature of wireless medium coupled with limited resource of sensor nodes, makes the design of reliable multicast protocol a challenging task. In this work, we propose a time division multiple access (TDMA) based energy aware media access and control (TEA-MAC) protocol for reliable multicast in WSNs. The TDMA eliminates collisions, overhearing and idle listening, which are the main sources of reliability degradation and energy consumption. Furthermore, the proposed protocol is parametric in the sense that it can be used to trade-off reliability with energy and delay as per the requirement of the underlying applications. The performance of TEA-MAC has been evaluated by simulating it using Castalia network simulator. Simulation results show that TEA-MAC is able to considerably improve the performance of multicast communication in WSNs.
Resumo:
In this paper, a strategy for controlling a group of agents to achieve positional consensus is presented. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming (LP) formulation that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command that helps the agents to come close to each other even for a large number of agents, which was not possible with an existing strategy in the literature, is introduced. The method is extended to achieve positional consensus at a prespecified location. The effectiveness of the approach is illustrated through simulation results. A comparison between the LP approach and the existing second-order cone programming-based approach is also presented. The algorithm was successfully implemented on a robotic platform with three robots.
Resumo:
In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.
Resumo:
The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.
Resumo:
In the recent years there has been a considerable increase in demand for the electrical power requirement in our country. Presently the transmission system voltages has increased to 765 kV ac and 800kV dc, keeping in view of the future demand experimentation and simulation studies for 1200 kV ac and 1100kV dc transmission are under progress. In the present study an attempt is made to compute the surface potential, electric field across the string of ceramic disc insulators used for 1200kV ac systems. The studies are carried out under normal, polluted conditions and for the case of insulator string containing faulty discs. A computer code using surface charge simulation method (SCSM) is developed for the present analysis. Also a new technique which enhances the surface potential and electric field strength for the existing ceramic disc insulators is presented.
Resumo:
The nodes with dynamicity, and management without administrator are key features of mobile ad hoc networks (1VIANETs). Increasing resource requirements of nodes running different applications, scarcity of resources, and node mobility in MANETs are the important issues to be considered in allocation of resources. Moreover, management of limited resources for optimal allocation is a crucial task. In our proposed work we discuss a design of resource allocation protocol and its performance evaluation. The proposed protocol uses both static and mobile agents. The protocol does the distribution and parallelization of message propagation (mobile agent with information) in an efficient way to achieve scalability and speed up message delivery to the nodes in the sectors of the zones of a MANET. The protocol functionality has been simulated using Java Agent Development Environment (JADE) Framework for agent generation, migration and communication. A mobile agent migrates from central resource rich node with message and navigate autonomously in the zone of network until the boundary node. With the performance evaluation, it has been concluded that the proposed protocol consumes much less time to allocate the required resources to the nodes under requirement, utilize less network resources and increase the network scalability. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
Nonequilibrium calculations in the presence of an electric field are usually performed in a gauge, and need to be transformed to reveal the gauge-invariant observables. In this work, we discuss the issue of gauge invariance in the context of time-resolved angle-resolved pump/probe photoemission. If the probe is applied while the pump is still on, one must ensure that the calculations of the observed photocurrent are gauge invariant. We also discuss the requirement of the photoemission signal to be positive and the relationship of this constraint to gauge invariance. We end by discussing some technical details related to the perturbative derivation of the photoemission spectra, which involve processes where the pump pulse photoemits electrons due to nonequilibrium effects.
Resumo:
In this paper the soft lunar landing with minimum fuel expenditure is formulated as a nonlinear optimal guidance problem. The realization of pinpoint soft landing with terminal velocity and position constraints is achieved using Model Predictive Static Programming (MPSP). The high accuracy of the terminal conditions is ensured as the formulation of the MPSP inherently poses final conditions as a set of hard constraints. The computational efficiency and fast convergence make the MPSP preferable for fixed final time onboard optimal guidance algorithm. It has also been observed that the minimum fuel requirement strongly depends on the choice of the final time (a critical point that is not given due importance in many literature). Hence, to optimally select the final time, a neural network is used to learn the mapping between various initial conditions in the domain of interest and the corresponding optimal flight time. To generate the training data set, the optimal final time is computed offline using a gradient based optimization technique. The effectiveness of the proposed method is demonstrated with rigorous simulation results.
Resumo:
In this paper, we present two new stochastic approximation algorithms for the problem of quantile estimation. The algorithms uses the characterization of the quantile provided in terms of an optimization problem in 1]. The algorithms take the shape of a stochastic gradient descent which minimizes the optimization problem. Asymptotic convergence of the algorithms to the true quantile is proven using the ODE method. The theoretical results are also supplemented through empirical evidence. The algorithms are shown to provide significant improvement in terms of memory requirement and accuracy.
Resumo:
For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.
Resumo:
The boundary knot method (BKM) of very recent origin is an inherently meshless, integration-free, boundary-type, radial basis function collocation technique for the numerical discretization of general partial differential equation systems. Unlike the method of fundamental solutions, the use of non-singular general solution in the BKM avoids the unnecessary requirement of constructing a controversial artificial boundary outside the physical domain. The purpose of this paper is to extend the BKM to solve 2D Helmholtz and convection-diffusion problems under rather complicated irregular geometry. The method is also first applied to 3D problems. Numerical experiments validate that the BKM can produce highly accurate solutions using a relatively small number of knots. For inhomogeneous cases, some inner knots are found necessary to guarantee accuracy and stability. The stability and convergence of the BKM are numerically illustrated and the completeness issue is also discussed.
Resumo:
With the recent rapid growth of Radio Frequency Micro-Electro-Mechanical Systems (RF MEMS) switches, there has developed an emergent requirement for more accurate theoretical models to predict their electromechanical behaviors. Many parameters exist in the analysis of the behavior of the switch, and it is inconvenient for further study. In this paper, an improved model is introduced, considering simultaneously axial stress, residual stress, and fringing-field effect of the fixed-fixed bridge structure. To avoid any unnecessary repetitive model tests and numerical simulation for RF MEMS switches, some dimensionless numbers are derived by making governing equation dimensionless. The electromechanical behavior of the fixed-fixed bridge structure of RF MEMS switches is totally determined by these dimensionless numbers.
Resumo:
Chemical control of surface functionality and topography is an essential requirement for many technological purposes. In particular, the covalent attachment of monomeric proteins to surfaces has been the object of intense studies in recent years, for applications as varied as electrochemistry, immuno-sensing, and the production of biocompatible coatings. Little is known, however, about the characteristics and requirements underlying surface attachment of supramolecular protein nanostructures. Amyloid fibrils formed by the self-assembly of peptide and protein molecules represent one important class of such structures. These highly organized beta-sheet-rich assemblies are a hallmark of a range of neurodegenerative disorders, including Alzheimer's disease and type II diabetes, but recent findings suggest that they have much broader significance, potentially representing the global free energy minima of the energy landscapes of proteins and having potential applications in material science. In this paper, we describe strategies for attaching amyloid fibrils formed from different proteins to gold surfaces under different solution conditions. Our methods involve the reaction of sulfur containing small molecules (cystamine and 2-iminothiolane) with the amyloid fibrils, enabling their covalent linkage to gold surfaces. We demonstrate that irreversible attachment using these approaches makes possible quantitative analysis of experiments using biosensor techniques, such as quartz crystal microbalance (QCM) assays that are revolutionizing our understanding of the mechanisms of amyloid growth and the factors that determine its kinetic behavior. Moreover, our results shed light on the nature and relative importance of covalent versus noncovalent forces acting on protein superstructures at metal surfaces.
Resumo:
In the current paper, we have primarily addressed one powerful simulation tool developed during the last decades-Large Eddy Simulation (LES), which is most suitable for unsteady three-dimensional complex turbulent flows in industry and natural environment. The main point in LES is that the large-scale motion is resolved while the small-scale motion is modeled or, in geophysical terminology, parameterized. With a view to devising a subgrid-scale(SGS) model of high quality, we have highlighted analyzing physical aspects in scale interaction and-energy transfer such as dissipation, backscatter, local and non-local interaction, anisotropy and resolution requirement. They are the factors responsible for where the advantages and disadvantages in existing SGS models come from. A case study on LES of turbulence in vegetative canopy is presented to illustrate that LES model is more based on physical arguments. Then, varieties of challenging complex turbulent flows in both industry and geophysical fields in the near future-are presented. In conclusion; we may say with confidence that new century shall see the flourish in the research of turbulence with the aid of LES combined with other approaches.
Resumo:
The usual plasma spraying methods often involve entrainment of the surrounding air into the turbulent plasma core and result in coated materials having relatively high porosity and low adhesive strength. Therefore, exploration of new plasma spraying methods for fabricating high quality coatings to meet the requirement of special applications will be quite important. In this study, an alternative plasma spraying method, i.e. the low-pressure laminar plasma spraying process, is investigated and used in an attempt for spraying thermal barrier coatings (TBCs). Investigations on the characteristics of the laminar plasma jets, feeding methods for the ceramic powder and the formation process of the individual quenched splats have been carried out. The properties of the TBCs sprayed by laminar plasma jet process, such as the adhesive strength at the interface of the ceramic coating/bond coat, the surface roughness and microstructure, are examined by tensile tests and scanning electron microscope (SEM) observations.