• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.181-190
• /
• 2013

PMIPv6(Proxy Mobile IPv6) is a network-based IP mobility management protocol, which can control the mobility without depending on the type of access system or the capability of mobile node. Combining it with SIP mobility, it can establish the route optimization effectively and ensure the terminal mobility and the session mobility. There are many literatures on PMIPv6-SIP in mobility management, but efficient performance analysis and mathematical modeling has not been standardized. For this, a new PMIPv6-SIP architecture is proposed to compare with Pure-SIP in terms of the handover delay and packet loss.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1773-1795
• /
• 2020

Unmanned aerial vehicles (UAVs) network are a very vibrant research area nowadays. They have many military and civil applications. Limited bandwidth, the high mobility and secure communication of micro UAVs represent their three main problems. In this paper, we try to address these problems by means of secure clustering, and a security clustering algorithm based on integrated trust value for UAVs network is proposed. First, an improved the k-means++ algorithm is presented to determine the optimal number of clusters by the network bandwidth parameter, which ensures the optimal use of network bandwidth. Second, we considered variables representing the link expiration time to improve node clustering, and used the integrated trust value to rapidly detect malicious nodes and establish a head list. Node clustering reduce impact of high mobility and head list enhance the security of clustering algorithm. Finally, combined the remaining energy ratio, relative mobility, and the relative degrees of the nodes to select the best cluster head. The results of a simulation showed that the proposed clustering algorithm incurred a smaller computational load and higher network security.

• Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.28-40
• /
• 2008

Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.27-37
• /
• 2002

This paper analyzes problems of existing Mobile IP and redesigns component functions, and proposes handover method using LRS and BCS for handover performance improvement. When mobile node moves another domain, the proposed BCS recognizes its mobility. So, BCS manages mobile node's binding information and serves micro mobility. When handover occurs among domains, micro mobility enables using LRS, As BCS and LRS have buffering function, they can reduce packet loss by forwarding the buffered datagram. It's designed component is implemented in LINUX environment. And then, handover performance was evaluated by simulation. The results of proposed handover method are better than existing method in both transmission delay time and packet loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.99-106
• /
• 2005

This Paper suggests the cooperation scenarios between Diameter protocol and Mobile IPv6 protocol. First, this paper designs cooperation scenarios and designs mobility support technology based on the designed scenarios. This paper deanes the interfaces between mobile node and local AAA client using ICMPv6 messages. In addition, this paper designs handoff procedures according to the area, which mobile node moves to.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.203-209
• /
• 2015

Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.641-644
• /
• 2010

Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node 들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 통신을 맺고 있던 Mobile Node가 Local Mobility Anchor 내 다른 Mobile Access Gateway의 범위로 이동할 경우 발생하는 핸드오버 상황에서 Correspondent Route Optimization 기법을 사용하여 signaling cost를 줄이는 방법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.987-996
• /
• 2006

In NEMO scenarios, mobile node's variety of movements and mobile router's point of attachment changes can result in handover. This handover process needs additional time to finish due to the multiple levels of indirection involved in NEMO. And the performance issues of mobile node's handover such as handover delay and packet loss in above cases haven't been studied thoroughly. So, in this paper, we define fast handover failure cases in hierarchical mobile IPv6 network based NEMO. We briefly described NEMO architecture and handover procedures of FMIPv6 and HMIPv6. And then, we classified mobile node or mobile router's movement pattern into several scenarios. Analysis for the fast handover classified NEMO scenarios, in terms of handover latency and packet delivery cost have been performed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.736-741
• /
• 2005

The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.105-107
• /
• 2015

In this paper, we proposed LTD(Load Tolerance Density-distribution) algorithm using dynamic density for analyzing distribute routing path. MANET(Mobile Ad-hoc Networks) consists of the node that has a mobility. By the Mobility, the topology is exchanged frequently. To reduce the exchange of topology, the hierarchy network is studied. However, if the load is concentrated at the cluster head node, the communication is disconnected. the proposed algorithm measure the dynamic density of the node using poisson distribution. And this algorithm provides distribute routing path using dynamic density. The simulation results, the proposed algorithm shows improved packet delivery ratio than the compared algorithm.