DMCA
Ad Hoc Routing Protocol Validation (2005)
Citations: | 1 - 0 self |
Citations
3231 | Ad-hoc on-demand distance vector routing
- Perkins, Royer
- 1999
(Show Context)
Citation Context ...3.2.2 Requirement Properties and Specification Languages Requirements on the system are commonly expressed in a temporal logic such as LTL (Linear Temporal Logic) [43] or CTL (Computation Tree Logic) =-=[10]-=-. Requirement properties can be categorized as either liveness or safety properties [29]. Characteristic for a safety property is that a violation is detectable using a finite system run. It can infor... |
1235 | The broadcast storm problem in a mobile ad hoc network
- Tseng, Ni, et al.
(Show Context)
Citation Context ...e test platform, its software modules, the operating system, and configuration parameters may also interact in an unpredictable way affecting the measurements. Many previous experimental studies [12] =-=[5]-=- [3] do not deal with stochastic factors and how to create repeatable experiments. We have developed a testbed and an experimental methodology [13] in order to achieve repeatability. In short, our tes... |
665 |
The SPIN Model Checker - primer and reference manual
- Holzmann
- 2004
(Show Context)
Citation Context ...e. The test platform, its software modules, the operating system, and configuration parameters may also interact in an unpredictable way affecting the measurements. Many previous experimental studies =-=[12]-=- [5] [3] do not deal with stochastic factors and how to create repeatable experiments. We have developed a testbed and an experimental methodology [13] in order to achieve repeatability. In short, our... |
662 | Uppaal in a Nutshell.
- Larsen, Pettersson, et al.
- 1997
(Show Context)
Citation Context ... the first PLBD packet of each type and can safely ignore the rest. Using this technique, we can model LUNAR with timed automata and perform verifications for realistic network sizes using the UPPAAL =-=[3]-=- tool. Variations on the PLBD operation are also used for route discovery in other ad hoc routing protocols; one example is the DSR protocol. The DSR variant of PLBD differs in that other nodes than t... |
83 |
Throughput and delay limits of
- Xiao, Rosdahl
- 2002
(Show Context)
Citation Context ...d hoc routing protocol proposals [3]. Currently, four of these are being considered for standardization by the Internet Engineering Task Force (IETF) MANET group [4]. They are AODV [5], DSR [6], OLSR =-=[7]-=- and TBRPF [8]. Very few attempts have so far been made to formally verify their operation. As in most other computer networking areas, simulations and live testing [2] are most often employed to veri... |
58 | Counter-example based predicate discovery in predicate abstraction.
- Das, Dill
- 2002
(Show Context)
Citation Context ... relay at B which is in turn connected to the port at C. 3 Case Study: Verification of LUNAR 3.1 The Model and Its Limitations We have used a somewhat simplified version of LUNAR for our verification =-=[14]-=-. Apart from the simultaneous back path creation, features [11] such as automatic address configuration and forced route rediscovery, etc. are missing in our description. The same goes for the RREQ Ti... |
33 | LUNAR: a Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation.
- TSCHUDIN, GOLD, et al.
- 2004
(Show Context)
Citation Context ...ction seems to increase with scenario complexity although we cannot be convinced by these few measurements. Partial order reduction has not been implemented in the currently available UPPAAL versions =-=[1]-=-. 4.3.3 Abstraction Techniques Manual abstraction can be applied to a general class of protocols. When thinking of suitable abstractions based on our work in Paper B we could note that the operation r... |
21 | Automatized verification of ad hoc routing protocols,” in
- Wibling, Parrow, et al.
- 2004
(Show Context)
Citation Context ...twork of mobile nodes operating in ad hoc mode. A MANET has the following main characteristics: 5 Cs• Nodes of the network can communicate wirelessly, for example by means of 802.11 [49] or Bluetooth =-=[4]-=-. • There is no fixed, centralized, infrastructure. • Nodes are not required to remain in set positions. They can join and leave the network area at any time and change position within the network. In... |
20 | Modelling and simulation of routing protocol for mobile ad hoc networks using coloured Petri nets.
- Xiong, Murata, et al.
- 2002
(Show Context)
Citation Context ... prior to verification, instead this is done dynamically during processing. Furthermore, as a measure to cope with the state space explosion problem, SPIN includes a partial order reduction algorithm =-=[16]-=-. The state space explosion problem refers to the situation in which the state space generated by the model because of parallelism becomes so large that all the visited states cannot be stored. In the... |
16 |
Formal Verification of Ad-hoc Routing Protocols using SPIN Model Checker. Centre for Telecommunication Research,
- Renesse, R, et al.
- 2004
(Show Context)
Citation Context ... attempts to combine the advantages from theorem proving and model checking. These new techniques thus have the potential for verifying infinite state systems automatically by abstract interpretation =-=[15]-=- followed by, for example, symbolic model checking [36]. There is ongoing work on many fronts in order to lower the threshold of use as well as on coping with the state explosion problem. Here, we con... |
12 |
A timing analysis of AODV,” in
- Chiyangwa, Kwiatkowska
- 2005
(Show Context)
Citation Context ...networks to be able to use, e.g., voice applications. The authors provide measurements of throughput, end-to-end delay, etc. measured using multiple pings in a few static topologies. Kaba and Raichle =-=[9]-=-, Sanghani et al. [18], Judd and Steenkiste [8], and Ramachadran et al. [16] all describe testbeds where the physical layer effects are emulated in different ways. The aim in all these studies is to m... |
11 |
Internet draft: The dynamic source routing protocol for mobile ad hoc networks (DSR).
- Johnson, Maltz, et al.
- 2003
(Show Context)
Citation Context ...hey are AODV [5], DSR [6], OLSR [7] and TBRPF [8]. Very few attempts have so far been made to formally verify their operation. As in most other computer networking areas, simulations and live testing =-=[2]-=- are most often employed to verify new protocols. The “Network Simulator - ns2” [9] is commonly used for simulation studies, and for real-world comparisons an assisting tool such as the “Ad hoc Protoc... |
7 | Formal Analysis of Routing Protocols
- Obradovic
- 2001
(Show Context)
Citation Context ...y other ad hoc routing protocols and is intended as a platform to explore novel ad hoc routing strategies. Even so, it has been shown to compete well with more complex protocols such as OLSR and AODV =-=[11]-=-. The simplicity of the core functionality in LUNAR enables us to more clearly study the modeling of properties which are not tied to the protocol itself, such as connectivity, dynamics and broadcasti... |
4 |
Implementation and Experimental evaluation of Wireless Ad hoc Routing protocols
- Lundgren
- 2005
(Show Context)
Citation Context ...be clock zones. The verification problem is thus reduced to manipulating and solving constraints. Optimized data structures are used for compact representation of the constraint systems. NuSMV. NuSMV =-=[8]-=- is a symbolic model checker which is a reimplementation and extension of McMillan’s original SMV system [36]. System descriptions are given in the NuSMV language in which transition relations are des... |
4 | An approach for verifying routing protocols in mobile ad hoc networks using Petri - Xiong, Murata, et al. - 2004 |
3 |
LUNAR pseudo code description. http://user.it.uu.se/ oskarw/lunar pseudo code/,
- Wibling
- 2004
(Show Context)
Citation Context ...l suggestions [50] since the emergence of ad hoc networking. Two of these are currently up for standardization by the IETF MANET group [25], namely the Dynamic MANET On-demand Routing protocol (DYMO) =-=[6]-=- and version two of the Optimized Link State Routing protocol (OLSRv2) [14]. However, even though there is much effort put into developing well functioning protocols, there have been few live performa... |