Abstract
In the gossip problem each node of the graph G possesses a unique piece of information - the gossip message. A sequence of one-way or two-way communications between pair of nodes is made to spread the messages so that any node of the graph knows all the gossips. The question is, what is the minimum number of calls between pairs of nodes needed to exchange all gossip messages? The solution to the two-way communication gossip problem is that \(2N-4\) calls (\(N\ge 4\)) suffice if and only if the graph contains a four cycle subgraph. For one-way communication problem the classical results states that in a strongly connected graph \(2N-2\) calls (\(N\ge 4\)) suffice. In this paper we consider the gossip problem in the context of saving the energy consumed by the sensor network nodes. In the process of gossiping the network nodes consume their energy resources. The amount of consumed energy depends on the cost of transmission between pairs of nodes, a selected transmission route and the sizes of the gossip messages. For the fixed size of gossip messages and the fixed cost of transmission of one unit of data between pairs of nodes we search for the optimal transmission route of the gossip messages such that the most overloaded node consumes the minimum amount of energy. We define the network lifetime for the gossiping process as the time until the first node of the network runs out of its energy. By minimizing the energy of the most overloaded node we obtain the solution to the network lifetime gossiping problem. In the paper we solve the problem for the one-dimensional regular sensor network. We propose a load balancing algorithm for solving the problem in networks with evenly distributed sensors in a given area such that an equal energy solution of the problem exists. We also propose a data aggregation scheduling algorithm to calculate the minimum number of calls necessary to spread the gossip messages for a given solution of the network lifetime gossiping problem.
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
Tijdeman, R.: On a telephone problem. Nieuw Arch. Wisk. 19, 188–192 (1971)
Hajnal, A., Milner, E.C., Szemeredi, E.: A cure for the telephone disease. Can. Math. Bull. 15, 447–450 (1972)
Baker, B., Shostak, R.: Gossips and telephones. Discrete Math. 2, 191–193 (1972)
Harary, F., Schwenk, A.J.: The communication problem on graphs and digraphs. J. Franklin Inst. 297, 491–495 (1974)
Bumby, R.: A problem with telephones. SIAM J. Algebraic Discrete Methods 2, 13–19 (1981)
Labahn, R.: The telephone problem for trees. Elektron. Informationsverarb. Kybernet. 22, 475–485 (1986)
West, D.: A class of solutions to the gossip problem part I. Discrete Math. 39, 307–326 (1982)
Flouri, K., Beferull-Lozano, B., Tsakalides, P.: Optimal gossip algorithm for distributed consensus SVM training in wireless sensor networks. In: 16th International Conference on Digital Signal Processing, Santorini-Hellas, Greece (2009)
Shah, D.: Gossip algorithms. Found. Trends Netw. 3(1), 1–125 (2008)
Czumaj, A., Gasieniec, L., Pelc, A.: Time and cost trade-offs in gossiping. SIAM J. Discrete Math. 11(3), 400–413 (1998)
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks. Springer, Heidelberg (2005). https://doi.org/10.1007/b137871
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis, and applications. In: Proceedings of the IEEE INFOCOM, Miami, FL (2005)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized Gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)
Lee, H.-M., Chang, G.J.: Set to set broadcasting in communication networks. Discrete Appl. Math. 40, 411–421 (1992)
Bermond, J.-C., Gargano, L., Rescigno, A.A., Vaccaro, U.: Fast gossiping by short messages. SIAM J. Comput. 27, 917–941 (1998)
Iwanicki, K. van Steen, M.: The PL-Gossip Algorithm, Technical report IR-CS-034 Vrije Universiteit Amsterdam (2007)
Hou, X., Tipper, D., Wu, S.: A Gossip-based energy conservation protocol for wireless ad hoc and sensor networks. J. Netw. Syst. Manag. 14(3), 381–414 (2006)
Modiano, E., Shah, D., Zussman, G.: Maximizing throughput in wireless networks via gossiping. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems SIGMETRICS, France, pp. 27–38 (2006)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319–349 (1988)
Chang, J.H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: Proceedings INFOCOM, pp. 22–31 (2000)
Acharya, T., Paul, G.: Maximum lifetime broadcast communications in cooperative multihop wireless ad hoc networks: centralized and distributed approaches. Ad Hoc Netw. 11, 1667–1682 (2013)
Lipiński, Z.: Maximum lifetime broadcasting problem in sensor networks (2015). http://arxiv.org/abs/1511.05587. Wireless Personal Communications (2018, to appear)
Lipiński, Z.: Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks. In: Proceedings of the 12th International Conference on Digital Information Management (ICDIM 2017), Fukuoka, Japan (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Lipiński, Z. (2018). Maximum Lifetime of the Wireless Sensor Network and the Gossip Problem. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds) Computer Networks. CN 2018. Communications in Computer and Information Science, vol 860. Springer, Cham. https://doi.org/10.1007/978-3-319-92459-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-92459-5_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92458-8
Online ISBN: 978-3-319-92459-5
eBook Packages: Computer ScienceComputer Science (R0)