IPv6 mobility support for real-time multimedia communications: A survey

Mobile Internet protocol version 6(MIPv6) route optimization improves triangular routing problem that exists in MIPv4 environment.Route optimization of Session Initiation Protocol (SIP) over MIPv6 provides ef�cient real-time multimedia applications to users. This article provides a survey of SIP over MIPv6. We review the processes involved during the setting up of a SIP call and during mid-call SIP mobility. When SIP transmits real-time multimedia applications in a wireless environment, the mobile node (MN) may move from one access router (AR) to another AR, handing over control from one AR to the other. High handover latency degrades the quality of real-time multimedia applications due to the fact that real-time multimedia applications are delay-sensitive.Handover latency is an important issue to discuss.Reduction of handover latency can be made possible with the use of SIP's hierarchical registration. On the other hand, hybrid hierarchical and fast handover SIP's registration performs better compared to hierarchical registration. Finally, we present the directions for future research

Traffic congestion in interconnected complex networks

Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is still relatively unexplored. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected BA scale-free networks. We find that assortative coupling can alleviate traffic congestion more readily than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet AS-level graphs of South Korea and Japan and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnected networks accordingly.Comment: 8 page

Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey

CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions

Mobility Management in beyond 3G-Environments

Beyond 3G-environments are typically defined as environments that integrate different wireless and fixed access network technologies. In this paper, we address IP based Mobility Management (MM) in beyond 3G-environments with a focus on wireless access networks, motivated by the current trend of WiFi, GPRS, and UMTS networks. The GPRS and UMTS networks provide countrywide network access, while the WiFi networks provide network access in local areas such as city centres and airports. As a result, mobile end-users can be always on-line and connected to their preferred network(s), these network preferences are typically stored in a user profile. For example, an end-user who wishes to be connected with highest bandwidth could be connected to a WiFi network when available and fall back to GPRS when moving outside the hotspot area.\ud In this paper, we consider a combination of MM for legacy services (like web browsing, telnet, etc.) using Mobile IP and multimedia services using SIP. We assume that the end-user makes use of multi-interface terminals with the capability of selecting one or more types of access networks\ud based on preferences. For multimedia sessions, like VoIP or streaming video, we distinguish between changes in network access when the end-user is in a session or not in a session. If the end-user is not in a session, he or she needs to be able to start new sessions and receive invitations for new sessions. If the end-user is in a session, the session needs to be handed over to the new access network as seamless as possible from the perspective of the end-user. We propose an integrated but flexible solution to these problems that facilitates MM with a customizable transparency to applications and end-users

A novel multi-agent and multilayered game formulation for Intrusion Detection in Internet of Things (IoT)

The current era of smart computing and enabling technologies encompasses the Internet of Things (IoT) as a network of connected, intelligent objects where objects range from sensors to smartphones and wearables. Here, nodes or objects cooperate during communication scenarios to accomplish effective throughput performance. Despite the deployment of large-scale infrastructure-based communications with faster access technologies, IoT communication layers can still be affected with security vulnerabilities if nodes/objects do not cooperate and intend to take advantage of other nodes for fulfilling their malevolent interest. Therefore, it is essential to formulate an intrusion detection/prevention system that can effectively identify the malicious node and restrict it from further communication activities—thus, the throughput, and energy performance can be maximized to a significant extent. This study introduces a combined multi-agent and multilayered game formulation where it incorporates a trust model to assess each node/object, which is participating in IoT communications from a security perspective. The experimental test scenarios are numerically evaluated, where it is observed that the proposed approach attains significantly improves intrusion detection accuracy, delay, and throughput performance as compared to the existing baseline approaches

Framework for constructing multimodal transport networks and routing using a graph database: A case study in London

Most prior multimodal transport networks have been organized as relational databases with multilayer structures to support transport management and routing; however, database expandability and update efficiency in new networks and timetables are low due to the strict database schemas. This study aimed to develop multimodal transport networks using a graph database that can accommodate efficient updates and extensions, high relation-based query performance, and flexible integration in multimodal routing. As a case study, a database was constructed for London transport networks, and routing tests were performed under various conditions. The constructed multimodal graph database showed stable performance in processing iterative queries, and efficient multi-stop routing was particularly enhanced. By applying the proposed framework, databases for multimodal routing can be readily constructed for other regions, while enabling responses to diversified routings, such as personalized routing through integration with various unstructured information, due to the flexible schema of the graph database