Abstract
The interaction between agents in multiagent-based control systems requires peer to peer communication between agents avoiding central control. The sensor nodes represent agents and produce measurement data every time step. The nodes exchange time series data by using the peer to peer network in order to calculate an aggregation function for solving a problem cooperatively. We investigate the aggregation process of averaging data for time series data of nodes in a peer to peer network by using the grouping algorithm of Cichon et al. 2018. Nodes communicate whether data is new and map data values according to their sizes into a histogram. This map message consists of the subintervals and vectors for estimating the node joining and leaving the subinterval. At each time step, the nodes communicate with each other in synchronous rounds to exchange map messages until the network converges to a common map message. The node calculates the average value of time series data produced by all nodes in the network by using the histogram algorithm. We perform simulations which show that the approximate histograms method provides a reasonable approximation of time series data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sahli, N., Jabeura, N., Badra, M.: Agent-based framework for sensor-to-sensor personalization. J. Comput. Syst. Sci. 81(3), 487–495 (2015)
Russell, S.-J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Pearson Education Inc., Upper Saddle River (2010)
Wooldridge, M.: An Introduction to MultiAgent Systems, 2nd edn. Wiley, Chichester (2009)
Rohbogner, G., Fey, S., Benoit, P., Wittwer, C., Christ, A.: Design of a multiagent-based voltage control system in peer-to-peer networks for smart grids. Energy Technol. 2(1), 107–120 (2014)
Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 565–574. IEEE Computer Society, United States (2000)
Kuhn, F., Locher, T., Wattenhofer, R.: Tight bounds for distributed selection. In: Proceedings of 19th ACM Annual Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 145–153. Association for Computing Machinery, New York (2007)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 482–491. IEEE Computer Society, Washington (2003)
Shah, D.: Network gossip algorithms. In: IEEE International Conference on Acoustics, Speech and Signal Processing Proceedings (ICASSP 2009), pp. 3673–3676. IEEE, Taipei (2009) https://doi.org/10.1109/ICASSP.2009.4960423
van de Bovenkamp, R., Kuipers, F., Van Mieghem, P.: Gossip-based counting in dynamic networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds.) NETWORKING 2012. LNCS, vol. 7290, pp. 404–417. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30054-7_32
Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report TR-2003-24. Stanford University (2003). http://ilpubs.stanford.edu:8090/586/. Accessed 1 Oct 2018
Flajolet, P., Martin, G.-N.: Probabilistic counting. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 76–82. IEEE, United States (1983)
Cichon, J., Gotfryd, K.: Average counting via approximate histograms. J. ACM Trans. Sens. Netw. (TOSN) 14(2), 8.1–8.32 (2018)
Baquero, C., Almeida, P.-S., Menezes, R., Jesus, P.: Extrema propagation: fast distributed estimation of sums and network sizes. J. IEEE Trans. Parallel Distrib. Syst. 23(4), 668–675 (2012)
Acknowledgments
This work was supported by the Indonesian Endowment Fund for Education (LPDP) under the BUDI-LPDP scholarship program. The authors acknowledge support from Offenburg University of Applied Sciences and Albert-Ludwigs-Universität Freiburg.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Nugroho, S., Weinmann, A., Schindelhauer, C., Christ, A. (2020). Averaging Emulated Time-Series Data Using Approximate Histograms in Peer to Peer Networks. In: De La Prieta, F., et al. Highlights in Practical Applications of Agents, Multi-Agent Systems, and Trust-worthiness. The PAAMS Collection. PAAMS 2020. Communications in Computer and Information Science, vol 1233. Springer, Cham. https://doi.org/10.1007/978-3-030-51999-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-51999-5_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-51998-8
Online ISBN: 978-3-030-51999-5
eBook Packages: Computer ScienceComputer Science (R0)