Oppurtunistic Routing Through Delay Analytical Methods in Ad-Hoc Wireless Networks

Authors

  • Thenmozhi M Dept. Of Computer Science, Sri Akilandeswari Women’s College, Wandiwash, India
  • Tamilarasi N Dept. Of Computer Science, Sri Akilandeswari Women’s College, Wandiwash, India

DOI:

https://doi.org/10.26438/ijcse/v6i11.252258

Keywords:

Wireless ad-hoc networks, Opportunistic Routing, encryption, decryption, analytical model

Abstract

Many researchers are showing a keen interest in opportunistic routing and are becoming very popular. This is mainly due to its specific characteristic that it posses for improving the performance and efficiency of the wireless ad-hoc networks. A broadcasting feature of wireless ad-hoc networks is made use in opportunistic routing which increases the network's overall reliability and throughput. This research paper focuses on an efficient analytical model which is capable of transmitting the data packets both in known and unknown topologies. This is done by making use of single and multiple forwarders. The proposed approach is designed in such a way that it reduces the probability of packet loss in the network. Furthermore this paper concentrates on the security aspects of the network and provides a proper authentication mechanism before the data packets are delivered to the receiver.

References

[1] Royer, E.M.,andToh, C.K., 1999. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Commun., 6(2), pp.46-55[1]

[2] Ballardie, "Core Based Trees (CBT Version 2) Multicast Routing - Protocol Specification," RFC-2189, September 1997[2]

[3] Li, J., Blake, C., De Couto, D.S., Lee, H.I. and Morris, R., 2001, July. The capacity of ad hoc wireless networks. In Proceedings of the 7th annual international conference on Mobile computing and networking (pp. 61-69). ACM[3]

[4] Westphal, C., 2006, October. Opportunistic routing in dynamic ad hoc networks: The OPRAH protocol. In Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on (pp. 570-573). IEEE[4]

[5] Nassr, M.S., Jun, J., Eidenbenz, S.J., Hansson, A.A. and Mielke, A.M., 2007, May. Scalable and reliable sensor network routing: Performance study from field deployment. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE (pp. 670-678). IEEE[5]

[6] Yuan, Y., Yang, H., Wong, S.H., Lu, S. and Arbaugh, W., 2005, September. ROMER: resilient opportunistic mesh routing for wireless mesh networks. In IEEE workshop on wireless mesh networks (WiMesh) (Vol. 12)[6]

[7] Jain, S. and Das, S.R., 2008. Exploiting path diversity in the link layer in wireless ad hoc networks. Ad Hoc Networks, 6(5), pp.805-825[7]

[8] Biswas, S. and Morris, R., 2004. Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review, 34(1), pp.69-74[8]

[9] Zhou, X. and Tang, X., 2011, August. Research and implementation of RSA algorithm for encryption and decryption. In Strategic Technology (IFOST), 2011 6th International Forum on (Vol. 2, pp. 1118-1121). IEEE[9]

[10] Issariyakul, T. and Hossain, E., 2012. Introduction to Network Simulator 2 (NS2). An Introduction to Network Simulator NS2(pp. 21-40). Springer, Boston, MA[10]

Downloads

Published

2025-11-18
CITATION
DOI: 10.26438/ijcse/v6i11.252258
Published: 2025-11-18

How to Cite

[1]
M. Thenmozhi and N. Tamilarasi, “Oppurtunistic Routing Through Delay Analytical Methods in Ad-Hoc Wireless Networks”, Int. J. Comp. Sci. Eng., vol. 6, no. 11, pp. 252–258, Nov. 2025.

Issue

Section

Research Article