Towards Opportunistic Data Dissemination in Mobile Phone Sensor Networks

Recently, there has been a growing interest within the research community in developing opportunistic routing protocols. Many schemes have been proposed; however, they differ greatly in assumptions and in type of network for which they are evaluated. As a result, researchers have an ambiguous understanding of how these schemes compare against each other in their specific applications. To investigate the performance of existing opportunistic routing algorithms in realistic scenarios, we propose a heterogeneous architecture including fixed infrastructure, mobile infrastructure, and mobile nodes. The proposed architecture focuses on how to utilize the available, low cost short-range radios of mobile phones for data gathering and dissemination. We also propose a new realistic mobility model and metrics. Existing opportunistic routing protocols are simulated and evaluated with the proposed heterogeneous architecture, mobility models, and transmission interfaces. Results show that some protocols suffer long time-to-live (TTL), while others suffer short TTL. We show that heterogeneous sensor network architectures need heterogeneous routing algorithms, such as a combination of Epidemic and Spray and Wait

An Overlay Routing Protocol for Video over sparse MANETs in Emergencies

Video delivery over a mobile ad-hoc network that can be deployed by members of an emergency service in an incident zone is an appealing tool for emergency and rescue services, but has not be studied yet. In order to design and test a suitable solution, we have generated realistic evaluation scenarios by modeling fireman action plans and GPS traces from real situations. The Emergency Overlay Routing (EOR) protocol is a reactive protocol integrated into a store-carry-forward architecture. It selects ferry nodes to transport video data from a camera in the Incident Area to the Incident Chief’s node, looking for the minimum delay, but reliable, candidate. The evaluation of EOR shows its superiority to the well-known DTN routing protocol, PROPHET, under this conditions

Towards reliable video transmission over sparse MANETs in emergencies

Video delivery in a mobile ad-hoc network that can be deployed by members of an emergency service in an incident zone is an appealing tool for emergency and rescue services, but has not been studied yet. In order to design and test a suitable solution, we have generated realistic evaluation scenarios by modeling fireman action plans and GPS traces from real situations. We propose an overlay network solution with routing and reliability mechanisms. The Emergency Overlay Routing (EOR) protocol is a reactive protocol integrated into a store-carry-forward architecture. It selects ferry nodes to transport video data from a camera in the Incident Area to the Incident Chief’s node, looking for the minimum delay, but reliable, candidate. We also propose a simple credit based mechanism (RTCP+) to improve the communication reliability. The evaluation of the whole system shows a great improvement against previous results and promising expectations

Towards reliable video transmission over sparse MANETs in emergencies

Video delivery in a mobile ad-hoc network that can be deployed by members of an emergency service in an incident zone is an appealing tool for emergency and rescue services, but has not been studied yet. In order to design and test a suitable solution, we have generated realistic evaluation scenarios by modeling fireman action plans and GPS traces from real situations. We propose an overlay network solution with routing and reliability mechanisms. The Emergency Overlay Routing (EOR) protocol is a reactive protocol integrated into a store-carry-forward architecture. It selects ferry nodes to transport video data from a camera in the Incident Area to the Incident Chief’s node, looking for the minimum delay, but reliable, candidate. We also propose a simple credit based mechanism (RTCP+) to improve the communication reliability. The evaluation of the whole system shows a great improvement against previous results and promising expectations

A mobile agent and message ferry mechanism based routing for delay tolerant network

Delay Tolerant Network (DTN) is a class of networks characterized by long delays, frequent disconnections and partitioning of communication paths between network nodes. Due to the frequent disconnection and network partitioning, the overall performance of the network will be deteriorated sharply. The problem is how to make the network fairly connected to optimize data routing and enhance the performance of a network. The aim of this study is to improve the performance of DTN by minimizing end-to-end delivery time and increasing message delivery ratio. Therefore, this research tackles the problem of intermittent connectivity and network partitioning by introducing Agents and Ferry Mechanism based Routing (AFMR). The AFMR comprises of two stages by applying two schemes: mobile agents and ferry mechanism. The agents' scheme is proposed to deal with intermittent connectivity and network partitioning by collecting the basic information about network connection such as signal strength, nodes position in the network and distance to the destination nodes to minimize end-to-end delivery time. The second stage is to increase the message delivery ratio by moving the nodes towards the path with available network connectivity based on agents' feedback. The AFMR is evaluated through simulations and the results are compared with those of Epidemic, PRoPHET and Message Ferry (MF). The findings demonstrate that AFMR is superior to all three, with respect to the average end-to-end delivery time, message delivery ratio, network load and message drop ratio, which are regarded as extremely important metrics for the evaluation of DTN routing protocols. The AFMR achieves improved network performance in terms of end-to-end delivery time (56.3%); enhanced message delivery ratio (60.0%); mitigation of message drop (63.5%) and reduced network load (26.1 %). The contributions of this thesis are to enhance the performance of DTN by significantly overcoming the intermittent connectivity and network partitioning problems in the network

Hybrid performance modelling of opportunistic networks

We demonstrate the modelling of opportunistic networks using the process algebra stochastic HYPE. Network traffic is modelled as continuous flows, contact between nodes in the network is modelled stochastically, and instantaneous decisions are modelled as discrete events. Our model describes a network of stationary video sensors with a mobile ferry which collects data from the sensors and delivers it to the base station. We consider different mobility models and different buffer sizes for the ferries. This case study illustrates the flexibility and expressive power of stochastic HYPE. We also discuss the software that enables us to describe stochastic HYPE models and simulate them.Comment: In Proceedings QAPL 2012, arXiv:1207.055