• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.17-26
• /
• 2004

Mobile multicast schemes are classified into remote subscription and bi-directional tunneling. While the former scheme has much overhead in the maintenances of multicast tree, the latter suffers from inefficient routing. In this paper, we propose dynamic mobile multicast routing (DMMR) scheme, which is operated on the basis of cost functions related with forwarding cost and tree reconstruction cost, Basically DMMR intends to find lower cost between forwarding cost and tree reconstruction cost. Forwarding cost is the cost of tunneling multicast packets from home agent, and tree reconstruction cost is the joining cost of foreign agent to multicast group. In the case that a mobile host moves to the other area, its foreign agent calculates cost functions related with forwarding cost and tree reconstruction cost. If forwarding cost is higher than tree reconstruction cost, foreign agent joins to multicast group and reconstructs the multicast tree. Accordingly, foreign agent can dynamically adapt remote subscription or bi-directional tunneling, Our scheme provides more stable multicast service to the mobile hosts regardless of the movements of mobile host and the number of mobile group members.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.519-531
• /
• 2004

Ad-hoc networks are temporary wireless systems composed of mobile nodes without any fixed infrastructure. The life time of each node in the ad-hoc network significantly affects the life time of whole ad-hoc network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all mobile nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Power-Aware Dynamic Source Routing (PADSR) which selects the best path to make the life time of the network be longer. In PADSR, when a source node finds a path to the destination node, it selects the best path that makes nodes in the network live evenly long. To find the best path, PADSR considers the consumption of transmission energy and residual battery capacity of nodes upon the path. Consequently the network lives longer if we use PADSR.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.165-173
• /
• 2011

In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.71-78
• /
• 2006

MANET routing protocols must support not only wireless networking without any relaying on network infrastructure, but also dynamic management of routing information caused by node mobility. Hence, they are one of important routing protocols for USN. Recently DYMO is regarded as a promising routing protocol for UMT because it is simple and easy to extend as well as it requires less networking load than others. In this paper, we design and implement DYMO routing protocol into various operation systems. Also, we develop a DYMO conformance test tool to evaluate our implementations.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1121-1128
• /
• 2008

Ad-Hoc network is consisted with the device of wireless communication. Therefore, the organization of network is dynamic and the changing communication channel is essential. According this, the study of secure routing route and certification technique has to be needed. In we research, we suggest not only the secure routing scheme in Ad-Hoc circumstance but also the method that user can be serviced the type of network which is connected Ad-Hoc network and wireless lam. In case of the routing form of Ad-Hoc Network, although in preexist study, when the device of organization withdraws, routing is needed, in we research, we suggest the detour route that is used hop frequency. We can offer the service of ubiquitous that the certification of secure user and the creation of routing route in Ad-Hoc network.

• Annual Conference of KIPS
• /
• 2003.11b
• /
• pp.1209-1212
• /
• 2003

애드 혹 네트웍(Ad Hoc Networks)은 유선 기반 망을 배제한 완전한 모바일 네트웍이다. 이동성이 큰 애드 혹 네트웍 노드간에는 경로 설정을 위해서 주기적으로 라우팅 패킷이 전송된다. 라우팅 방법은 소스 전송 요구에 따른 요구 기반 라우팅과 주기적으로 라우팅 테이블을 갱신하는 테이블 기반 라우팅으로 나누어진다. 또한, 이 두가지 방법을 혼합한 라우팅을 사용할 수 있는데, 기존의 연구에서 동등한 노드의 자원과 역할을 가정하기 때문에, 실제 네트웍에 적용하는데 한계가 있다. 본 논문에서는 클러스터를 이용한 라우팅 방법을 제안한다. 단순한 클러스터를 이용한 노드 관리는 클러스터 구성에 따른 관리 오버헤드가 발생하게 된다. 따라서 클러스터 구성 노드의 적정 수준을 유지하고, 전파 자원이 충분한 글러스터 선출 방법을 제안함으로써, 네트웍 전체의 관리 오버헤드를 줄일 수 있다. 시뮬레이션은 NS2 [12]를 이용하여, 시뮬레이션 시간동안 노드가 잔여 전력에 따라 클러스터 멤버의 수와 Hello Packet 의 주기를 변화 시킴으로써 노드의 생존성을 보장하고, 최적을 클러스터 구성할 수 있는 노드 수를 측정하였다.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.223-228
• /
• 2012

There are many algorithms to improve the network traffic and to avoid losing packets in the network. This paper proposed determining the shortest paths for hops, which are in the middle of the source and destination. The shortest path in this paper means the fastest path between them. Recently, dynamic routing algorithm is currently used now but this paper suggests the fastest paths between the source and the destination is by using the record of the network traffic history. People are using the networking and the network traffic is always corresponding to how many people use the networking in specific time. Therefore, I can predict the network condition by referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.33-40
• /
• 2012

Recently, according to increasing the network traffic in the IMS, the role of Network Management System (NMS) is very important because of limited network resource. NMS can perform two kinds of routing ways with the capability of static or dynamic routing. The way of A dynamic routing is more efficient than static routing one because it can make the flow of traffic changeful among nodes in the IMS. Therefore, in this paper, we suggest a management function of NMS, using a dynamic routing algorithm for managing the CSCFs in the IMS. And then we analyze the algorithm by measuring the performance of PoC, one of the prominent application services to be deployed in the IMS.

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

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Annual Conference of KIPS
• /
• 2001.10b
• /
• pp.1359-1362
• /
• 2001

Ad-hoc 망은 기존의 유선망이나 중앙집중화된 관리의 도움 없이 무선이동단말 스스로가 동적으로 구성하는 망이다. 현재 ad hoc망에서의 라우팅을 위해 제시된 on-demand 방식의 라우팅 프로토콜은 경로발견을 위해 blind flooding을 수행하며 이는 프로토콜의 효율성을 저해하고 있다. 본 논문에서는 이러한 blind flooding의 문제점을 개선한 수 있는 방법으로 2-hop거리의 이웃노드들에 대한 정보와 threshold factor를 이용하여 선택적으로 flooding을 수행함으로써 라우팅 오버헤드를 줄일 수 있는 방법을 제시한다.