Timely Data Delivery in a Realistic Bus Network

Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I

Timely data delivery in a realistic bus network

Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I

TP-DS: A Heuristic Approach for Traffic Pattern Discovery System in MANET’s

As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. Many techniques are proposed to enhance the anonymous communication in case of the mobile ad hoc networks (MANETs). However, MANETs are vulnerable under certain circumstances like passive attacks and traffic analysis attacks. Traffic analysis problem expose some of the methods and attacks that could infer MANETs are still weak under the passive attacks. In this Research, proposed ‘Traffic pattern Discovery System in MANET’s, aheuristic approach(TP-DS) , enables a passive global adversary to accurately infer the traffic pattern in an anonymous MANET without compromising any node. TP-DS works well on existing on-demand anonymous MANET routing protocols to determine the source node, destination node and the end-to-end communication path. Detailed simulations show that TP-DS can infer the hidden traffic pattern with accuracy as high than the TP-DS and gives the result with accuracy of 95%. DOI: 10.17762/ijritcc2321-8169.150310

Delay Tolerant Networking over the Metropolitan Public Transportation

We discuss MDTN: a delay tolerant application platform built on top of the Public Transportation System (PTS) and able to provide service access while exploiting opportunistic connectivity. Our solution adopts a carrier-based approach where buses act as data collectors for user requests requiring Internet access. Simulations based on real maps and PTS routes with state-of-the-art routing protocols demonstrate that MDTN represents a viable solution for elastic nonreal-time service delivery. Nevertheless, performance indexes of the considered routing policies show that there is no golden rule for optimal performance and a tailored routing strategy is required for each specific case

Deploying public surface transit to forward messages in DTN

Delay Tolerant Network (DTN) is a communication architecture enabling connectivity in a topology with unregular end-to-end network connection. DTN enables communication in environments with cross-connectivity, large delays and delivery time variations, and a high error rate. DTN can be used in vehicular networks where public transport get involved. This research aims to analyze the role of public transit as a DTN routing infrastructure. The impact of using public transit as a relay router is investigated by referencing the network performance, defined by its delivery ratio, average delay and overhead. The results show that public transit can be used as a backbone for DTN in an urban scenario using existing protocols. This opens insights for future researches on routing algorithm and protocol design

Connectivity Contribution to Urban Hub Network Based on Super Network Theory – Case Study of Beijing

With the rapid development of urbanization in China, the number of travel modes and urban passenger transportation hubs has been increasing, gradually forming multi-level and multi-attribute transport hub networks in the cities. At the same time, Super Network Theory (SNT) has advantages in displaying the multi-layer transport hubs. The aim of this paper is to provide a new perspective to study connectivity contribution of potential hubs. Urban transport hubs are ranked through topological features based on Hub Super Network (HSN). This paper proposes two indexes based on Super-Edge (SE), Zero Hub Degree of SE (ZHDoSE) and a number of shared SEes (NSSE), respectively. Then, a case study was conducted in Beijing, which considers four combinations to study the influence of transport modes and subway lines on connectivity. The results show that no-normalization strengthens the contribution of transport modes and subway lines on connectivity. Besides, the transport mode contributes a lot to the connectivity. However, elements normalization strengthens the subway lines under ZHDoSE reciprocal. In addition, various weights of ZHDoSE and NSSE have different influences on the recognition results of SEes in HSN

Content Download in Vehicular Networks in Presence of Noisy Mobility Prediction

Bandwidth availability in the cellular backhaul is challenged by ever-increasing demand by mobile users. Vehicular users, in particular, are likely to retrieve large quantities of data, choking the cel- lular infrastructure along major thoroughfares and in urban areas. It is envisioned that alternative roadside network connectivity can play an important role in offloading the cellular infrastructure. We investigate the effectiveness of vehicular networks in this task, considering that roadside units can exploit mobility prediction to decide which data they should fetch from the Internet and to schedule transmissions to vehicles. Rather than adopting a specific prediction scheme, we propose a fog-of-war model that allows us to express and account for different degrees of prediction accuracy in a simple, yet effective, manner. We show that our fog-of-war model can closely reproduce the prediction accuracy of Markovian techniques. We then provide a probabilistic graph-based representation of the system that includes the prediction information and lets us optimize content prefetching and transmission scheduling. Analytical and simulation results show that our approach to content downloading through vehicular networks can achieve a 70% offload of the cellular networ

Cloud-Assisted Safety Message Dissemination in VANET-Cellular Heterogeneous Wireless Network

Abstract-In vehicular ad-hoc networks (VANETs), efficient message dissemination is critical to road safety and traffic efficiency. Since many VANET-based schemes suffer from high transmission delay and data redundancy, integrated VANETcellular heterogeneous network has been proposed recently and attracted significant attention. However, most existing studies focus on selecting suitable gateways to deliver safety message from the source vehicle to a remote server, while rapid safety message dissemination from the remote server to a targeted area has not been well studied. In this paper, we propose a framework for rapid message dissemination that combines the advantages of diverse communication and cloud computing technologies

Maximizing Routing Throughput with Applications to Delay Tolerant Networks

abstract: Many applications require efficient data routing and dissemination in Delay Tolerant Networks (DTNs) in order to maximize the throughput of data in the network, such as providing healthcare to remote communities, and spreading related information in Mobile Social Networks (MSNs). In this thesis, the feasibility of using boats in the Amazon Delta Riverine region as data mule nodes is investigated and a robust data routing algorithm based on a fountain code approach is designed to ensure fast and timely data delivery considering unpredictable boat delays, break-downs, and high transmission failures. Then, the scenario of providing healthcare in Amazon Delta Region is extended to a general All-or-Nothing (Splittable) Multicommodity Flow (ANF) problem and a polynomial time constant approximation algorithm is designed for the maximum throughput routing problem based on a randomized rounding scheme with applications to DTNs. In an MSN, message content is closely related to users’ preferences, and can be used to significantly impact the performance of data dissemination. An interest- and content-based algorithm is developed where the contents of the messages, along with the network structural information are taken into consideration when making message relay decisions in order to maximize data throughput in an MSN. Extensive experiments show the effectiveness of the above proposed data dissemination algorithm by comparing it with state-of-the-art techniques.Dissertation/ThesisDoctoral Dissertation Computer Science 201