| Abstrakt: |
Among the pool of promising research areas of the current technological era, an exciting research area is the Internet of Things (IoT) that aims to build a network of Internet-capacitate devices to facilitate a smart world. A large pool of devices is embedded in all possible geographical sites to gather the data to enable the intelligent world. The data collected from this massive pool of devices will be enormous in terms of size and diversity. Keeping in cognizance of the battery and energy constraints of the Internet-capacitate devices, any IoT network's efficiency will depend upon the total number of intra- and inter- communications between/within the IoT network's sensor devices components like the base station and the data collection nodes. To decrease the number of intra- and inter-communications, data aggregation from the multiple nodes and transmitting the aggregated data as a single data-packet can be a possible solution. Data aggregation has been proven to be an efficient technique to increase efficiency and keep the data fresh in an IoT framework. Aggregating the data efficiently will eventually minimize the latency and increase the throughput of the network as a whole. This paper has proposed a new mechanism for data aggregation, i.e., beta-dominating set centered cluster-based data aggregation mechanism (βDSC2DAM) for the Internet of Things, which is an improvement of the classical cluster-based data aggregation mechanism. The proposed mechanism is compared with the classical cluster-based data aggregation mechanism and evaluated on the parameters of Data Aggregation Time, Average Latency, Mean End-to-End delay of the arrived packets, and Maximum End-to-End delay of the arrived packets in the IoT network. The algorithms are also compared based on asymptotic time complexity analysis. The results reveal that the βDSC2DAM performs better in terms of time complexity and the parameters listed than the classical cluster-based aggregation mechanism for the Internet of Things. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink