Fast Device Discovery for Remote Device Management in Lighting Control Networks

( Sang Il Choi ),( Sang Hun Lee ),( Seok Joo Koh ),( Sang Kyu Lim ),( In Su Kim ),( Tae Gyu Kang ) 한국정보처리학회 2015 Journal of information processing systems Vol.11 No.1

The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.

Fast Device Discovery for Remote Device Management in Lighting Control Networks

Choi, Sang-Il,Lee, Sanghun,Koh, Seok-Joo,Lim, Sang-Kyu,Kim, Insu,Kang, Tae-Gyu Korea Information Processing Society 2015 Journal of information processing systems Vol.11 No.1

The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.

Fast Device Discovery for Remote Device Management in Lighting Control Networks

최상일,고석주,이상훈,임상규,김인수,강태규 한국정보처리학회 2015 Journal of information processing systems Vol.11 No.1

The Remote Device Management (RDM) protocol is used to manage the devices in the lighting controlnetworks. RDM provides bi-directional communications between a controller and many lighting devices overthe DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit uniqueID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends torequire a large delay in the device discovery process. In this paper, we propose a novel partition-based discoveryscheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into severalpartitions as per the device UID, and the controller performs device discovery for each partition by configuringa response timer that each device will use. From numerical simulations, we can see that there is an optimalnumber of partitions to minimize the device discovery time for a given number of devices in the proposedscheme, and also that the proposed partition-based scheme can reduce the device discovery time, as comparedto the existing binary search scheme.

기기 간 직접통신을 위한 모바일 어플리케이션 및 서비스 디스커버리 프로토콜

최계원(Kae Won Choi),이현(Hyun Lee),장성철(Sung Cheol Chang) 한국통신학회 2013 韓國通信學會論文誌 Vol.38 No.10(통신이론)

본 논문에서는 기기 간 직접(device-to-device) 통신 시스템에서 근접한 디바이스의 모바일 어플리케이션 및 서비스를 발견하기 위한 디스커버리 프로토콜을 제안한다. 기기 간 직접통신 기술을 기반으로 모바일 소셜네트워크, 모바일 마케팅 등의 근접 기반 어플리케이션을 실현할 수 있다. 이를 위해 우선적으로 주변에 있는 수많은 디바이스에서 원하는 어플리케이션을 찾아내는 디스커버리 프로토콜의 설계가 필수적이다. 기반 시설이 없는 에드혹 망에서 디스커버리 프로토콜을 구현하기 위해서는 디바이스 내부의 어플리케이션 정보를 축약해서 디스커버리 코드를 생성하고 이를 주기적으로 방송하는 방법을 쓸 수 있다. 본 논문에서는 해시함수 및 블룸필터(Bloom filter)를 이용하여 디스커버리 프로토콜을 설계하고 이의 성능을 수학적으로 분석한다. In this paper, we propose a discovery protocol for finding nearby mobile applications and services in a device-to-device communications system. The device-to-device communication technology enables proximity-based services such as mobile social networks and mobile marketing. For realizing these proximity-based services, it is essential to design a discovery protocol which pinpoints the devices with mobile applications of interest among hundreds and thousands of devices in proximity. In the infrastructure-less networks such as ad hoc networks, we can design the discovery protocol that periodically broadcasts a short discovery code containing the compressed information of the mobile applications. In this paper, we design the discovery protocol with the discovery code generated by using a hash function and a Bloom filter. We also mathematically analyze the performance of the proposed protocol.

디바이스 간 직접통신 시스템을 위한 부분 정보를 이용한 근거리 디바이스 발견

여규학(Gyu-hak Yeo),채승엽(Seung-yeob Chae),임민중(Min-joong Rim),강충구(Chung G. Kang),예충일(Choong-il Yeh),안재영(Jae-young Ahn) 한국통신학회 2013 韓國通信學會論文誌 Vol.38 No.5B

디바이스 간 직접통신을 할 때 중요한 절차 중 하나는 근거리에 위치한 디바이스들을 발견하는 것이다. 정확한 디바이스 발견을 위해서는 모든 디바이스들이 한 번 이상 발견 신호를 전송하고 다른 디바이스들이 그 신호를 수신함으로써 모든 디바이스들 사이의 거리 정보를 파악해야 한다. 그러나 디바이스 발견을 위해서 주기적으로 모든 디바이스들이 한 번 이상 신호를 전송한다면 디바이스 신호 전송 주기가 너무 길어지거나 디바이스 발견을 위한 자원을 많이 사용해야 하는 문제가 발생할 수 있다. 또한 여러 실제적인 요인에 의해서 일부 정보들이 손실될 수 있으며 모든 필요한 정보를 얻는데 너무 많은 시간이 소요될 수 있다. 본 논문에서는 디바이스 발견을 위한 자원을 줄이고 발견 정보 손실이 있는 경우를 지원하기 위하여 일부 정보만을 활용하여 근거리에 있는 디바이스를 발견하는 방법을 제안한다. 또한 일부 발견 정보만이 있을 때의 발견 확률에 대해서 논한다. One of the important processes in device-to-device communication is the discovery of proximate devices. In order to perform precise discovery of devices, the distance information among all the device pairs should be gathered by each device sending a discovery signal in turn and the other devices receiving the signal. However, periodic discovery signal transmission by every device might require too long discovery period or too large resource for discovery. Above all, some discovery information might be lost due to several practical reasons and it may take substantial amount of time to obtain all the necessary information. In this paper, we propose a proximate-device-discovery method using partial discovery information in order to reduce the resource for discovery and support the cases in which some discovery information can be lost. We also discuss discovery probabilities with partial discovery information.

LTE-Advanced 네트워크에서 D2D 통신을 위한 특정 디바이스 탐색 기법

김향미(Hyang-Mi Kim),이한나(Han-Na Lee),김상경(SangKyung Kim) 한국IT서비스학회 2014 한국IT서비스학회지 Vol.13 No.1

Device discovery for D2D (device-to-device) communication enables a device to discover other devices in order to initiate communication with them. Devices should perform the discovery phase using a small quantity of radio resource in a short time and be able to reduce the load of the base station. Legacy device discovery schemes have focused on discovering as many target devices as possible. However, it is not appropriate for peer-to-peer D2D communication scenario. Further, synchronization problems are an important issue for discovery signal transmission. This paper proposes a discovery method that one requesting device discovers a specific target for communication. Multiple antenna beamforming is employed for the synchronization between the base station and a target device. The proposal can reduce the load of the base station using the information that it already maintains and improve the reliability of the device discovery because two times of synchronizations using beamforming among the base station and devices can make the exact discovery of a target device with mobility possible.

Discovering Mobile Applications in Cellular Device-to-Device Communications: Hash Function and Bloom Filter-Based Approach

Kae Won Choi,Wiriaatmadja, Dimas Tribudi,Hossain, Ekram IEEE 2016 IEEE TRANSACTIONS ON MOBILE COMPUTING Vol.15 No.2

<P>We propose a code-based discovery protocol for cellular device-to-device (D2D) communications. To realize proximity-based services such as mobile social networks and mobile marketing using D2D communications, each device should first discover nearby devices, which have mobile applications of interest, by using a discovery protocol. The proposed discovery protocol makes use of a short discovery code that contains compressed information of mobile applications in a device. A discovery code is generated by using either a hash function or a Bloom filter. When a device receives a discovery code broadcast by another device, the device can approximately find out the mobile applications in the other device. The proposed protocol is capable of quickly discovering massive number of devices while consuming a relatively small amount of radio resources. We analyze the performance of the proposed protocol under the random direction mobility model and a real mobility trace. By simulations, we show that the analytical results well match the simulation results and that the proposed protocol greatly outperforms a simple non-filtering protocol.</P>

Device-to-Device Discovery for Proximity-Based Service in LTE-Advanced System

Kae Won Choi,Zhu Han IEEE 2015 IEEE journal on selected areas in communications Vol.33 No.1

<P>In this paper, we propose a device-to-device (D2D) discovery scheme as a key enabler for a proximity-based service in the Long-Term Evolution Advanced (LTE-A) system. The proximity-based service includes a variety of services exploiting the location information of user equipment (UE), for example, the mobile social network and the mobile marketing. To realize the proximity-based service in the LTE-A system, it is necessary to design a D2D discovery scheme by which UE can discover another UE in its proximity. We design a D2D discovery scheme based on the random access procedure in the LTE-A system. The proposed random-access-based D2D discovery scheme is advantageous in that 1) the proposed scheme can be readily applied to the current LTE-A system without significant modification; 2) the proposed scheme discovers pairs of UE in a centralized manner, which enables the access or core network to centrally control the formation of D2D communication networks; and 3) the proposed scheme adaptively allocates resource blocks for the D2D discovery to prevent underutilization of radio resources. We analyze the performance of the proposed D2D discovery scheme. A closed-form formula for the performance is derived by means of the stochastic geometry-based approach. We show that the analysis results accurately match the simulation results.</P>

IoT 디바이스의 동적 특성의 효과적 관리를 위한 프레임워크

라현정(Hyun Jung La),박춘우(Chun Woo Park),김수동(Soo Dong Kim) 한국정보과학회 2014 정보과학회논문지 : 소프트웨어 및 응용 Vol.41 No.8

최근 각광받고 있는 연구분야 중 하나인 Internet of Things (IoT)은 사물들이 네트워크 상에 연결되어 있는 있는 컴퓨팅 환경으로, 이 환경을 구성하는 여러 IoT 디바이스들이 협업을 통해 사용자에게 유용한 기능을 제공할 수 있는 장점이 있다. IoT 디바이스의 제한된 배터리 수명, 이동성과 같은 동적인 특성으로 인해 IoT 디바이스의 상태는 계속해서 변하게 되며, 이로 인해 IoT 디바이스를 관리하는 데에 어려움이 있다. 본 논문에서는 IoT 디바이스의 동적인 특성에 의한 IoT 디바이스 관리 문제를 도출하고 이를 해결하기 위한 디바이스 관리 프레임워크를 제안한다. 그리고, 디바이스 검색, 디바이스 상태 확인, 디바이스 선택 및 연결, 그리고 디바이스 교체를 포함한 네 가지의 기법을 제시한다. 또한 제시된 기법들을 기반으로 디바이스 관리 프레임워크를 구현하고 실험을 통하여 제안한 기법들의 실효성을 검증한다. Internet of Things (IoT), one of the emerging research areas, is the computing paradigm where various things connect to the network and cooperate with their neighbors to reach common goals. Computing with IoT devices opens up a new array of opportunities for providing value-added smart services and applications to end users. That is, IoT devices play an important role of providing useful services to the users. However, the states of IoT devices are dynamically changed at runtime, which come from their mobility, network connectivity, and a battery drain problem. This dynamism results in difficulties in managing these IoT devices. In this paper, we propose a framework to manage those IoT devices with dynamism. Hence, we first derive issues from IoT devices’ dynamism. And, we define a set of requirements to manage the IoT devices and present a framework to manage the device dynamism. The framework is equipped by a device discovery method, a device status monitoring method, a device selection and connection method, and a device replacement method. Finally, we verify the feasibility and effectiveness of the framework through experiments.

Improved Dynamic Programming in Local Linear Approximation Based on a Template in a Lightweight ECG Signal-Processing Edge Device

이승민,박대진 한국정보처리학회 2022 Journal of information processing systems Vol.18 No.1

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need todevelop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of theECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has thedisadvantage of high complexity using memoization. In this paper, the calculation area and memory usage areimproved using a linear approximated template. The proposed algorithm reduces the calculation area requiredfor dynamic programming through local optimization around the vertices of the template. In addition, itminimizes the storage space required by expressing the time information using the error from the vertices ofthe template, which is more compact than the time difference between vertices. When the length of the signalis L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL)to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 msto 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square differenceconfirms that the proposed algorithm is a stable approximation.