Wireless Sensor Networks (WSNs) comprise a large number of sensor nodes, which are spread out within a region and communicate using wireless links. In some WSN applications, recognizing boundary nodes is important for topology discovery, geographic routing and tracking. In this thesis, we study the problem of identifying the boundary nodes of a WSN. In a WSN, close-by nodes can communicate with their neighbors and have the ability to estimate distances to nearby nodes, but not necessarily the true distances. Our objective is to find the boundary nodes by using the connectivity relation and neighbor distance information without any knowledge of node locations. Moreover, our main aim is to design a distributed algorithm that works even when the average degree is low. We propose a heuristic algorithm to find the boundary nodes which are connected in a boundary cycle of a location-free, low density, randomly deployed WSN. We develop the key ideas of our boundary detection algorithm in the centralized scenario and extend these ideas to the distributed scenario. Then, we show by simulation experiments that the distributed implementation outperforms the centralized one. The centralized implementation relies on the connectivity of the network to the base station. Therefore, for low density disconnected networks, the algorithm cannot find boundaries in partitions of the network that cannot establish connection to the base station. This condition leads to a low quality of boundary discovery. In contrast, the distributed implementation is more realistic for real WSNs, especially for relatively sparse networks when all local information cannot be collected very well due to sparse connectivity. In low-degree disconnected networks, the simulation results show that the distributed implementation has a higher quality of boundaries compared to the centralized implementation.

Thesis (M.Comp.Sc.)--University of Wollongong, 2005. / Typescript. This thesis is subject to a 6 month embargo (12/12/05 to 12/06/06) and may only be viewed and copied with the permission of the author. For further information please Contact the Archivist. Includes bibliographical references: leaf 65-72.

Thesis (Ph. D.)--Missouri University of Science and Technology, 2008. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed May 27, 2008) Includes bibliographical references.

Thesis (Ph.D.)--University of Western Australia, 2008.

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008. / Laskar, Joy, Committee Chair ; Cressler, John, Committee Member ; Kornegay, Kevin, Committee Member ; Tentzeris, Emmanouil, Committee Member ; Lee, Chang-Ho, Committee Member.

Thesis (M.E.)--University of Canterbury, 2006. / Typescript (photocopy). "December 2006." Includes bibliographical references (p. 83-86). Also available via the World Wide Web.

CNPq / Nesta dissertação de mestrado é apresentada uma proposta adaptativa com abordagem intercamadas para redes sem fio de múltiplos saltos. O objetivo principal é analisar o impacto que a troca de informações entre camadas do modelo de rede podem ter sobre seu desempenho geral. Informações sobre a qualidade das conexões na camada física são passadas diretamente para a camada de rede, que poderá calcular melhores rotas a serem utilizadas por cada nó. Esta proposta foi avaliada por meio de simulações com o intuito de ser comparada com outros modelos de cálculo de rotas existentes. Os resultados obtidos indicam redes mais estáveis, com menor quantidade de pacotes perdidos e menores valores de jitter. / In this master thesis an adaptive cross-layer solution for multihop wireless networks is presented. The main objective is to analyze the impact that the information exchange between network model layers can have on its overall performance. Connections quality information from physical layer is handled directly to the network layer, which may calculate better routes to be used by each node. This proposal was evaluated through simulations to be compared to other routes calculation models. Obtained results indicate more stable networks, with fewer dropped packets and lower jitter values. / 5000

Neste trabalho, é proposta a utilização de múltiplas antenas de transmissão juntamente com o embaralhamento de pacotes para aumentar a segurança de uma rede composta por dois nós legítimos (Alice e Bob) e um espião passivo, todos eles providos com múltiplas antenas. Levando em consideração o denominado intervalo de segurança (Security Gap) como métrica de desempenho e assumindo um cenário com desvanecimento quase-estático, foi então analisado (analítica e numericamente) o intervalo de segurança em termos de probabilidade de outage e de taxa de erro de pacotes (usando códigos convolucionais), mostrando que em ambas as situações é possível atingir níveis negativos de intervalo de segurança com um número praticável de antenas transmissoras. Além disso, mostra-se que usando uma aproximação para o intervalo de segurança baseado na probabilidade de outage, é possível estimar com precisão o número de antenas em Alice para se atingir um determinado nível de segurança. Também é mostrado que utilizando o esquema de seleção de antena de transmissão juntamente com o método de combinação de razão máxima na recepção (TAS/MRC) com o embaralhamento de pacote, é possível ter os mesmos resultados, ou muito similares, para um caso real utilizando a FER quando comparado com o caso ideal da probabilidade de outage. / In this work, the use of multiple transmitting antennas with frame scrambling is proposed to increase the security of a network composed by two legitimate nodes (Alice and Bob) and a passive eavesdropper, all of them provided with multiple antennas. Considering the so-called security gap as the performance metric and assuming a quasi-static fading scenario, it was evaluated (analytically and through numerical results) the security gap based on both the outage probability and the frame error rate (using convolutional codes), showing that, in both situations, it is possible to achieve negative values of security gap with a feasible number of transmitting antennas. Moreover, it is showed that using an approximation to security gap based on outage probability, one can accurately estimate the number of antennas in Alice needed to achieve a given level of security. It is also showed that using TAS/MRC with frame scrambling, it is possible to get the same results, or almost the same, in a real case using FER when it is compared to an ideal case with outage probability.

Neste trabalho, é proposta a utilização de múltiplas antenas de transmissão juntamente com o embaralhamento de pacotes para aumentar a segurança de uma rede composta por dois nós legítimos (Alice e Bob) e um espião passivo, todos eles providos com múltiplas antenas. Levando em consideração o denominado intervalo de segurança (Security Gap) como métrica de desempenho e assumindo um cenário com desvanecimento quase-estático, foi então analisado (analítica e numericamente) o intervalo de segurança em termos de probabilidade de outage e de taxa de erro de pacotes (usando códigos convolucionais), mostrando que em ambas as situações é possível atingir níveis negativos de intervalo de segurança com um número praticável de antenas transmissoras. Além disso, mostra-se que usando uma aproximação para o intervalo de segurança baseado na probabilidade de outage, é possível estimar com precisão o número de antenas em Alice para se atingir um determinado nível de segurança. Também é mostrado que utilizando o esquema de seleção de antena de transmissão juntamente com o método de combinação de razão máxima na recepção (TAS/MRC) com o embaralhamento de pacote, é possível ter os mesmos resultados, ou muito similares, para um caso real utilizando a FER quando comparado com o caso ideal da probabilidade de outage. / In this work, the use of multiple transmitting antennas with frame scrambling is proposed to increase the security of a network composed by two legitimate nodes (Alice and Bob) and a passive eavesdropper, all of them provided with multiple antennas. Considering the so-called security gap as the performance metric and assuming a quasi-static fading scenario, it was evaluated (analytically and through numerical results) the security gap based on both the outage probability and the frame error rate (using convolutional codes), showing that, in both situations, it is possible to achieve negative values of security gap with a feasible number of transmitting antennas. Moreover, it is showed that using an approximation to security gap based on outage probability, one can accurately estimate the number of antennas in Alice needed to achieve a given level of security. It is also showed that using TAS/MRC with frame scrambling, it is possible to get the same results, or almost the same, in a real case using FER when it is compared to an ideal case with outage probability.

In situations where information infrastructure is destroyed or not available, on-demand information infrastructure is pivotal for the success of rescue missions. In this paper, a drone-carried on-demand information infrastructure for long-distance WiFi transmission system is developed. It can be used in the areas including emergency response, public event, and battlefield. In years development, the Drone WIFI System has developed from single-CPU platform, twin-CPU platform, Atmega2560 platform to NVIDIA Jetson TX2 platform. By the upgrade of the platform, the hardware shows more and more reliable and higher performance which make the application of the platform more and more exciting. The latest TX2 platform can provide real time and thermal video transmission, also application of deep learning of object recognition and target tracing. All these up-to-date technology brings more application scenarios to the system. Therefore, the system can serve more people in more scenarios.