• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.433-441
• /
• 2003

We propose a new resource reservation scheme called MC-HMRSVP(Mobile clustering based-Hierarchical mobile ReSource reserVation Protcol) that is an extension of HMRSVP[3,4]. MC-HMRSVP always establishes a virtual cluster called Mobile Cluster, which includes its immediately adjacent MA(Mobile Agent) for passive reservation as well as the current MA for active reservation to which MH(Mobile Host) belongs. Our scheme also establishes the MC regardless of intra/inter region movement by GMA(Gateway Mobile Agent) function when a MH moves. To provide a general formulation on analyzing the performance in terms of reservation cost, we also model the resource reservation cost by using a simple recursive equation. Then, we show that our scheme decreases the reservation cost in comparison with the existing HMRSVP extentions.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.103-109
• /
• 2013

Mobile ad hoc networks (MANETs) are infrastructure-less and stand-alone wireless networks with dynamic topologies. To support user's safety in MANETs, fundamental and various security services should be supported. Especially in mobile commercial market, one of the major concerns regarding security is user privacy. Recently, researches about security system to protect user privacy in cluster-based MANETs have been introduced. This paper propose a cluster reconfiguration protocol under anonymous cluster-based MANETs to enhance the network stability. The improved anonymous cluster-based MANETs can recover the network structure against abnormal states of clutserheads.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.33-40
• /
• 2017

In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1208-1214
• /
• 2009

Sensor networks are vulnerable to data congestion and hot-spot compared with wireless networks. Mobile sink supporting route protocol has such problems as hot-spot and data congestion because agent of cluster node transmits all data packet. Therefore, mobile sink supporting route protocol needs to reduce the number of packets and keep the packets from concentrating on a single node. To solve these problems, we propose mobile sink supporting routing Protocol using agent of cluster node. Cutting down on the number of packets compared with the existing mobile sink supporting routing Protocol, our proposed protocol has reduced both communication overhead and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1001-1008
• /
• 2015

Mobile Ad hoc Network(MANET) consists of a node that has mobility. In MANET, the node has routing, the node builds a network of their own, no dependent infrastructure. Topology are exchanged due to node mobility in MANET. For reducing the change of topology, hierarchical network algorithm has been investigated. In hierarchical network, cluster member node communicates through cluster head node. When the load-balancing of cluster head node is exceed, assigned cluster member node can't communicate with base station. To solve this problem, we proposed Load Tolerance algorithm. The proposed algorithm, when cluster member node can't send a message by cluster head node that exceed load-balancing, then the cluster member node sends a message by selected load tolerance node. Through a simulation, the proposed algorithm improves packet delivery ratio in cluster routing.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.204-212
• /
• 2011

Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.583-585
• /
• 2002

Mobile Ad Hoc Network에서는 무선으로 연결된 호스트들이 쉽게 이동할 수 있으며 미리 설치된 유선망을 이용하는 셀롤러망과 달리 이동 호스트 사이의 통신만으로 이루어진 망이다. Mobile Ad Hoc Network에서는 각각의 노드들의 이동성이 높기 때문에 이 각각의 노드들의 라우팅 경로를 결정하는 것이 중요하다. 이에 따라 Mobile Ad Hoc Network를 위한 많은 라우팅 프로토콜이 제안되었다. 본 논문에서는 기존에 제안된 Cluster Based Routing Protocol(CBRP)극 변형하여 마치 셀롤러망에서의 셀과 같이 고정된 위치를 하나의 셀로 정의하고 그 하나의 셀이 클러스터를 형성하여 라우팅 오버 헤드를 줄일 수 있는 기법을 제안한다.

• Journal of Information Technology Services
• /
• v.16 no.1
• /
• pp.119-138
• /
• 2017

Mobile easy payment is a term for using mobile devices to facilitate financial transactions. Mobile easy payment is a quickly emerging practice, supported by the dramatic increase of mobile phone or device users around the world. The purpose of this study is to classify user's group of the mobile easy payment service by their lifestyle based on I-VALS type and to investigate differences in usage behavior among the user groups. For empirical study, a questionnaire survey was carried out with users of mobile easy payment services using the Internet from June 7 to 10 in 2016. We conducted factor analysis for I-VALS, usage factors, satisfaction factors. We also performed cluster analysis for group classification, and analysis of variance, cross analysis to compare the different usage behavior among the user groups. In analysis results, first three cluster appeared including "ICT task-oriented group", ICT positive and socialities oriented group", "ICT leader-oriented group". Second, it was found significant differences among the clusters about factor of "easy of use", "securities", "universality", "satisfaction". Third, we showed that there were significant differences in time first used the service. Based on these findings, we provide practical implications. Results of our study can be expected to provide the basis of differentiated marketing strategy of mobile easy payment services.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.86-96
• /
• 2015

In mobile communication, mobile services [MSs] (e.g., phone calls, short/multimedia messages, and Internet data) incur a cost to both mobile users (MUs) and mobile service providers (MSPs). The proposed model MobPrice consists of dynamic data pricing schemes for mobile communication in order to achieve optimal usage of MSs at minimal prices. MobPrice inspires MUs to subscribe MSs with flexibility of data sharing and intra-peer exchanges, thereby reducing overall cost. The main contributions of MobPrice are three-fold. First, it proposes a novel k-level data-pricing (kDP) scheme for MSs. Second, it extends the kDP scheme with the notion of service-sharing-based pricing schemes to a collaborative peer-to-peer data-pricing (pDP) scheme and a cluster-based data-pricing (cDP) scheme to incorporate the notion of 'cluster' (made up of two or more MUs) in mobile communication. Third, our performance study shows that the proposed schemes are indeed effective in maximizing MS subscriptions and minimizing MS's price/user.