• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.715-723
• /
• 2015

In this paper, we propose a context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm in Mobile Ad Hoc Networks. The existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. The proposed algorithm performs cluster formation using a range of direction and threshold of velocity for the base-station, we calculate the exchange of the cluster head node probability using the direction and velocity for maintaining cluster formation. The DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.17-24
• /
• 2011

In this paper, we propose an Entropy-based Routing Protocol using Mobility (ERPM) for supporting ubiquitous convergence services efficiently in mobile ad-hoc wireless networks. The main features that the ERPM introduces to obtain the goals can be summarized as follows. First, ERPM can construct stable routing routes based on the entropy concepts using mobility of nodes. Second, ERPM can quantitatively evaluate the stability of route by entropy concepts using mobility of nodes. Third, ERPM can select the most stable route in the view points of mobility of routes between a source node and a destination node, where multiple paths are available. The performance evaluation of the proposed ERPM performed via simulation using OPNET and analysis shows that the ERPM can support the construction of stable routing routes and increase the transmission ratio of data efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1035-1037
• /
• 2009

Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.223-225
• /
• 2004

Ad-Hoc 네트워크에서 기존의 On-Demand 방식의 라우팅 프로토콜은 네트워크에서 현재 사용 중인 경로가 혼잡하어라도 네트워크 토폴로지가 변하기 이전에는 새로운 경로를 찾지 못하므로 노드의 이동성이 낮은 환경에서는 트래픽이 특정노드로 집중되는 문제가 발생한다 또한 노드들의 이동성이 낮아 네트워크가 안정된 상태인 경우 특정 노드의 트래픽이 고려되지 않은 상태에서 최단 경로만을 선택하여 데이터를 전송하기 때문에 특정노드에 트래픽이 집중되어 전송지연 및 과도한 에너지 소비를 발생시킨다는 문제점을 갖는다. 이런 특정 노드의 과도한 에너지 소비를 차단하여 전체 네트워크의 수명을 연장시키기 위한 효과적인 방법을 찾기 위한 노력이 진행되고 있다. 본 논문에서는 이러한 문제를 해결하기 위해 기존의 DSR에 에너지 소비율을 기반으로 경로설정 및 대체경로 설정기능을 추가한 ECLB(Energy Consumption based Load Balancing Method)를 제안한다. ECLB는 현재의 단위시간당 처리되는 패킷수와 과거의 평균 패킷처리율을 바탕으로 에너지 임계치(energy threshold)를 설정하고 이를 바탕으로 최적의 경로를 설정한다. 또한 계속적으로 동일 전송 경로를 사용함으로 인한 특정노드에 대한 에너지 소모의 심화와 전송지연을 최소화하기 위해 과중한 트래픽 상태를 분산시킬 수 있는 대체경로를 이용하여 데이터 집중에 따른 손실을 최소화시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.671-674
• /
• 2008

초기의 Ad-hoc 네트워크의 라우팅 프로토콜들은 Table-driven 알고리즘이 대두되었으나, 많은 문제점으로 이동단말의 이동성을 지원하는 On-demand 방식의 라우팅 프로토콜에 대한 연구가 진행되었다. 최근에는 On-demand 와 Table-driven의 장점을 반영한 AODV(Ad-hoc On-demand Distance Vector)가 널리 이용되고 있다. 그러나 AODV의 장점에도 불구하고 아직까지 AODV 는 노드들의 잦은 이동으로 Ad-hoc 네트워크에 많은 라우팅 패킷을 발생시켜 전체적인 네트워크의 성능 면에서 많은 약점을 보이고 있다. 본 논문에서는 Ad-hoc 네트워크를 구성하는 노드들 사이의 링크에 대한 신뢰성을 위해 노드의 이동경로예측을 기반으로 하는 새로운 경로설정 및 유지기법을 제안한다. 제안하는 기법은 AOMDV를 기반으로 노드의 위치와 이동 정보로 이동되는 방향과 위치를 예측하여 보다 안정적인 경로를 선택할 수 있는 기회를 제공하는 라우팅 기법이다. 또한 AOMDV로 다중경로를 보유하여 데이터의 종류와 특성에 적합한 최적의 경로선택으로 불필요한 경로설정 메시지의 오버헤드를 줄인다.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.409-418
• /
• 2005

This paper presents an efficient multicast method based on a locality in mobile IPv6 networks. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

• Convergence Security Journal
• /
• v.11 no.5
• /
• pp.13-19
• /
• 2011

Mobile nodes in MANETs have the nature of unrestricted mobility so that they will join and leave the network frequently. Therefore, it important consideration to determine the optimal distance progress between relaying nodes along the route in order to maintain the established route for an arbitrary length of time (i.e., route duration). In this paper, we derived the link maintenance probability by considering the initial distance between two relaying nodes and node mobility. Based on the link maintenance probability, we further analyzed the route stability by considering the impact of distance progress between relaying nodes along the route.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1108-1118
• /
• 2005

A mobile Ad Hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. A mobile ad hoc node has limited battery capacity. Hence, Ad Hoc routing protocol ought to be energy conservative. Previous energy aware routing has limit in fairness among nodes and network wide power consumption. In this research, we propose a new routing protocol called Clustering Based Energy-Aware Routing(CBEAR) which can improve the problems. Simulation results show that the routing protocol improves fairness and network wide power consumption as well as life time of nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.425-426
• /
• 2016

In this paper, we proposed an algorithm based on movement prediction using Markov chain in delay tolerant networks(DTNs). The existing prediction algorithms require additional information such as a node's schedule and connectivity between nodes. However, network reliability is lowered when additional information is unknown. To solve this problem, we proposed an algorithm for predicting a movement path of the node by using Markov chain. The proposed algorithm maps speed and direction for a node into state, and predict movement path of the node using transition probability matrix generated by Markov chain. As the result, proposed algorithm show that the proposed algorithms has competitive delivery ratio but with less average latency.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.