Divide, Conquer and Merge for Internet-of-Things
Jagnyashini Debadarshini, Sudipta Saha · 2022
Divide, Conquer and Merge (DCM) is a well-known algorithmic paradigm. It has been used to solve both core problems as well as to address the scalability issue in other algorithms. It is widely used in networks or distributed computation to solve the scalability problem arising due to highly dense and wide structures. However, from the implementation point of view, all these application of DCM were designed considering the traditional Asynchronous-Transmission (AT) based communication technologies. In this work, we study the application of DCM in the context of Synchronous-Transmission (ST) which bears fundamentally different dynamics compared to the AT. Specifically, we study the application of DCM over an existing state-of-the-art ST-based strategy MiniCast and demonstrate the performance gain in calculation of aggregation. Our work, shows that applying DCM on MiniCast makes MiniCast based aggregation mechanism upto six times faster and make it consume upto five times lesser energy compared to the case when DCM is not applied.