Store and Haul: Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding

This work investigates the benefits and drawbacks of repeating controlled flooding at different intervals in mobile ad hoc networks (MANETs) to overcome episodic connectivity. Specifically, the thesis examines the efficiencies in repeating transmissions by quantifying the packet delivery ratio (PDR) and recording the resulting delays in different types of MANET scenarios. These scenarios mainly focus on partitions within the simulated networks by varying node density and mobility. The nodes store transmitted data and haul it across the MANET in the hope that it will come in range of a node that leads to the destination. A customized version of the Network Simulator 2 (ns-2) is used to create the simulations. A qualitative analysis follows and shows the cost and benefits of increased transmissions at varied time intervals

SOCIAL AND LOCATION BASED ROUTING IN DELAY TOLERANT NETWORKS

Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Routing in DTNs is very challenging as it must handle network partitions, long delays, and dynamic topology in such networks. Recently, the consideration of social characteristics of mobile nodes provides a new angle of view in the design of DTNs routing protocols. In many DTNs, a multitude of mobile devices are used and carried by people (e.g. pocket switched networks and vehicular networks), whose behaviors are better described by social models. This opens the new possibilities of social-based routing, in which the knowledge of social characteristics is used for making better forwarding decision. However, the social relations do not necessarily reflect the true device communication opportunities in a dynamic DTN. On the other hand, the increasing availability of location technologies (GPS, GSM networks, etc.) enables mobile devices to obtain their locations easily. Consider that an individual’s location history in the real world implies his/her social interests and behaviors to some extent, in this dissertation, we study new social based DTN routing protocols, which utilize location and/or social features to achieve efficient and stable routing for delay tolerant networks. We first incorporate the location features into the social-based DTN routing methods to improve their performance by treating location similarity among nodes as possible social relationship. Then, we dis- cuss the possibility and methods to further improve routing performance by adding limited amount of throw-boxes into the networks to aid the DTN relay. Several throw-boxes based routing protocols and location selection methods for throw-boxes are proposed. All pro- posed routing methods are evaluated via extensive simulations with real life trace data (such as MIT reality, Nokia MDC, and Orange D4D)

On the performance of social-based and location-aware forwarding strategies in urban vehicular networks

High vehicular mobility in urban scenarios originates inter-vehicles communication discontinuities, a highly important factor when designing a forwarding strategy for vehicular networks. Store, carry and forward mechanisms enable the usage of vehicular networks in a large set of applications, such as sensor data collection in IoT, contributing to smart city platforms. This work evaluates the performance of several location-based and social-aware forwarding schemes through emulations and in a real scenario. Gateway Location Awareness (GLA), a location-aware ranking classification, makes use of velocity, heading angle and distance to the gateway, to select the vehicles with higher chance to deliver the information in a shorter period of time, thus differentiating nodes through their movement patterns. Aging Social-Aware Ranking (ASAR) exploits the social behavior of each vehicle, where nodes are ranked based on a historical contact table, differentiating vehicles with a high number of contacts from those who barely contact with other vehicles. To merge both location and social aforementioned algorithms, a HYBRID approach emerges, thus generating a more intelligent mechanism. For each strategy, we evaluate the influence of several parameters in the network performance, as well as we comparatively evaluate the strategies in different scenarios. Experiment results, obtained both in emulated (with real traces of both mobility and vehicular connectivity from a real city-scale urban vehicular network) and real scenarios, show the performance of GLA, ASAR and HYBRID schemes, and their results are compared to lower- and upper-bounds. The obtained results show that these strategies are a good tradeoff to maximize data delivery ratio and minimize network overhead, while making use of mobile networks as a smart city network infrastructure.publishe

Estratégias de encaminhamento para recolha oportunística de informação em redes móveis de internet das coisas

High vehicular mobility in urban scenarios originates inter-vehicles communication discontinuities, a highly important factor when designing a forwarding strategy for vehicular networks. Store, carry and forward mechanisms enable the usage of vehicular networks in a large set of applications, such as sensor data collection in IoT, contributing to smart city platforms. This work focuses on two main topics to enhance the forwarding decision: i) forwarding strategies that make use of location-aware and social-based to perform neighborhood selection, ii) and packet selection mechanisms to provide Quality of Service (QoS). The neighborhood selection is performed through multiple metrics, resulting in three forwarding strategies: (1) Gateway Location Awareness (GLA), a location-aware ranking classification making use of velocity, heading angle and distance to the gateway, to select the vehicles with higher chance to deliver the information in a shorter period of time, thus differentiating nodes through their movement patterns; (2) Aging Social-Aware Ranking (ASAR) that exploits the social behaviours of each vehicle, where nodes are ranked based on a historical contact table, differentiating vehicles with a high number of contacts from those who barely contact with other vehicles; (3) and to merge both location and social aforementioned algorithms, a hybrid approach emerges, thus generating a more intelligent mechanism. Allied to the forwarding criteria, two packet selection mechanisms are proposed to address distinct network functionalities, namely: Distributed Packet Selection, that focuses primarily on data type prioritization and secondly, on packet network lifetime; and Equalized Packet Selection, which uses network metrics to calculate a storage packet ranking. To do so, the packet number of hops, the packet type and packet network lifetime are used. In order to perform the evaluation of the proposed mechanisms, both real and emulation experiments were performed. For each forwarding strategy, it is evaluated the influence of several parameters in the network's performance, as well as comparatively evaluate the strategies in different scenarios. Experiment results, obtained with real traces of both mobility and vehicular connectivity from a real city-scale urban vehicular network, are used to evaluate the performance of GLA, ASAR and HYBRID schemes, and their results are compared to lower- and upper-bounds. Later, these strategies' viability is also validated in a real scenario. The obtained results show that these strategies are a good tradeoff to maximize data delivery ratio and minimize network overhead, while making use of moving networks as a smart city network infrastructure. To evaluate the proposed packet selection mechanisms, a First In First Out packet selection technique is used as ground rule, thus contrasting with the more objective driven proposed techniques. The results show that the proposed mechanisms are capable of provide distinct network functionalities, from prioritizing a packet type to enhancing the network's performance.A elevada mobilidade em cenários veiculares urbanos origina descontinuidades de comunicação entre veículos, um fator altamente importante quando se desenha uma estratégia de encaminhamento para redes veiculares. Mecanismos de store, carry and forward (guardar, carregar e entregar) possibilitam a recolha de dados de sensores em aplicações da Internet das coisas, contribuindo para plataformas de cidades inteligentes. Este trabalho é focado em dois tópicos principais de forma a melhorar a decisão de encaminhamento: i) estratégias de encaminhamento que fazem uso de métricas sociais e de localização para efetuar a seleção de vizinhos, ii) e mecanismos de seleção de pacotes que qualificam a rede com qualidade de serviço. A seleção de vizinhos é feita através de múltiplas métricas, resultando em três estratégias de encaminhamento: Gateway Location Awareness (GLA), uma classificação baseada em localização que faz uso de velocidade, ângulo de direção e distância até uma gateway, para selecionar os veículos com maior probabilidade de entregar a informação num menor período temporal, distinguindo os veículos através dos seus padrões de movimento. Aging Social-Aware Ranking (ASAR) explora os comportamentos sociais de cada veículo, onde é atribuída uma classificação aos veículos com base num histórico de contactos, diferenciando veículos com um alto número de contactos de outros com menos. Por fim, por forma a tirar partido das distintas características de cada uma das destas estratégias, é proposta uma abordagem híbrida, Hybrid between GLA and ASAR (HYBRID). Aliado ao critério de encaminhamento, são propostos dois mecanismos de seleção de pacotes que focam distintas funcionalidades na rede, sendo estes: Distributed Packet Selection, que foca em primeiro lugar na prioritização de determinados tipos de pacotes e em segundo lugar, no tempo de vida que resta ao pacote na rede; e Equalized Packet Selection, que usa métricas da rede para calcular a classificação de cada pacote em memória. Para tal, é usado o numero de saltos do pacote, o tipo de dados do pacote e o tempo de vida que resta ao pacote na rede. De forma a avaliar os mecanismos propostos, foram realizadas experiências em emulador e em cenário real. Para cada estratégia de encaminhamento, e avaliada a influência de vários parâmetros de configuração no desempenho da rede. Para além disso, é feita uma avaliação comparativa entre as várias estratégias em diferentes cenários. Resultados experimentais, obtidos usando traços reais de mobilidade e conetividade de uma rede veicular urbana, são utilizados para avaliar a performance dos esquemas GLA, ASAR e HYRID. Posteriormente, a viabilidade destas estratégias é também validada em cenário real. Os resultados obtidos mostram que estas estratégias são um bom tradeoff para maximizar a taxa de entrega de dados e minimizar a sobrecarga de dados na rede. Para avaliar os mecanismos de seleção de pacotes, um simples mecanismo First In First Out é utilizado como base, contrapondo com as técnicas propostas mais orientadas a objectivos concretos. Os resultados obtidos mostram que os mecanismos propostos são capazes de proporcionar à rede diferentes funcionalidades, desde prioritização de determinado tipos de dados a melhoramentos no desempenho da rede.Agradeço à Fundação Portuguesa para a Ciência e Tecnologia pelo suporte financeiro através de fundos nacionais e quando aplicável cofi nanciado pelo FEDER, no âmbito do Acordo de Parceria PT2020 pelo projecto MobiWise através do programa Operacional Competitividade e Internacionalização (COMPETE 2020) do Portugal 2020 (POCI-01-0145-FEDER-016426).Mestrado em Engenharia Eletrónica e Telecomunicaçõe

Zuverlässige Gruppenkommunikation in mobilen Ad-hoc-Netzen auf Basis eines verzögerungstoleranten Kommunikationsdienstes

Ein zuverlässiges Netz für die Kommunikation ist die Basis für eine erfolgreiche Organisation und Koordination von Rettungskräften in Katastrophenfällen. Die heutige Kommunikationstechnik der Rettungskräfte basiert auf dem digitalen Funksystem Terrestrial Trunked Radio (TETRA). TETRA bietet keine ausreichende Datenrate für Multimediadaten und ist bei zerstörter Infrastruktur nur eingeschränkt nutzbar. Deshalb ist es notwendig die Kommunikation in Katastrophenfällen auf anderen Netztypen aufzubauen und Protokolle weiterzuentwickeln. Die vorliegende Arbeit befasst sich mit der zuverlässigen Gruppenkommunikation in Katastrophenfällen. Durch die oft fehlende Infrastruktur in solchen Szenarien, werden Mobile Ad-hoc Networks (MANETs) verwendet, um eine Kommunikation kurzfristig wieder herzustellen. MANETs bilden sich selbständig und sind in ihrer Reichweite eingeschränkt. Das kann dazu führen, dass mehrere zu einer Kommunikationsgruppe gehörende Kommunikationspartner nicht direkt miteinander verbunden sind. Um trotzdem eine Kommunikation zu ermöglichen, wurde unter Nutzung eines verzögerungstoleranten Kommunikationsdienstes (Delay Tolerant Networking (DTN)) ein Gruppenkommunikationsprotokoll entwickelt. Dieses Protokoll (Reliable Multicast over Delay Tolerant Mobile Ad Hoc Networks (RMDA)) übermittelt Gruppennachrichten mit einer hohen wählbaren Zuverlässigkeit an die gewünschten Gruppenmitglieder unter Optimierung des Speicherplatzbedarfs der DTN-Knoten.A reliable network for communication is the basis for a successful organization and coordination of rescue services in case of disasters. Today’s communication technology of the emergency services is based on the digital radio system Terrestrial Trunked Radio (TETRA). TETRA provides no sufficient data rates for multimedia data. In case of destroyed infrastructure it is available only to a limited extent. Therefore in case of disasters, it is necessary to provide communication services based on other network types and further development of protocols. This thesis is concerned with reliable group communication in disaster scenarios. By the frequent lack of infrastructure in such scenarios, Mobile Ad-hoc Networks (MANETs) are used to restore quickly. MANETs build themselves autonomously and are locally limited. As a result, group members belonging to one multicast group could be not directly connected. Therefore, to enable a communication, a group communication protocol was developed using a delay-tolerant communication service (Delay Tolerant Networking (DTN)). This protocol (Reliable Multicast over Delay Tolerant Mobile Ad Hoc Networks (RMDA)) sends group messages with selectable high degree of reliability to the desired group members, while optimizing the buffer required on the DTN nodes

Efficient Routing and Scheduling in Wireless Networks

The temporal and spatial variation in wireless channel conditions, node mobility make it challenging to design protocols for wireless networks. In this thesis, we design efficient routing and scheduling algorithms which adapt to changing network conditions caused by varying link quality or node mobility to improve user-level performance. We design and analyze routing protocols for static, mobile and heterogeneous wireless networks. We analyze the performance of opportunistic and cooperative forwarding in static mesh networks showing that opportunism outperforms cooperation; we identify interference as the main cause for mitigating the potential gains achievable with cooperative forwarding. For mobile networks, we quantitatively analyze the tradeoff between state information collection (sampling frequency and number of bits per sample) and power consumption for a fixed source-to-destination goodput constraint. For heterogeneous networks comprising of both static and mobile nodes, we propose a greedy algorithm (adaptive-flood) which dynamically classifies individual nodes as routers/flooders depending on network conditions and demonstrate that it achieves performance equivalent to, and in some cases significantly better than, that of network-wide routing or flooding alone. Last, we consider an application-level wireless streaming scenario where multiple clients are streaming different videos from a cellular base station. We design a greedy algorithm for efficiently scheduling multiple video streams from a base station to mobile clients so as to minimize the total number of application-playout stalls. We develop models for coarse timescale wireless channel variation to aid network and application-layer protocol design

Аналіз роботи систем супутникового зв'язку на низькій орбіті

Робота містить 76 сторінок, 26 рисунків, 3 таблиці та 2 додатки. Було використано 71 джерело. Актуальність роботи: Сучасні телекомунікаційні мережі в будь-якій країні світу представлені в основному наземними ВОЛЗ, кабельними мережами DSL/ADSL, та радіочастотними каналами передачі данних. Кожного року таких мереж стає все більше, зростає кількіть абонентів та мережевого трафіку, вимоги до якості зв’язку та швидкості передачі данних збільшуються. Згадані типи наземних мереж не розповсюджені в областях з малою густиною населення, або у малонаселенних районах, які займають більшу частину земної поверхні. Для вирішення проблем доступності всесвітньої мережі необхідні кардинально нові рішення, які будуть одноково привабливими для постачальників послуг та їх клієнтів. Метою роботи є аналіз існуючих рішень в сфері низькоорбітальних ССЗ та дослідження систем що знаходяться в процессі розгортання. В кінцевому результаті проведення моделювання однієї з таких систем що буде надавати послуги на території нашої країни. Задачі дослідження: - провести аналіз існуючих рішень та технологій мережевої взаємодії. - провести огляд сучасних систем супутникового зв’язку та іх порівняння - розглянути принципи функціонування ССЗ, - провести точний аналіз та моделювання роботи однієї з таких систем. Об’єкт дослідження: Угрупування системи супутникового зв’язку низької навколоземної орбіти «Starlink» Предмет дослідження: Канал передачі данних та принцип функціонування супутникового угрупування. Наукова новизна: моделювання роботи супутникового сузір’я на территорії нашої країни. Практична значимість: можливість розглянути використання ССЗ низької навколоземної орбіти для використання в сфері послуг широкосмугового телекомунікаційного зв’язку, що раніше не представляло комерційного інтересу.The work cantains 76 pages, 26 figures and 3 tables and 2 applications. 71 sources were used. Relevance: Modern telecommunication networks in any country of the world are represented mainly by terrestrial fiber optics, DSL / ADSL cable networks, and radio frequency sensors. Every year, such networks become wider, increase amount of subscribers and the network traffic, the requirements for network quality and bandwidth are increasing. These types of terrestrial networks are uncommon in areas with low population density, or in sparsely populated areas that occupy most of the earth's surface. To resolve the problems of the World Wide Web availability, radically new solutions are needed that will be equally attractive to service providers and their customers. The aim of the work: analyze the existing solutions in the field of low-orbit GCC and systems in the process of deployment. Final result is modeling one of such system that will be provide services in our country. Research objectives: - to carry out analytical economics and technologies of network interaction. - to review modern satellite communication systems and compare them - consider the operation principles the GCC - to analyse and modeling of one such system. Object of research: Constellation of Low Earth orbit satelites "Starlink" Subject of research: Data transmission channel and operation principles of the satellite group. Scientific novelty: modeling the operation of a complete satellite constellation. Practical significance: the possibility of considering the use of low-Earth orbit GCCs for use in broadband telecommunications services, which has not commercial interest earlier. The possibility of considering the use of low-Earth orbit GCC for providing services

A Geographic Multicopy Routing Scheme for DTNs With Heterogeneous Mobility

Previous geographic routing schemes in delay/disruption tolerant networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose, “The-best-geographic-relay (TBGR)” routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks like clustered wireless sensor networks. 2) We next extend TBGR for heterogeneous scenario, and propose “the-best-heterogeneity-geographic-relay (TBHGR)” routing scheme considering individual nodal visiting preference (referred to nonidentical nodal mobility). Extensive results under a realistic heterogeneous scenario show the advantage of TBHGR over literature works in terms of reliable message delivery, while with low routing overhead