We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks. We develop veri cation techniques suited to routin...

A sensor network is nothing but the collection of number of wireless mobile nodes. Each node route the packet as well as forward the packet until the destination. Many routing protocol have been developed in mobile networks. Protocol selection is the main purpose of the wireless network and selected protocol must be best in all aspects of the mobile network. In this paper, simulation performanc...

There are many kinds of distance{vector algorithms for adaptive routing in wide{area computer networks, ranging from the classical Distributed Bellman{Ford to several recent algorithms that have better performance. However, these algorithms have very complicated behaviors and their analyses in the literature has been incomplete (and operational). In this paper, we present a stepwise assertional...

The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the fac...

We present the wireless routing protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distribut...

We present the wireless routing protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distribut...

AbstructAn ad hoc network is a collection of wireless mobile nodes dynamicmy forming a temporary network without the use of any existing network infrastructure or centralized administration. Various ad-hoc routing protocols have been proposed in literature such as Destination Sequenced Distance Vector (DsDv), ad-hoc On-demand mbow Vector (AODV) and Dynamic source Routing 0 s ~ ) . TCPlLP is the...

Internet Engineering Task Force (IETF) working group has standardized the transmission of internet protocol version 6 (IPv6) packets over IEEE 802.15.4 low power wireless personal area network (LoWPAN) as 6LoWPAN protocol. It provides the wireless sensor network (WSN) node with IP communication capabilities by putting an adaptation layer above the 802.15.4 link layer. Different mechanisms perfo...

Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When t...