Sciweavers

138 search results - page 13 / 28
» Bypass routing: An on-demand local recovery protocol for ad ...
Sort
View
ISSTA
2000
ACM
13 years 12 months ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
IJWIN
2007
68views more  IJWIN 2007»
13 years 7 months ago
Density-Independent, Scalable Search in Ad Hoc Networks
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
Zygmunt J. Haas, Rimon Barr
ICT
2004
Springer
147views Communications» more  ICT 2004»
14 years 28 days ago
A Heuristic Approach to Energy Saving in Ad Hoc Networks
This paper presents a new algorithm, Extra, for extending the lifetime of ad hoc networks. Extra tries to conserve energy by identifying and switching off nodes that are momentaril...
R. I. da Silva, Julius C. B. Leite, M. P. Fernande...
ADHOC
2007
133views more  ADHOC 2007»
13 years 7 months ago
Secure position-based routing protocol for mobile ad hoc networks
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
SEFM
2008
IEEE
14 years 1 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar