Citation Context

...on for verification is, however, not as severe as it may first seem since no path can then be longer than two hops. 7 Related Work Chiyangwa and Kwiatkowska [9] have studied timing properties of AODV =-=[10]-=- using UPPAAL. Their model uses a linear topology with specialized sender, re140 O. Wibling, J. Parrow, and A. Pears ceiver and intermediate nodes. The authors investigate how network diameter affect...

Citation Context

...only one packet at a time can be delivered to each node, one of the packets would have been dropped and the other propagated. Different variants of PLBD have been proposed and used in other protocols =-=[5]-=-. The goal of these is to minimize the number of rebroadcasts needed to reach all connected nodes. (h) A C D G E F B A C D G D E F BsAd Hoc Routing Protocol Verification Through Broadcast Abstraction ...

Citation Context

... topologies. Their method involves constructing a specialized model where we use the same protocol instance at each node which simplifies the modeling process. Obradovic et al [11] have used the SPIN =-=[12]-=- model checker and the HOL [13] theorem prover to verify route validity and freedom from routing loops in AODV. They used conditions on next node pointers, sequence numbers and hop counters to form a ...

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...

Citation Context

...een network nodes, and we have used a range of [2,4] ms to model this delay. This represents four to eight times the theoretical delay lower limit (DLL) for the basic access mechanism of IEEE 802.11b =-=[7]-=-. Note that intermittent transmission failures on lower layers (e.g. due to packet collisions) are treated as link breakages in our model. In addition to the general assumptions in Section 2.4 we assu...

Citation Context

...s imply the path invariant theorem (using standard deductive reasoning). The approach requires a significant amount of user interaction and is not directly applicable to other protocols. Das and Dill =-=[14]-=- also prove absence of routing loops in a simplified version of AODV. The strategy is similar to that of Obradovic et al, but more automated. They use predicate abstraction and can discover most of th...

Citation Context

...ncipally through simulation. Simulation often fails to discover subtle design errors, and therefore formal verification is a promising approach. In this work, we verify correct operation of the LUNAR =-=[1]-=- protocol route establishment in realistic general scenarios using a network diameter of up to eleven hops. We further describe how the route discovery phase in the DSR [2] protocol can be verified in...

Citation Context

...ew of related efforts in verifying MANET protocols. Finally, Section 8 contains conclusions and describes opportunities for future work in the area. 2 Preliminaries 2.1 Previous Work In previous work =-=[4]-=- our result was to formally verify important properties of ad hoc routing protocols acting in realistic network scenarios. The scenarios we used are repeated in Figure 1 for clarity. We studied the LU...

Citation Context

... routing protocol WARP. They use a general 5-node topology, and provide a nonexhaustive verification (using the approximating bitstate hashing mode [12]), covering 98% of the state space. Xiong et al =-=[16,17]-=- have modeled AODV using Petri nets. A topology approximation mechanism describes dynamic topology changes. They report on a looping situation found during a state space search of a general ten node t...

Citation Context

... successfully discovers all required predicates for the version of AODV considered. Proficiency in formal verification is required in order to make general use of their method. de Renesse and Aghvami =-=[15]-=- have used SPIN to model check the ad hoc routing protocol WARP. They use a general 5-node topology, and provide a nonexhaustive verification (using the approximating bitstate hashing mode [12]), cove...

Citation Context

...h the source and destination. The implication for verification is, however, not as severe as it may first seem since no path can then be longer than two hops. 7 Related Work Chiyangwa and Kwiatkowska =-=[9]-=- have studied timing properties of AODV [10] using UPPAAL. Their model uses a linear topology with specialized sender, re140 O. Wibling, J. Parrow, and A. Pears ceiver and intermediate nodes. The aut...

Citation Context

...rect operation of the LUNAR [1] protocol route establishment in realistic general scenarios using a network diameter of up to eleven hops. We further describe how the route discovery phase in the DSR =-=[2]-=- protocol can be verified in a similar way. We have aimed for the modeling to be fairly straightforward and for the verification procedure to require a minimum amount of user interaction. The verifica...

Citation Context

...encompasses a variety of topologies. Their method involves constructing a specialized model where we use the same protocol instance at each node which simplifies the modeling process. Obradovic et al =-=[11]-=- have used the SPIN [12] model checker and the HOL [13] theorem prover to verify route validity and freedom from routing loops in AODV. They used conditions on next node pointers, sequence numbers and...

Citation Context

...th of a PLBD, symbolic addresses of the intermediate nodes are generated as we go. These can be seen as pointers to the real addresses. Therefore, we select them from a limited range of numbers, e.g. =-=[0,8]-=- if we admit a maximum of 9 intermediate nodes along the fastest path. For each new route request the symbolic addresses are selected from different ranges, even thoughs136 O. Wibling, J. Parrow, and ...

Citation Context

... routing protocol WARP. They use a general 5-node topology, and provide a nonexhaustive verification (using the approximating bitstate hashing mode [12]), covering 98% of the state space. Xiong et al =-=[16,17]-=- have modeled AODV using Petri nets. A topology approximation mechanism describes dynamic topology changes. They report on a looping situation found during a state space search of a general ten node t...

Citation Context

...realize this, a routing protocol must be running on each node to forward packets from source to destination. We study a basic version of the LUNAR protocol and use our earlier pseudo code description =-=[6]-=- to aid us in the modeling. The situation in which we wish to verify correct operation arises when one network node, S, has an IP packet to deliver to another node, D, but there is no route to that no...