• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Priority Aware Interference Mitigation Techniques for Coexistence of Wireless Technologies in Smart Utility Networks

Nahar, Badrun, Alam, Mohammad Shah, Shawkat, Shamim Ara, Hoque, Mohammad A. 21 November 2017 (has links)
In recent years, Smart Grid (SG) is envisioned to be the next generation electric power system by replacing traditional power grid due to its advantage of using two way communications. To implement reliable SG wireless communication networks, IEEE introduced a new wireless standard (IEEE802.15.4g) for Smart Utility Networks (SUNs). However, SUN operates on 2.4 GHz unlicensed band which is overlapped with Wireless Local Area Networks (WLANs) that leads to coexistence in Smart Utility Networks. In this paper, the coexistence problem of SUN is addressed in terms of homogeneous and heterogeneous interferences. To mitigate the homogeneous interference, Contention Access Period (CAP) and Contention Free Period (CFP) of a super frame of IEEE 802.15.4g is used to access the channel using slotted CSMA/CA algorithm by modifying the Backoff Period (BP) and Clear Channel Assessment (CCA) period for different priority data. An analytical model is developed using Markov chain, through which we demonstrate the accuracy of the proposed model in terms of throughput, channel access delay, probability of successful transmission and collision for nodes with different priority data. Performance evaluation is further investigated by comparing the proposed scheme with the existing PA-MAC. A channel switching mechanism is explored to mitigate the heterogeneous interference by the prediction of Naive Bayes Classifier. Predicted result shows that proposed mechanism effectively mitigates the heterogeneous interference by choosing the non-overlapping and non-coexisting channel.
2

Roteamento geográfico para redes de sensores e atuadores sem fio em redes urbanas de comunicação / Design of a hybrid geographical routing protocol for wireless sensor and actuator networks applied to smart utility networks

Denardin, Gustavo Weber 25 May 2012 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Smart grids and smart utility networks are the next-generation utility networks that intend to provide efficient control and management of utilities such as electricity, natural gas, water and sewage. Communication technology is the essential element for enabling formation of networks where control messages and metering data can be exchanged. In this work it is shown that wireless sensor and actuator networks are suitable candidates to implement this intelligent networks. The main routing algorithms for this category of wireless network are investigated in order to verify its performance when applied to the characteristics of smart utility networks, which are mainly related for large scale networks formed by hundreds to thousands of devices. It is shown that geographic routing is one of the most suitable routing strategies for large scale wireless networks, due to its low overhead and high scalability features. Usually, a geographic routing scheme combines a geographic greedy forwarding with a recovery mechanism to solve the local minima problem. Solutions proposed in the literature commonly combine greedy forwarding with the well known face routing for achieving this goal. However, the average path length in number of hops produced by face routing could be much worse than the optimal topological path in most realistic scenarios. In this work, it is proposed a new intermediate procedure between the geographic greedy mode and the recovery mode in order to improve routing efficiency in number of hops, without network overhead. It exploits the optimal topological route to base stations, obtained by beacon messages, as a resource to find better routes than the ones created by face routing. It is shown by simulations that the proposed hybrid approach leads to a significant improvement of routing performance when applied to combined greedy-face routing algorithms. Furthermore, experimental results obtained through testbeds shown that the proposed maintenance procedures are capable of avoid uctuations in the network infrastructure, providing robust routes for packet forwarding in large scale networks. / Smart grids e redes urbanas de comunicação formam a próxima geração de redes que pretende fornecer controle e gestão é eficiente aos servicos publicos como eletricidade, gás natural, água e esgoto. A tecnologia de comunicação é o elemento essencial para permitir a formação de redes em que mensagens de controle e dados de medição possam ser transmitidos. Neste trabalho demonstra-se que as redes de sensores e atuadores sem fio são candidatas viáveis e adequadas para implementar estas redes. Os principais algoritmos de roteamento para esta categoria de rede sem fios são investigados, a fim de verificar o seu desempenho quando aplicados às características das redes urbanas de comunicação, que geralmente são redes de grande escala formadas por centenas a milhares de dispositivos. Ainda, demostra-se que o roteamento geográfico �e uma das estratégias mais adequadas de roteamento para redes sem fio de grande escala, devido às suas características de baixa sobrecarga e alta escalabilidade. Estes algoritmos geralmente combinam um encaminhamento geográfico greedy com um mecanismo de recuperação para solucionar o problema dos mínimos locais, sendo o roteamento por faces a solução mais empregada na literatura como método de recuperação. No entanto, o número médio de saltos nos caminhos produzidos pelo roteamento por faces pode ser muito maior do que o caminho topológico ótimo na maioria dos cenários reais. Neste trabalho propõe-se um procedimento intermediário entre o encaminhamento geográfico greedy e o modo de recuperação, a fim de melhorar a eficiência em número de saltos sem gerar sobrecarga de mensagens de controle. Este procedimento explora as rotas topológicas ótimas para as estações base como um recurso adicional para encontrar rotas melhores para outros nós do que as geradas pelo roteamento por faces. Demonstra-se ainda através de simulações que a abordagem híbrida proposta melhora significativamente o desempenho do encaminhamento de pacotes quando aplicada a algoritmos greedy combinados com roteamento por faces. Ademais, os resultados experimentais obtidos através da planta teste comprovam que os procedimentos de manutenção propostos são capazes de evitar flutuações na infra-estrutura de rede, oferecendo rotas robustas para o encaminhamento de pacotes em redes de grande escala.

Page generated in 0.06 seconds