• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.1-16
• /
• 2012

Cost-effective mobility management for the roaming mobile users is very important in the seamless services on next-generation wireless network (NGWN). MIPv6 (Mobile IPv6) is one of the mobility management schemes proposed by the IETF (The Internet Engineering Task Force) and various IPv6-based mobility management schemes have been developed. They are directly involved with data transfer from MN (Mobile Node). In this paper, two kinds of schemes in analyzing of mobility management schemes are proposed. The signaling transfer and packet delivery procedures for each mobility management schemes are analyzed, respectively. The signaling cost for mobility management schemes are calculated, and the cost of each protocol are analyzed numerically. In other word, applying the sum of signaling cost and packet delivery cost to each mobility management scheme, their costs are analyzed. Finally, our performance evaluation results that the network-based mobility management scheme shows better performance in terms of overall cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.711-712
• /
• 2006

In this paper, we propose algorithm that improves energy efficiency of sensor node. That is, sensor node suggests algorithm that minimizes unnecessary surrounding feeler, and when passes information to neighborhood node, transmit forecasting position of node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.120-127
• /
• 2008

HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.387-395
• /
• 2005

In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.

• Journal of Internet Computing and Services
• /
• v.14 no.3
• /
• pp.67-79
• /
• 2013

In wireless networks, efficient mobility management to support of mobile users is very important. Several mobility management schemeshave been proposed with the aim of reducing the signaling traffic of MN(Mobile Node). Among them, PMIPv6 (Proxy Mobile IPv6) is similar with host-based mobility management protocols but MN does not require any process for mobility. By introducing new mobile agent like MAG (Mobile Access Gateway) and LMA (Local Mobility Anchor), it provides IP mobility to MN. In this paper, we propose the analytical model to evaluate the mean signalingdelay and the mean bandwidth according to the type of MN mobility. As a result of mathematical analysis, MF-PMIP (Multicasting-based FastPMIP) outperforms compared to F-PMIP and PMIP in terms of parameters for the performance evaluation.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.592-599
• /
• 2011

Proxy Mobile IPv6 (PMIPv6) is the network-based mobility management protocol that network supports the mobility of mobile node (MN) on behalf of the MN. In PMIPv6, a multi-homed MN can connect to the PMIPv6 domain by using only one interface even though it has multiple interfaces. It would be efficient when such a multi-homed MN connects to the PMIPv6 domain by using all of its interfaces. If such a multi-homed MN utilizes all of its interfaces, flow mobility can be provided that the MN handovers one or more flows from one interface to another without re-establishing session. In this paper, we propose the flow-based mobility management protocol by considering the intention of the user. The Router Advertisement (RA) message is used in order for the PMIPv6 domain to inform that the MN can utilize the flow mobility. The proposed mechanism is evaluated by analyzing signaling overhead and handover latency, and the numerical results show that the performance is affected by mobility speed of the MN and the failure probability of the wireless link.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.183-191
• /
• 2008

In this paper, we propose Stream Control Transmission Protocol(SCTP) proxy which supports making an SCTP connection from a Corresponding Node(CN) to a Mobile Node(MN). Recently, mobility support in transport layer is proposed, which provides mobility in end-to-end way using the extension of SCTP. Mobile SCTP can provide handover to all applications that use SCTP as a transport protocol. However, current SCTP does not include independent location management service and can not make connection from a CN to a MN without assistance of other mobile protocols. To solve this problem, Proposed SCTP proxy interoperates with generic location management service and performs an address transformation to forward connection set up messages to the MN. Using the proposed proxy, SCTP can provide a complete mobility support including a connection setup to the MN and maintaining an existing connection.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.23-26
• /
• 2012

In MANET, the nodes, configuring a path, act as routers and they have various mobilities. If the path is broken by a node's moving, a new path has to be found again. For this reason, the node with high mobility should be excluded from configuring a path as far as possible. In this paper, we propose an algorithm which excludes nodes with high mobility from constructing a path by collecting and managing the information of mobility. As the result, the proposed algorithm provides more stable paths. In this algorithm, we appends MRecord Field and Relieve Field in the routing table to collect and manage the mobility information by extending current AOMDV. In addition, we add Mbl Field to RREP (Route Reply) message to adapt the collected information to configure the real path.