摘要 :
Distributed Mobility Management (DMM) is a current alternative paradigm for developing IP mobility management schemes to address the centralised mobility management problems in existing IP mobility management schemes. This is to a...
展开
Distributed Mobility Management (DMM) is a current alternative paradigm for developing IP mobility management schemes to address the centralised mobility management problems in existing IP mobility management schemes. This is to allow these schemes to cope with the current increase in the number of mobile users and mobile data traffic volume, as well as the trend in the mobile Internet towards a fiat architecture. To date, schemes' development based on DMM approach is still at preliminary stages in the IETF, and there is no current standard in place. In this paper, we develop network-based DMM schemes for the Network Mobility (NEMO). The schemes are developed for non-nested and nested NEMO scenarios - with the goal of mitigating the sub-optimal routing, high packet overhead and packet delivery latency, especially in a nested NEMO scenario, due to the employment of a centralized mobility management approach in NEMO. Additionally, the proposed scheme improves the packet delivery and location update (i.e., binding update) costs. The paper presents in detail the schemes' design, operation mechanism, and the performance evaluation (through analytical and simulation in ns-2). Both the analytical and simulation results show that the proposed schemes yield a significant improvement- in terms of reducing packet overhead and packet delivery latency, as well as binding update and packet delivery costs. (C) 2015 Elsevier Ltd. All rights reserved.
收起
摘要 :
Currently existing IP mobility management protocols deploy a centralized anchor to manage mobility of the mobile nodes in both control- and data-planes. As a result the data traffic and mobility control signaling for all the mobil...
展开
Currently existing IP mobility management protocols deploy a centralized anchor to manage mobility of the mobile nodes in both control- and data-planes. As a result the data traffic and mobility control signaling for all the mobile nodes registered in the network are handled by the centralized mobility anchor. Considering the ever increasing number of mobile users and mobile data traffic volume, the centralized mobility management approach presents performance drawbacks, such as low scalability, traffic bottleneck, and single point of failure. Furthermore, this approach causes non-optimal routing and creates significant delays on packets, especially when the two communicating nodes are close to each other yet far from the mobility anchor. However, mobility management schemes developed based on a distributed mobility management (DMM) approach can overcome these limitations. In this paper, we present a network-based DMM scheme which eliminates the drawbacks of the centralized mobility management approach such as the traffic bottlenecks and single point of failure. Furthermore, our proposed scheme optimizes the route for ongoing mobile node communication(s), such that both handover and newly established communications are optimally routed. Analytical and simulation results show that the proposed schemes yield a significant improvement with respect to the currently proposed DMM schemes-in terms of reducing packet delivery cost, tunneling cost, and total cost as well as end-to-end packet delivery delay and handover delay.
收起
摘要 :
Currently, IP mobility management solutions standardized by IETF rely on a centralized and static mobility approach, whereby a central mobility anchor manages mobility signaling and data traffic forwarding. All data traffic sent t...
展开
Currently, IP mobility management solutions standardized by IETF rely on a centralized and static mobility approach, whereby a central mobility anchor manages mobility signaling and data traffic forwarding. All data traffic sent to a mobile node (MN) traverse the central mobility anchor regardless the current point of attachment of the MN in the Internet. Consequently, the packets follow a non-optimal path via the central mobility anchor which is typically located in the MN's home network, and result to increase in packet delivery latency. This paper discusses a distributed mobility management mechanism that releases the burden of the central mobility anchor by splitting the mobility management functions of the mobility anchor and co-locating the mobility routing function at the gateway of each sub-network. This mechanism optimizes the data path of the MN that has moved to visited networks, which reduces the packet delivery latency. Moreover, the mechanism is extended to achieve seamless handover when the MN moves between visited networks. Through simulation under NS-2, the performance of the packet delivery latency, handover delay and packet loss is studied and analyzed with respect to varying network load and increasing distance of the MN's home network from the visited networks. Simulation results show the improvement in packet delivery latency as compared to using non-optimized paths. Moreover, the results also verify the achievement of seamless handover when an MN moves between visited networks.
收起
摘要 :
Mobility management is a challenging topic in mobile computing environment. Studying the situation of mobiles crossing the boundaries of location areas is significant for evaluating the costs and performances of various location m...
展开
Mobility management is a challenging topic in mobile computing environment. Studying the situation of mobiles crossing the boundaries of location areas is significant for evaluating the costs and performances of various location management strategies. Hitherto, several formulae were derived to describe the probability of the number of location areas' boundaries crossed by a mobile. Some of them were widely used in analyzing the costs and performances of mobility management strategies. Utilizing the density evolution method of vector Markov processes, we propose a general probability formula of the number of location areas' boundaries crossed by a mobile between two successive calls. Fortunately, several widely-used formulae are special cases of the proposed formula.
收起
摘要 :
We consider a state-based dynamic location management scheme, in which the user is partitioned into different mobility state set, and his location area size is changed dynamically corresponding to the state set that he belongs to....
展开
We consider a state-based dynamic location management scheme, in which the user is partitioned into different mobility state set, and his location area size is changed dynamically corresponding to the state set that he belongs to. Comparing with the fixed LA scheme, numerical experiment result shows its performance can be improved by 30% while the current location and paging procedure can still be applied. Besides, as this scheme does not need to process complicated user information, the requirement of computing power can be decreased significantly in compare with the user-based schemes. Our scheme can be used in current 2G mobile systems (such as GSM, CDMA) and the Third Generation (3G) mobile systems with slightly modification of the equipment software.
收起
摘要 :
Successful implementation of efficient mobility management techniques is critical to the success of next-generation wireless systems. Handoff management has become more critical in present wireless networks, to support multimedia ...
展开
Successful implementation of efficient mobility management techniques is critical to the success of next-generation wireless systems. Handoff management has become more critical in present wireless networks, to support multimedia communications and associated services. This paper intends to study the handoff management aspect of the general mobility management issue which is prevailing in wireless networks. Multilayer mobility management models such as Hierarchical Mobile IPv6 (HMIPv6) and flatter architectures like Proxy Mobile IPv6 have great potential to serve as a mobility management solution for the next-generation networks. Influenced by the advantages of layered mobility management architectures, in this paper, a Three Layered MIPv6 (TLMIPv6) model has been examined for its performance against various parameters like signaling load, packet delivery ratio, end-to-end delay, packet delivery overhead, jitter, bandwidth consumption, throughput, etc. Execution of TLMIPv6 has been contrasted and that of HMIPv6 and PMIPv6 under Random Walk Mobility and Gauss-Markov Mobility models. It is seen from the experimental results that the TLMIPv6 protocol exhibits more than 15% reduction in signaling cost for handoff frequencies greater than 7/sec and more than 20% reduction in end-to-end delay for hop distances above 18, in comparison to HMIPv6 under identical simulation scenarios. The future scopes of the work are outlined.
收起
摘要 :
Many mobile knowledge management (KM) systems have been described in the literature having unique and interesting features, each being inserted into a specific application domain. This fragmentation in the application domain makes...
展开
Many mobile knowledge management (KM) systems have been described in the literature having unique and interesting features, each being inserted into a specific application domain. This fragmentation in the application domain makes it difficult to compare and define a set of core features of mobile KM systems. Analysing and comparing features and strategies of several systems from different application domains makes it possible to identify the core features that form a mobile KM system. Consequently, we may use these core features to define the evaluation and comparison framework of mobile KM systems, regardless of its application domain. The purpose of this work is to define these core features and discuss their importance, through the analysis of six mobile KM systems, highlighting the positive and the negative aspects of the KM processes. The contributions of this work are the framework and the list of core features of mobile KM systems.
收起
摘要 :
Mobile work challenges organizational records management This paper reports the results of a study in three case organizations on how the organizations' records management meets and adapts to the increasing role of mobile work. Da...
展开
Mobile work challenges organizational records management This paper reports the results of a study in three case organizations on how the organizations' records management meets and adapts to the increasing role of mobile work. Data was collected by interviewing mobile workers and record management professionals. Documentary materials were used to analyse official records management policies. The findings revealed that documented organizational policies do not take into account mobile work, and cannot effectively support personal or corporate records management in mobile work. Records management professionals were poorly informed of the extent of mobile work in the organization, and of the special problems related to managing records in mobile work. The overall conclusion is that organizations should pay more attention to the new requirements for records management caused by mobile work.
收起
摘要 :
Recent development of hardware technologies such as communication medium which advances from wired to wireless has led to the emergence of mobile information systems. A major problem in such a mobile information system is how to l...
展开
Recent development of hardware technologies such as communication medium which advances from wired to wireless has led to the emergence of mobile information systems. A major problem in such a mobile information system is how to locate mobile clients. This is named the location management issue. Two major costs are involved in managing a mobile client's location: the movement cost and the locating cost. Past methods can only minimize one of the two costs, but not both. The major contribution of this paper is to present methods that minimize both costs simultaneously. Our performance analysis proves that the proposed methods are superior to the past ones.
收起
摘要 :
Efficient mobility management is one of the most important challenges in mobile networks. Since roaming between wireless cells can cause long handoff latency and high packet loss, it can result in poor quality of services for dela...
展开
Efficient mobility management is one of the most important challenges in mobile networks. Since roaming between wireless cells can cause long handoff latency and high packet loss, it can result in poor quality of services for delay-sensitive applications and for applications requiring reliable transmission. In this paper, we propose a new seamless micro-mobility management framework for Micro Mobile MPLS (called MiM-MPLS) to overcome the packet loss problem while maintaining low handoff latency. In addition, we propose a combination of MiM-MPLS and the existing MFC-Micro Mobile MPLS [3], [4] (called MiM-MFC-MPLS) to further enhance the handoff performance. MiM-MPLS and MiM-MFC-MPLS provide efficient handoff mechanisms through the use of pre-established Label Switched Paths (LSPs), the L2 trigger, and local registration. The handoff mechanisms for (L2 and L3) intra handoffs and for an inter handoff in these frameworks are described in detail. The performance is analyzed in terms of the signaling cost of registration updates, handoff latency, packet loss, buffer size requirement, and delay jitter. Compared to existing handoff frameworks, the results show that the proposed MiM-MPLS and MiM-MFC-MPLS can provide no packet loss while maintaining low signaling cost of registration updates, handoff latency, and delay jitter at the cost of some buffer space. In particular, MiM-MFC-MPLS has the best handoff performance (i.e., the lowest signaling cost of registration updates, handoff latency, and delay jitter) among all the frameworks that we considered at the cost of some buffer space.
收起
原文获取