6 research outputs found

    Learning Periodic Human Behaviour Models from Sparse Data for Crowdsourcing Aid Delivery in Developing Countries

    Full text link
    In many developing countries, half the population lives in rural locations, where access to essentials such as school materials, mosquito nets, and medical supplies is restricted. We propose an alternative method of distribution (to standard road delivery) in which the existing mobility habits of a local population are leveraged to deliver aid, which raises two technical challenges in the areas optimisation and learning. For optimisation, a standard Markov decision process applied to this problem is intractable, so we provide an exact formulation that takes advantage of the periodicities in human location behaviour. To learn such behaviour models from sparse data (i.e., cell tower observations), we develop a Bayesian model of human mobility. Using real cell tower data of the mobility behaviour of 50,000 individuals in Ivory Coast, we find that our model outperforms the state of the art approaches in mobility prediction by at least 25% (in held-out data likelihood). Furthermore, when incorporating mobility prediction with our MDP approach, we find a 81.3% reduction in total delivery time versus routine planning that minimises just the number of participants in the solution path.Comment: Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013

    On exploiting priority relation graph for reliable multi-path communication in mobile social networks

    Full text link
    © 2018 Elsevier Inc. A mobile social network (MSN) consists of certain amount of mobile users with social characteristics, and it provides data delivery concerning social relationships between mobile users. In MSN, ordinary people contact each other more frequently if they have more social features in common. In this paper, we apply a new topology structure–priority relation graph (PRG) to evaluate the data delivery routing in MSN on the system-level. By using the natural order of nodes’ representation, the diameter, the regular degree and the multi-path technology, we determine the priority relation graph-based social feature routing (PRG-SFR) algorithm to find disjointed multi-paths in MSN. Here, the multi-path technology can be exploited for ensuring that, between each pair of sender and receiver, the important information can be delivered through a highly reliable path. Then we calculate the tolerant ability of ‘faults’ and estimate the availability of MSN on the theoretical level. Finally, we analyze the efficiency of PRG-SFR algorithm from the numerical standpoint in terms of fault tolerance, forwarding number, transmission time and delivery rate. Moreover, we make comparisons between PRG-SFR algorithm and certain state-of-the-art technologies

    A critical review of the routing protocols in opportunistic networks.

    Get PDF
    The goal of Opportunistic Networks (OppNets) is to enable message transmission in an infrastructure less environment where a reliable end-to-end connection between the hosts in not possible at all times. The role of OppNets is very crucial in today’s communication as it is still not possible to build a communication infrastructure in some geographical areas including mountains, oceans and other remote areas. Nodes participating in the message forwarding process in OppNets experience frequent disconnections. The employment of an appropriate routing protocol to achieve successful message delivery is one of the desirable requirements of OppNets. Routing challenges are very complex and evident in OppNets due to the dynamic nature and the topology of the intermittent networks. This adds more complexity in the choice of the suitable protocol to be employed in opportunistic scenarios, to enable message forwarding. With this in mind, the aim of this paper is to analyze a number of algorithms under each class of routing techniques that support message forwarding in OppNets and to compare those studied algorithms in terms of their performances, forwarding techniques, outcomes and success rates. An important outcome of this paper is the identifying of the optimum routing protocol under each class of routing

    Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey

    Get PDF
    CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions

    Methodologies for the analysis of value from delay-tolerant inter-satellite networking

    Get PDF
    In a world that is becoming increasingly connected, both in the sense of people and devices, it is of no surprise that users of the data enabled by satellites are exploring the potential brought about from a more connected Earth orbit environment. Lower data latency, higher revisit rates and higher volumes of information are the order of the day, and inter-connectivity is one of the ways in which this could be achieved. Within this dissertation, three main topics are investigated and built upon. First, the process of routing data through intermittently connected delay-tolerant networks is examined and a new routing protocol introduced, called Spae. The consideration of downstream resource limitations forms the heart of this novel approach which is shown to provide improvements in data routing that closely match that of a theoretically optimal scheme. Next, the value of inter-satellite networking is derived in such a way that removes the difficult task of costing the enabling inter-satellite link technology. Instead, value is defined as the price one should be willing to pay for the technology while retaining a mission value greater than its non-networking counterpart. This is achieved through the use of multi-attribute utility theory, trade-space analysis and system modelling, and demonstrated in two case studies. Finally, the effects of uncertainty in the form of sub-system failure are considered. Inter-satellite networking is shown to increase a system's resilience to failure through introduction of additional, partially failed states, made possible by data relay. The lifetime value of a system is then captured using a semi-analytical approach exploiting Markov chains, validated with a numerical Monte Carlo simulation approach. It is evident that while inter-satellite networking may offer more value in general, it does not necessarily result in a decrease in the loss of utility over the lifetime.In a world that is becoming increasingly connected, both in the sense of people and devices, it is of no surprise that users of the data enabled by satellites are exploring the potential brought about from a more connected Earth orbit environment. Lower data latency, higher revisit rates and higher volumes of information are the order of the day, and inter-connectivity is one of the ways in which this could be achieved. Within this dissertation, three main topics are investigated and built upon. First, the process of routing data through intermittently connected delay-tolerant networks is examined and a new routing protocol introduced, called Spae. The consideration of downstream resource limitations forms the heart of this novel approach which is shown to provide improvements in data routing that closely match that of a theoretically optimal scheme. Next, the value of inter-satellite networking is derived in such a way that removes the difficult task of costing the enabling inter-satellite link technology. Instead, value is defined as the price one should be willing to pay for the technology while retaining a mission value greater than its non-networking counterpart. This is achieved through the use of multi-attribute utility theory, trade-space analysis and system modelling, and demonstrated in two case studies. Finally, the effects of uncertainty in the form of sub-system failure are considered. Inter-satellite networking is shown to increase a system's resilience to failure through introduction of additional, partially failed states, made possible by data relay. The lifetime value of a system is then captured using a semi-analytical approach exploiting Markov chains, validated with a numerical Monte Carlo simulation approach. It is evident that while inter-satellite networking may offer more value in general, it does not necessarily result in a decrease in the loss of utility over the lifetime

    Roteamento em redes tolerantes a atrasos e interrupções: uma abordagem baseada em redes neurais

    Get PDF
    Tese (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2015.As Redes Tolerantes a Atrasos e Interrupções (DTN) foram concebidas para operar considerando interrupções e grandes atrasos na comunicação. O roteamento se torna uma tarefa mais desafiadora em contextos com alta frequência de mudança da topologia e poucas informações a respeito da topologia futura. Em uma rede formada somente por ônibus do sistema de transporte público, os contatos entre os ônibus acontecem de forma quase-oportunista devido à regularidade não estritamente seguida nos itinerários. Uma forma de melhorar o roteamento nas DTNs é explorar informações históricas e do cenário para aumentar a taxa de entrega de mensagens e diminuir o atraso na entrega e o consumo de recursos. Com poucas informações a serem exploradas no cenário, o roteamento fica mais difícil de ser tratado. Neste contexto, esta tese propõe uma nova abordagem de roteamento baseado em Redes Neurais Artificiais (RNA) que apresenta vantagens em relação as outras estratégias aplicáveis nas mesmas condições, tal como a estratégia do caminho de probabilidade máxima (MaxProp). Um mecanismo de predição de contatos baseado em RNA foi desenvolvido para permitir a obtenção de contatos futuros que então são utilizados em um mecanismo de construção de jornadas, permitindo estimar a melhor jornada até o destino. Um procedimento para projetar as RNAs é apresentado. Um simulador de troca de mensagens foi desenvolvido para testar as estratégias avaliadas. Os resultados obtidos demonstram que a abordagem desenvolvida atinge um maior número de mensagens entregues, menor atraso e menor custo de uso da rede. Esses resultados foram obtidos nas versões com ou sem replicação de mensagens utilizando dados reais ou sintéticos. Uma modelagem para a implementação da estratégia de roteamento proposta projetada para funcionar na arquitetura da Internet Research Task Force (IRTF) é apresentada.Abstract : Delay/disruption Tolerant Networks (DTN) are designed to operate considering interruptions and high delays in communication. The routing becomes a more challenging task in a context of a high frequency of topology changes in which little information are available. In a network formed just by buses of a bus transportation system, the contacts are quasi-opportunistic due the regularity in the itineraries not strictly followed by the bus. A manner to improve the routing in DTN is to exploit historical information to increase the delivery rate and decrease the delivery delay and resources consumption. In this context, this thesis describes a new routing approach based on Artificial Neural Networks (ANN) presenting advantages over other applicable strategies in the same conditions, such as the maximum probability path (Max- Prop). A contact predictor based on ANN was developed to achieve future contacts. The predicted contacts are used in a journey predictor, aiming to obtain the best journey to the destination. A procedure for designing of ANNs is presented. A message forwarding simulator was developed to test the evaluated strategies. The obtained results demonstrate that the developed approach increases the number of delivered messages, decreases the delivery delay and decreases the delivery cost. These results are verified both in the version with message replication, as without message replication, using synthetic or real data. A modeling for the implementation of the proposed routing strategy designed to work in the Internet Research Task Force (IRTF) architecture is presented
    corecore