Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Djahel, Soufiene, Farid Nait-Abdesselam, and Zonghua Zhang: Mitigating packet dropping problem in mobile ad hoc networks: proposals and challenges. In: IEEE communications surveys & tutorials 13, no. 4, 658–672, 2011.
Govindan, Kannan, and Prasant Mohapatra: Trust computations and trust dynamics in mobile adhoc networks: a survey. In: IEEE Communications Surveys & Tutorials 14, no. 2, 279–298, 2012.
Jadhav, Payal, and RachnaSatao: A survey on opportunistic routing protocols for wireless sensor networks. In: Procedia Computer Science 79, 603–609, 2016.
Thorat, Sandeep A., and P. J. Kulkarni: Opportunistic routing in presence of selfish nodes for MANET. In: Wireless Personal Communications 82.2, 689–708, 2015.
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.
Å imoňák, SlavomÃr: Verification of communication protocols based on formal methods integration. In: Acta Polytechnica Hungarica 9.4, 117–128, 2012.
NS2, https://www.isi.edu/nsnam/ns/, 2017.
Biswas, Sanjit, and Robert Morris: ExOR: opportunistic multi-hop routing for wireless networks. In: ACM SIGCOMM Computer Communication Review 35.4, 133–144, 2005.
Chakchouk, Nessrine: A survey on opportunistic routing in wireless communication networks. In: IEEE Communications Surveys & Tutorials 17.4, 2214–2241, 2015.
Patel, Tejas, and Pariza Kamboj: Opportunistic routing in wireless sensor networks: A review. In: IEEE International on Advance Computing Conference (IACC), 2015.
Rozner, Eric: SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks. In: IEEE transactions on Mobile computing 8.12, 1622–1635, 2009.
Yamazaki, Taku: Forwarding mechanism using prioritized forwarders for opportunistic routing. In: 18th IEEE Asia-Pacific Network Operations and Management Symposium (APNOMS), 2016.
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.
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.
M. Salehi, A. Boukerche, A. Darehshoorzadeh, and A. Mammeri: Towards a Novel Trust-based Opportunistic Routing Protocol for Wireless Networks. In: Wireless Networks, vol. 22, no. 3, pp. 927–943, 2016.
Bo, Wang: Trust-based minimum cost opportunistic routing for Ad hoc networks. In: Journal of Systems and Software 84.12, 2107–2122, 2011.
Bhargavan, Karthikeyan, Davor Obradovic, and Carl A. Gunter: Formal verification of standards for distance vector routing protocols. In: Journal of the ACM (JACM) 49.4, 538–576, 2002.
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.
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.
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.
Ho, Jun-Won: Sequential hypothesis testing based approach for replica cluster detection in wireless sensor networks. In: Journal of Sensor and Actuator Networks 1.2, 153–165, 2012.
Wang, Zehua, Yuanzhu Chen, and Cheng Li: CORMAN: A novel cooperative opportunistic routing scheme in mobile ad hoc networks. In: IEEE Journal on Selected Areas in Communications 30.2, 289–296, 2012.
Analytical Proofs, https://en.wikipedia.org/wiki/Analytic_proof.
Hypothesis Testing, https://en.wikipedia.org/wiki/Null_hypothesis.
IBM SPSS, https://www.ibm.com/analytics/us/en/technology/spss/.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Thorat, S.A., Kulkarni, P.J., Yadav, S.V. (2018). Verification and Validation of Trust-Based Opportunistic Routing Protocol. In: Pattnaik, P., Rautaray, S., Das, H., Nayak, J. (eds) Progress in Computing, Analytics and Networking. Advances in Intelligent Systems and Computing, vol 710. Springer, Singapore. https://doi.org/10.1007/978-981-10-7871-2_9
Download citation
DOI: https://doi.org/10.1007/978-981-10-7871-2_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7870-5
Online ISBN: 978-981-10-7871-2
eBook Packages: EngineeringEngineering (R0)