Bibliographies thématiques / Distributed sensors networks

Littérature scientifique sur le sujet « Distributed sensors networks »

Auteur : Grafiati
Publié le 11 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Distributed sensors networks ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Distributed sensors networks"

1

Bao, Xi Rong, Yue Huang et Shi Zhang. « A Distributed Motion Algorithm for Mobile Sensor in Hybrid Wireless Sensor Networks ». Applied Mechanics and Materials 719-720 (janvier 2015) : 812–17. http://dx.doi.org/10.4028/www.scientific.net/amm.719-720.812.

Texte intégral
Résumé :
Constructing a hybrid wireless sensor networks comprising a mix of static sensors and mobile sensors can achieve a balance between improving coverage and reducing the cost of the network. In order to achieve high network coverage, mobile sensor move from a small to a big size of coverage hole in the hybrid wireless sensor networks. Due to the energy of the mobile sensor is limited, how to reduce the moving distance of the mobile sensor and reduce the energy consumption in the process of moving is a very important issue. This paper proposes a distributed minimum cost matching algorithm (DMMA) to redeploy mobile sensor, which can make the level of network coverage to meet the requirement of the environment, while effectively reducing the number of sensors. In our method, static sensors detect coverage hole by Voronoi diagrams, coverage holing sensors and mobile sensors by using DMMA to excellently heal the large coverage holes. Simulation results show that our method can effectively improve the coverage rate of the WSNs, while save the energy of mobile sensors.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Patan, Maciej. « Distributed scheduling of sensor networks for identification of spatio-temporal processes ». International Journal of Applied Mathematics and Computer Science 22, no 2 (1 juin 2012) : 299–311. http://dx.doi.org/10.2478/v10006-012-0022-9.

Texte intégral
Résumé :
Distributed scheduling of sensor networks for identification of spatio-temporal processesAn approach to determine a scheduling policy for a sensor network monitoring some spatial domain in order to identify unknown parameters of a distributed system is discussed. Given a finite number of possible sites at which sensors are located, the activation schedule for scanning sensors is provided so as to maximize a criterion defined on the Fisher information matrix associated with the estimated parameters. The related combinatorial problem is relaxed through operating on the density of sensors in lieu of individual sensor positions. Then, based on the adaptation of pairwise communication algorithms and the idea of running consensus, a numerical scheme is developed which distributes the computational burden between the network nodes. As a result, a simple exchange algorithm is outlined to solve the design problem in a decentralized fashion.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Singh, Mitali, et Viktor K. Prasanna. « A HIERARCHICAL MODEL FOR DISTRIBUTED COLLABORATIVE COMPUTATION IN WIRELESS SENSOR NETWORKS ». International Journal of Foundations of Computer Science 15, no 03 (juin 2004) : 485–506. http://dx.doi.org/10.1142/s012905410400256x.

Texte intégral
Résumé :
In-network collaborative computation is essential for implementation of a large number of sensor applications. We approach the problem of computation in sensor networks from a parallel and distributed system's perspective. We define COSMOS, the Cluster-based, heterOgeneouSMOdel for Sensor networks. The model abstracts the key features of the class of cluster-based sensor applications. It assumes a hierarchical network architecture comprising of a large number of low cost sensors with limited computation capability, and fewer number of powerful clusterheads, uniformly distributed in a two dimensional terrain. The sensors are organized into single hop clusters, each managed by a distinct clusterhead. The clusterheads are organized in a mesh-like topology. All sensors in a cluster are time synchronized, whereas the clusterheads communicate asynchronously. The sensors are assumed to have multiple power states and a wakeup mechanism to facilitate power management. To illustrate algorithm design using our model, we discuss implementation of algorithms for sorting and summing in sensor networks.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Veeravalli, Venugopal V., et Pramod K. Varshney. « Distributed inference in wireless sensor networks ». Philosophical Transactions of the Royal Society A : Mathematical, Physical and Engineering Sciences 370, no 1958 (13 janvier 2012) : 100–117. http://dx.doi.org/10.1098/rsta.2011.0194.

Texte intégral
Résumé :
Statistical inference is a mature research area, but distributed inference problems that arise in the context of modern wireless sensor networks (WSNs) have new and unique features that have revitalized research in this area in recent years. The goal of this paper is to introduce the readers to these novel features and to summarize recent research developments in this area. In particular, results on distributed detection, parameter estimation and tracking in WSNs will be discussed, with a special emphasis on solutions to these inference problems that take into account the communication network connecting the sensors and the resource constraints at the sensors.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Zareei, Mahdi, Cesar Vargas-Rosales, Mohammad Hossein Anisi, Leila Musavian, Rafaela Villalpando-Hernandez, Shidrokh Goudarzi et Ehab Mahmoud Mohamed. « Enhancing the Performance of Energy Harvesting Sensor Networks for Environmental Monitoring Applications ». Energies 12, no 14 (20 juillet 2019) : 2794. http://dx.doi.org/10.3390/en12142794.

Texte intégral
Résumé :
Fast development in hardware miniaturization and massive production of sensors make them cost efficient and vastly available to be used in various applications in our daily life more specially in environment monitoring applications. However, energy consumption is still one of the barriers slowing down the development of several applications. Slow development in battery technology, makes energy harvesting (EH) as a prime candidate to eliminate the sensor’s energy barrier. EH sensors can be the solution to enabling future applications that would be extremely costly using conventional battery-powered sensors. In this paper, we analyze the performance improvement and evaluation of EH sensors in various situations. A network model is developed to allow us to examine different scenarios. We borrow a clustering concept, as a proven method to improve energy efficiency in conventional sensor network and brought it to EH sensor networks to study its effect on the performance of the network in different scenarios. Moreover, a dynamic and distributed transmission power management for sensors is proposed and evaluated in both networks, with and without clustering, to study the effect of power balancing on the network end-to-end performance. The simulation results indicate that, by using clustering and transmission power adjustment, the power consumption can be distributed in the network more efficiently, which result in improving the network performance in terms of a packet delivery ratio by 20%, 10% higher network lifetime by having more alive nodes and also achieving lower delay by reducing the hop-count.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ramezani, Tayebeh, et Tahereh Ramezani. « A Distributed Method to Reconstruct Connection in Wireless Sensor Networks by Using Genetic Algorithm ». Modern Applied Science 10, no 6 (10 avril 2016) : 50. http://dx.doi.org/10.5539/mas.v10n6p50.

Texte intégral
Résumé :
In recent years most of the research in the field of sensor networks is allocated to the wireless sensor and actor networks due to their complicacy and vastness of research area. This type of network is a group of sensors and actors wirelessly linked to each other. Sensors gather information of physical world while actors take appropriate decisions on the basis of gathered information and then perform proper actions upon the environment. In wireless sensor and actor networks, it is very important to maintain the connection between actors. Failure of one or more actors can break up the network into separated parts and this failure acts as a barrier to the network to perform its duties. The purpose of the present paper was to provide a genetic algorithm in wireless sensor and actor networks, to improve evaluation and to maintain the connection between actors’ networks. In order to evaluate strong points and weaknesses of the recommended approach, the OMNet++ simulation was used and the outcomes of the simulation were indicative of the recommended approach’s validity.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Shin, Huicheol, Yongjae Kim, Seungjae Baek et Yujae Song. « Distributed Learning for Dynamic Channel Access in Underwater Sensor Networks ». Entropy 22, no 9 (7 septembre 2020) : 992. http://dx.doi.org/10.3390/e22090992.

Texte intégral
Résumé :
In this study, the problem of dynamic channel access in distributed underwater acoustic sensor networks (UASNs) is considered. First, we formulate the dynamic channel access problem in UASNs as a multi-agent Markov decision process, wherein each underwater sensor is considered an agent whose objective is to maximize the total network throughput without coordinating with or exchanging messages among different underwater sensors. We then propose a distributed deep Q-learning-based algorithm that enables each underwater sensor to learn not only the behaviors (i.e., actions) of other sensors, but also the physical features (e.g., channel error probability) of its available acoustic channels, in order to maximize the network throughput. We conduct extensive numerical evaluations and verify that the performance of the proposed algorithm is similar to or even better than the performance of baseline algorithms, even when implemented in a distributed manner.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Aerts, Sam, Günter Vermeeren, Matthias Van den Bossche, Reza Aminzadeh, Leen Verloock, Arno Thielens, Philip Leroux et al. « Lessons Learned from a Distributed RF-EMF Sensor Network ». Sensors 22, no 5 (22 février 2022) : 1715. http://dx.doi.org/10.3390/s22051715.

Texte intégral
Résumé :
In an increasingly wireless world, spatiotemporal monitoring of the exposure to environmental radiofrequency (RF) electromagnetic fields (EMF) is crucial to appease public uncertainty and anxiety about RF-EMF. However, although the advent of smart city infrastructures allows for dense networks of distributed sensors, the costs of accurate RF sensors remain high, and dedicated RF monitoring networks remain rare. This paper describes a comprehensive study comprising the design of a low-cost RF-EMF sensor node capable of monitoring four frequency bands used by wireless telecommunications with an unparalleled temporal resolution, its application in a small-scale distributed sensor network consisting of both fixed (on building façades) and mobile sensor nodes (on postal vans), and the subsequent analysis of over a year of data between January 2019 and May 2020, during which slightly less than 10 million samples were collected. From the fixed nodes’ results, the potential errors were determined that are induced when sampling at lower speeds (e.g., one sample per 15 min) and measuring for shorter periods of time (e.g., a few weeks), as well as an adequate resolution (30 min) for diurnal and weekly temporal profiles which sufficiently preserves short-term variations. Furthermore, based on the correlation between the sensors, an adequate density of 100 sensor nodes per km2 was deduced for future networks. Finally, the mobile sensor nodes were used to identify potential RF-EMF exposure hotspots in a previously unattainable area of more than 60 km2. In summary, through the analysis of a small number of RF-EMF sensor nodes (both fixed and mobile) in an urban area, this study offers invaluable insights applicable to future designs and deployments of distributed RF-EMF sensor networks.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Zhao, Bingya, et Ya Zhang. « Transmission rate conditions for distributed filtering in sensor networks against eavesdropper ». Transactions of the Institute of Measurement and Control 43, no 12 (25 avril 2021) : 2757–67. http://dx.doi.org/10.1177/01423312211005607.

Texte intégral
Résumé :
This paper studies the distributed secure estimation problem of sensor networks (SNs) in the presence of eavesdroppers. In an SN, sensors communicate with each other through digital communication channels, and the eavesdropper overhears the messages transmitted by the sensors over fading wiretap channels. The increasing transmission rate plays a positive role in the detectability of the network while playing a negative role in the secrecy. Two types of SNs under two cooperative filtering algorithms are considered. For networks with collectively observable nodes and the Kalman filtering algorithm, by studying the topological entropy of sensing measurements, a sufficient condition of distributed detectability and secrecy, under which there exists a code–decode strategy such that the sensors’ estimation errors are bounded while the eavesdropper’s error grows unbounded, is given. For collectively observable SNs under the consensus Kalman filtering algorithm, by studying the topological entropy of the sensors’ covariance matrices, a necessary condition of distributed detectability and secrecy is provided. A simulation example is given to illustrate the results.
Styles APA, Harvard, Vancouver, ISO, etc.
10

WANG, BANG. « SENSOR PLACEMENT FOR COMPLETE INFORMATION COVERAGE IN DISTRIBUTED SENSOR NETWORKS ». Journal of Circuits, Systems and Computers 17, no 04 (août 2008) : 627–36. http://dx.doi.org/10.1142/s0218126608004575.

Texte intégral
Résumé :
The sensor placement problem for complete information coverage in a distributed sensor network is studied. Sensors are assumed to be placed on the grid points of a grid in the sensor field and complete information coverage is claimed if all the grid points are information covered. This sensor placement problem is formulated as a constrained optimization problem where the objective is to minimize the total cost while guaranteeing certain coverage requirement. We propose a greedy algorithm to solve this problem. Computational results show that the proposed algorithm can efficiently obtain a good quality solution with greatly reduced computation complexity and the number of sensors can be greatly reduced for information coverage.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Distributed sensors networks"

1

Mehrotra, Shashank. « Distributed Algorithms for Tasking Large Sensor Networks ». Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33975.

Texte intégral
Résumé :
Recent advances in wireless communications along with developments in low-power circuit design and micro-electro mechanical systems (MEMS) have heralded the advent of compact and inexpensive wireless micro-sensor devices. A large network of such sensor nodes capable of communicating with each other provides significant new capabilities for automatically collecting and analyzing data from physical environments. A notable feature of these networks is that more nodes than are strictly necessary may be deployed to cover a given region. This permits the system to provide reliable information, tolerate many types of faults, and prolong the effective service time. Like most wireless systems, achieving low power consumption is a key consideration in the design of these networks. This thesis presents algorithms for managing power at the distributed system level, rather than just at the individual node level. These distributed algorithms allocate work based on user requests to the individual sensor nodes that comprise the network. The primary goal of the algorithms is to provide a robust and scalable approach for tasking nodes that prolongs the effective life of the network. Theoretical analysis and simulation results are presented to characterize the behavior of these algorithms. Results obtained from simulation experiments indicate that the algorithms can achieve a significant increase in the life of the network. In some cases this may be by an order of magnitude. The algorithms are also shown to ensure a good quality of sensor coverage while improving the network life. Finally, they are shown to be robust to faults and scale to large numbers of nodes.
Master of Science
Styles APA, Harvard, Vancouver, ISO, etc.
2

Wang, Yu. « A Low-Complexity Distributed Architecture for Wireless Sensors Networks ». Thesis, University of Essex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504839.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Feitosa, Allan Eduardo. « Classification techniques for adaptive distributed networks and aeronautical structures ». Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-05022019-104746/.

Texte intégral
Résumé :
This master thesis is the result of a collaborative work between EMBRAER and the Escola Politécnica da USP for the study of structural health monitoring (SHM) techniques using sensors applied to aircraft structures. The goal was to develop classification techniques to discriminate between different events arising in the aircraft structure during tests; in the short term, improving the current SHM system used by EMBRAER, based on acoustic emission and, in the long term, fostering the development of a fully distributed system. As a result of studying classification methods for immediate use, we developed two techniques: the Spectral Similarity and a Support Vector Machines (SVM) classifier. Both are unsupervised solutions, due to the unlabeled nature of the data provided. The two solutions were delivered as a final product to EMBRAER for prompt use in the existing SHM system. By studying distributed solutions for future implementations, we developed a detection algorithm based on adaptive techniques. The main result was a special initialization for a maximum likelihood (ML) detector that yields an exponential decay rate in the error probability to a nonzero steady state, using adaptive diffusion estimation in a distributed sensor network. The nodes that compose the network must decide, locally, between two concurrent hypotheses concerning the environment state where they are inserted, using local measurements and shared estimates coming from their neighbors. The exponential performance does not depend on the adaptation step size value, provided it is sufficiently small. The results concerning this distributed detector were published in the journal IEEE Signal Processing Letters.
Esta dissertação de mestrado é o resultado de um trabalho colaborativo entre a EMBRAER e a Escola Politécnica da USP no estudo de técnicas de monitoramento do estado de saúde de estruturas (Structural Health Monitoring - SHM) utilizando sensores em estruturas aeronáuticas. O objetivo foi desenvolver técnicas de classificação para discriminar entre diferentes eventos que surgem em estruturas aeronáuticas durante testes; para o curto prazo, aperfeiçoando o atual sistema de SHM utilizado pela EMBRAER, baseado em emissão acústica e, no longo prazo, fomentando o desenvolvimento de um sistema completamente distribuído. Como resultado do estudo de métodos de classificação para uso imediato, desenvolvemos duas técnicas: a Similaridade Espectral e um classificador que utiliza Support Vector Machines (SMV). Ambas as técnicas são soluções não-supervisionadas, devido a natureza não rotulada dos dados fornecidos. As duas soluções foram entregues como um produto final para a EMBRAER para pronta utilização em seu atual sistema de SHM. Ao estudar soluções completamente distribuídas para futuras implementações, desenvolvemos um algoritmo de detecção baseado em técnicas adaptativas. O principal resultado foi uma inicialização especial para um detector de máxima verossimilhança (maximum likelihood - ML) que possui uma taxa de decaimento exponencial na probabilidade de erro até um valor não nulo em regime estacionário, utilizando estimação adaptativa em uma rede distribuída. Os nós que compõem a rede devem decidir, localmente, entre duas hipóteses concorrentes com relação ao estado do ambiente onde eles estão inseridos, utilizando medidas locais e estimativas compartilhadas vindas de nós vizinhos. O desempenho exponencial não depende do valor do passo de adaptação, se este for suficientemente pequeno. Os resultas referentes a este detector distribuído foram publicados na revista internacional IEEE Signal Processing Letters.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Chatterjea, Supriyo. « Distributed and self-organizing data management strategies for wireless sensors networks a cross-layered approach / ». Enschede : University of Twente [Host], 2008. http://doc.utwente.nl/59799.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Karaaslan, Ibrahim. « Anti-sensor Network : Distortion-based Distributed Attack In Wireless Sensor Networks ». Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609276/index.pdf.

Texte intégral
Résumé :
In this thesis, a novel anti-sensor network paradigm is introduced against wireless sensor networks (WSN). Anti-sensor network (ASN) aims to destroy application reliability by adaptively and anonymously introducing adequate level of artificial distortion into the communication of the event features transported from the sensor nodes (SN) to the sink. ASN is composed of anti-sensor nodes (aSN) randomly distributed over the sensor network field. aSNs pretend to be SNs tomaintain anonymity and so improve resiliency against attack detection and prevention mechanisms. Performance evaluations via mathematical analysis and simulation experiments show that ASN can effectively reduce the application reliability of WSN.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Murukesvan, Abhinash. « Distributed Overlays in Wireless Sensor Networks ». Thesis, KTH, Kommunikationssystem, CoS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92202.

Texte intégral
Résumé :
This thesis investigates two architectures and compares their suitability for selective application and user differentiation in sensor networks. A hierarchical architecture consisting of more capable cluster heads surrounded by weaker nodes is compared to a flat architecture of equally powerful nodes. In both architectures there exists a logical overlay network that connects the nodes, depending on the application and user. Furthermore, a broadcast encryption scheme is proposed to aid in distributing keys to nodes for secure communication and to maintain these restricted groups.
applikation och användar differentiering i trådlösa sensor nätverk. En hierarkisk arkitekturbestående av kraftfullare sensor noder omgiven av mindre kraftfulla sensor noder jämförsmed en platt arkitektur bestående av lika kraftfulla sensor noder. I båda arkitekturer existerarett logiskt lager ovanpå stacken som kopplar noder beroende på applikation och användare,helt oberoende av geografisk placering. Utöver det, bör en nyckel management schema användas till att distribuera nycklar tillnoderna för säker kommunikation och att bibehålla dessa slutna grupper.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Lin, Erwei Kam Moshe. « Detection in distributed sensor networks / ». Philadelphia, Pa. : Drexel University, 2005. http://hdl.handle.net/1860/1303.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Gao, Huaien. « Distributed learning in sensor networks ». Diss., lmu, 2009. http://nbn-resolving.de/urn:nbn:de:bvb:19-96120.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

MORBEE, MARLEEN. « Optimized information processing in resource-constrained vision systems. From low-complexity coding to smart sensor networks ». Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/12126.

Texte intégral
Résumé :
Vision systems have become ubiquitous. They are used for traffic monitoring, elderly care, video conferencing, virtual reality, surveillance, smart rooms, home automation, sport games analysis, industrial safety, medical care etc. In most vision systems, the data coming from the visual sensor(s) is processed before transmission in order to save communication bandwidth or achieve higher frame rates. The type of data processing needs to be chosen carefully depending on the targeted application, and taking into account the available memory, computational power, energy resources and bandwidth constraints. In this dissertation, we investigate how a vision system should be built under practical constraints. First, this system should be intelligent, such that the right data is extracted from the video source. Second, when processing video data this intelligent vision system should know its own practical limitations, and should try to achieve the best possible output result that lies within its capabilities. We study and improve a wide range of vision systems for a variety of applications, which go together with different types of constraints. First, we present a modulo-PCM-based coding algorithm for applications that demand very low complexity coding and need to preserve some of the advantageous properties of PCM coding (direct processing, random access, rate scalability). Our modulo-PCM coding scheme combines three well-known, simple, source coding strategies: PCM, binning, and interpolative coding. The encoder first analyzes the signal statistics in a very simple way. Then, based on these signal statistics, the encoder simply discards a number of bits of each image sample. The modulo-PCM decoder recovers the removed bits of each sample by using its received bits and side information which is generated by interpolating previous decoded signals. Our algorithm is especially appropriate for image coding.
Morbee, M. (2011). Optimized information processing in resource-constrained vision systems. From low-complexity coding to smart sensor networks [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/12126
Palancia
Styles APA, Harvard, Vancouver, ISO, etc.
10

Boschian, Valentina. « Models and Methods for Multi-Actor Systems ». Doctoral thesis, Università degli studi di Trieste, 2012. http://hdl.handle.net/10077/7431.

Texte intégral
Résumé :
2010/2011
The study of the models and methods to apply to multi-actor systems is a widely discussed research topic in the related scientific literature. The multi-actor systems are defined as systems that are characterized by the presence of several autonomous elements, of different decision makers and of complex rules that allow the communication, the coordination and the connection of the components of such systems. Commonly, the study of Multi-Actor System, MAS, recalls the well-known issues concerning the multi-agent systems. The research topic related to the multi-agent system firstly started to appear in scientific literature in 1980s, mainly in relation to the computer science and artificial intelligence. In this dissertation, in particular, the study of the multi-agent systems, and specifically of the multi-actor systems, is taken into account merely in relation to the distinctive features of complexity that characterize such systems and not to the issues concerning the agent-oriented software engineering. Therefore, the research results presented in this thesis are focused on the development and on the realization of innovative models and methodologies to face the management and the decision making mechanisms applied to complex multi-actor systems. This dissertation especially focuses on two different examples of multi-actor systems in two very diverse perspectives. The former deals with the research problem related to intermodal transportation networks, while the latter with the so called consensus problem in distributed networks of agents. Concerning the research problem related to the intermodal logistic systems, the research activity addresses the management of their more and more increasing complexity by the applications of the modern Information and Communication Technologies (ICT) tools that are key solutions to achieve the efficiency and to enhance logistics competitiveness. The related scientific literature still seems lacking in addressing with adequate attention the impact of these new techniques on the management of these complex systems and, moreover, there is an apparent lack of a systematic and general methodology to describe in detail the multiplicity of elements that can influence the dynamics and the corresponding information and decision making structure of intermodal transportation systems. The innovative results presented in this dissertation are focused on the development of an Integrated System, IS, devoted to manage intermodal transportation networks at the tactical as well as operational decision level to be used by decision makers both in off-line planning and real time management. To specify the Integrated System, a reference model is developed relying on a top-down metamodeling procedure. These innovative research results are a contribution to bridge the gap and to propose not only a systematic modeling approach devoted to describe a generic multi-actor logistic system, but also a management technique based on a closed loop strategy. The second example of application is focused on a topic that is widely discussed in scientific literature related to the study of the multi-actor collective behaviors in a distributed network. The interaction protocols that allow the agents to reach the convergence to a common value is called consensus or agreement problem. This research problem is particularly studied in the context of cooperative control of multi-agent systems because the agents are autonomous, independent and have to interact in a distributed network. The presented research results address the investigation of new and fast alignment protocols that enhance the performances of the standard iteration protocols for particular topologies of digraphs on the basis of a triangular splitting of the standard iteration matrix. The examined examples, the models and the methodologies applied to analyze them, are very different in the two cases and this testifies the large extent of research problems related to the multi-actor systems.
L’analisi di modelli e metodi da sviluppare e da applicare nel contesto dei sistemi multi-attoriali costituisce un tema molto variegato e discusso nella letteratura scientifica internazionale. I sistemi multi-attoriali sono sistemi che si contraddistinguono per la presenza di molti elementi autonomi diversi tra loro, di molteplici decisori e di complesse regole che determinano la comunicazione, il coordinamento e la connessione all'interno di tali sistemi. Frequentemente, facendo riferimento a sistemi multi-attoriali, Multi-Actor Systems, si richiama il tema molto attuale dei sistemi multi agente, Multi-Agent Systems. Diffusisi a partire dal 1980, i sistemi multi agente sono spesso studiati in relazione alle metodologie di sviluppo dell'ingegneria del software. Nel presente lavoro di tesi, il tema dei sistemi multi-agente, ed in particolare di quelli multi-attoriali, non viene analizzato in questo contesto, ma in relazione alle tecniche decisionali da adottare per gestire sistemi caratterizzati da un alto livello di complessità. In tale ambito, i risultati presentati all'interno di questa dissertazione sono focalizzati sullo sviluppo e sulla realizzazione di nuovi metodi e di nuove metodologie, in grado di affrontare la gestione della complessità dei sistemi multi-attoriali. Vengono in particolare esaminate due diverse problematiche, in due contesti completamente diversi e con tecniche differenti, a testimoniare le vaste applicazioni che riguardano i sistemi multi-attoriali. I problemi analizzati sono incentrati, in primo luogo, su un'applicazione inerente la gestione di sistemi logistici intermodali ed, in secondo luogo, sullo studio delle regole o protocolli di interazione in una rete distribuita di agenti autonomi. Per quanto riguarda l'aspetto legato ai sistemi intermodali di trasporto, un tema molto discusso nella letteratura scientifica recente, l'analisi si focalizza sulla gestione della loro sempre crescente complessità, tramite l'utilizzo di sistemi dell'Information and Communication Technology, ICT. Questi strumenti richiedono metodi e modelli che sono innovativi rispetto a quanto è presente nella letteratura scientifica, all'interno della quale è stata riscontrata la mancanza di un approccio sistematico e sufficientemente ad alto livello per la realizzazione di una metodologia in grado di descrivere allo stesso tempo sia la molteplicità di elementi che influenzano le dinamiche e le informazioni, sia le strutture decisionali dei sistemi intermodali. L'innovazione dei risultati presentati in questa tesi si focalizza proprio sull'esigenza di proporre un sistema integrato, Integrated System (IS), basato su un metamodello delle reti intermodali di trasporto, che fornisca un valido supporto ai decisori sia a livello tattico che operativo. Il secondo aspetto affrontato in questa tesi riguarda un altro argomento di largo ed attuale interesse nella letteratura scientifica, che viene comunemente chiamato problema del consenso. Questo problema affronta lo studio di come diversi agenti autonomi collocati su una rete distribuita siano in grado di comunicare e di accordarsi su un valore comune, senza la presenza di un decisore centrale. A questo scopo ci sono degli algoritmi che specificano le regole o protocolli di interazione tra i diversi agenti. In tale contesto, i risultati proposti si focalizzano su alcune problematiche rappresentate dal protocollo classico del consenso e soprattutto sulla sua scarsa efficienza in particolari conformazioni delle reti di agenti. Il lavoro di tesi propone, quindi, un approccio di suddivisione, splitting, della matrice standard di iterazione, di tipo triangolare, che presenta notevoli vantaggi in termini di performance rispetto all'algoritmo classico. Lo studio di problemi multi-attoriali, pertanto, richiede lo sviluppo di innovative metodologie decisionali e di nuovi metodi di gestione delle comunicazioni, per rispondere al livello sempre crescente di complessità, offrendo in questo modo alcuni spunti molto interessanti per la ricerca.
XXIV Ciclo
1984
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Distributed sensors networks"

1

Distributed sensor networks. 2e éd. Boca Raton : Chapman and Hall/CRC, 2013.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

N, Kulchin Yuri, Society of Photo-optical Instrumentation Engineers. Russian Chapter. et Society of Photo-optical Instrumentation Engineers., dir. Distributed fiber optical sensors and measuring networks : Selected papers on distributed fiber optical sensors and measuring networks, 1999-2000. Bellingham, Wash : SPIE, 2001.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Lesser, Victor, Charles L. Ortiz et Milind Tambe, dir. Distributed Sensor Networks. Boston, MA : Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0363-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bhanu, Bir, Chinya V. Ravishankar, Amit K. Roy-Chowdhury, Hamid Aghajan et Demetri Terzopoulos, dir. Distributed Video Sensor Networks. London : Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-127-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Distributed video sensor networks-research challenges and future directions workshop (2009 : Riverside, Calif.), dir. Distributed video sensor networks. London : Springer, 2011.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Distributed sensor networks : Sensor networking and applications. 2e éd. Boca Raton : Chapman & Hall/CRC, 2013.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

name, No. Distributed sensor networks : A multiagent perspective. Boston, MA : Kluwer Academic Publishers, 2003.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Iyengar, Sitharama S., Kianoosh G. Boroojeni et N. Balakrishnan. Mathematical Theories of Distributed Sensor Networks. New York, NY : Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4419-8420-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Lesser, Victor. Distributed Sensor Networks : A Multiagent Perspective. Boston, MA : Springer US, 2003.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Victor, Lesser, Ortiz Charles L et Tambe Milind 1965-, dir. Distributed sensor networks : A multiagent perspective. Boston : Kluwer Academic Publishers, 2003.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "Distributed sensors networks"

1

Sastry, Srikanth, Tsvetomira Radeva, Jianer Chen et Jennifer L. Welch. « Reliable Networks with Unreliable Sensors ». Dans Distributed Computing and Networking, 281–92. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17679-1_25.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Hsu, Yin-Chung, Yen-Ting Chen et Chiu-Kuo Liang. « Distributed Coverage-Enhancing Algorithms in Directional Sensor Networks with Rotatable Sensors ». Dans Distributed Computing and Networking, 201–13. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25959-3_15.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Bartos, Karel, et Martin Rehak. « Distributed Self-organized Collaboration of Autonomous IDS Sensors ». Dans Dependable Networks and Services, 113–17. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30633-4_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Cecílio, José, et Pedro Furtado. « Planning for Distributed Control Systems with Wired and Wireless Sensors ». Dans Computer Communications and Networks, 67–82. Cham : Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02889-7_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Leone, Pierre, Sotiris Nikoletseas et José Rolim. « An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks ». Dans Distributed Computing in Sensor Systems, 35–48. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11502593_6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Cecílio, José, et Pedro Furtado. « Latency Modeling for Distributed Control Systems with Wired and Wireless Sensors ». Dans Computer Communications and Networks, 51–66. Cham : Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02889-7_6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Wright, Rebecca N., Zhiqiang Yang et Sheng Zhong. « Distributed Data Mining Protocols for Privacy : A Review of Some Recent Results ». Dans Secure Mobile Ad-hoc Networks and Sensors, 67–79. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11801412_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Kieffer, Michel. « Distributed Bounded-Error Parameter and State Estimation in Networks of Sensors ». Dans Numerical Validation in Current Hardware Architectures, 189–202. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01591-5_12.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Liu, Guiyun, Jing Yao, Hongbin Chen, Han Zhang et Dong Tang. « Symmetric Game for Distributed Estimation in Energy Harvesting Wireless Sensor Networks with Selfish Sensors ». Dans Algorithms and Architectures for Parallel Processing, 344–52. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27161-3_30.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Ghorbel, Oussama, Mohamed Wassim Jmal, Mohamed Abid et Hichem Snoussi. « Distributed and Efficient One-Class Outliers Detection Classifier in Wireless Sensors Networks ». Dans Lecture Notes in Computer Science, 259–73. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22572-2_19.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Distributed sensors networks"

1

Licht, Torsten, et Abhijit Deshmukh. « Hierarchically Organized Bayesian Networks for Distributed Sensor Networks ». Dans ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-33217.

Texte intégral
Résumé :
As sensor hardware becomes more sophisticated, smaller in size and increasingly affordable, use of large scale sensor networks is bound to become a reality in several application domains, such as vehicle condition monitoring, environmental sensing and security assessment. The ability to incorporate communication and decision capabilities in individual or groups of sensors, opens new opportunities for distributed sensor networks to monitor complex engineering systems. In such large scale sensor networks, the ability to integrate observations or inferences made by distributed sensors into a single hypothesis about the state of the system is critical. This paper addresses the sensor integration issue in hierarchically organized sensor networks. We propose a multi-agent architecture for distributed sensor networks. We present a new formalism to represent causal relations and prior beliefs of hierarchies of sensors, called Hierarchically Organized Bayesian Networks (HOBN), which is a semantic extension of Multiply Sectioned Bayesian Networks (MSBN). This formalism allows a sensor to reason about the integrity of a sensed signal or the integrity of neighboring sensors. Furthermore, we can also evaluate the consistency of local observations with respect to the knowledge of the system gathered up to that point.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Davies, D. E. N. « Optical Fibre Distributed Sensors And Sensor Networks ». Dans 1985 International Technical Symposium/Europe, sous la direction de Herve J. Arditti et Luc B. Jeunhomme. SPIE, 1986. http://dx.doi.org/10.1117/12.951137.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Munteanu, Adrian, Eli De Poorter et Leander Hendrikx. « Distributed barcode tracking in visual sensor networks ». Dans 2017 IEEE SENSORS. IEEE, 2017. http://dx.doi.org/10.1109/icsens.2017.8234160.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Tolba, Fatiha Djemili, Wessam Ajib et Abdellatif Obaid. « Distributed clustering algorithm for mobile wireless sensors networks ». Dans 2013 IEEE Sensors. IEEE, 2013. http://dx.doi.org/10.1109/icsens.2013.6688565.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Wu, Zekun, Qirui Wang, Andrei V. Gribok et Kevin P. Chen. « Pipeline Degradation Evaluation Based on Distributed Fiber Sensors and Convolutional Neural Networks (CNNs) ». Dans Optical Fiber Sensors. Washington, D.C. : Optica Publishing Group, 2022. http://dx.doi.org/10.1364/ofs.2022.w4.41.

Texte intégral
Résumé :
We present a machine learning method to analyze data harnessed by distributed fiber sensors for pipeline monitoring. Convolutional neural networks are used to identify and classify pipeline internal defects with 99% and 94% accuracy, respectively.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Mao Ching Foo, Hock Beng Lim, Y. Zeng, Vinh The Lam, R. Teo et Gee Wah Ng. « Impact of Distributed Resource Allocation in Sensor Networks ». Dans 2005 International Conference on Intelligent Sensors, Sensor Networks and Information Processing. IEEE, 2005. http://dx.doi.org/10.1109/issnip.2005.1595558.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Zhang, Zaixuan, Insoo S. Kim, Jianfeng Wang, Haiqi Feng, Ning Guo, Xiangdong Yu, Honglin Liu, Xiaobiao Wu et Yohee Kim. « Distributed optical fiber sensors system and networks ». Dans Distributed Fiber Optical Sensors and Measuring Networks, sous la direction de Yuri N. Kulchin. SPIE, 2001. http://dx.doi.org/10.1117/12.417885.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Garcia Morchon, Oscar, et Heribert Baldus. « Efficient distributed security for wireless medical sensor networks ». Dans 2008 International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP). IEEE, 2008. http://dx.doi.org/10.1109/issnip.2008.4761995.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Kardan, Ahmad, et Mohammad Kajbaf. « Distributed Broadcast Minimum Spanning Tree (reliable version) ». Dans 2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information. IEEE, 2007. http://dx.doi.org/10.1109/issnip.2007.4496925.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Qi Hao, Fei Hu et Jiang Lu. « Distributed multiple human tracking with wireless binary pyroelectric infrared (PIR) sensor networks ». Dans 2010 Ninth IEEE Sensors Conference (SENSORS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icsens.2010.5690895.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Distributed sensors networks"

1

Ratmanski, Kiril, et Sergey Vecherin. Resilience in distributed sensor networks. Engineer Research and Development Center (U.S.), octobre 2022. http://dx.doi.org/10.21079/11681/45680.

Texte intégral
Résumé :
With the advent of cheap and available sensors, there is a need for intelligent sensor selection and placement for various purposes. While previous research was focused on the most efficient sensor networks, we present a new mathematical framework for efficient and resilient sensor network installation. Specifically, in this work we formulate and solve a sensor selection and placement problem when network resilience is also a factor in the optimization problem. Our approach is based on the binary linear programming problem. The generic formulation is probabilistic and applicable to any sensor types, line-of-site and non-line-of-site, and any sensor modality. It also incorporates several realistic constraints including finite sensor supply, cost, energy consumption, as well as specified redundancy in coverage areas that require resilience. While the exact solution is computationally prohibitive, we present a fast algorithm that produces a near-optimal solution that can be used in practice. We show how such formulation works on 2D examples, applied to infrared (IR) sensor networks designed to detect and track human presence and movements in a specified coverage area. Analysis of coverage and comparison of sensor placement with and without resilience considerations is also performed.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Lacoss, Richard T. Distributed Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, septembre 1986. http://dx.doi.org/10.21236/ada204719.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Lacoss, Richard T. Distributed Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, septembre 1985. http://dx.doi.org/10.21236/ada163866.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Lacoss, Richard T. Distributed Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, mars 1986. http://dx.doi.org/10.21236/ada176132.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Lee, A. P., C. F. McConaghy, J. N. Simon, W. Benett, L. Jones et J. Trevino. Sensor modules for wireless distributed sensor networks. Office of Scientific and Technical Information (OSTI), février 1999. http://dx.doi.org/10.2172/15005723.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Park, Vincent D., et Joseph P. Macker. Protocol Considerations for Distributed Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, décembre 2000. http://dx.doi.org/10.21236/ada389300.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Raghavendra, Cauligi S., et Viktor K. Prasanna. Distributed Signal Processing in Wireless Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, août 2005. http://dx.doi.org/10.21236/ada437824.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Chair, Zelneddine, et Pramod K. Varshney. On Hypothesis Testing in Distributed Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, novembre 1987. http://dx.doi.org/10.21236/ada195910.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Sim, Leng K., David H. Gerstman et V. A. Nguyen. The Distributed Unattended Networked Sensors Field Experiment. Fort Belvoir, VA : Defense Technical Information Center, novembre 2000. http://dx.doi.org/10.21236/ada390611.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Zhu, Sencun, Guohong Cao et Peng Liu. Distributed Self-healing Mechanisms for Securing Sensor Networks. Fort Belvoir, VA : Defense Technical Information Center, février 2010. http://dx.doi.org/10.21236/ada518946.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Distributed sensors networks » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie