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

Internet of Satellites (IoSat): analysis of network models and routing protocol requirements

The space segment has been evolved from monolithic to distributed satellite systems. One of these distributed systems is called the federated satellite system (FSS) which aims at establishing a win-win collaboration between satellites to improve their mission performance by using the unused on-board resources. The FSS concept requires sporadic and direct communications between satellites, using inter satellite links. However, this point-to-point communication is temporal and thus it can break existent federations. Therefore, the conception of a multi-hop scenario needs to be addressed. This is the goal of the Internet of satellites (IoSat) paradigm which, as opposed to a common backbone, proposes the creation of a network using a peer-to-peer architecture. In particular, the same satellites take part of the network by establishing intermediate collaborations to deploy a FSS. This paradigm supposes a major challenge in terms of network definition and routing protocol. Therefore, this paper not only details the IoSat paradigm, but it also analyses the different satellite network models. Furthermore, it evaluates the routing protocol candidates that could be used to implement the IoSat paradigm.Peer ReviewedPostprint (author's final draft

Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network

An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good properties of the network structure. It is recoverable for local accidents in the hierarchical network structure. Moreover, the design principle is theoretically supported with a calculation method for the optimal service rates of message-ferries derived from a tandem queue model for stochastic processes on a chain of edges in the network. These results obtained from a combination of complex network science and computer science will be useful for developing a resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of Collective Adaptive Systems) at The 9th IEEE International Conference on SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201

Secure Group Communication in Delay Tolerant Mobile Ad-Hoc Network

Delay-tolerant networks (DTNs) are well-known for delivering various types of information from different senders in a multicast manner, both in centralised and decentralised networks. Wireless mobile nodes form small networks in which one or more senders transmit data to one or more destinations through intermediate nodes. DTN routing protocols differ from traditional wireless routing protocols. There are security threats in DTNs, such as blackhole attackers dropping data, jamming attacks consuming bandwidth, and Vampire attacks depleting battery power and available bandwidth. This paper proposes a prevention scheme to detect and mitigate all three types of attackers in multicast communication. These attackers can impact performance by generating false replies, flooding with redundant information, and wasting communication power. The primary focus of this paper is on security issues related to DTN routing protocols. In order to counter malicious nodes, a blacklist is maintained, and if a neighbour identifies a node as malicious, it excludes packets from that node. Meanwhile, the neighbour continues sending packets to the malicious node, except for broadcast packets, which are dropped. If a node is found to forward no packets or only some packets by all its neighbours, any reply it gives to route requests is disregarded, and any request it initiates is ignored. Successful data reception at the destination indicates that hop-based data delivery maintains a record of successful transmissions. The proposed security scheme demonstrates improved performance

Towards low cost prototyping of mobile opportunistic disconnection tolerant networks and systems

Fast emerging mobile edge computing, mobile clouds, Internet of Things (IoT) and cyber physical systems require many novel realistic real time multi-layer algorithms for a wide range of domains, such as intelligent content provision and processing, smart transport, smart manufacturing systems and mobile end user applications. This paper proposes a low cost open source platform, MODiToNeS, which uses commodity hardware to support prototyping and testing of fully distributed multi-layer complex algorithms over real world (or pseudo real) traces. MODiToNeS platform is generic and comprises multiple interfaces that allow real time topology and mobility control, deployment and analysis of different self-organised and self-adaptive routing algorithms, real time content processing, and real time environment sensing with predictive analytics. Our platform also allows rich interactivity with the user. We show deployment and analysis of two vastly different complex networking systems: fault and disconnection aware smart manufacturing sensor network and cognitive privacy for personal clouds. We show that our platform design can integrate both contexts transparently and organically and allows a wide range of analysis

Routing and Applications of Vehicular Named Data Networking

Vehicular Ad hoc NETwork (VANET) allows vehicles to exchange important informationamong themselves and has become a critical component for enabling smart transportation.In VANET, vehicles are more interested in content itself than from which vehicle the contentis originated. Named Data Networking (NDN) is an Internet architecture that concentrateson what the content is rather than where the content is located. We adopt NDN as theunderlying communication paradigm for VANET because it can better address a plethora ofproblems in VANET, such as frequent disconnections and fast mobility of vehicles. However,vehicular named data networking faces the problem of how to efficiently route interestpackets and data packets. To address the problem, we propose a new geographic routing strategy of applying NDNin vehicular networks with Delay Tolerant Networking (DTN) support, called GeoDTN-NDN. We designed a hybrid routing mechanism for solving the flooding issue of forwardinginterest packets and the disruption problem of delivering data packets. To avoid disruptionscaused by routing packets over less-traveled roads, we develop a new progressive segmentrouting approach that takes into consideration how vehicles are distributed among differentroads, with the goal of favoring well-traveled roads. A novel criterion for determiningprogress of routing is designed to guarantee that the destination will be reached no matterwhether a temporary loop may be formed in the path. We also investigate applications of vehicular named data networking. We categorizethese applications into four types and design an NDN naming scheme for them. We proposea fog-computing based architecture to support the smart parking application, which enablesa driver to find a parking lot with available parking space and make reservation for futureparking need. Finally we describe several future research directions for vehicular nameddata networking

PaFiR : Particle Filter Routing – a predictive relaying scheme for UAV-assisted IoT communications in future innovated networks

Increasing urbanization, smart cities and other cutting-edge technologies offer the prospect of providing more functions to benefit citizens by relying on the substantial data processing and exchange capabilities now possible. This can generate significant unpredictable and unbalanced data loads for the bearing IoT network to support its application and service demands. We thus propose a wireless routing scheme designed to use the Particle Filter algorithm to empower portable smart devices with intelligent capacities for the radio communication system. This facilitates the offloading of traffic from traditional wireless networks and enables the IoT system to adopt unmanned aerial vehicles, thus also offering further innovation to flying network platforms. The proposed PaFiR routing protocol offers the network more scalability, tolerance and resilience, to achieve the goal of smart relaying. Simulation results that demonstrate the routing algorithm designed offers excellent performance when compared with existing wireless relaying schemes. It provides delivery ratios that are improved by up to 40% without unmanageable increases in latency or overheads