Verification and Validation of Trust-Based Opportunistic Routing Protocol
Data routing is an essential operation in working of a MANET. Many researchers have proposed novel routing protocols for MANET. Working of the routing protocols differs with each other. Each routing protocol follows a set of rules and has different characteristics. Various network simulators are popularly used to test performance and working of the novel routing protocols. However, there is a need to formally verify working of any novel routing protocol and to statistically validate experimental results collected from simulation. Our last research contribution proposed a novel trust-based opportunistic routing protocol, viz. ORPSN. This paper presents formal verification of ORPSN protocol using analytical proofs. The paper gives analytical proofs about optimality of the algorithm and loop freedom. The paper uses t-test to validate experimental results and observations. It compares performance of ORPSN and CORMAN opportunistic routing protocols in various test conditions. After statistical validation of experimental results, it is observed that performance of ORPSN is significantly better than CORMAN.
KeywordsMANET Routing protocol Opportunistic routing Verification Analytical proofs Validation Hypothesis testing
- 5.Yasin, Daniyal, Kashif Saghar, and Shahzad Younis: Formal modeling and verification of Rumor Routing protocol. In: 13th IEEE International Bhurban Conference on Applied Sciences and Technology (IBCAST), 2016.Google Scholar
- 6.Šimoňák, Slavomír: Verification of communication protocols based on formal methods integration. In: Acta Polytechnica Hungarica 9.4, 117–128, 2012.Google Scholar
- 7.NS2, https://www.isi.edu/nsnam/ns/, 2017.
- 10.Patel, Tejas, and Pariza Kamboj: Opportunistic routing in wireless sensor networks: A review. In: IEEE International on Advance Computing Conference (IACC), 2015.Google Scholar
- 12.Yamazaki, Taku: Forwarding mechanism using prioritized forwarders for opportunistic routing. In: 18th IEEE Asia-Pacific Network Operations and Management Symposium (APNOMS), 2016.Google Scholar
- 13.Shabani, S., N. Moghim, and A. Bohlooli: EOpR: An opportunistic routing algorithm for adhoc networks. In: 5th IEEE International Conference on Computer and Knowledge Engineering (ICCKE), 2015.Google Scholar
- 14.Thorat, Sandeep A., and P. J. Kulkarni: Design issues in trust based routing for MANET. In: 5th IEEE International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1–7, 2014.Google Scholar
- 18.Bourke, Timothy, Rob van Glabbeek, and Peter Höfner: A mechanized proof of loop freedom of the (untimed) AODV routing protocol. In: International Symposium on Automated Technology for Verification and Analysis. Springer International Publishing, 2014.Google Scholar
- 19.De Renesse, F., and A. H. Aghvami: Formal verification of ad-hoc routing protocols using SPIN model checker. In: Proceedings of the 12th IEEE Mediterranean Electro-technical Conference. MELECON 2004.Google Scholar
- 20.Vamsi, P. Raghu, and Krishna Kant: Sybil attack detection using sequential hypothesis testing in wireless sensor networks. In: IEEE International Conference on Signal Propagation and Computer Technology (ICSPCT), 2014.Google Scholar
- 23.Analytical Proofs, https://en.wikipedia.org/wiki/Analytic_proof.
- 24.Hypothesis Testing, https://en.wikipedia.org/wiki/Null_hypothesis.