Internet Predictions

More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future. A summary of the articles is available in the Web extras section

Solutions for vehicular communications: a review

Vehicular networks experience a number of unique challenges due to the high mobility of vehicles and highly dynamic network topology, short contact durations, disruption intermittent connectivity, significant loss rates, node density, and frequent network fragmentation. All these issues have a profound impact on routing strategies in these networks. This paper gives an insight about available solutions on related literature for vehicular communications. It overviews and compares the most relevant approaches for data communication in these networks, discussing their influence on routing strategies. It intends to stimulate research and contribute to further advances in this rapidly evolving area where many key open issues that still remain to be addressed are identified.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group (NetGNA), Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of the Seventh Framework Programme of EU, in the framework of the Specific Joint Research Project VDTN

Cognitive Communications and Networking Technology Infusion Study Report

As the envisioned next-generation SCaN Network transitions into an end-to-end system of systems with new enabling capabilities, it is anticipated that the introduction of machine learning, artificial intelligence, and other cognitive strategies into the network infrastructure will result in increased mission science return, improved resource efficiencies, and increased autonomy and reliability. This enhanced set of cognitive capabilities will be implemented via a space cloud concept to achieve a service-oriented architecture with distributed cognition, de-centralized routing, and shared, on-orbit data processing. The enabling cognitive communications and networking capabilities that may facilitate the desired network enhancements are identified in this document, and the associated enablers of these capabilities, such as technologies and standards, are described in detail

Routing in Delay Tolerant Networks

Delay-tolerant networks (DTNs) have the great potential to connecting devices and regions of the world that are presently under-served by current networks. A vital challenge for Delay Tolerant Networks is to determine the routes through the network without ever having an end to end path, or knowing which routers will be connected at any given instant of time. The problem has an added constraint of limited size of buffers at each node. This situation limits the applicability of traditional routing techniques which categorize lack of path as failure of nodes and try to seek for existing end-to-end path. Approaches have been proposed which focus either on epidemic message replication or on previously known information about the connectivity schedule. The epidemic approach, which is basically a flooding technique, of replicating messages to all nodes has a very high overhead and does not perform well with increasing load. It can, however, operate without any prior information on the network configuration. On the other hand, the alternatives, i.e., having a prior knowledge about the connectivity, seems to be infeasible for a self-configuring network. In this project we try to maximize the message delivery rate without compromising on the amount of message discarded. The amount of message discarded has a direct relation to the bandwidth used and the battery consumed. The more the message discarded more is the bandwidth used and battery consumed by every node in transmitting the message. At the same time, with the increase in the number of messages discarded, the cost for processing every message increases and this adversely affects the nodes. Therefore, we have proposed an algorithm where the messages are disseminated faster into the network with lesser number of replication of individual messages. The history of encounter of a node with other nodes gives noisy but valuable information about the network topology. Using this history, we try to route the packets from one node to another using an algorithm that depends on each node’s present available neighbours/contact and the nodes which it has encountered in the recent past. We have also focused on passing the messages to those nodes which are on the move away from the source/forwarder node, as the nodes moving away have a greater probability of disseminating the messages throughout the network and hence increases chances of delivering the message to the destination

Data transmission, handling and dissemination issues of EUCLID Data

The key features of the Euclid Science Ground Segment (SGS) are the amount of data that the mission will generate, the heavy processing load that is needed to go from the raw data to the science products, the number of parties involved in the data processing, and the accuracy and quality control level that are required at every step of the processing. This enforces a data-centric approach, in the sense that all the operations of the SGS will revolve around a Euclid Archive System (EAS) that will play a central role in the storage of data products and their metadata

Performance Assessment of Aggregation and Deaggregation Algorithms in Vehicular Delay-Tolerant Networks

Vehicular Delay-Tolerant Networks (VDTNs) are a new approach for vehicular communications where vehicles cooperate with each other, acting as the communication infrastructure, to provide low-cost asynchronous opportunistic communications. These communication technologies assume variable delays and bandwidth constraints characterized by a non-transmission control protocol/ internet protocol architecture but interacting with it at the edge of the network. VDTNs are based on the principle of asynchronous communications, bundleoriented communication from the DTN architecture, employing a store-carryand- forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. At the ingress edge nodes, incoming IP Packets (datagrams) are assembled into large data packets, called bundles. The bundle aggregation process plays an important role on the performance of VDTN applications. Then, this paper presents three aggregation algorithms based on time, bundle size, and a hybrid solution with combination of both. Furthermore, the following four aggregation schemes with quality of service (QoS) support are proposed: 1) single-class bundle with N = M, 2) composite-class bundle with N = M, 3) single-class bundle with N > M, and 4) composite-class bundle with N > M, where N is the number of classes of incoming packets and M is the number of priorities supported by the VDTN core network. The proposed mechanisms were evaluated through a laboratory testbed, called VDTN@Lab. The adaptive hybrid approach and the composite-class schemes present the best performance for different types of traffic load and best priorities distribution, respectively

Improving Message Delivery Performance in Opportunistic Networks using a Forced-stop diffusion scheme

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-40509-4_11The performance of mobile opportunistic networks strongly depends on contact duration. If the contact lasts less than the required transmission times, some messages will not get delivered, and the whole diffusion scheme will be seriously affected. In this paper we propose a new diffusion method, called Forced-Stop, that is based on controlling node mobility to guarantee a complete message transfer. Using the ONE simulator and realistic mobility traces, we compared our proposal with the classical Epidemic diffusion. We show that Forced-Stop improves the message delivery performance, increasing the delivery ratio up to 30\%, and reducing the latency of message delivery up to 40\%, with a limited impact on buffer utilisation and message relaying. These results can be a relevant indication to the designers of opportunistic network applications that could integrate in their products strategies to inform the user about the need to temporarily stop in order to favor the overall data delivery.This work was partially supported by the Ministerio de Economía y Competitividad, Programa Estatal de Investigación, Desarrollo e Innovación Orientada a los Retos de la Sociedad, Proyectos I+D+I 2014, Spain, under Grant TEC2014-52690-R, the Generalitat Valenciana, Spain, under Grant AICO/2015/108, the Secretaría Nacional de Educación Superior, Ciencia, Tecnología e Innovación del Ecuador(SENESCYT), and the Universidad Laica Eloy Alfaro de Manabi, Ecuador.Herrera Tapia, J.; Hernández Orallo, E.; Tomás Domínguez, AE.; Manzoni, P.; Tavares De Araujo Cesariny Calafate, CM.; Cano Escribá, JC. (2016). Improving Message Delivery Performance in Opportunistic Networks using a Forced-stop diffusion scheme. En Ad-hoc, Mobile, and Wireless Networks. Springer. 156-168. https://doi.org/10.1007/978-3-319-40509-4_11S156168Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006)Ferretti, S.: Shaping opportunistic networks. Comput. Commun. 36, 481–503 (2013)Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, Rome (2009)Tsai, T.-C., Chan, H.-H.: NCCU Trace: social-network-aware mobility trace. IEEE Commun. Mag. 53, 144–149 (2015)AnAverage WhatsApp User Sends Messages per Month, 15 September 2015. http://www.statista.com/chart/1938/monthly-whatsapp-usage-per-userNiu, J., Guo, J., Cai, Q., Sadeh, N., Guo, S.: predict and spread: an efficient routing algorithm for opportunistic networking. In: Wireless Communications and Networking Conference (WCNC), 2011 IEEE, pp. 498–503, Cancún (2011)Thakur, G.S., Kumar, U., Helmy, A., Hsu, W.-J.: On the efficacy of mobility modeling for DTN evaluation: analysis of encounter statistics andspatio-temporal preferences. In: 7th International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 510–515, Istanbul (2011)Warthman, F.: Delay-and Disruption-Tolerant Networks (DTNs) a tutorial, version 2.0. In: The InterPlaNetary (IPN) Internet Project. InterPlanetary Networking Special Interest Group (IPNSIG) (2012)Battestini, A., Setlur, V., Sohn, T.: A large scale study of text messaging use. In: 12th International Conference on Human Computer Interaction with Mobile Devices and Services MobileHCI, pp. 1–10, Lisbon (2010)Förster, A., Garg, K., Nguyen, H.A., Giordano, S. On context awareness and social distance in human mobility traces. In: Third ACM International Workshop on Mobile Opportunistic Networks, pp. 5–12, Zürich (2012)Boldrini, C., Conti, M., Passarella, A.: Modelling data dissemination in opportunistic networks. In: Proceedings of the Third ACM Workshop on Challenged Networks - CHANTS 2008, pp. 89–96, San Francisco (2008)Natalizio, E., Loscrí, V.: Controlled mobility in mobile sensor networks: advantages, issues and challenges. Telecommun. Syst. 52(4), 2411–2418 (2013)Neena, V.V., Rajam, V.M.A.: Performance analysis of epidemic routing protocol for opportunistic networks in different mobility patterns. In: 2013 International Conference on Computer Communication and Informatics, pp. 1–5, Coimbatore (2013)Mehta, N., Shah, M.: Performance evaluation of efficient routing protocols in delay tolerant network under different human mobility models. Int. J. Grid Distrib. Comput. 8(1), 169–178 (2015)Su, J., Chin, A., Popivanova, A., Goel, A., Lara, E.D.: User mobility for opportunistic ad-hoc networking. In: Sixth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2004), Low Wood (2004)Feng, Z., Chin, K.-W.: A unified study of epidemic routing protocols and their enhancements. In: IEEE 26th International Parallel and Distributed Processing Symposium Workshops PhD Forum (IPDPSW), pp. 1484–1493, Shanghai (2012)Vardalis, D., Tsaoussidis, V.: Exploiting the potential of DTN for energy-efficient internetworking. J. Syst. Softw. 90, 91–103 (2014)Rango, F.D., Amelio, S., Fazio, P.: Epidemic strategies in delay tolerant networks from an energetic point of view: main issues and performance evaluation. J. Networks 10(01), 4–14 (2015)Herrera-Tapia, J., Manzoni, P., Hernández-Orallo, E., Calafate, C.T., Cano, J.-C.: Power consumption evaluation in vehicular opportunistic networks. In: IEEE 12th CCNC 2015 Workshops - VENITS, pp. 925–930, Las Vegas (2015)Erramilli, V., Crovella, M.: Forwarding in opportunistic networks with resource constraints. In: Proceedings of the third ACM workshop on Challenged networks - CHANTS 2008, pp. 41–47, San Francisco (2008)Fathima, G., Wahidabanu, R.: Buffer management for preferential delivery in opportunistic delay tolerant networks. Int. J. Wirel. Mob. Netw. (IJWMN) 3, 15–28 (2011)Pan, D., Ruan, Z., Zhou, N., Liu, X., Song, Z.: A comprehensive-integrated buffer management strategy for opportunistic networks. EURASIP J. Wirel. Commun. Netw. 2013(1), 1–10 (2013)Hernández-Orallo, E., Herrera-Tapia, J., Cano, J.-C., Calafate, C.T., Manzoni, P.: Evaluating the impact of data transfer time in contact-based messaging applications. IEEE Commun. Lett. 19, 1814–1817 (2015)de Abreu, C.S., Salles, R.M.: Modeling message diffusion in epidemical DTN. Ad Hoc Netw. 16, 197–209 (2014

The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions

In recent years, the current Internet has experienced an unexpected paradigm shift in the usage model, which has pushed researchers towards the design of the Information-Centric Networking (ICN) paradigm as a possible replacement of the existing architecture. Even though both Academia and Industry have investigated the feasibility and effectiveness of ICN, achieving the complete replacement of the Internet Protocol (IP) is a challenging task. Some research groups have already addressed the coexistence by designing their own architectures, but none of those is the final solution to move towards the future Internet considering the unaltered state of the networking. To design such architecture, the research community needs now a comprehensive overview of the existing solutions that have so far addressed the coexistence. The purpose of this paper is to reach this goal by providing the first comprehensive survey and classification of the coexistence architectures according to their features (i.e., deployment approach, deployment scenarios, addressed coexistence requirements and architecture or technology used) and evaluation parameters (i.e., challenges emerging during the deployment and the runtime behaviour of an architecture). We believe that this paper will finally fill the gap required for moving towards the design of the final coexistence architecture.Comment: 23 pages, 16 figures, 3 table

Efficient Routing Protocol in Delay Tolerant Networks (DTNs)

Modern Internet protocols demonstrate inefficient performance in those networks where the connectivity between end nodes has intermittent property due to dynamic topology or resource constraints. Network environments where the nodes are characterized by opportunistic connectivity are referred to as Delay Tolerant Networks (DTNs). Highly usable in numerous practical applications such as low-density mobile ad hoc networks, command/response military networks and wireless sensor networks, DTNs have been one of the growing topics of interest characterized by significant amount of research efforts invested in this area over the past decade. Routing is one of the major components significantly affecting the overall performance of DTN networks in terms of resource consumption, data delivery and latency. Over the past few years a number of routing protocols have been proposed. The focus of this thesis is on description, classification and comparison of these protocols. We discuss the state-of-the-art routing schemes and methods in opportunistic networks and classify them into two main deterministic and stochastic routing categories. The classification is based on forwarding decisions in routing methods adopted with or without the knowledge about the network topology and nodes trajectories. The protocols in each class have their own advantages and shortcomings. In the stochastic routing protocols category, simple flooding-based protocols are feasible approaches in those networks where there is a little or no information about the network topology and there is no resource restriction. Epidemic routing is a flooding- based protocol relying upon the distribution of messages through the networks to deliver information to their destinations. To demonstrate the performance of the epidemic routing protocol for information delivery in networks with intermittent connectivities, we provide several simulation experiments and show that this protocol with reasonable aggregate resource consumption, ensures eventual message delivery in networks, using minimal assumptions regarding nodes trajectories, network topology and connectivity of underlying networks and only based on sufficient number of random pair-wise exchanges of messages among mobile nodes. In the following, we introduce the recently proposed network coding concept and discuss coding-based information delivery advantages in wireless networks. Network coding is a recently introduced paradigm to efficiently disseminate data in wireless networks in which data flows coming from multiple sources are combined to increase throughput, reduce delay, and enhance robustness against node failures. Finally, we present some simulation experiments to show the superiority of network coding for information delivery in wireless networks, compared to pure flooding-based mechanisms. /Kir1