Skip to main content ITU
Logo
  • Programmes
    • BSc Programmes
    • BSc in Global Business Informatics
    • BSc in Digital Design and Interactive Technologies
    • BSc in Software Development
    • BSc in Data Science
    • Applying for a BSc programme
    • MSc Programmes
    • MSc in Digital Innovation & Management
    • MSc in Digital Design and Interactive Technologies
    • MSc in Software Design
    • MSc in Computer Science
    • MSc in Data Science
    • MSc in Games
    • Applying for an MSc programme
    • Student Life
    • Women in tech
    • Student organisations at ITU
    • Labs for students
    • Practical Information for International Students
    • Ask a student
    • Study Start
    • Study and Career Guidance
    • Guest Students
    • Who can be a Guest Student
    • ITU Summer University
    • Exchange Student
    • Become an exchange student at ITU
    • Open House
    • Open House - MSc programmes
    • Open House - BSc programmes
  • Professional Education
    • Master in IT
    • Master in IT Management
    • Single Subjects
    • About single subjects
    • Contact
    • Contact us here
  • Research
    • Departments
    • Business IT Department
    • Computer Science Department
    • Digital Design Department
    • Research Groups and Labs
    • Research Groups
    • Labs
    • Research Centres
    • Centre for Digital Play
    • Center for Climate IT
    • Center for Computing Education Research
    • Centre for Digital Welfare
    • Centre for Information Security and Trust
    • European Blockchain Centre
    • Danish Institute for IT Program Management
    • ITU Research Portal
    • Find Researcher
    • Find Research
    • Research Ethics and Integrity
    • Good Scientific Practice
    • Technical Reports
    • Technical Reports
    • PhD Programme
    • About the PhD Programme
    • PhD Courses
    • PhD Defences
    • PhD Positions
    • Types of Enrolment
    • PhD Handbook
    • PhD Support
  • Collaboration
    • Collaboration with students
    • Project collaboration
    • Project Market
    • Student worker
    • Project postings
    • Job and Project bank
    • Employer Branding
    • IT Match Making
    • Hiring an ITU student or graduate
    • Make a post in the job bank
    • Research collaboration
    • Licensing Opportunities
    • Open Entrepreneurship
    • Research collaboration
    • Industrial PhD
    • Hire an Industrial PhD
    • Innovation and entrepreneurship
    • ITU Business Development
    • ITU Startup programme
  • About ITU
    • About ITU
    • Press
    • Vacancies
    • Contact
  • DK
ITU
ITU  /  Research  /  Technical Reports  /  Technical Reports Archive  /  2007  /  A Calculus for Mobile Ad Hoc Networks
  • Research
    • Research Departments
    • Research Ethics and Integrity
    • Good Scientific Practice
    • Research Groups and Centers
    • Labs
    • Technical Reports
      • Technical Reports Archive
        • 2021
        • 2018
        • 2017
        • 2016
        • 2015
        • 2014
        • 2013
        • 2012
        • 2011
        • 2010
        • 2009
        • 2008
        • 2007
          • A Realizability Model for Impredicative Hoare Type Theory
          • Preliminary Proceedings of the 14 International Workshop on Expressiveness in Concurrency (EXPRESS'07)
          • A Calculus for Mobile Ad Hoc Networks
            • Typing Linear and Non-Linear Higher-Order Mobile Embedded Resources with Local Names
            • Early Experiences on Adopting BPM and SOA: An Empirical Study
          • 2006
          • 2005
          • 2004
          • 2003
          • 2002
          • 2001
          • 2000
      • PhD Programme

    A Calculus for Mobile Ad Hoc Networks



    Jens Chr. Godskesen

    May 2007

    Abstract

    We suggest a Calculus for Mobile Ad Hoc Networks, CMAN. A node in a network is a process equipped with a location, it may communicate with other nodes using synchronous spatially oriented broadcast where only the current neighbors receive the message. Nodes may autonomously change their neighbor relationship and thereby change the network topology. We define a natural reduction semantics and strong and weak reduction congruences as well as a labeled transition semantics and prove strong and weak contextual bisimulation respectively to be sound and complete co-inductive characterizations of the corresponding reduction congruences. For the subset of connection closed networks we show a significantly simpler co-inductive characterization. Finally, we apply CMAN on a small example of a cryptographic routing protocol.

    Technical report TR-2007-98 in IT University Technical Report Series, May 2007.

    Available as PDF.


    Contact us

    Phone
    +45 7218 5000
    E-mail
    itu@itu.dk

    All contact information

    Web Accessibility Statement

    Find us

    IT University of Copenhagen
    Rued Langgaards Vej 7
    DK-2300 Copenhagen S
    Denmark
    How to get here

    Follow us

    ITU Student /
    Privacy /
    EAN-nr. 5798000417878/
    CVR-nr. 29 05 77 53

    This page is printed from https://en.itu.dk/Programmes/BSc-Programmes/~/link.aspx?_id=7AF971A8CCA040D184609747E55D40A1&_z=z