Variable Size Bin Packing Algorithm for IoT

Kshitija Kalaskar

Abstract: In the era of bigdata and IoT, large amount of data is generated, that ranges upto some petabytes, i. e. Bigdata. Everyone using a machine spends a lot of time acquiring and storing data. Also small and large enterprises use and generate large amount business data which needs to be stored. Finding enough storage space to hold all the acquired data requires larger storage servers or external storage devices or deletion of older files. Deleting older files may result in loss of important data for organizations. Data in IoT are of different varieties i. e. they are unstructured and hence available in different sizes as well as possess different attributes and are required for knowledge generation. These are required to be packed into bins of defined sizes such that minimum number of bins is used to pack maximum data, in order to reduce storage cost and ease of data access and retrieval, by designing appropriate algorithm. Hence, we design a variable-size bin-packing algorithm for data generated from IoT.

Keywords: Bin-packing, IoT, Data Descriptors, Data Ladder

How to Cite?: Kshitija Kalaskar, "Variable Size Bin Packing Algorithm for IoT", Volume 4 Issue 7, July 2015, International Journal of Science and Research (IJSR), Pages: 2599-2602, https://www.ijsr.net/getabstract.php?paperid=SUB157123, DOI: https://dx.doi.org/10.21275/SUB157123