• 한국컴퓨터정보학회논문지
• /
• 제20권2호
• /
• pp.89-97
• /
• 2015

본 논문에서는 이동 클라우딩 환경에서 LBS(Location Based Services)를 지원하는 핸드오프 기법을 제안한다. 이동 클라우딩 컴퓨팅은 핸드오프 지연과 함께 재인증 지연이 발생한다. 단말이 새로운 AP에 도착하면 클라우드 서버로부터 다시 인증을 받는 절차가 필요하다. 하지만 위치정보를 이동 단말의 재인증에 사용하면 인증에 따른 지연시간을 감축시킬 수 있다. 이를 위해 제안하는 기법은 위성신호를 받지 못하는 실내에서 사용할 수 없는 GPS기반 기술을 보완할 수 있는 WiFi 기반의 위치정보 서버에 AP의 위치정보를 구축하고 핸드오프 수행 시에 위치정보를 수집하도록 하였다. 또한 핸드오프 시에 위치정보 요청을 분리하여 처리하도록 하여 핸드오프지연 시간의 증가 없이 LBS 처리를 가능하도록 하였다. 성능 분석은 핸드오프 지연시간과 위치정보 처리시간과 이에 따라 발생하는 데이터의 양을 기존의 클라우드 환경에서의 핸드오프 기법과 비교 분석하였다. 제안한 기법은 핸드오프 시에 위치정보 서버를 통해 위치정보를 수신하도록 하여 LBS 처리에 따른 지연시간이 낮았으며 핸드오프 수행시간이 증가하지 않는 것을 확인하였다.

• 한국IT서비스학회지
• /
• 제6권3호
• /
• pp.225-239
• /
• 2007

Mobile service is highly becoming in the limelight on information society by offering infringement problem about individual privacy or information by political and scientific interest This study is focusing on primary LBS application Mobile service that emphasize position confirmation, especially, looking for friends. The aim at this study grasps user productivity factor of LBS application Mobile service, and analyses whether some have relations with value and action determination of LBS application Mobile service. According to result, Mobile service applying position service is supported with usefulness and system quality, adaptedness. On the other hand, Usability and social effect, privacy weren't embossed by leading person. Mobile service applying position service is changed with a person who have experience looking for friend. This study has systematically analysed about LBS application service by leading person

• 경영과학
• /
• 제29권1호
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.1-6
• /
• 2020

Fast service access involves keeping track of the location of mobile users, while they are moving around the mobile network for a satisfactory level of QoS (Quality of Service) in a cost-effective manner. The location databases are used to keep track of Mobile Terminals (MT) so that incoming calls can be directed to requested mobile terminals at all times. MT reporting cell system used in location management is to designate each cell in the network as a reporting cell or a non-reporting cell. Determination of an optimal number of reporting cells (or reporting cell configuration) for a given network is reporting cell planning (RCP) problem. This is a difficult combinatorial optimization problem which has an exponential complexity. We can see that a cell in a network is either a reporting cell or a non-reporting cell. Hence, for a given network with N cells, the number of possible solutions is 2^N. We propose a biogeography based optimization (BBO) for design of mobile station location management system in wireless communication network. The number and locations of reporting cells should be determined to balance the registration for location update and paging operations for search the mobile stations to minimize the cost of system. Experimental results show that our proposed BBO is a fairly effective and competitive approach with respect to solution quality for optimally designing location management system because BBO is suitable for combinatorial optimization and multi-functional problems.

• 한국컴퓨터정보학회논문지
• /
• 제22권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.

• 한국컴퓨터정보학회논문지
• /
• 제21권12호
• /
• pp.91-96
• /
• 2016

In this paper, we propose the CRM service model for analyzing and managing location based data collected by Wi-Fi and BLE. As mobile devices became personalized, enterprises became interested in individual location, and location based mobile marketing started to stand on spotlight. Location based proximity marketing is developing along with contactless data transmission technology, and payment system that uses NFC, Beacon that utilizes BLE, as well as advertisement via Wi-Fi are being serviced. We suggest the model that mobile devices can be detected and identified by MAC address with the need of being connected to Wi-FI or Bluetooth interface. MAC addresses are not associated with any specific user account or mobile phone number. The idea is to be able to measure the amount of people which are present in a certain point at a specific time, allowing the study of the evolution of data analysis and offers effective information for decision-makings.

• 한국콘텐츠학회논문지
• /
• 제7권5호
• /
• pp.138-145
• /
• 2007

이동통신망 고도화와 유비쿼터스 센서 네트워크 기술 개발에 따라 상황인지 기반 신규 서비스 모델이 개발되고 있다. 이동통신사업자는 셀 기반의 위치정보를 이용한 친구 찾기 서비스 GPS 위치정보를 이용한 텔레매틱스 서비스 등을 제공하고 있고 최근에는 셀 기반의 위치정보 서비스를 이용한 114 서비스를 제공하고 있다. 본 논문에서는 이동통신망에서 위치정보와 상용자 정보를 이용한 모바일 상황인지 맛집 추천 서비스를 위피 플랫폼을 이용하여 개발하였다. 개발된 모바일 상황인지 맛집 추천 서비스는 이동통신망의 LBS(Location Based Service) 플랫폼으로부터 사용자 위치정보, 유선 웹 서버로부터 계절, 시간, 기상 등의 상황정보, 데이터베이스에 저장된 개인 선호 정보 등을 이용하여 최적의 맛집을 추천한다. 개발된 맛집 추천 서비스는 관광 정보 시스템과 연동하여 텔레매틱스 핵심 서비스로 제공할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2827-2848
• /
• 2021

Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

• 한국통신학회논문지
• /
• 제40권11호
• /
• pp.2196-2204
• /
• 2015

이동노드의 밀집도 정보는 모바일 IT 기술의 비약적인 발전과 함께 위치기반서비스, 사물인터넷, 스마트그리드, 지능형빌딩시스템 등 최근에 확대되는 다양하고 새로운 분야에 다양하게 활용될 수 있다. 일반적으로 특정 위치에서의 무선 이동노드의 통신 가능한 수신 이동노드는 송신 이동노드의 최대 통신 거리에 따라 가변적이다. 본 논문에서에서 들로네 삼각망을 이용해서 최대 통신거리와는 무관하게 주어진 환경에서의 전체적인 노드들의 상대적 위치를 반영한 이동노드들의 밀집도를 효과적으로 계산하는 방법을 제안한다. 제안된 방법은 사물인터넷과 같이 목적, 기능에 따라 최대 통신거리가 동일하지 않은 통신 디바이스들로 구성된 통신망의 밀집도를 계산하는데 잘 활용될 수 있다. 본 논문에서 제안되는 방법은 위치기반서비스, 사물인터넷, 스마트 그리드, 지능형빌딩 시스템 등에 잘 적용될 수 있다.

• 정보처리학회논문지A
• /
• 제13A권5호
• /
• pp.455-464
• /
• 2006

다중 지역으로 구성된 이동 에이전트 컴퓨팅 환경에서 공간적 복제 기반 기법(SRBA: Spatial Replication-Based Approach)은 에이전트의 고장발생 시에도 그 에이전트의 수행이 대기 없이 계속적으로 진행될 수 있도록 하기 때문에, 대표적인 이동 에이전트 결함 포용 기법으로 사용될 수 있다. 그러나 이 기법을 실제의 이동 에이전트 기반 컴퓨팅 시스템에 적용하는데 있어서, 단계별로 복제된 이동 에이전트들에 대한 위치추적 및 관리비용을 최소화시키는 것이 필수적이다. 본 논문에서는 이러한 문제점을 해결하는 새로운 이동 에이전트 위치 관리 프로토콜인 SRLM(Location Management protocol for Spatial Replication)을 제안한다. 제안된 프로토콜은 단계군 내의 복제된 이동 에이전트들 중 대표 작업자만이 자신의 지역서버에게 위치등록하게 함으로써 기존 프로토콜에 비해 위치갱신 및 메시지 전달 비용을 매우 줄인다. 또한, 이 프로토콜은 한 단계 군에서의 대표 작업자 결함 발생시 새로운 대표 작업자의 선출로 인한 위치 관리 문제를 해결한다.