Protocolos de coleta de dados para redes de sensores sem fio

• Ano de defesa: 2015
• Autor(a) principal: Bruno Pereira dos Santos
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Minas Gerais; UFMG
• Palavras-chave em Português: Comunicação sem fio; Roteamento; Centralidade; Redes de sensores sem fio; Roteamento (Administração de redes de computadores); Computação; Sistemas de comunicaçâo sem fio; Sistemas de comunicação sem fio
• Link de acesso: http://hdl.handle.net/1843/ESBF-9WVQRL

This work presents two protocols to mitigate the data collect in Wireless Sensor Network (WSN). The first is called Centrality-based Routing Aware for L2Ns (CRAL) that routing packets based in centrality of the nodes and uses different Link Quality Estimations (LQEs), in addition CRAL has a flexible architecture enabling the attachment of data fusion functions and some improvements. We also present the eXtend Collection Tree Protocol (XCTP) to create bidirectional unicast routes between sensor nodes and base station, enabling two way exchange of controls packets (acknowledgments and feedback) or data packets. Moreover we present a algorithm called Policy Aware that provides energy balancing between more central nodes and non-central nodes. Our work presents two new protocols and a new algorithm compared with those presented in the existing literature. We employ a properly methodology to validate and evaluate the proposed protocols using different metrics to check reliability, efficiency, robustness, and flexibility of CRAL and XCTP. The main results for CRAL shows that: i) on average it is more reliable delivering 99.6% of the generated data, while CT and SPT reach about 60%; ii) CRAL and Policy Aware Algorithm are more fair in balancing energy consumption to reduce energy expenditure of the central nodes; iii) CRAL presents small number of Steiner Nodes, and also shows fresh data to use PerHopAd technique for data fusion. XCTP requires small storage space to create bidirectional routes and very small additional overhead in packets. XCTP saves 82% than Ad hoc On Demand Distance Vector (AODV) concerning storage space, being more reliable delivering 100% of packets than Collection Tree Protocol (CTP) that delivers 96.5%. XCTP is scalable by intelligent use of the entries on route tables, it is robust for being agile in network failures and for working with different amounts of nodes. XCTP also presents small control overhead than Routing Protocol for low-power and lossy networks (RPL) on route maintainance.