Markovian Implementation Methods using Mobile Ad hoc Networks

Abstract

In this proposed emerging paper approach that indicated storage buffer and security for mobile ad hoc network using via improved delay analysis. Optimal route allocation is first made by applying dynamic routing protocol. This is to reduce the communication bandwidth cost between the unbreakable optimal paths. Finally, security between the nodes is ensured through MUHC method. An extensive simulation is conducted to illustrate the efficiency of our delay analysis as well as the impacts of network parameters PDR, Delay RO and size of the sending packet.

Introduction

I. INTRODUCTION

End-to-End Delay method in Buffer-limited (E2ED-B) MANETs indicated two-hop communication paths delay analysis. The E2ED-B framework combined the theories of fixed-point (FP), quasi-birth-and-death process, and embedded Markov chain. To the occupancy states of relay buffer, the Markov chain theory was then applied to categorize packet delivery process. However, the end-to-end delay method in buffer limited constraints with 2HR (E2ED-B) did not take into consideration the security aspects and the constraint on buffer space was not addressed. The paper is developed as follows. In the next section (Section 2), we discuss some related work in delay analysis in MANET.

In this paper, we propose an effective End-to-End delay method detector based on the combination of cooperative network and dynamic routing protocol. We provide an Optimal Route Allocation framework to select the best combination. The MQORA method provides a way for safe and secure transmission of data packets between mobile nodes in MANET.

A. ORAMHR Method

In the proposed MQ-ORA and MHR scheme is introduced to provide better connection between mobile nodes in network mathematically denoted as given below.      

II. PERFORMANCE EVALUATION

This section evaluates the proposed multi hop routing scheme by simulation results by adopting NS2 simulator. Study presents the performance of Markovian Queuing-based Optimum Route Allocation (MQ-ORA) method and compares with its traditional End-to-End Delay in Buffer Limited [E2ED-BL] method. To evaluate the performance of MQ-ORA method, we consider a network consisting of 70 nodes within the 1000 * 1000 rectangular area and uses Random Waypoint Method as the mobile method. The source destination combination for MQ-ORA method is spread in the network in random form where the data packet generating rate is set as 10, 20, 30,…, 70 packets / second.

III. DISCUSSION

In this section the result analysis of MQ-ORA method is made and compared with the existing method, End-to-End Delay in Buffer Limited [E2ED-BL] [1] in MANET. In this section the scenario with 70 mobile nodes within the defined area and the number of data packet size in the range of 100KB and 700KB is considered. Each mobile node moves with the velocity of 0 – 15 m/s and the simulation method were executed 7 times. To evaluate the efficiency of MQ-ORA method, the following metrics like end-to-end delay, packet delivery ratio, storage buffer in MANET is measured.

Conclusion

This paper represents a significant step towards the end-to-end delay modeling in MANETs. With the help of the theories of Optimum Route Allocation-based Multi Hop Routing, Markovian Queuing and Secured Multiple Unique Hash Chain method, a novel theoretical framework has been developed to efficiently depict the highly dynamics in such networks. Also, it is expected the framework can shed light on the E2E delay modeling for multi-hop MANETs. By measuring the optimal routing, we propose a Diffie- Hellman-Hash algorithm based on the cryptographic keys to ensure genuine data packet transmission with the aid of division remainder method. Extensive simulations have been conducted to validate the efficiency and applicability of our framework.

References

REFERENCES [1] Jia Liu, Min Sheng, Yang Xu, Jiandong Li, and Xiaohong Jiang, “End-to-End Delay Methoding in Buffer-Limited MANETs: A General Theoretical Framework”, IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 1, 2016. [2] Fraser Cadger, Kevin Curran, Jose Santos and Sandra Moffett, “Mobility and Delay in Greedy Geographic Routing”, International Journal of Service and Computing Oriented Manufacturing. [3] Prabha R. and Ramaraj N., “An improved multipath MANET routing using link estimation and swarm intelligence”, EURASIP Journal on Wireless Communications and Networking, 2015. [4] C-K Toh, “Adhoc Mobile Wireless Networks”, Pearson edition, Vol.3, 2011. [5] R Ahlswede, et al, “Network information flow”, IEEE transactions on information theory, Vol.56, No.12, 2010, pp: 5893-5905 [6] C. E. Perkins, “Ad-hoc networks”, Vol.2, No.1, 2010.Ch. Niranjan Kumara, N.Satyanarayanab, “Multipath QoS Routing for Traffic Splitting in MANETs”, International Conference on Intelligent Computing, Communication & Convergence, Elsevier, May 2015. [7] C. S. R. Murthy et al, “Adhoc Wireless Networks Architecture and Protocols”, Prentice Hall, Vol.2, 2007. [8] Jyoti Prakash Singh, Paramartha Dutta, Arindrajit Pal, “Delay Prediction in Mobile Ad Hoc Network using Artificial Neural Network, Computer, Communication, Control and Information Technology, Elsevier, 2012. [9] Seyed Hossein Hosseini Nazhad, Mohammad Shojafar, Shahaboddin Shamshirband, Mauro Conti, “An efficient routing protocol for the QoS support of large scale MANETs”, Wiley, 2017. [10] Imielinski, et al, “Mobile Computing”, Springer publications, Vo.76... No.12, 2010, pp: 1281-1293 [11] Basagni.S, et al, “Ad Hoc Networking”, IEEE Press Wiley, Vol.6, No.2, 2003, pp: 46-55. [12] M. Frodigh, et al, “Wireless ad hoc networking: the art of networking without a network” Ericsson Review, Vol .77, No.4, 2000, pp: 248-263. [13] G.Forman and J.Zahorjan, “Mobile Wireless Computing”, IEEE Spectrum, Vol.27, No.4, 1994, pp: 38-47. [14] Swati, et.al, “A Survey Routing Protocols in MANET” IJCA, Vol.96, No.13, 2014, pp.7-12. [15] A. Mishra, et al, “Security in Wireless Ad Hoc Networks, in Book The Handbook of Ad Hoc Wireless Networks” (Chapter 30), CRC Press LLC, 2003,

Copyright

Copyright © 2022 Servesh Gupta, Pratik Tawde. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.