Machine-to-Machine (M2M) communications

Routing protocols in Vehicular Delay Tolerant Networks: A comprehensive survey

A survey of routing and data dissemination in Delay Tolerant Networks

In mobile cloud computing (MCC) paradigm, cloud service providers not only offer powerful cloud data centers but also provide small-scale cloudlets in some strategic locations for mobile users to access their rich resources. Due to the flexibility and locality of cloudlets, most requests of mobile users can be processed locally. However, the cloudlets usually have limited resources and processing abilities, which implies that they may not be capable to process every incoming request. Instead, some resource-intensive requests need to be sent to remote data centers for processing and such a processing is transparent to users. In this paper, we address the online request admission issue in a cloudlet with an objective to maximize the system throughput, for which we first propose a novel admission cost model to model critical resource consumptions. We then devise efficient control algorithms for online request admissions. We finally conduct experiments by simulations to evaluate the performance of the proposed algorithms. Experimental results indicate that the proposed algorithms are promising and outperform other heuristics.

/pdf/throughput-maximization-for-online-request-admissions-in-2h2yzlrptn.pdf

Throughput maximization for online request admissions in mobile cloudlets

Networks that lack continuous end-to-end connections among their nodes due to node mobility, constrained power sources, or limited data storage space are called DTNs. To overcome the intermittent connectivity, DTN nodes store and carry the data packets they receive until they come into communication range of each other. In addition, they spread multiple copies of the same packet on the network to increase the delivery probability. In recent years, several routing protocols have been developed specifically for DTNs. These protocols vary in the number of copies they spread and the information they use to guide the packets to their destinations. There have been some reviews of those protocols, but no performance comparison has been conducted. In this article, we study four well-known DTN routing protocols: EPIDEMIC, Spray-and-Wait, PROPHET, and MAXPROP. We introduce a procedural form to present the protocols. We measure the performance of the protocols in terms of packet delivery, delivery cost, and average packet delay. We compare the protocols' performance together with the results of optimal routing using real-life scenarios of vehicles and pedestrians roaming in a city. We conduct several simulation experiments to show the impact of changing buffer capacity, packet lifetime, packet generation rate, and number of nodes on the performance metrics. The article is concluded by providing guidelines to develop an efficient DTN routing protocol. To the best of our knowledge, this work is the first to provide a detailed performance comparison among the diverse collection of DTN routing protocols.

A performance comparison of delay-tolerant network routing protocols

Delay tolerant networks (DTN) are characterized by a lack of continuous end-to-end connections due to node mobility, constrained power sources, and limited data storage space of some or all of its nodes. To overcome the frequent disconnections, DTN nodes are required to store data packets for long periods of time until they come near other nodes. Moreover, to increase the delivery probability, they spread multiple copies of the same packet on the network so that one of them reaches the destination. Given the limited storage and energy resources of many DTN nodes, there is a tradeoff between maximizing delivery and minimizing storage and energy consumption. In this paper, we study the routing problem in DTN with limited resources. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. Next, we propose a new protocol based on social grouping among the nodes to maximize data delivery while minimizing network overhead by efficiently spreading the packet copies in the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead.

SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping

In this paper, we propose a new routing protocol for home networks, called dependable routing protocol (DRP) that adapts to the changes in local topology within home networks nvironments. DRP is based on an effective selection of paths through which a packet must pass to reach the home unit. The selection, in such dynamic home networks, is made using dependable routing, i.e, in a way that maximizes the routes quality between the network nodes and the home unit while minimizing the Failure of Service (FoS). To minimize FoS, DRP maintains requirements on both the tolerable end-to-end delay (for time-sensitive routing) and the bit error rate (for reliable routing) within the network. To achieve this, we formulate the routing dependability problem mathematically as a constrained optimization problem. Specifically, analytical expressions for the route quality as well as the delay and bit error rate of a route in a home network scenario are derived. Numerical and simulation results show that the proposed approach gives optimal or near-optimal solutions and improves significantly the home network performance when compared to one prominent routing protocol: the Minimum Total Transmission Power Routing scheme, MTPR.

http://rboutaba.cs.uwaterloo.ca/Papers/Conferences/2011/SaleetGC11.pdf

Vineet Srivastava

Papers

SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping

A performance comparison of delay-tolerant network routing protocols

Performance Modeling of Routing Dependability in Home Networks