• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.9-14
• /
• 2008

Mobile Ad-Hoc network is the network of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move freely and communicate with each other. The location management is an important issue because location information of a mobile node is frequently changed in MANET. In this paper, we propose new quorum system applying the gravity of locality of mobile nodes adaptively by using the fuzzy-logic for the mobility of mobile nodes in order to manage location information of mobile nodes in MANET efficiently. The performance of the proposed scheme is evaluated by an analytical model and compared with those of existing UQS and DQS schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.444-446
• /
• 2021

MANETs(Mobile Ad-hoc Networks) are composed of mobile nodes that are not subordinate to fixed networks and have the feature that can form their own networks. they are used in various fields for specific goals. The mobility model in MANET can be applied in various ways depending on the purpose of usage. The random mobility model has the advantage of being simple and easy to implement, so it is being used the most. In a MANET, it is assumed that each node moves independently. The random movement model is a good model for expressing this independence of each node. However, it is insufficient to express the characteristics of all nodes with only random properties of individual nodes. This paper limits the stochastic mobility model applicable in MANET. we compare the proposed stochastic mobility model and the random mobility model. We confirm that the proposed mobility model is applied to the routing protocol to show improved characteristics in terms of energy consumption efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.42-50
• /
• 2008

Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.632-641
• /
• 2007

Since the mobile node acts as the router, the Mobile Ad Hoc network requires the security methods that are different from that of network of the wire environment. Also, since the total network can't be included in the transmission area of the mobile node, when one node sends the message to the other node, we need the middle node. But if the middle node is the unreliable malicious node, we can't guarantee the secure message transmission. Also, because all nodes configuring the network are the mobile nodes, they use the restricted battery capacity and the restricted resources. Therefore, because we have trouble performing the encryption that many resources are required when we sending the message, it is vulnerable to the security than the network of the wire environment. Last, because the network topology continues to change by the mobility of nodes configuring the network, we need the security measure that matches the network characteristics. We suggest the routing attack detection for performance enhancement of AODV protocol in Mobile Ad Hoc networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.29-34
• /
• 2008

In this paper, we propose an entropy-based dynamic routing protocol for supporting effective route stability in mobile ad-hoc wireless sensor networks(MAWSN). The basic ideas and features are as follows. First, construction of entropy-based stable routing route using mobility of nodes between a source node and a destination node. Second, usage of location and direction information for route construction to support resource saving. Third, We consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET. The simulation results show the proposed routing protocol can effectively support route stability and packet delivery ratio.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.106-108
• /
• 2014

본 논문에서는 노드의 로드밸런싱 속성을 이용하여 분산경로를 설정하는 L.T(Load Tolerance)알고리즘을 제안한다. 모바일 애드 혹 네트워크(Mobile Ad hoc Network)는 유동성을 가진 노드들로 구성된 네트워크로 토폴로지의 변화가 빈번하여, 기존 알고리즘에서는 라우팅 경로를 유지하기 위한 계층적 네트워크연구가 진행되어 왔다. 하지만 계층적 네트워크에서 특정 클러스터 헤드노드에게 로드밸런싱이 집중될 경우, 클러스터 헤드노드의 제한된 로드밸런싱을 초과되어 통신이 단절된다. 본 논문에서 제안한 알고리즘은 유효한 통신 반경 안에 존재하는 클러스터 헤드노드들의 로드밸런싱을 측정한다. 클러스터 헤드노드의 로드밸런싱이 높을 경우, 소속된 클러스터 멤버노드는 클러스터 헤드노들의 로드밸런싱과 동적속성을 분석하여 L.T 속성을 계산하며, 계산된 L.T 속성을 이용하여, 노드의 분산경로를 설정한다. 모의실험을 통해 클러스터 헤드노드의 로드 밸런싱이 높을 경우, 로드밸런싱이 낮은 분산 경로를 제공함에 따라 향상된 패킷 전송률을 보일 것으로 기대된다.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.141-149
• /
• 2018

Nowadays, mobile computing has become a common computing paradigm that provides convenience to people's daily life. More and more useful mobile applications' appearance makes it possible for a user to manage personal schedule, enjoy entertainment, and do many useful activities. However, there are some inherent defects in a mobile device that battery constraints and bandwidth limitations. These drawbacks get a user into troubles when to run computationally intensive applications. As a remedy scheme, component offloading makes room for handling mentioned issues via migrating computationally intensive component to the cloud server. In this paper, we will present the predictive offloading method for efficient mobile cloud computing. At last, we will present experiment result for validating applicability and practicability of our proposal.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.507-513
• /
• 2005

This paper proposes a fast handoff scheme between PDSNs in 3GPPs network for a mobile node. It introduces a method by which handoff can be performed without reestablishing PPP connection that may occur in the process of performing handoff between PDSNs. The method for handoff between PDSNs which provide packet services to a mobile node, requires that the PDSNs should receive subscribers information about mobile nodes from their neighbor PDSNs forming a communication network. When the PDSN recognizes the mobile node moving into its coverage area, it can quickly establish a communication channel with the mobile node based on the already received subscriber information. As a result, handoff is performed without reestablishing PPP. Accordingly, handoff between PDSNs can be performed faster, removing time needed for establishing a PPP session with a terminal and for terminating a previously set up PPP session.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.950-953
• /
• 2007

무선 인프라와 이동성 지원 기술의 발달로 한 장소에서 머물던 무선 인터넷 서비스를 이동 중에도 받을 수 있게 되었다. 이러한 환경의 변화로 인해 모바일 기기의 이동성에 대한 관심은 더욱 더 커지고 있으며, 이동성뿐만 아니라 유선과 마찬가지로 끊김 없는 서비스를 받고자 하는 요구도 높아지고 있다. 모바일 노드의 이동성을 지원하기 위해서 기존 네트워크 계층의 Mobile IP 와는 달리 전송 계층에서 동작하는 mSCTP (mobile Stream Control Transmission Protocol)가 등장하였다. mSCTP 는 기존 SCTP 의 멀티호밍과 동적으로 IP 주소를 변경할 수 있는 DAR (Dynamic Address Resolution) 시그널을 이용하여 모바일 노드의 핸드오프를 지원하고 있다. 하지만, IP 주소의 추가, 변경 및 삭제에 대한 각 시그널의 전송 시기에 대한 정의가 없어 전송 시기를 결정하는 메커니즘이 필요하다. 따라서 본 논문에서는 퍼지 IF-THEN 룰을 적용한 퍼지 모델을 이용하여 이러한 문제점을 해결하고자 한다. 모바일 노드가 이동하게 될 새로운 네트워크의 신호 세기와 현재 네트워크 신호와의 신호비를 퍼지 모델에 입력하고 그 결과 값을 통해 시그널 전송 시기를 판단한다. 모바일 노드는 핸드오프 시기를 적절히 판단 할 수 있기 때문에 잘못된 핸드오프로 인한 세션의 단절을 줄일 수 있고, 기존에 발생하던 핸드오프 지연 시간을 줄일 수 있어 이동 중에도 손실 없는 서비스를 제공 받을 수 있게 된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1295-1298
• /
• 2006

일반적인 센서 네트워크 환경과 달리 이동성을 중시하는 환경에서의 무선 센서 네트워크는 에너지 효율성, 동적 자기구성, 이동성에 적합하도록 개발되어야 한다. 이러한 환경에서의 센서 네트워크 응용은 고정 노드와 이동 노드가 혼재되어 있는 것이 일반적이다. 본 논문에서는 이러한 이동 노드 지원을 위한 'LEACH-Mobile' 프로토콜을 제안한다. LEACH-Mobile프로토콜은 노드의 움직임에 따라 토폴로지가 변화할 때, 이동하는 노드가TDMA 스케줄에 따른 시간 슬롯에서 특정 클러스터 헤드 노드와 통신이 가능한지의 여부로서 클러스터의 멤버가 될 노드를 결정하고 클러스터를 재구성한다. LEACH-Mobile 프로토콜의 시뮬레이션 결과는 이동 노드가 증가함에 따라 이동성을 지원하지 않는 기존의 LEACH 프로토콜에 비해 데이터 전송 성공률 면에서 명확한 성능 향상을 가져오는 것을 보여준다.