Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  sensor actuator networks
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Architects of ad-hoc wireless Sensor-Actor Networks (SANETS) face various problems and challenges. The main limitations relate to aspects such as the number of sensor nodes involved, low bandwidth, management of resources and issues related to energy management. In order for these networks to be functionally proficient, the underlying software system must be able to effectively handle unreliable and dynamic distributed communication, power constraints of wireless devices, failure of hardware devices in hostile environments and the remote allocation of distributed processing tasks throughout the wireless network. The solution must be solved in a highly scalable manner. This paper provides the requirements analysis and presents the design of a software system middleware that provides a scalable solution for ad-hoc sensor network infrastructure made of both stationary and mobile sensors and actuators.
EN
Given a connection graph of entities that send and receive a flow of data controlled by effort and given the parameters, the metric tensor is computed that is in the elastic relational flow to effort. The metric tensor can be represented by the Hessian of the interaction potential. Now the interaction potential or cost function can be among two entities: 3 entities or 'N' entities and can be separated into two main parts. The first part is the repulsion potential the entities move further from the others to obtain minimum cost, the second part is the attraction potential for which the entities move near to others to obtain the minimum cost. For Pauli's model [1], the attraction potential is a functional set of parameters given from the environment (all the elements that have an influence in the module can be the attraction of one entity to another). Now the cost function can be created in a space of macro-variables or macro-states that is less of all possible variables. Any macro-variable collect a set of micro-variables or microstates. Now from the hessian of the macro-variables, the Hessian is computed of the micro-variables in the singular points as stable or unstable only by matrix calculus without any analytical computation - possible when the macro-states are distant among entities. Trivially, the same method can be obtained by a general definition of the macro-variable or macro-states and micro-states or variables. As cloud computing for Sensor-Actor Networks (SANETS) is based on the bonding concept for complex interrelated systems; the bond valence or couple corresponds to the minimum of the interaction potential V and in the SANET cloud as the minimum cost.
EN
This paper describes the adaptation of a computational technique utilizing Extended Kohonen Maps (EKMs) and Rao-Blackwell-Kolmogorov (R-B) Filtering mechanisms for the administration of Sensor-Actuator networks (SANETs). Inspired by the BDI (Belief-Desire-Intention) Agent model from Rao and Georgeff, EKMs perform the quantitative analysis of an algorithmic artificial neural network process by using an indirect-mapping EKM to self-organize, while the Rao-Blackwell filtering mechanism reduces the external noise and interference in the problem set introduced through the self-organization process. Initial results demonstrate that a combinatorial approach to optimization with EKMs and Rao-Blackwell filtering provides an improvement in event trajectory approximation in comparison to standalone cooperative EKM processes to allow responsive event detection and optimization in patient healthcare.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.