• Survey Research
• /
• v.7 no.1
• /
• pp.55-84
• /
• 2006

This study has classified development stages (Embryonic-Growth-Maturity) of mobile telecommunication industry based on Industry Life Cycle theory. There are two steps to be analyzed in this study, In the first step, cluster was investigated through cluster analysis using mobile density to categorize development stages of mobile telecommunication industry. In the second step, we compared on indexes of market structure, market efficiency and market performance to find out characteristics of each stage of development. The results are as follows. First, HHI is higher at embryonic stage than at growth and maturity stages, Second, ARPU(Average Revenue Per User) and RPM(Revenue Per Minute) are getting higher as the stages move on. Third, EBITDA margins, an index of market performance, is decreasing along the three stages. Finally, this study presents a clue to define the stage of development of mobile telecommunication industry and build a proper strategy for the market change.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.17-23
• /
• 2015

In this paper, we propose a mobile app clustering method using word clusters. Considering the quick change of mobile app trends, the proposed method divides the mobile apps into some semantically similar mobile apps by applying a clustering algorithm to the mobile app set, rather than the predefined category system. In order to alleviate the data sparseness problem in the short mobile app description texts, the proposed method additionally utilizes the unigram, the bigram, the trigram, the cluster of each word. For the purpose of accurately clustering mobile apps, the proposed method manages to avoid exceedingly small or large mobile app clusters by using the word clusters. Experimental results show that the proposed method improves 22.18% from 57.48% to 79.66% on overall accuracy by using the word clusters.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.216-220
• /
• 2008

Sensor nodes in wireless network have several limitations such as lack of energy resource and network bandwidth. There are many researches to extend lifetime of sensor network and enhance availability. However, most of the previous researches didn't consider the mobile sink node. Those researches aren't suitable in the environment having mobile sinks. In this paper. we propose a scheme that reduces communication overheads and energy consumptions and improves reliability in routing path setup. Proposed scheme has excellent scalability without degrading performance in environment where many sink nodes exist and/or the network size is huge. Proposed scheme saves the energy consumption up to 70% in comparison with the previous grid-based and cluster-based protocol. As a result, proposed scheme increases the lifetime of sensor network and enhances availability of wireless sensor network.

• 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.

• The Journal of Society for e-Business Studies
• /
• v.25 no.3
• /
• pp.15-40
• /
• 2020

Due to the explosive growth of mobile application services, categorizing mobile application services is in need in practice from both customers' and developers' perspectives. Despite the fact, however, there have been limited studies regarding systematic categorization of mobile application services. In response, this study proposed a method for categorizing mobile application services, and suggested a service taxonomy based on the network clustering results. Total of 1,607 mobile healthcare services are collected through the Google Play store. The network analysis is conducted based on the similarity of descriptions in each application service. Modularity detection analysis is conducted to detects communities in the network, and service taxonomy is derived based on each cluster. This study is expected to provide a systematic approach to the service categorization, which is helpful to both customers who want to navigate mobile application service in a systematic manner and developers who desire to analyze the trend of mobile application services.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.1
• /
• pp.64-72
• /
• 2009

Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.51-63
• /
• 2013

Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.310-323
• /
• 2006

In this paper, we describe a secure cluster-routing protocol based on a multi-layer scheme in ad hoc networks. We propose efficient protocols, Authentication based on Multi-layer Clustering for Ad hoc Networks (AMCAN), for detailed security threats against ad hoc routing protocols using the selection of the cluster head (CH) and control cluster head (CCH) using a modification of cluster-based routing ARCH and DMAC. This protocol provides scalability of Shadow Key using threshold authentication scheme in ad hoc networks. The proposed protocol comprises an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. This scheme takes advantage of Shadow Key using threshold authentication key configuration in large ad hoc networks. In experiments, we show security threats against multilayer routing scheme, thereby successfully including, establishment of secure channels, the detection of reply attacks, mutual end-to-end authentication, prevention of node identity fabrication, and the secure distribution of provisional session keys using threshold key configuration.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.792-795
• /
• 2012

애드 혹 네트워크(MANET: Mobile Ad hoc NETworks)는 기본적인 내부구조(infrastructure) 없이 노드들만으로 네트워크 망을 구성한다. 경로 탐색 정책으로 리액티브(reactive) 방식과 프로액티브(proactive) 방식이 있는데, 전통적으로 리액티브 방식의 성능이 더 좋은 것으로 평가된다. 그리고 두가지 방식의 장점을 취합한 하이브리드(hybrid) 방식의 클러스터 토폴로지(cluster topology) 도입에 관한 연구가 이루어지고 있다. 그 중, HCR(Hybrid Cluster Routing)이 제안되었는데, 이는 프로액티브 방식에 보다 중심을 둔 기법이다. HCR 은 리액티브 방식 경로 탐색 방법인 플라딩(flooding)의 탐색 지역을 한정된 범위로 제한할 수 있으나, 프로액티브 방식의 전체 네트워크 구성 정보 유지에 따른 막대한 오버헤드를 발생한다. 본 논문에서는 이러한 오버헤드를 줄이기 위해, 클러스터 내부 경로 탐색 기법인 MICF(Maginot path based Intra Cluster Flooding)를 제안한다. MICF 는 HCR 을 개선한 FSRS(First Search and Reverse Setting) 기반의 기법으로서, 클러스터 내부의 마지노 패스(maginot path)를 기준으로 경로 탐색 지역을 제한한다. MICF 는 게이트웨이(gateway) 간 최단 거리가 항상 클러스터 헤드(cluster head)를 중점으로 원의 내각 지역에 존재함을 바탕으로 하며, 최단 경로의 보장과 플라딩 지역 제한을 동시에 만족한다. 실험 결과, MICF 는 FSRS 기반의 기존 클러스터 내부 플라딩 방식보다 총 에너지의 7.79%만큼 더 에너지를 보존하였다. 결론적으로, MICF 역시 기존의 방식보다 에너지를 더 효율적으로 사용할 수 있으며, 마지노패스 설정과 이를 기반으로 한 제어 과정에 추가적인 오버헤드가 발생하지 않는다. 그리고 플라딩 면적이 작을수록 오버헤드가 줄어들게 됨을 알 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2699-2707
• /
• 2013

We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.