Dynamic MAP Selection Mechanism for HMIPv6

Wang, Yinghong; Huang, Kuo‐Feng; Kuo, Chin-Hwa; Huang, Weijia

doi:10.1109/aina.2008.17

Cited by 9 publications

(3 citation statements)

References 6 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], a MAP selection mechanism was proposed to take the mobile node's particular characteristics into consideration. In [11], a scheme was proposed to find an appropriate anchor point for each individual mobile user regarding its mobility pattern and its long term requested services.…”

Section: B Dynamic Home Agent Assignmentmentioning

confidence: 99%

Dynamic home agent assignment in peer-to-peer overlay networks

Chen

Kuo

2009

2009 First Asian Himalayas International Conference on Internet

View full text Add to dashboard Cite

Mobile IP gives solutions to wireless applications to maintain the connectivity while handover is occurred. However, a remote home agent can result in poor efficiency. Dynamic home agent reassignment model is proposed to reduce both the signalling traffic and the data traffic to the home network. Therefore, it has to be assured that there are enough home agents available; otherwise, it is hardly to pick one home agent resulting in good performance.In this paper, a dynamic home agent selection in peer-to-peer overlay networks is proposed. Users are responsible to play the role of home agent sometimes. The Overlay association table is referred. Mobile relay assignment and mobile relay redirection are addressed.Due to the previous work, a software agent has been presented to perform the undercover maintenance of connectivity at the application layer for handling the mobility in all-IP networks. It gives an end-to-end handover solution via proxy-based component using API hooking technology. There are no equipments added, no change of protocol stack and no modification on existing services. While a peer node performs handover, services will not be aware of packets re-directing to the new destination address. An experimental testbed is presented for performance measurement.

show abstract

Section: B Dynamic Home Agent Assignmentmentioning

confidence: 99%

Dynamic home agent assignment in peer-to-peer overlay networks

Chen

Kuo

2009

2009 First Asian Himalayas International Conference on Internet

View full text Add to dashboard Cite

show abstract

“…In this study we only describe the proposed speed mechanism. Besides, the MAP selection mechanism also integrates with the MAP load control mechanism which improves the drawback of Wang et al, (2008).…”

Section: Speed Detection Mechanismmentioning

confidence: 99%

Mobile Node Speed Detection Mechanism in Hierarchical Mobile Internet Protocol (IPv6)

Kusin

Zakaria

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: IETF has introduced Hierarchical Mobile IPv6 (HMIPv6) to support mobility problem in the next generation Internet Protocol (IPv6). The key concept behind this protocol is the usage of Mobility Anchor Point (MAP) located at any level router of network to support hierarchical mobility management and seamless handover. The distance MAP selection in HMIPv6 causes MAP overloaded as the network grows. Approach: To address the issue in designing MAP selection scheme, we proposed a dynamic speed detection mechanism that integrates with the load control mechanism. Results: From the experimental results we obtained that the proposed scheme gives better distribution in MAP load and reduced binding update cost. Conclusion/Recommendations: The Next Generation Networks (NGN) is expected to provide seamless handover in high speed wireless network environment. There is crucial need of very sophisticated protocols to support NGN QoS requirements.

show abstract

“…The request is to manage MN with the smallest and the highest score on a list until load becomes balanced. In another mechanism, Wang et al [8] designed the MAP Load Table (MLT) to record the load condition of neighbor MAPs. The scheme will choose the MAP which has minimum load value to register.…”

Section: Related Workmentioning

confidence: 99%

Network based Load-Aware Mobility Management in IEEE 802.11 Wireless Mesh Networks

Wang¹

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:One major concern for mobile networks consists of finding efficient ways of handling user mobility so that the handover process has minimum effect on users' ongoing sessions. Although COAP provides an efficient way for mobility management in IEEE 802.11 wireless mesh networks, it does not control load among multiple MAPs in the network. Thus, in many cases, the attached MAP is overloaded, and extensive delays are experienced during the routing process. To tackle this problem, this paper proposes a load-aware mobility management scheme. The overloaded MAP is detected according to the load estimation. Then the overloaded MAP initiates the search procedure to find the underutilized MAP and transfer the MN's attachment request to it. The proposed scheme can efficiently balance the handover load among MAPs at the cost of slightly prolonged attachment delay and increased attachment messages compared with COAP.

show abstract

Dynamic MAP Selection Mechanism for HMIPv6

Cited by 9 publications

References 6 publications

Dynamic home agent assignment in peer-to-peer overlay networks

Dynamic home agent assignment in peer-to-peer overlay networks

Mobile Node Speed Detection Mechanism in Hierarchical Mobile Internet Protocol (IPv6)

Network based Load-Aware Mobility Management in IEEE 802.11 Wireless Mesh Networks

Contact Info

Product

Resources

About