• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.220-222
• /
• 2000

무선기술의 발전과 다양한 휴대용 장비가 개발되면서 무선 인터넷 서비스에 대한 요구가 증가하고 있다. 하지만 현재 네트워크에서 사용되고 있는 IPv4를 이용해서는 IP의 이동 환경을 지원하지 못한다. 이에 여러 연구가 진행되고 있으며 IETE의 Mobile IP Working Group에서는 기존의 IPv4를 사용하면서도 이동환경을 지원하기 위한 이동 IP에 대해 연구를 진행하고 있다. 이에 본 논문에서는 인터넷에서 계층적이며 효율적인 이동성 지원을 위하여 인트라 도메인과 인터도메인에서 이동성 지원을 위한 기법을 제안한다. 본 논문에서는 멀티캐스트 라우팅 프로콜인 PIM-SM(Protocol Independent Multicase-Sparse Mode)과 MSDP(Multipicast Source Discovery Protocol)를 이용하며, 하나의 이동 노드 (Mobile Node, MN)는 대응 노드(Correspondent Node, CN)에 의해 특정한 멀티캐스트 그룹으로 인식된다. 이동 노드를 목적지로 하는 패킷은 RP(Rendezvous Point)로 보내진 후 이동노드의 현재 위치로 포워딩 된다. 또한 인트라 도메인과 인터 도메인에서 계층적이며 효율적인 방법을 지원함으로써 핸드오프 지연을 감소시키며, 홈 에이전트와 대응 노드에 부가되던 부하를 줄일 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.82-85
• /
• 2005

In the MIPv6 network, when mobile nodes move into new newtwork, they need to find the new access router and points(AR/AP) for the newtwork. Unless they are not connected to authorized AR/APs, they can be exposed to a lot of attacks. In this paper we propose a protocol to authenticate AR/AR and MN each other. This protocol is based on the public key scheme which is used in the SEcure Neighbor Discovery(SEND) protocol.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.29-35
• /
• 2009

In this paper we propose a mobile ad-hoc routing protocal based on AODV(Ad hoc On demand Distance Vector) with traffic management support and evaluate the performance through simulation. The average reception rate is increased by establishing the shortest route, considering in advance the usable communication resources at each node. For performance evaluation, we analyze the average data reception rate, considering the node mobility.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.109-118
• /
• 2010

Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.461-465
• /
• 2007

MANET(Mobile Ad hoc Networks) is free-mobility formation of mobile nodes in the wireless networks. Generally, wireless networks has two main type of structures which Tree and Mesh. These general structure is difficult to do which connectivity, redundancy transmit and network continuant. In this paper, we would suggest a new ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) technology for effective MANET which Ontology Doppler effect-based. ODDMRP consist of the parameters for node entropy when using Doppler effect which moving position of round node, moving time, and distribution chart in velocity also it express distance of destination node and property structure organization. It would be used to provide improvement to keep the optimal communication routing and also could be improve network stabilization, and continuation durability of connectivity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.791-800
• /
• 2010

Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2101-2119
• /
• 2013

The spectrum allocation is an attractive issue for mobile cognitive radio (CR) network. However, the time-varying characteristic of the spectrum allocation is not fully investigated. Thus, this paper originally deduces the probabilities of spectrum availability and interference constrain in theory under the mobile environment. Then, we propose a prediction mechanism of the time-varying available spectrum lists and the dynamic interference topologies. By considering the node mobility and primary users' (PUs') activity, the mechanism is capable of overcoming the static shortcomings of traditional model. Based on the mechanism, two prediction-based spectrum allocation algorithms, prediction greedy algorithm (PGA) and prediction fairness algorithm (PFA), are presented to enhance the spectrum utilization and improve the fairness. Moreover, new utility functions are redefined to measure the effectiveness of different schemes in the mobile CR network. Simulation results show that PGA gets more average effective spectrums than the traditional schemes, when the mean idle time of PUs is high. And PFA could achieve good system fairness performance, especially when the speeds of cognitive nodes are high.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.4
• /
• pp.87-97
• /
• 2019

SRS was proposed for immediate processing of the meaning of sensor data on mobile devices independent from specific sensor networks and sensor type. However, each time new sensor data is received, sensor data inspection operations are performed repeatedly, and it cause resulting in low performance. App profile-based SRS has been proposed to resolve the problem. The app profile-based SRS has improved the SRS problem through the profile, but has been tested in a virtual simulation environment. After that the test was experimented in a real-time environment, but has not been tested with a variety of dynamic factors. Therefore, this paper experiment considering such as user mobility and sensor density in real-time environment. And this paper also evaluate performance of the App profile-based through analysis of the results of the experiment. As a result, app profile-based SRS is high influence by density and sensor type, and the number of sensor node is not influence.