Sensor Proxy Mobile IPv6 (SPMIPv6)—A Novel Scheme for Mobility Supported IP-WSNs

IP based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health-care, home automation, environmental monitoring, industrial control, vehicle telematics and agricultural monitoring. In all these applications, mobility in the sensor network with special attention to energy efficiency is a major issue to be addressed. Host-based mobility management protocols are not suitable for IP-WSNs because of their energy inefficiency, so network based mobility management protocols can be an alternative for the mobility supported IP-WSNs. In this paper we propose a network based mobility supported IP-WSN protocol called Sensor Proxy Mobile IPv6 (SPMIPv6). We present its architecture, message formats and also evaluate its performance considering signaling cost, mobility cost and energy consumption. Our analysis shows that with respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 60% and 56%, as well as the mobility cost by 62% and 57%, compared to MIPv6 and PMIPv6, respectively. The simulation results also show that in terms of the number of hops, SPMIPv6 decreases the signaling cost by 56% and 53% as well as mobility cost by 60% and 67% as compared to MIPv6 and PMIPv6 respectively. It also indicates that proposed scheme reduces the level of energy consumption significantly

Virtual Mobility Domains - A Mobility Architecture for the Future Internet

The advances in hardware and wireless technologies have made mobile communication devices affordable by a vast user community. With the advent of rich multimedia and social networking content, an influx of myriads of applications, and Internet supported services, there is an increasing user demand for the Internet connectivity anywhere and anytime. Mobility management is thus a crucial requirement for the Internet today. This work targets novel mobility management techniques, designed to work with the Floating Cloud Tiered (FCT) internetworking model, proposed for a future Internet. We derive the FCT internetworking model from the tiered structure existing among Internet Service Provider (ISP) networks, to define their business and peering relationships. In our novel mobility management scheme, we define Virtual Mobility Domains (VMDs) of various scopes, that can support both intra and inter-domain roaming using a single address for a mobile node. The scheme is network based and hence imposes no operational load on the mobile node. This scheme is the first of its kind, by leveraging the tiered structure and its hierarchical properties, the collaborative network-based mobility management mechanism, and the inheritance information in the tiered addresses to route packets. The contributions of this PhD thesis can be summarized as follows: · We contribute to the literature with a comprehensive analysis of the future Internet architectures and mobility protocols over the period of 2002-2012, in light of their identity and handoff management schemes. We present a qualitative evaluation of current and future schemes on a unified platform. · We design and implement a novel user-centric future Internet mobility architecture called Virtual Mobility Domain. VMD proposes a seamless, network-based, unique collaborative mobility management within/across ASes and ISPs in the FCT Internetworking model. The analytical and simulation-based handoff performance analysis of the VMD architecture in comparison with the IPv6-based mobility protocols presents the considerable performance improvements achieved by the VMD architecture. · We present a novel and user-centric handoff cost framework to analyze handoff performance of different mobility schemes. The framework helps to examine the impacts of registration costs, signaling overhead, and data loss for Internet connected mobile users employing a unified cost metric. We analyze the effect of each parameter in the handoff cost framework on the handoff cost components. We also compare the handoff performance of IPv6-based mobility protocols to the VMD. · We present a handoff cost optimization problem and analysis of its characteristics. We consider a mobility user as the primary focus of our study. We then identify the suitable mathematical methods that can be leveraged to solve the problem. We model the handoff cost problem in an optimization tool. We also conduct a mobility study - best of our knowledge, first of its kind - on providing a guide for finding the number of handoffs in a typical VMD for any given user\u27s mobility model. Plugging the output of mobility study, we then conduct a numerical analysis to find out optimum VMD for a given user mobility model and check if the theoretical inferences are in agreement with the output of the optimization tool

Survivability, Scalability and Security of Mobility Protocols

Today mobile computing has become a necessity and we are witnessing explosive growth in the number of mobile devices accessing the Internet. To facilitate continuous Internet connectivity for nodes and networks in motion, mobility protocols are required and they exchange various signaling messages with the mobility infrastructure for protocol operation. Proliferation in mobile computing has raised several research issues for the mobility protocols. First, it is essential to perform cost and scalability analysis of mobility protocols to find out their resource requirement to cope with future expansion. Secondly, mobility protocols have survivability issues and are vulnerable to security threats, since wireless communication media can be easily accessible to intruders. The third challenge in mobile computing is the protection ofsignaling messages against losses due to high bandwidth requirementof multimedia in mobile environments. However, there is lack of existing works that focus on the quantitative analysis of cost, scalability, survivability and security of mobility protocols.In this dissertation, we have performed comprehensive evaluation ofmobility protocols. We have presented tools and methodologies required for the cost, scalability, survivability and security analysis of mobilityprotocols. We have proposed a dynamic scheduling algorithm to protect mobility signaling message against losses due to increased multimedia traffic in mobile environments and have also proposed a mobile networkarchitecture that aims at maximizing bandwidth utilization. The analysis presented in this work can help network engineers compare different mobility protocols quantitatively, thereby choose one that is reliable, secure, survivable and scalable

Low latency IP mobility management: Protocol and analysis

Mobile IP is one of the dominating protocols that enable a mobile node to remain reachable while moving around in the Internet. However, it suffers from long handoff latency and route inefficiency. In this article, we present a novel distributed mobility management architecture, ADA (Asymmetric Double-Agents), which introduces double mobility agents to serve one end-to-end communication. One mobility agent is located close to the MN and the other close to the CN. ADA can achieve both low handoff latency and low transmission latency, which is crucial for improvement of user perceived QoS. It also provides an easy-to-use mechanism for MNs to manage and control each traffic session with a different policy and provide specific QoS support. We apply ADA to MIPv6 communications and present a detailed protocol design. Subsequently, we propose an analytical framework for systematic and thorough performance evaluation of mobile IP-based mobility management protocols. Equipped with this model, we analyze the handoff latency, single interaction delay and total time cost under the bidirectional tunneling mode and the route optimization mode for MIPv6, HMIPv6, CNLP, and ADA. Through both quantitative analysis and NS2-based simulations, we show that ADA significantly outperforms the existing mobility management protocols. © 2011 Liu et al; licensee Springer

On Energy Efficiency and Delay Minimization in Reactive Protocols in Wireless Multi-hop Networks

In Wireless Multi-hop Networks (WMhNs), routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models (LP_models) to assess and enhance reactive routing protocols. To practically examine constraints of respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of LP_models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we enhance AODV and DSR. To practically examine the efficiency of enhanced protocols in different scenarios of WMhNs, we conduct simulations using NS- 2. From simulation results, enhanced DSR and AODV achieve efficient output by optimizing routing latencies and routing load in terms of retransmission attempts

An Optimal Game Theoretical Framework for Mobility Aware Routing in Mobile Ad hoc Networks

Selfish behaviors are common in self-organized Mobile Ad hoc Networks (MANETs) where nodes belong to different authorities. Since cooperation of nodes is essential for routing protocols, various methods have been proposed to stimulate cooperation among selfish nodes. In order to provide sufficient incentives, most of these methods pay nodes a premium over their actual costs of participation. However, they lead to considerably large overpayments. Moreover, existing methods ignore mobility of nodes, for simplicity. However, owing to the mobile nature of MANETs, this assumption seems unrealistic. In this paper, we propose an optimal game theoretical framework to ensure the proper cooperation in mobility aware routing for MANETs. The proposed method is based on the multi-dimensional optimal auctions which allows us to consider path durations, in addition to the route costs. Path duration is a metric that best reflects changes in topology caused by mobility of nodes and, it is widely used in mobility aware routing protocols. Furthermore, the proposed mechanism is optimal in that it minimizes the total expected payments. We provide theoretical analysis to support our claims. In addition, simulation results show significant improvements in terms of payments compared to the most popular existing methods