An Efficient Agent Scheming in Distributed Time Varying Networks

  • Ali MustafaEmail author
  • Salman Ahmed
  • Najam ul Islam
  • Ahsan Tufail
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 16)


Time varying networks are a new paradigm for understanding and building distributed systems composed of various agents. Agents are autonomous systems and have two important attributes; First, they have some degree of independence in execution of their decision and deciding their next goal in order to achieve a global goal secondly, they are capable of interacting with other agents using a communication network. In this paper, an algorithm for agent counting is proposed for computing the total number of agents in a network by using graph and matrix theory. Simulation results indicates some of the control problems in distributed time varying networks and demonstrate the effectiveness of the established results for a fixed and switching topologies.


Time varying networks Agent counting Distributed algorithm Consensus control 


  1. 1.
    Karsai, M., Perra, N., Vespignani, A.: Time varying networks and the weakness of strong ties. Sci. Rep. 4, 1–6 (2014)Google Scholar
  2. 2.
    Imtiaz, J., Jasperneite, J., Weber, K., Goetz, F.J.: A novel method for auto configuration of realtime ethernet networks. In: IEEE International Conference on Emerging Technologies and Factory Automation, pp. 861–868 (2008)Google Scholar
  3. 3.
    Cisco active network abstraction 3.7 reference guide, chap. 24, pp. 1–4Google Scholar
  4. 4.
    Kracht, J.E.: Mechanism for determining actual physical topology of network based on gathered configuration information representing true neighboring devices. Patent 377–987. US Patent 6, April 2002Google Scholar
  5. 5.
    Yang, D.B., Banos, H.H.G., Guibas, L.J.: Counting people in crowds with a real-time network of simple image sensors. In: IEEE International Conference on Computer Vision, vol. 1, pp. 122–129 (2003)Google Scholar
  6. 6.
    Kahani, M., Beadle, H.: Decentralized approaches for network management. Comput. Commun. 27, 36–47 (1997)CrossRefGoogle Scholar
  7. 7.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, L., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of 6th annual ACM Symposium on Principles of Distributed Computing, pp. 1–12 (1987)Google Scholar
  8. 8.
    Evers, J., Kiss, D., Kowalczyk, W., Navilarekallu, T., Renger, M., Sella, L., Timperio, V., Viorel, A., Wijk, S.V., Yzelman, A.J.: Node counting in wireless ad-hoc networks. In: Proceedings of the 79th European Study Group Mathematics with Industry, pp. 49–73 (2011)Google Scholar
  9. 9.
    Perkins, C.E., Royer, E.M.: Adhoc on-demand distance vector routing. In: Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999)Google Scholar
  10. 10.
    Rehan, S., Bansal, M.: Performance comparison among different evolutionary algorithms in terms of node count reduction in BDDs. Int. J. VLSI Embed. Syst. 04, 491–496 (2013)Google Scholar
  11. 11.
    Liu, H., Cheng, L., Tan, M., Hou, Z., Wang, Y.: Distributed exponential finite-time coordination of multi-agent systems: containment control and consensus. Int. J. Control 88(2), 237–247 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Pandey, A.: Consensusabilty of discrete-time multi-agent system. Ph.D. dissertation, Visvesvaraya Technological University (2012)Google Scholar
  13. 13.
    DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118–121 (1974)CrossRefzbMATHGoogle Scholar
  14. 14.
    Saber, R.O., Murray, R.M.: Consensus protocols for networks of dynamic agents. In: Proceedings of the American Control Conference (2003)Google Scholar
  15. 15.
    Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Autom. Control 49(9), 1520–1533 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Feng, Y., Xu, S., Zhang, B.: Group consensus control for double integrator dynamic multiagent systems with fixed communication topology. Int. J. Robust Nonlinear Control 24(3), 532–547 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Ren, W., Beard, R.W., Atkins, E.M.: A survey of consensus problems in multi-agent coordination. In: American Control Conference, pp. 1859–1864 (2005)Google Scholar
  18. 18.
    Gantmacher, F.R.: Matrix Theory, vol. 2. Chelsea, New York (1959)zbMATHGoogle Scholar
  19. 19.
    Meng, X., Chen, T.: Event-based agreement protocols for multi-agent networks. Automatica 49(1), 2125–2132 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Ren, W., Beard, R.W.: Consensus seeking in multi agent systems under dynamically changing interaction topologies. IEEE Trans. Autom. Control 50(5), 655–661 (2005)CrossRefzbMATHGoogle Scholar
  21. 21.
    Xiao, F., Wang, L.: State consensus for multi-agent systems with switching topologies and time-varying delays. Int. J. Control 79(10), 1277–1284 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. Proc. Am. Math. Soc. 14, 733–737 (1963)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Ali Mustafa
    • 1
    • 2
    Email author
  • Salman Ahmed
    • 3
  • Najam ul Islam
    • 2
  • Ahsan Tufail
    • 1
  1. 1.Department of Electrical EngineeringCOMSATS IITAttockPakistan
  2. 2.Department of Electrical EngineeringBahria UniversityIslamabadPakistan
  3. 3.Department of Computer Systems EngineeringUniversity of Engineering and Technology PeshawarPeshawarPakistan

Personalised recommendations