article

An Observational Theory for Mobile Ad Hoc Networks (full version)

Author:

Massimo MerroAuthors Info & Claims

Information and Computation, Volume 207, Issue 2

Pages 194 - 208

https://doi.org/10.1016/j.ic.2007.11.010

Published: 01 February 2009 Publication History

Abstract

We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove that the two semantics coincide. The labelled transition system is then used to derive the notions of (weak) simulation and bisimulation for ad hoc networks. The labelled bisimilarity completely characterises reduction barbed congruence, a standard branching-time and contextually-defined program equivalence. We then use our (bi)simulation proof method to formally prove a number of non-trivial properties of ad hoc networks.

References

[1]

Berry, G. and Gonthier, G., The esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming. v19 i2. 87-152.

Digital Library

[2]

C. Ene, T. Muntean, A broadcast based calculus for communicating systems, in: IPDPS, IEEE Computer Society, 2001, pp. 149--159.

Digital Library

[3]

A. Francalanza, M. Hennessy, A theory of system behaviour in the presence of node and link failures, in: CONCUR, volume 3653 of Lecture Notes in Computer Science, Springer, 2005, pp. 368--382.

Digital Library

[4]

A. Francalanza, M. Hennessy, A theory for observational fault tolerance, in: FoSSaCS, volume 3921 of Lecture Notes in Computer Science, Springer, 2006, pp. 16--31.

Digital Library

[5]

J.C. Godskesen, A calculus for mobile ad hoc networks, in: COORDINATION, volume 4467 of Lecture Notes in Computer Science, Springer Verlag, 2007, pp. 132--150.

Digital Library

[6]

Harel, D., Statecharts: a visual formulation for complex systems. Science of Computer Programming. v8 i3. 231-274.

Digital Library

[7]

Hennessy, M. and Rathke, J., Bisimulations for a calculus of broadcasting systems. Theoretical Computer Science. v200. 225-260.

Digital Library

[8]

Honda, K. and Yoshida, N., On reduction-based process semantics. Theoretical Computer Science. v152 i2. 437-486.

Digital Library

[9]

Merro, M., An observational theory for mobile ad hoc networks. Electronic Notes in Theoretical Computer Science. v173. 275-293.

Digital Library

[10]

Mezzetti, N. and Sangiorgi, D., Towards a calculus for wireless systems. Electronic Notes in Theoretical Computer Science. v158. 331-353.

Digital Library

[11]

Milner, R., Calculi for synchrony and asynchrony. Theoretical Computer Science. v25. 267-310.

[12]

Milner, R., Communication and Concurrency. 1989. Prentice Hall.

Digital Library

[13]

Milner, R., Parrow, J. and Walker, D., A calculus of mobile processes (parts I and II). Information and Computation. v100. 1-77.

Digital Library

[14]

R. Milner, D. Sangiorgi, Barbed bisimulation, in: ICALP, volume 623 of Lecture Notes in Computer Science, Springer Verlag, 1992, pp. 685--695.

Digital Library

[15]

Nanz, S. and Hankin, C., A framework for security analysis of mobile wireless networks. Theoretical Computer Science. v367 i1-2. 203-227.

Digital Library

[16]

K. Ostrovsky, K.V.S. Prasad, W. Taha, Towards a primitive higher order calculus of broadcasting systems, in: PPDP, ACM, 2002, pp. 2--13.

Digital Library

[17]

C.E. Perkins, E.M. Belding-Royer, Ad-hoc on-demand distance vector routing, in: WMCSA, IEEE Computer Society, 1999, pp. 90--100.

Digital Library

[18]

G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.

[19]

K.V.S. Prasad, A calculus of value broadcasts, in: PARLE, volume 694 of Lecture Notes in Computer Science, Springer Verlag, 1993, pp. 391--402.

Digital Library

[20]

Prasad, K.V.S., A calculus of broadcasting systems. Science of Computer Programming. v25 i2-3.

Digital Library

[21]

K.V.S. Prasad, Broadcasting in time, in: COORDINATION, volume 1061 of Lecture Notes in Computer Science, Springer Verlag, 1996, pp. 321--338.

Digital Library

[22]

K.V.S. Prasad, A prospectus for mobile broadcasting systems, in: Workshop on Algebraic Process Calculi: The First Twenty-Five Years and Beyond (PA'05). BRICS Press, 2005.

[23]

Rappaport, T., . 2002. Monographs in Computer Science, 2002.second ed. Prentice Hall.

[24]

Sangiorgi, D. and Walker, D., The π-Calculus: A Theory of Mobile Processes. 2001. Cambridge University Press.

Digital Library

[25]

Sanzgir, K., LaFlamme, D., Dahil, B., Neil Levine, B., Shields, C. and Belding-Royer, E.M., Authenticated routing for ad hoc networks. IEEE Journal on Selected Areas in Communication, special issue on Wireless Ad Hoc Networks. v23 i3. 598-610.

Digital Library

[26]

A. Singh, C.R. Ramakrishnan, S.A. Smolka, A Process Calculus for Mobile Ad Hoc Networks, 2006. Available from: <http://www.lmc.cs.sunysb.edu/~cram/Papers/SRS_OmegaCalc2006/>.

Cited By

Chen NZhu H(2024)A proof system of the CaIT calculusFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-022-2258-318:2Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11704-022-2258-3
Chen NZhu H(2024)A process calculus SMrCaIT for IoTJournal of Software: Evolution and Process10.1002/smr.259536:5Online publication date: 25-Apr-2024
https://dl.acm.org/doi/10.1002/smr.2595
Xie WZhu HWu X(2023)A Timed Calculus with Mobility for Wireless NetworksProceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things10.1145/3603781.3603896(653-657)Online publication date: 26-May-2023
https://dl.acm.org/doi/10.1145/3603781.3603896
Show More Cited By

Index Terms

An Observational Theory for Mobile Ad Hoc Networks (full version)

Recommendations

An Observational Theory for Mobile Ad Hoc Networks

We propose a process calculus to study the observational theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove that the two ...
A process calculus for Mobile Ad Hoc Networks

We present the @w-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The @w-calculus naturally captures essential characteristics of MANETs, including the ability of a ...
Landmark routing in ad hoc networks with mobile backbones
Special issue on Routing in mobile and wireless ad hoc networks

A mobile ad hoc network is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Recent research has demonstrated its performance bottleneck through ...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 207, Issue 2

February, 2009

288 pages

ISSN:0890-5401

Issue’s Table of Contents

Copyright © © 2008.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen NZhu H(2024)A proof system of the CaIT calculusFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-022-2258-318:2Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11704-022-2258-3
Chen NZhu H(2024)A process calculus SMrCaIT for IoTJournal of Software: Evolution and Process10.1002/smr.259536:5Online publication date: 25-Apr-2024
https://dl.acm.org/doi/10.1002/smr.2595
Xie WZhu HWu X(2023)A Timed Calculus with Mobility for Wireless NetworksProceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things10.1145/3603781.3603896(653-657)Online publication date: 26-May-2023
https://dl.acm.org/doi/10.1145/3603781.3603896
Jiang YLiu SEhrhard T(2019)A fully abstract semantics for value-passing CCS for treesFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-018-7069-113:4(828-849)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s11704-018-7069-1
Xie WZhu HWu XVinh P(2019)Formal Verification of mCWQ Using Extended Hoare LogicMobile Networks and Applications10.1007/s11036-018-1142-824:1(134-144)Online publication date: 15-Feb-2019
https://dl.acm.org/doi/10.1007/s11036-018-1142-8
Cenciarelli PGorla DSalvo I(2019)Depletable channelsActa Informatica10.1007/s00236-018-0329-656:5(405-431)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s00236-018-0329-6
Fei YZhu HSun HYin J(2019)A Security Calculus for Wireless Networks of Named Data NetworkingFormal Methods and Software Engineering10.1007/978-3-030-32409-4_11(170-185)Online publication date: 5-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-32409-4_11
Wu XZhu HXie W(2019)UTP Semantics of a Calculus for Mobile Ad Hoc NetworksUnifying Theories of Programming10.1007/978-3-030-31038-7_10(198-216)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-31038-7_10
Yadav PGaur MGuan S(2018)A behavioural theory for intrusion detection system in mobile ad-hoc networksProceedings of the 2nd International Conference on High Performance Compilation, Computing and Communications10.1145/3195612.3195617(51-60)Online publication date: 15-Mar-2018
https://dl.acm.org/doi/10.1145/3195612.3195617
Yousefi BGhassemi FKhosravi R(2017)Modeling and efficient verification of wireless ad hoc networksFormal Aspects of Computing10.1007/s00165-017-0429-z29:6(1051-1086)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s00165-017-0429-z
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents