Downloads: 101

Files in This Item:
File Description SizeFormat 
transcom.2018NVP0001.pdf1.74 MBAdobe PDFView/Open
Title: Program file placement problem for machine-to-machine service network platform
Authors: Sato, Takehiro  kyouindb  KAKEN_id  orcid (unconfirmed)
Oki, Eiji
Author's alias: 佐藤, 丈博
大木, 英司
Keywords: IoT
placement problem
heuristic algorithm
Issue Date: 1-Mar-2019
Publisher: Institute of Electronics, Information and Communication, Engineers, IEICE
Journal title: IEICE Transactions on Communications
Volume: E102B
Issue: 3
Start page: 418
End page: 428
Abstract: The Machine-to-Machine (M2M) service network platform accommodates M2M communications traffic efficiently by using tree-structured networks and the computation resources deployed on network nodes. In the M2M service network platform, program files required for controlling devices are placed on network nodes, which have different amounts of computation resources according to their position in the hierarchy. The program files must be dynamically repositioned in response to service quality requests from each device, such as computation power, link bandwidth, and latency. This paper proposes a Program File Placement (PFP) method for the M2M service network platform. First, the PFP problem is formulated in the Mixed-Integer Linear Programming (MILP) approach. We prove that the decision version of the PFP problem is NP-complete. Next, we present heuristic algorithms that attain sub-optimal but attractive solutions. Evaluations show that the heuristic algorithm based on the number of devices that share a program file reduces the total number of placed program files compared to the algorithm that moves program files based on their position.
Rights: © 2019 IEICE. 許諾条件に基づいて掲載しています。
DOI(Published Version): 10.1587/transcom.2018NVP0001
Related Link:
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks

Export Format: 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.