Skip to main content
SpringerLink
Log in

An Efficient Agent Scheming in Distributed Time Varying Networks

  • Conference paper
  • First Online:
Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016 (IntelliSys 2016)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 16))

Included in the following conference series:

  • 2662 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. 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. Cisco active network abstraction 3.7 reference guide, chap. 24, pp. 1–4

    Google Scholar 

  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 2002

    Google Scholar 

  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. Kahani, M., Beadle, H.: Decentralized approaches for network management. Comput. Commun. 27, 36–47 (1997)

    Article  Google Scholar 

  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. 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. 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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pandey, A.: Consensusabilty of discrete-time multi-agent system. Ph.D. dissertation, Visvesvaraya Technological University (2012)

    Google Scholar 

  13. DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118–121 (1974)

    Article  MATH  Google Scholar 

  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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Gantmacher, F.R.: Matrix Theory, vol. 2. Chelsea, New York (1959)

    MATH  Google Scholar 

  19. Meng, X., Chen, T.: Event-based agreement protocols for multi-agent networks. Automatica 49(1), 2125–2132 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. Proc. Am. Math. Soc. 14, 733–737 (1963)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, COMSATS IIT, Attock, Pakistan

    Ali Mustafa & Ahsan Tufail

  2. Department of Electrical Engineering, Bahria University, Islamabad, Pakistan

    Ali Mustafa & Najam ul Islam

  3. Department of Computer Systems Engineering, University of Engineering and Technology Peshawar, Peshawar, Pakistan

    Salman Ahmed

Authors
  1. Ali Mustafa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Salman Ahmed
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Najam ul Islam
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ahsan Tufail
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Mustafa .

Editor information

Editors and Affiliations

  1. Faculty of Computing and Engineering, School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, United Kingdom

    Yaxin Bi

  2. The Science and Information (SAI) Organization, Bradford, West Yorkshire, United Kingdom

    Supriya Kapoor

  3. The Science and Information (SAI) Organization, Bradford, West Yorkshire, United Kingdom

    Rahul Bhatia

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Mustafa, A., Ahmed, S., ul Islam, N., Tufail, A. (2018). An Efficient Agent Scheming in Distributed Time Varying Networks. In: Bi, Y., Kapoor, S., Bhatia, R. (eds) Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016. IntelliSys 2016. Lecture Notes in Networks and Systems, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-319-56991-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-56991-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-56990-1

  • Online ISBN: 978-3-319-56991-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation