• Journal of Digital Convergence
• /
• v.14 no.9
• /
• pp.309-315
• /
• 2016

The node mobility in the wireless mobile network environment increases the energy consumption. This paper proposes a CNMA (cluster-based node management algorithm) to reduce the energy consumption caused by node mobility, and to prolong the life cycle for cluster member nodes. The proposed CNMA traces the mobility for nodes between cluster header and member, and it analyses the energy capacity as monitoring periodically their relationship. So, it makes a division and merges by analysing the state transition for nodes. This paper is to reduce the energy consumption due to the node mobility. The simulation results show that the proposed CNMA can efficiently control the energy consumption caused by mobility, and it can improve the energy cycle.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.688-696
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) is a network localized mobility management protocol that is independent of global mobility management protocols. In a single mobility domain (LMD), the mobile node (MN) is not involved in any IP mobility-related signaling and uses only its PMIPv6 home address for all its communication. Subsequently, when the MN moves into another LMD, the MN must change its PMIPv6 home address. In such a circumstance, host-based mobility signaling is activated. Thus, the nature of the network-based mobility of the PMIPv6 cannot be retained. Additionally, if the MN does not support global mobility, it cannot maintain communication with its correspondent node (CN). In this paper, we propose a solution for global mobility support in PMIPv6 networks, called Global-PMIPv6 that allows current communication sessions of a MN without mobility protocol stacks to be maintained, even when the MN moves into another LMD. Thus, Global-PMIPv6 retains the advantages of the PMIPv6 for global mobility support. We then evaluate and compare network performance between our proposed solution and PMIPv6.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.210-211
• /
• 2015

Proxy Mobile IPv6 (PMIPv6) is a network based IP mobility management protocol. PMIPv6 make sure that the IP address of the mobile node remains the same as long as the mobile node roams with in the PMIPv6 domain. A mobile node roams with in a PMIPv6 domain. PMIPv6 protocol doesn't provide the mobility support once the mobile node moves from one PMIPv6 domain to another PMIPv6 domain. This paper proposes a Software Defined Networking (SDN) based PMIPv6 scheme which provides the mobility support for inter PMIPv6 domain movement of mobile node. In the proposed architecture each PMIPv6 domain has a SDN controller and SDN controllers from different domains communicate with each other to share the mobility information.

• The Journal of Engineering Research
• /
• v.8 no.1
• /
• pp.97-106
• /
• 2006

Chord system, structured P2P system based on distributed hashed table, didn't consider the mobility of mobile device. Mobility of mobile node may cause performance falloff of both mobile node and P2P network. Not only Chord system but also the greater part of P2P system didn't consider the mobility of mobile node. Recently it is researched on mobility in P2P system. In this paper, it proposed the method of the supporting mobility in chord system. Mobile node joins to the P2P network through the stationary node meaning the parents node. Mobile node require or offer the service for the parents node.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.408-412
• /
• 2015

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.245-248
• /
• 2008

Everytime a node moves out of its area, the connection to the node encounters a handover which may cause much latency. NetLMM(Network based Localized Mobility Management) supports the mobility management for such nodes and improves handover latency using MIH(Media Independent Handover) function. In this paper, we add some messages to NetLMM procedure to improve handover latency and analyze its effects through a scenario based approach

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.645-655
• /
• 2014

Latency, an identified element of Internet protocol (IP) mobility protocol execution, can reduce handover performance in mobile networks. Although the performance can be improved by applying an effective network-based IP mobility scheme in place of the traditional host-based alternatives, the existing inter-domain extensions of network-based IP mobility continue to suffer from an extended handover latency. This paper proposes a new inter-domain network-based IP mobility scheme based on node movement prediction. The proposed scheme accelerates the handover by preparing the future domain of the mobile node in a proactive manner. Analytical and simulation-based evaluations confirm improved performance of the proposed scheme in terms of handover latency and packet loss compared with existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.480-488
• /
• 2009

A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the number of nodes entering into/leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.872-885
• /
• 2015

The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.2
• /
• pp.83-91
• /
• 2018

With the development of IT (Information Technology) technology, embedded system and network technology are combined and used in various environments such as military environment as well as everyday life. In this paper, we propose a new airdropped distributed mobility model (ADMM) modeling the dispersion falling of the direct shot of a cluster bomb, and we compare and analyze some representative MANET routing protocols in ADMM in ns-3 simulator. As a result of the analysis, we show OLSR routing protocol is promising in ADMM environment in the view points of packet delivery ratio (PDR), end to end delay, and jitter. In addition, we propose a new adaptation scheme for OLSR, AND-OLSR (Average Node Distance based adaptive-OLSR) to improve the original OLSR in ADMM environment. The new protocol calculates the average node distance, adapts the period of the control message based on the average node distance increasing rate. Through the simulation study, we show that the proposed AND-OLSR outperforms the original OLSR in PDR and control message overhead.