Дисертації з теми "Distributed sensors networks"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Distributed sensors networks".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Mehrotra, Shashank. "Distributed Algorithms for Tasking Large Sensor Networks." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33975.
Повний текст джерелаMaster of Science
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.
Повний текст джерела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/.
Повний текст джерела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.
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Lin, Erwei Kam Moshe. "Detection in distributed sensor networks /." Philadelphia, Pa. : Drexel University, 2005. http://hdl.handle.net/1860/1303.
Повний текст джерелаGao, Huaien. "Distributed learning in sensor networks." Diss., lmu, 2009. http://nbn-resolving.de/urn:nbn:de:bvb:19-96120.
Повний текст джерела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.
Повний текст джерела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
Boschian, Valentina. "Models and Methods for Multi-Actor Systems." Doctoral thesis, Università degli studi di Trieste, 2012. http://hdl.handle.net/10077/7431.
Повний текст джерела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
Oreshkin, Boris. "Distributed information fusion in sensor networks." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86916.
Повний текст джерелаFor the distributed average consensus algorithm a memory based acceleration methodology is proposed. The convergence of the proposed methodology is investigated. For the two important settings of this methodology, optimal values of system parameters are determined and improvement with respect to the standard distributed average consensus algorithm is theoretically characterized. The theoretical improvement characterization matches well with the results of numerical experiments revealing significant and well scaling gain. The practical distributed on-line initialization scheme is devised. Numerical experiments reveal the feasibility of the proposed initialization scheme and superior performance of the proposed methodology with respect to several existing acceleration approaches.
For the collaborative signal and information processing methodology a number of theoretical performance guarantees is obtained. The collaborative signal and information processing framework consists in activating only a cluster of wireless sensors to perform target tracking task in the cluster head using particle filter. The optimal cluster is determined at every time instant and cluster head hand-off is performed if necessary. To reduce communication costs only an approximation of the filtering distribution is sent during hand-off resulting in additional approximation errors. The time uniform performance guarantees accounting for the additional errors are obtained in two settings: the subsample approximation and the parametric mixture approximation hand-off.
Cette thèse aborde le problème de la conception et l'analyse d'algorithmes distribuès servant à l'agrégation efficace et la fusion de l'information dans des reséaux capteurs sans fil. Ces algorithmes distribuès servent à addresser un bon nombre d'inconvénients qu'ont les approches de fusion centralisée telles que le point de défaillance unique, les protocoles de routage complexe, la consommation de puissance inégale dans les noeuds de capteurs, l'utilisation inefficace des voies de transmission sans-fil et l'extensibilité limitée. Ces inconvénients de l'approche centralisée ont comme effet de réduire la durée de vie du reséau, la robustesse des noeuds face aux défaillances et la capacité du réseau. Les algorithmes distribuès atténuent ces problèmes en utilisant des simples protocoles de messageries entre les noeuds ainsi que du traitement d'information localisé. Toutefois, pour ces algorithmes, les pertes de précision et/ou de temps nécessaire pour effectuer une tâche peuvent être importantes. C'est pourquoi la conception et l'analyse d'algorithmes distribuès rapide et précis est importante. Dans cette thèse, deux problèmes spécifiques associés à l'analyse et le conception de tels algorithms sont abordés.
En ce qui concerne l'algorithme de consensus sur la moyenne distribuè, une méthode d'accélération fondé sur la mémoire est proposée et sa convergence analysée. Pour les deux paramètres importants de cette méthodologie, les valeurs optimales pour le système sont déterminées et l'amélioration par rapport à l'algorithme de consensus de base est caractérisée de façon théorique. Cette caractérisation correspond aux resultants d'expériences numériques et révèlent des gains importants et extensibles. Le régime distribuè d'initialisation en ligne est conçu. Des expériences numériques révèlevent la faisabilité du régime d'initilisation proposé ainsi qu'un rendement supérieur à plusieurs approches existantes.
Pour la méthodologie de traitement de signaux et d'information collaborative, un certain nombre de garanties théoriques de performance sont obtenues. Ce cadre de travail consiste à activer seulement une grappe de capteurs sans fil pour effectuer les tâches de pistage d'objet au niveau deu chef de groupe en utilisant un filtre particulaire. La grappe optimale est déterminée à chaque intervale de temps et le transfert du titre de chef de groupe est réalisé au besoin. Pour réduire les coûts de communication, seulement une approximation de la distribution du filtre est envoyé pendant le transfert de responsabilités ce qui entraîne des erreurs supplémentaires. Les garanties de performance uniformes dans le temps tenant compte de ces erreurs supplémentaires sont obtenues dans deux contextes.
Wen, Xiaojun. "Distributed MIMO for wireless sensor networks." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5749.
Повний текст джерелаRamakrishnan, Naveen. "Distributed Learning Algorithms for Sensor Networks." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1284991632.
Повний текст джерелаChan, Chee Wai. "Distributed beamforming in wireless sensor networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FChan.pdf.
Повний текст джерелаThesis Advisor(s): Murali Tummala, Roberto Cristi. Includes bibliographical references (p. 79-81). Also available online.
Kulathumani, Vinodkrishnan. "Network Abstractions for Designing Reliable Applications Using Wireless Sensor Networks." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211560039.
Повний текст джерелаLi, Junlin. "Distributed estimation in resource-constrained wireless sensor networks." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26633.
Повний текст джерелаCommittee Chair: Ghassan AlRegib; Committee Member: Elliot Moore; Committee Member: Monson H. Hayes; Committee Member: Paul A. Work; Committee Member: Ying Zhang. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Wälchli, Markus. "Distributed event detection in wireless sensor networks /." [S.l.] : [s.n.], 2009. http://opac.nebis.ch/cgi-bin/showAbstract.pl?sys=000288149.
Повний текст джерелаCheung, Victor. "Distributed position estimation for wireless sensor networks /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20CHEUNG.
Повний текст джерелаÜstebay, Deniz. "Efficient distributed consensus in wireless sensor networks." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114428.
Повний текст джерелаDe nombreuses applications des réseaux de capteurs sans fil peuvent être formulées comme des cas particuliers du problème de consensus moyenné distribué. Ce problème nécessite d'atteindre un état du réseaux où tous les capteurs ont la même valeur; à savoir la moyenne des valeurs initiales. Arriver à un tel consensus peut représenter un défi dans certains scénarios pratiques si la topologie du réseau change au cours du temps, par exemple à cause de la mobilité des capteurs ou un manque de fiabilité des liens sans fil. Dans ces cas particuliers, les algorithmes de colportage sont des alternatives attrayantes étant donné qu'ils n'ont pas besoin de routes spécifiques: ils dépendent d'échanges asynchrones effectués entre les capteurs. Cependant, la communication supplémentaire ajoutée par le colportage est élevée pour les topologies utilisées pour modeler les réseaux de capteurs sans fil. Nous proposons ici de nouveaux algorithmes de colportage qui arrivent à un consensus en utilisant moins de transmissions sans fil que le colportage aléatoire. Nous proposons tout d'abord un algorithme de colportage avec écoute du voisinage. Cet algorithme profite de la nature des transmissions sans fils pour épier les échanges dans le voisinage. Ainsi, quand un noeud se réveille pour une mise à jour de l'algorithme de colportage, au lieu de choisir un noeud voisin en manière aléatoire, il choisit le voisin qui a la valeur la plus éloignée de la sienne. Nous prouvons que ces mises à jour sont garanties de converger plus rapidement que le colportage aléatoire et que l'économie en terme de communication peut être exprimée en fonction du nombre maximum de voisins dans le réseau. Nous étudions ensuite le problème d'arriver à un consensus sur un vecteur de grande dimension. Le consensus sur les composantes d'un vecteur peut être réalisé avec l'utilisation du colportage en parallèle pour chaque composante. Cependant cette façon peut être peu économique dans le cas où seulement quelques composantes sont significatives. Cette thèse présente deux algorithmes, dénommés colportage sélectif seuil et top-m, qui visent à arriver à un consensus seulement sur les composantes significatives du vecteur considéré. Les deux algorithmes se focalisent sur l'utilisation des ressources de communication à chaque mise à jour en échangant seulement les composantes significatives du vecteur local. Nous prouvons que de telles mises à jour identifient avec succès les composantes significatives du vecteur. Utilisant ces algorithmes, nous proposons de nouvelles méthodes pour la compression décentralisée et les filtres à particules distribués dans les réseaux de capteurs. Nos expériences numériques démontrent que des économies de communication sont réalisées sur les méthodes existantes. Les algorithmes proposés dans cette thèse sont des alternatives appropriées au colporatage aléatoire parce qu'ils n'ont pas besoin de l'information additionnelle qui doit être transmise au-delà du voisinage proche. Pris dans leur ensemble, nos résultats indiquent qu'il est possible de diminuer l'excès de communication du colportage aléatoire tout en gardant ses propriétés bénéfiques.
Luo, Bin, and 羅斌. "Distributed clock synchronization for wireless sensor networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/198812.
Повний текст джерелаpublished_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy
Yang, Shusen. "Distributed optimisation in dynamic wireless sensor networks." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/19676.
Повний текст джерелаDe, Jager Dirk. "Enabling technologies for distributed body sensor networks." Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/340622/.
Повний текст джерелаJabeen, Farhana. "Distributed spatial analysis in wireless sensor networks." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/distributed-spatial-analysis-in-wireless-sensor-networks(f8a1f71a-81b0-4dc7-b520-b90a2393a61e).html.
Повний текст джерелаChristakos, Constantine Kleomenis 1974. "Distributed-in/ distributed-out sensor networks : a new framework to analyze distributed phenomena." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34183.
Повний текст джерелаIncludes bibliographical references (p. 155-165).
With a new way of thinking about organizing sensor networks, we demonstrate that we can more easily deploy and program these networks to solve a variety of different problems. We describe sensor networks that can analyze and actuate distributed phenomena without a central coordinator. Previous implementations of sensor networks have approached the problem from the perspective of centralized reporting of distributed events. By contrast, we create a system that allows users to infer the global state from within the sensor network itself, rather than by accessing an outside, central middleware layer. This is accomplished via dynamic creation of clusters of nodes based on application or intent, rather than proximity. The data collected and returned by these clusters is returned directly to the inquirer at his current location. By creating this Distributed-in/Distributed-out (DiDo) system that bypasses a middleware layer, our networks have the principal advantage of being easily configurable and deployable. We show that a system with this structure can solve path problems in a random graph. These graph problems are directly applicable to real-life applications such as discovering escape routes for people in a building with changing pathways. We show that the system is scalable, as reconfiguration requires only local communication.
(cont.) To test our assumptions, we build a suite of applications to create different deployment scenarios that model the physical world and set up simulations that allow us to measure performance. Finally, we create a set of simple primitives that serve as a high-level organizing protocol. These primitives can be used to solve different problems with distributed sensors, regardless of the underlying network protocols. The instructions provided by the sensors result in tangible performance improvements when the sensors' instructions are directed to agents within a simulated physical world.
by Constantine Kleomenis Christakos.
Ph.D.
Tewatia, Rohit. "Security in Distributed Embedded Systems." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1379.
Повний текст джерелаCommunication in a sensor network needs guaranteed reception of data without fail and providing security to it. The authenticity and confidentiality of the data has to be ensured as sensors have limited hardware resources as well as the bandwidth. This thesis addresses the security aspects in wireless sensor networks. The main task of the project is to identify the critical security parameters for these distributed embedded systems. The sensors have extremely limited resources: small amount of memory, low computation capability and poor bandwidth. For example, a sensor platform can have 8KB of flash memory, a 4MHz 8-bit Atmel processor, and a 900MHz radio interface. Various security threats posed to these small wireless sensor networks has been made and solutions proposed. Secure communication between these communicating partners is to be achieved using cryptography.
Naik, Udayan Lim Alvin S. "Implementation of distributed composition service for self-organizing sensor networks." Auburn, Ala., 2005. http://repo.lib.auburn.edu/2005%20Fall/Thesis/NAIK_UDAYAN_28.pdf.
Повний текст джерелаMyers, Robert L. "SMART SENSORS VS DISTRIBUTED DATA ACQUISITION." International Foundation for Telemetering, 2001. http://hdl.handle.net/10150/606371.
Повний текст джерелаDistributed processing is coming to data acquisition. The desire for smart sensors that can preprocess data, is growing. Making sensors themselves intelligent will reverse the historic trend toward smaller and cheaper sensors. Incorporating current sensor technology into data acquisition nodes in a network will create a distributed data acquisition, DAQ, environment that can acquire data from around the world over the Internet. The future is now.
Nurellari, Edmond. "Distributed detection and estimation in wireless sensor networks : resource allocation, fusion rules, and network security." Thesis, University of Leeds, 2017. http://etheses.whiterose.ac.uk/17669/.
Повний текст джерелаHeo, Nojeong Varshney Pramod K. "Distributed deployment algorithms for mobile wireless sensor networks." Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2004. http://wwwlib.umi.com/cr/syr/main.
Повний текст джерелаFabeck, Gernot [Verfasser]. "Distributed Detection in Wireless Sensor Networks / Gernot Fabeck." Aachen : Shaker, 2011. http://d-nb.info/1098040872/34.
Повний текст джерелаLiu, Bin. "Channel aware distributed detection in wireless sensor networks." Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2006. http://proquest.umi.com/login?COPT=REJTPTU0NWQmSU5UPTAmVkVSPTI=&clientId=3739.
Повний текст джерелаJallad, A. H. M. "Distributed computing in space-based wireless sensor networks." Thesis, University of Surrey, 2008. http://epubs.surrey.ac.uk/773025/.
Повний текст джерелаZhou, Yilun. "Fault detection and distributed estimation with sensor networks." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/61021.
Повний текст джерелаTang, Zuoyin. "Distributed source coding schemes for wireless sensor networks." Thesis, University of Bath, 2007. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.487519.
Повний текст джерелаLifton, Joshua Harlan 1976. "Pushpin computing : a platform for distributed sensor networks." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/61859.
Повний текст джерелаIncludes bibliographical references (p. 169-172).
A hardware and software platform has been designed and implemented for modeling, testing, and deploying distributed peer-to-peer sensor networks comprised of many identical nodes. Each node possesses the tangible affordances of a commonplace pushpin to meet ease-of-use and power considerations. The sensing, computational, and communication abilities of a "Pushpin", as well as a "Pushpin" operating system supporting mobile computational processes are treated in detail. Example applications and future work are discussed.
by Joshua Harlan Lifton.
S.M.
Leinonen, M. (Markus). "Distributed compressed data gathering in wireless sensor networks." Doctoral thesis, Oulun yliopisto, 2018. http://urn.fi/urn:isbn:9789526220451.
Повний текст джерелаTiivistelmä Patterikäyttöisistä antureista koostuvat langattomat anturiverkot yleistyvät esineiden internetin myötä esim. ympäristö-, teollisuus-, ja terveydenhoitosovelluksissa. Koska langaton tiedonsiirto kuluttaa merkittävästi energiaa, kommunikoinnin minimointi on elintärkeää pidentämään verkon elinikää ja parantamaan käyttäjäkokemusta. Väitöskirjan tavoitteena on kehittää ja analysoida energiatehokkaita hajautettuja pakattuja datankeruumenetelmiä langattomiin anturiverkkoihin. Työssä ehdotetaan neljä lähestymistapaa, jotka säästävät anturien energiaa minimoimalla se tiedonsiirron määrä, mikä vaaditaan täyttämään sovelluksen asettamat kriteerit. Väitöskirjan ensimmäinen osa tarkastelee protokollakerrosten yhteissuunnittelua, jossa minimoidaan anturien yhteislähetysteho optimoimalla resurssiallokaatio ja monitiereititys. Ratkaisuksi ehdotetaan konsensukseen perustuva hajautettu algoritmi. Tulokset osoittavat algoritmin suppenemisominaisuuksien olevan verrokkejaan paremmat. Loppuosat keskittyvät harvojen lähteiden pakattuun havaintaan (compressed sensing, CS). Toinen osa keskittyy tila- ja aikatasossa korreloituneen anturidatan hajautettuun keräämiseen. Työssä kehitetään liukuvaan ikkunaan ja rekursiiviseen dekoodaukseen perustuva CS-algoritmi. Tulokset osoittavat menetelmän saavuttavan verrokkejaan korkeamman rekonstruktiotarkkuuden pienemmällä tiedonsiirrolla sekä dekoodausviiveellä ja -kompleksisuudella ja kykenevän asteittain parantamaan menneitä estimaatteja. Työn viimeiset osat sisällyttävät järjestelmämalliin CS-mittausten kvantisoinnin keskittyen häviölliseen lähdekoodaukseen. Kolmas osa käsittelee hajautettua korreloitujen harvojen signaalien kvantisoitua CS-havaintaa (quantized CS, QCS). Työssä ehdotetaan särön ja muuttuvan koodinopeuden välisen suhteen optimoiva QCS-menetelmä. Menetelmällä osoitetaan olevan verrokkejaan parempi pakkaustehokkuus sekä kyky painottaa suorituskyvyn ja enkooderin kompleksisuuden välillä mittausten esikvantisointia käyttäen. Neljäs osa tutkii informaatioteoreettisia, koodisuhde-särösuhteeseen perustuvia suorituskykyrajoja yhden anturin QCS-järjestelmässä. Parhaimmalle mahdolliselle pakkaustehokkuudelle johdetaan alaraja, sekä kehitetään menetelmä sen numeeriseen arviointiin. Tulokset vertaavat käytännön QCS-menetelmiä johdettuihin rajoihin, ja osoittavat ehdotetun QCS-menetelmän saavuttavan lähes optimaalinen suorituskyky
Jingjing, Hao. "Distributed sensor fault detection and isolation over wireless sensor network." Doctoral thesis, Universite Libre de Bruxelles, 2017. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/254423.
Повний текст джерелаDoctorat en Sciences de l'ingénieur et technologie
info:eu-repo/semantics/nonPublished
Petersen, Sigmund Seehuus. "Distributed source coding in sensor networks : A practical implementation." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8705.
Повний текст джерелаIn this thesis we take a closer look at wireless sensor networks and source coding. A necessary condition for this work to have any meaning is that the sensors in the network are spatially co-located and that there is correlation between the data the sensors observe. When there is correlation, there is redundancy in the information communicated that can be removed by source coding techniques. This can be done by emph{distributed source coding}. Slepian and Wolf showed theoretically that there is no rate loss no matter if the sensors are communicating. cite{slepian73} Wyner and Ziv expanded this from the lossless case of Slepian and Wolf to apply to lossy source coding. cite{wyner76} Pradhan and Ramchandran found a practical implementation for the theory of Slepian-Wolf and Wyner-Ziv based on channel coding principles. cite{pradhan03} This can be done because the correlation between any two sources can be modelled as a channel with an error probability. We build our work on their ideas. The channel coding technique we have found most advantageous for this scheme is emph{Low Density Parity-Check} coding. LDPC coding is the most advanced form of linear block coding up to date. It is represented by a sparse parity-check matrix. While LDPC coding in the traditional sense is used for bandwidth expansion of the source to protect it from channel errors, it is used for bandwidth compression, or rate reduction, in the distributed sense. The distributed LDPC scheme is used on medical ECG data as an example. Due to lack of time and the comprehensive task, the adpapted message-passing decoding algorithm needed to fulfill the implementation could not be finished. We have illustrated the distributed encoder system with a $(7,4)$-Hamming code to give an example. The performance of this system is not good enough for any practical use, but will function as a guideline for possible future work in the area.
Bielefeld, Daniel [Verfasser]. "Ultra-Wideband Sensor Networks for Distributed Detection / Daniel Bielefeld." Aachen : Shaker, 2011. http://d-nb.info/1070152587/34.
Повний текст джерелаEriksson, Emil. "Distributed Processing of Visual Features in Wireless Sensor Networks." Licentiate thesis, KTH, Nätverk och systemteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-207094.
Повний текст джерелаAllt eftersom digitalkameror blir både billigare och mer avancerade blir de också vanligare i handhållna enheter, i hemelektronik och som dedikerad övervakningsutrustning. Algoritmer för datorseende kan användas på stillbilderna och videoklippen som samlas in av dessa kameror för objektidentifiering, scenförståelse, navigering, mm. Genom att använda data från flera kameror som observerar samma händelser kan prestandan hos dessa datorseendealgoritmer förbättras. Utplacering av kameranätverk är emellertid svårt i områden utan tillgång till infrastruktur som kan tillhandahålla elektricitet och nätverksanslutning. I denna avhandling studerar vi nätverk av kamerautrustade sensornoder som ett kostnadseffektivt alternativ till konventionella kameranätverk. För att övervinna beräkningsbegränsningarna hos sensornoderna förstärker vi sensornätverket med dedikerade beräkningsnoder och bearbetar bilder parallellt i flera beräkningsnoder. I den första delen av avhandlingen formulerar vi minimeringsproblemet för den tid som krävs från bildupptagning tills en representation av den visuella informationen extraheras från bilden. Lösningen till minimeringsproblemet är en fördelning av delområden av en infångad bild till en delmängd av beräkningsnoderna. Beräkningsnoderna bearbetar bilderna för att ta fram representationen av den visuella informationen. Vi använder den tidsmässiga korrelationen av bildinnehållet för att förutsäga en approximation av fördelningen av visuell information i en infångad bild. Baserat på den ungefärliga fördelningen beräknar vi en approximativ lösning på minimeringsproblemet med hjälp av linjärprogrammering. Vi visar att det går att får en bra kompromiss mellan prestanda och beräkningskomplexitet genom att använda det visuella innehållet i tidigare bildrutor för att förutsäga innehållet i kommande bildrutor. I den andra delen av avhandlingen föreslår vi helt distribuerade algoritmer för tilldeling av delar av bilder till beräkningsnoder i ett visuellt sensornätverk. Algoritmerna skiljer sig i mängden tillgänglig information och hur uppdateringar av tilldelningar verkställs. Vi tillhandahåller analytiska resultat för förekomsten av jämviktstilldelningar och visar att en given jämviktstilldelning inte nödvändigtvis är optimal. Vi visar även att fullt distribuerade algoritmer är mest effektiva när sensornoder gör asynkrona förändringar i sina tilldelningar och i mindre symmetriska topologier. Genom att lägga till gles koordination kan prestandan förbättras avsevärt både i genomsnitt och i värsta fall.
QC 20170516
Papalexidis, Nikolaos. "Distributed algorithms for beamforming in wirless [sic] sensor networks." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion-image.exe/07Jun%5FPapalexidis.pdf.
Повний текст джерелаThesis Advisor(s): Murali Tummala, John C. McEachen. "June 2007." Includes bibliographical references (p. 111-113). Also available in print.
Ing, Garrick. "Distributed particle filters for object tracking in sensor networks." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98971.
Повний текст джерелаNabeel, Mohammed M. [Verfasser]. "Reliable communication in distributed sensor networks / Mohammed M. Nabeel." Paderborn : Universitätsbibliothek, 2019. http://d-nb.info/1183087837/34.
Повний текст джерелаMILLER, TAMARA GUERRA. "DISTRIBUTED SPARSITY-AWARE SIGNAL PROCESSING ALGORITHMS FOR SENSOR NETWORKS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2016. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27190@1.
Повний текст джерелаCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Neste trabalho de dissertação são propostos algoritmos adaptativos que exploram a esparsidade em redes distribuídas de sensores para estimação de parâmetros e estimação espectral. São desenvolvidos algoritmos gradiente conjugado (CG) distribuído para os protocolos consenso e difusão em versão convencional e modificada (MCG). Esses algoritmos são desenvolvidos com exploração de esparsidade usando as funções penalidades l1 e log-sum. Os métodos propostos apresentam um melhor desempenho en termos de velocidade de convergência e desvio médio quadratico (MSD) que as já conhecidas variantes distribuídas do algoritmo least mean square (LMS) e muito próximo ao desempenho do algoritmo recursive least square (RLS). Além disso, propõe-se um algoritmo distribuído de optimização alternada de variáveis discretas e contínuas (DAMDC) baseado no LMS. O algoritmo DAMDC-LMS apresenta um desempenho muito próximo ao algoritmo oráculo e tem maior velocidade de convergência que os algoritmos estudados com exploração de esparsidade. Os resultados numéricos mostram que o algoritmo DAMDC-LMS pode ser aplicado em vários cenários.
This dissertation proposes distributed adaptive algorithms exploiting sparsity for parameter and spectrum estimation over sensor networks. Conventional and modified conjugate gradient (CG and MCG) algorithms using consensus and diffusion strategies are presented. Sparsity-aware versions of CG an MCG algorithms using l1 and log-sum penalty functions are developed. The proposed sparsity-aware and non-sparse CG and MCG methods outperform the equivalent variants of the least-mean square (LMS) algorithms in terms of convergence rate and mean square deviation (MSD) at steady state, and have a close performance to the recursive least square (RLS) algorithm. The diffusion CG strategies have shown the best performance, specifically the adapt then combine (ATC) version. Furthermore a distributed alternating mixed discretecontinuous (DAMDC) algorithm to approach the oracle algorithm based on the diffusion strategy for parameter and spectrum estimation over sensor networks is proposed. An LMS type algorithm with the DAMDC proposed technique obtains the oracle matrix in an adaptive way and compare it with the existing sparsity-aware as well as the classical algorithms. The proposed algorithm has an improved performance in terms of MSD. Numerical results show that the DAMDC-LMS algorithm is reliable and can be applied in several scenarios.
Chachra, Sumit, and Theodore Elhourani. "RESOURCE ALLOCATION IN SENSOR NETWORKS USING DISTRIBUTED CONSTRAINT OPTIMIZATION." International Foundation for Telemetering, 2004. http://hdl.handle.net/10150/605299.
Повний текст джерелаSeveral algorithms have been proposed for solving constraint satisfaction and the more general constraint optimization problem in a distributed manner. In this paper we apply two such algorithms to the task of dynamic resource allocation in the sensor network domain using appropriate abstractions. The aim is to effectively track multiple targets by making the sensors coordinate with each other in a distributed manner, given a probabilistic representation of tasks (targets). We present simulation results and compare the performance of the DBA and DSA algorithms under varying experimental settings.
Anilkumar, Ravi. "Energy-Efficient Measurement of Coverage in Distributed Sensor Networks." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/9787.
Повний текст джерелаMaster of Science
Whipps, Gene Thomas. "Contributions to Distributed Detection and Estimation over Sensor Networks." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1502970194073045.
Повний текст джерелаMuralidharan, Gautam. "On the distributed revocation of nodes in sensor networks." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/164.
Повний текст джерелаThesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Krishnan, Rajet. "Problems in distributed signal processing in wireless sensor networks." Thesis, Manhattan, Kan. : Kansas State University, 2009. http://hdl.handle.net/2097/1351.
Повний текст джерелаYu, Jia. "Distributed parameter and state estimation for wireless sensor networks." Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28929.
Повний текст джерела