A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
A process calculus for Mobile Ad Hoc Networks
2010
Science of Computer Programming
We present the ω-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. ...
(A similar separation of concerns has been achieved in several recently introduced process calculi for wireless and mobile networks [13, 10, 9, 6 ], but not, as we argue in Section 8, as simply and naturally ...
Acknowledgements We would like to thank the anonymous reviewers for their valuable comments which substantially helped in improving the quality of the paper. ...
doi:10.1016/j.scico.2009.07.008
fatcat:layqpe7v4japvj3kpzu3nrep6u
A Timed Calculus for Mobile Ad Hoc Networks
2012
Electronic Proceedings in Theoretical Computer Science
We develop a timed calculus for Mobile Ad Hoc Networks embodying the peculiarities of local broadcast, node mobility and communication interference. ...
We then apply our calculus to model and study some MAC-layer protocols with special emphasis on node mobility and communication interference. ...
In this paper, we present a timed calculus for mobile ad hoc networks (TCMN), which extends CWS [12] and deals with all of the three issues. ...
doi:10.4204/eptcs.105.9
fatcat:qxc7jzorbbemhlrsrobuzbxdra
A Calculus for Mobile Ad-hoc Networks with Static Location Binding
2009
Electronical Notes in Theoretical Computer Science
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN [6]. ...
Essential to the new calculus is the novel restricted treatment of node mobility imposed by hiding of location names using a static binding operator, and we introduce the more general notion of unidirectional ...
Our work is devoted to a particular kind of wireless networks, i.e. Mobile Ad Hoc Networks (MANETs). ...
doi:10.1016/j.entcs.2009.06.018
fatcat:sl2xt4fwinfzzougn5lbsoymsi
A process calculus for energy-aware multicast communications of mobile ad hoc networks
2013
Wireless Communications and Mobile Computing
Energy conservation is a critical issue in mobile ad hoc networks (MANETs) for both nodes and network lifetime, as only batteries power nodes. ...
In order to reason about cost-effective ad hoc routing protocols, our calculus captures the possibility for a node to control the transmission radius of its communications. ...
INTRODUCTION A mobile ad hoc network (MANET) is a self-configuring network of mobile devices connected by wireless links. ...
doi:10.1002/wcm.2207
fatcat:fdnvo4ovdnec7ebbnltbqy4gfa
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
2009
Electronical Notes in Theoretical Computer Science
We introduce a novel process calculus called DBSPI (distributed broadcast SPI-calculus) which models mobile ad hoc networks (MANET). ...
To our knowledge this is the first type system for a MANET calculus doing that. ...
In [3] Godskesen describes a calculus with a rich term languageá la Applied π [2] for mobile ad hoc networks called CMAN. ...
doi:10.1016/j.entcs.2009.06.030
fatcat:qhboydkamjfolej6errkhl4iqe
A Calculus for Mobile Ad Hoc Networks
[chapter]
Lecture Notes in Computer Science
We suggest a Calculus for Mobile Ad Hoc Networks, CMAN. ...
The goal of our work is to define a Calculus for Mobile Ad Hoc Networks (CMAN) that facilitates mobility and spatially oriented broadcast. ...
Acknowledgments Thanks to the anonymous reviewers for valuable comments on earlier versions of this paper. ...
doi:10.1007/978-3-540-72794-1_8
dblp:conf/coordination/Godskesen07
fatcat:rmjrmqidffbhtg4fflrc3l5wae
A Process Calculus for Mobile Ad Hoc Networks
[chapter]
Lecture Notes in Computer Science
We present the ω-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. ...
(A similar separation of concerns has been achieved in several recently introduced process calculi for wireless and mobile networks [5, 8, 9, 12] , but not, as we argue in Section 6, as simply and naturally ...
We thank Massimo Merro for his valuable comments on an earlier version of this paper. Research supported in part by NSF grants CCR-0205376, CNS-0509230, CNS-0627447, and ONR grant N000140710928. ...
doi:10.1007/978-3-540-68265-3_19
dblp:conf/coordination/SinghRS08
fatcat:3agxm5nkk5dfrcneaxxaqpuefu
A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks
[chapter]
2010
IFIP Advances in Information and Communication Technology
We present CMN # , a process calculus for formally modelling and reasoning about Mobile Ad Hoc Networks (MANETs) and their protocols. ...
The calculus We introduce the language CMN # , an extension of CMN (Calculus of Mobile Ad Hoc Networks) [4] , that models mobile ad hoc networks as a collection of ...
This is an extension of CMN (Calculus of Mobile Ad Hoc Networks), proposed by Merro in [4] . ...
doi:10.1007/978-3-642-15240-5_2
fatcat:o3tey4oorrc45jfxjwzt2kn5ye
Sender- and receiver-centered interference in wireless ad hoc networks
2010
2010 IFIP Wireless Days
In this paper we present the E-BUM calculus, a Energy-aware calculus for Broadcast, Unicast and Multicast communications in wireless ad hoc networks. ...
We formalize the notions of senderand receiver-centered interference and provide efficient proof techniques for verifying the absence of interference between a specific set of nodes. ...
The E-BUM calculus presented in this paper is an extension of CMN (Calculus of Mobile Ad-Hoc Networks) [7] that models unicast and multicast communications as well as the ability for a node to control ...
doi:10.1109/wd.2010.5657715
dblp:conf/wd/GallinaR10
fatcat:bb47v4tjgvb3zphgulcbrnh6r4
A Coordination Model for ad hoc Mobile Systems
[chapter]
2003
Lecture Notes in Computer Science
Particular, coordination is a challenging task, since ad hoc networks are characterized by very opportunistic connections and rapidly changing topologies. ...
This paper presents a coordination model, called PeerSpaces, designed to overcome the shortcomings of traditional coordination models when used in ad hoc networks. ...
Acknowledgments We would like to thank Jan Vitek and Bogdan Carbunar for the discussions that led to this paper. ...
doi:10.1007/978-3-540-45209-6_145
fatcat:gezcvh2g4zhuncbl5xeg7h235m
Restricted Broadcast Process Theory
2008
2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. ...
We give a formal operational semantics for our process algebra, and define equivalence relations on protocols and networks. ...
We are going to extend our algebra to verify security properties of ad hoc networks based on information flow analysis [9] . ...
doi:10.1109/sefm.2008.25
dblp:conf/sefm/GhassemiFM08
fatcat:x7jik2e7mncvvfseeofnyg2jja
An Observational Theory for Mobile Ad Hoc Networks
2007
Electronical Notes in Theoretical Computer Science
We propose a process calculus to study the observational theory of Mobile Ad Hoc Networks. ...
The labelled transition system is then used to derive the notions of simulation and bisimulation for ad hoc networks. ...
Acknowledgements Many thanks to Davide Sangiorgi for insightful comments on a early draft. I also thank Davide Quaglia for useful discussions on MANETs. ...
doi:10.1016/j.entcs.2007.02.039
fatcat:4mqe42ixjvhwrnzygwwbyi4blu
An Observational Theory for Mobile Ad Hoc Networks (full version)
2009
Information and Computation
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. ...
The labelled transition system is then used to derive the notions of (weak) simulation and bisimulation for ad hoc networks. ...
We propose a value-passing process calculus to model Mobile Ad Hoc Networks. Our calculus is called Calculus of Mobile Ad Hoc Networks (CMN). ...
doi:10.1016/j.ic.2007.11.010
fatcat:okdpxz7ldfazxdi44szzbqqgaa
Technical sessions (day 1)
2011
2011 17th IEEE International Conference on Networks
in Wireless Sensor Network ThA1.3 -P0197 Efficient Flooding using Prefetching and Caching in On-Demand Routing Protocol for Mobile Ad-hoc Networks ThA1.4 -P0192 Energy Efficient High Capacity HETNET by ...
Transmission over Bursty Loss Channels 20111i h IEEE International Conference on Networks Mobile, ad-hoc, mesh and sensor networks (2/3) Chair: Zhiyun LIN Zhejiang University ThM1.1 -P0227 Delay Tolerant ...
doi:10.1109/icon.2011.6168466
fatcat:5mt7itnnvbgx3phqsnsucmw3iy
A framework for throughput and energy efficiency in mobile ad hoc networks
2011
2011 IFIP Wireless Days (WD)
In this paper, we propose a general framework to evaluate and compare both throughput and energy efficiency of mobile ad hoc networks. ...
This framework is built upon a probabilistic, energy-aware, calculus for the analysis of broadcast, unicast and multicast wireless communications. ...
It is based on the probabilistic, energy-aware, calculus for mobile ad hoc networks introduced in [2] . ...
doi:10.1109/wd.2011.6098191
dblp:conf/wd/GallinaHMR11
fatcat:xv6zwwwajrg6vdyvwcskgo4mzy
« Previous
Showing results 1 — 15 out of 4,899 results