Skip to main content
SpringerLink
Log in

Study of Routing Algorithms Considering Real Time Restrictions Using a Connectivity Function

  • Conference paper
Towards Autonomous Robotic Systems (TAROS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6856))

Included in the following conference series:

Abstract

The paper focuses on the study of a mobile distributed system that is characterized by frequently changing topology. The routing algorithms [4,5,1] for such a system should be, in general, fully adaptive. Additionally, it is important to know the state of the task scheduler of each node in order to determine whether it acts as a router. Traditionally, existing routing algorithms [3,2] resort to the path discovery process for each modification in topology.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Jacquet, P., Mühlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: Proc. IEEE INMIC 2001, pp. 62–68. IEEE, New York (2001)

    Google Scholar 

  2. Liu, Z., Kim, J., Lee, B., Kim, C.: A routing protocol based on adjacency matrix in ad hoc mobile networks. In: Proc. 7th Int. Conf. on Advanced Language Processing and Web Information Technology, pp. 430–436. IEEE Computer Soc., Los Alamitos (2008)

    Google Scholar 

  3. Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann, San Francisco (2007)

    Google Scholar 

  4. Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc. IEEE INFOCOM 1997, vol. 3, pp. 1405–1413. IEEE Computer Soc., Los Alamitos (1997)

    Google Scholar 

  5. Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100. IEEE Computer Soc., Los Alamitos (1999)

    Google Scholar 

  6. Peterson, L.L., Davie, B.S.: Computer Networks: A Systems Approach, 4th edn. Morgan Kaufmann, San Francisco (2007)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Posgrado en Ciencia e Ingeniería de la computación, Mexico

    Magali Arellano-Vázquez

  2. Departamento de Ingeniería de Sistemas Computacionales y Automatización, Mexico

    Héctor Benítez-Pérez

  3. Departamento de Matemáticas, Facultad de Ciencias, UNAM, México D.F., Mexico

    Jorge L. Ortega-Arjona

Authors
  1. Magali Arellano-Vázquez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Héctor Benítez-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jorge L. Ortega-Arjona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

  2. Materials and Engineering Research Institute, Sheffield Hallam University, City Campus, Horward Street, S1 1WB, Sheffield, UK

    Lyuba Alboul  & Jacques Penders  & 

  3. Department of Computing, Engineering and Mathematical Sciences, Bristol Robotics Laboratory (BRL), University of Bristol and the West of England, Bristol Business Park, BS16 1QD, Bistol, UK

    Chris Melhuish

  4. Department of Electrical and Electronic Engineering, Imperial College London, Exhibition Road, SW7 2BT, London, UK

    Mark Witkowski

  5. Department of Psychology, The University of Sheffield, Wstern Bank, S10 2TN, Sheffield, UK

    Tony J. Prescott

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arellano-Vázquez, M., Benítez-Pérez, H., Ortega-Arjona, J.L. (2011). Study of Routing Algorithms Considering Real Time Restrictions Using a Connectivity Function. In: Groß, R., Alboul, L., Melhuish, C., Witkowski, M., Prescott, T.J., Penders, J. (eds) Towards Autonomous Robotic Systems. TAROS 2011. Lecture Notes in Computer Science(), vol 6856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23232-9_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23232-9_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23231-2

  • Online ISBN: 978-3-642-23232-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation