34,895 research outputs found

    Improved Handover Routing Scheme In Hierarchical Mobile Ipv6 Networks

    Get PDF
    Mobile Internet Protocol version 6 (MIPv6) has been proposed to solve the problem of mobility in the new era of Internet. MIPv6 is a proposal for handling routing of IPv6 packets to mobile nodes that have moved away from their home network. In the near future, with the simultaneous growth of the mobile user population and the Internet, users will move more frequently between networks as they stay connected to the Internet and access its resources. Thus, as mobility increases across networks, handovers will significantly give impact on the quality of the connection and on user application . Previous research has shown that MIPv6 only defines a means of managing global mobility (macro-mobility) but does not address local mobility (micro-mobility) separately. Instead, it uses the same mechanism in both cases. This involves long handover delay and a lot of signaling. The extension of protocol of basic MIPv6 has been investigated. Internet Engineering Task Force (IETF) introduced Hierarchical Mobile IPv6 (HMIPv6) . HMIPv6 is the proposed enhancement of MIPv6 that is designed to reduce the amount of signaling required and to improve handover speed for mobile connections. New node in HMIPv6 called the mobility anchor point (MAP) serves as a local entity to aid in mobile handover. By separating global and local mobility, HMIPv6 makes it possible to deal with either situation of macro mobility and micro mobility appropriately. The MAP helps to decrease the delay and packet loss during handover. HMIPv6's handover operation has been investigated. We have analyzed the handover routing scheme on Internet Protocol (IP) layer. The operation of this handover starts from the mobile node (MN) sends binding update (BU) to its new network until MN receives packet from the correspondent node (CN) or home agent (HA) through its new network. The adoption of multicast scheme and the avoidance of redundancy in sending binding update scheme have been proposed and have been implemented to HMIPv6. Proposed multicast scheme may allow MN to receive packets during handover operation. The avoidance of redundancy in sending B U scheme may reduce the amount of signaling for the handover thus reduce the handover delay. We have tested the performance of HMIPv6 with the proposed schemes based on simulation study. The results show that our proposed schemes reduce the handover delay and the amount of packet loss in HMIPv6

    Multicast source mobility support for regenerative satellite networks

    Get PDF
    YesSatellite communications provides an effective solution to the ever increasing demand for mobile and ubiquitous communications especially in areas where terrestrial communication infrastructure is not present. IP multicasting is a bandwidth saving technology which could become an indispensable means of group communication over satellites since it can utilise the scarce and expensive satellite resources in an efficient way. In Source-Specific Multicast (SSM) the data is sent through a multicast tree from the source to all the receivers. However, if a source is a mobile node moving from one network to another, then special mechanisms are required to make sure this multicast tree does not break. Until now, while many research efforts have been made to provide IP multicast for the mobile nodes, they are mainly focused on terrestrial networks. Unfortunately, the terrestrial mobile multicast schemes are not directly applicable in a satellite environment. This paper, proposes a new mechanism to support multicast source mobility in SSM based applications for a mesh multi-beam satellite network with receivers both within the satellite network and in the Internet. In the proposed mechanism, the SSM receivers continue to receive multicast traffic from the mobile source despite the fact that the IP address of the source keeps on changing as it changes its point of attachment from one satellite gateway (GW) to another. The proposed scheme is evaluated and the results compared with the mobile IP home subscription (MIP HS)-based approach. The results show that the proposed scheme outperforms the MIP HS-based approach in terms of signalling cost and packet delivery cost

    SD-MCAN: A Software-Defined Solution for IP Mobility in Campus Area Networks

    Get PDF
    Campus Area Networks (CANs) are a subset of enterprise networks, comprised of a network core connecting multiple Local Area Networks (LANs) across a college campus. Traditionally, hosts connect to the CAN via a single point of attachment; however, the past decade has seen the employment of mobile computing rise dramatically. Mobile devices must obtain new Internet Protocol (IP) addresses at each LAN as they migrate, wasting address space and disrupting host services. To prevent these issues, modern CANs should support IP mobility: allowing devices to keep a single IP address as they migrate between LANs with low-latency handoffs. Traditional approaches to mobility may be difficult to deploy and often lead to inefficient routing, but Software-Defined Networking (SDN) provides an intriguing alternative. This thesis identifies necessary requirements for a software-defined IP mobility system and then proposes one such system, the Software-Defined Mobile Campus Area Network (SD-MCAN) architecture. SD-MCAN employs an OpenFlow-based hybrid, label-switched routing scheme to efficiently route traffic flows between mobile hosts on the CAN. The proposed architecture is then implemented as an application on the existing POX controller and evaluated on virtual and hardware testbeds. Experimental results show that SD-MCAN can process handoffs with less than 90 ms latency, suggesting that the system can support data-intensive services on mobile host devices. Finally, the POX prototype is open-sourced to aid in future research

    Performance evaluation of route optimization management of producer mobility in information-centric networking

    Get PDF
    Named data networking (NDN) is a network service evolving the Internet's host-based packet delivery model. The idea of NDN is to use named data for routing, which specifies what they are looking for, instead of using location addresses that determine where they expect it to be provided. This architecture is expected to solve many issues that are currently faced by transmission control protocol/internet protocol (TCP/IP) architecture, such as scalability, robustness, mobility, security, and etcetera. One of the problems is about handling producer mobility. Considering the explosion growth rate of Internet connection in public transport vehicles, this is a challenge that needs to be overcome. Therefore, we have proposed a new scheme called route optimization management of producer mobility (ROM-P) with new features such as distributing anchor points and caching by using the same data name and com-paring our previous scheme, efficient producer mobility support (EPMS). This paper shows the analysis result between the ROM-P and EPMS by using simulation. All simulations were conducted using ndnSIM 2.4 NS-3 based. Throughout the simulation ROM-P shows a promising development in better performing compares to EPMS

    Integrated Framework For Mobile Low Power IoT Devices

    Get PDF
    Ubiquitous object networking has sparked the concept of the Internet of Things (IoT) which defines a new era in the world of networking. The IoT principle can be addressed as one of the important strategic technologies that will positively influence the humans’ life. All the gadgets, appliances and sensors around the world will be connected together to form a smart environment, where all the entities that connected to the Internet can seamlessly share data and resources. The IoT vision allows the embedded devices, e.g. sensor nodes, to be IP-enabled nodes and interconnect with the Internet. The demand for such technique is to make these embedded nodes act as IP-based devices that communicate directly with other IP networks without unnecessary overhead and to feasibly utilize the existing infrastructure built for the Internet. In addition, controlling and monitoring these nodes is maintainable through exploiting the existed tools that already have been developed for the Internet. Exchanging the sensory measurements through the Internet with several end points in the world facilitates achieving the concept of smart environment. Realization of IoT concept needs to be addressed by standardization efforts that will shape the infrastructure of the networks. This has been achieved through the IEEE 802.15.4, 6LoWPAN and IPv6 standards. The bright side of this new technology is faced by several implications since the IoT introduces a new class of security issues, such as each node within the network is considered as a point of vulnerability where an attacker can utilize to add malicious code via accessing the nodes through the Internet or by compromising a node. On the other hand, several IoT applications comprise mobile nodes that is in turn brings new challenges to the research community due to the effect of the node mobility on the network management and performance. Another defect that degrades the network performance is the initialization stage after the node deployment step by which the nodes will be organized into the network. The recent IEEE 802.15.4 has several structural drawbacks that need to be optimized in order to efficiently fulfil the requirements of low power mobile IoT devices. This thesis addresses the aforementioned three issues, network initialization, node mobility and security management. In addition, the related literature is examined to define the set of current issues and to define the set of objectives based upon this. The first contribution is defining a new strategy to initialize the nodes into the network based on the IEEE 802.15.4 standard. A novel mesh-under cluster-based approach is proposed and implemented that efficiently initializes the nodes into clusters and achieves three objectives: low initialization cost, shortest path to the sink node, low operational cost (data forwarding). The second contribution is investigating the mobility issue within the IoT media access control (MAC) infrastructure and determining the related problems and requirements. Based on this, a novel mobility scheme is presented that facilitates node movement inside the network under the IEEE 802.15.4e time slotted channel hopping (TSCH) mode. The proposed model mitigates the problem of frequency channel hopping and slotframe issue in the TSCH mode. The next contribution in this thesis is determining the mobility impact on low latency deterministic (LLDN) network. One of the significant issues of mobility is increasing the latency and degrading packet delivery ratio (PDR). Accordingly, a novel mobility protocol is presented to tackle the mobility issue in LLDN mode and to improve network performance and lessen impact of node movement. The final contribution in this thesis is devising a new key bootstrapping scheme that fits both IEEE 802.15.4 and 6LoWPAN neighbour discovery architectures. The proposed scheme permits a group of nodes to establish the required link keys without excessive communication/computational overhead. Additionally, the scheme supports the mobile node association process by ensuring secure access control to the network and validates mobile node authenticity in order to eliminate any malicious node association. The purposed key management scheme facilitates the replacement of outdated master network keys and release the required master key in a secure manner. Finally, a modified IEEE 802.15.4 link-layer security structure is presented. The modified architecture minimizes both energy consumption and latency incurred through providing authentication/confidentiality services via the IEEE 802.15.4

    Selective Advance Reservations Based on Host Movement Detection and Resource-Aware Handoff

    Get PDF
    This paper proposes a new mechanism, which addresses the excessive advance reservation requirements of QoS guarantee methods for mobile Internet. To save resources for excessive advance reservations, the proposed mechanism employs a movement detection scheme for a mobile host (MH) using link-layer functionalities. With the movement detection scheme, advance reservations can be established at only where a MH is likely to visit soon. Another novel feature of our mechanism is resource-aware handoff direction scheme that allows a MH to choose its next BS according to not only the link-layer signal strength, but also the available amount of resources in the reachable base stations (BSs). It considerably decreases a probability that QoS is disrupted due to the failure in advance reservation request. Also, the proposed mechanism requires fewer functional and structural changes to the current Internet components and protocols since all the enhanced features are integrated only into leaf BSs and MHs. It does not suffer from the problems of the conventional approaches based on Mobile IP and RSVP Tunnel, such as non-optimal routing path and signalling overhead. Our experiment results show that the proposed mechanism successfully eliminates the overhead for useless advance reservations while guaranteeing seamless QoS for MHs. The performance comparison demonstrates that our mechanism slightly outperforms the conventional approaches while requiring fewer modifications and additions to the existing Internet architecture. This performance advantage of the proposed mechanism becomes noticeable when the network is congested and the mobility of a host is high. Copyright © 2006 John Wiley & Sons, Ltd

    Selective Advance Reservations Based on Host Movement Detection and Resource-Aware Handoff

    Get PDF
    This paper proposes a new mechanism, which addresses the excessive advance reservation requirements of QoS guarantee methods for mobile Internet. To save resources for excessive advance reservations, the proposed mechanism employs a movement detection scheme for a mobile host (MH) using link-layer functionalities. With the movement detection scheme, advance reservations can be established at only where a MH is likely to visit soon. Another novel feature of our mechanism is resource-aware handoff direction scheme that allows a MH to choose its next BS according to not only the link-layer signal strength, but also the available amount of resources in the reachable base stations (BSs). It considerably decreases a probability that QoS is disrupted due to the failure in advance reservation request. Also, the proposed mechanism requires fewer functional and structural changes to the current Internet components and protocols since all the enhanced features are integrated only into leaf BSs and MHs. It does not suffer from the problems of the conventional approaches based on Mobile IP and RSVP Tunnel, such as non-optimal routing path and signalling overhead. Our experiment results show that the proposed mechanism successfully eliminates the overhead for useless advance reservations while guaranteeing seamless QoS for MHs. The performance comparison demonstrates that our mechanism slightly outperforms the conventional approaches while requiring fewer modifications and additions to the existing Internet architecture. This performance advantage of the proposed mechanism becomes noticeable when the network is congested and the mobility of a host is high. Copyright © 2006 John Wiley & Sons, Ltd

    Efficient Micro-Mobility using Intra-domain Multicast-based Mechanisms (M&M)

    Full text link
    One of the most important metrics in the design of IP mobility protocols is the handover performance. The current Mobile IP (MIP) standard has been shown to exhibit poor handover performance. Most other work attempts to modify MIP to slightly improve its efficiency, while others propose complex techniques to replace MIP. Rather than taking these approaches, we instead propose a new architecture for providing efficient and smooth handover, while being able to co-exist and inter-operate with other technologies. Specifically, we propose an intra-domain multicast-based mobility architecture, where a visiting mobile is assigned a multicast address to use while moving within a domain. Efficient handover is achieved using standard multicast join/prune mechanisms. Two approaches are proposed and contrasted. The first introduces the concept proxy-based mobility, while the other uses algorithmic mapping to obtain the multicast address of visiting mobiles. We show that the algorithmic mapping approach has several advantages over the proxy approach, and provide mechanisms to support it. Network simulation (using NS-2) is used to evaluate our scheme and compare it to other routing-based micro-mobility schemes - CIP and HAWAII. The proactive handover results show that both M&M and CIP shows low handoff delay and packet reordering depth as compared to HAWAII. The reason for M&M's comparable performance with CIP is that both use bi-cast in proactive handover. The M&M, however, handles multiple border routers in a domain, where CIP fails. We also provide a handover algorithm leveraging the proactive path setup capability of M&M, which is expected to outperform CIP in case of reactive handover.Comment: 12 pages, 11 figure
    corecore