EFFICIENT GOEGRAPHIC MANAGEMENT ROUTING WITH …

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056

Volume: 07 Issue: 11 | Nov 2020 www.irjet.net p-ISSN: 2395-0072

© 2020, IRJET | Impact Factor value: 7.529 | ISO 9001:2008 Certified Journal | Page 443

EFFICIENT GOEGRAPHIC MANAGEMENT ROUTING WITH ADAPTIVE POSITION

UPDATE TECHNIQUE IN MANET

Pooja Devi *1, Abhinav Dhiman*2, Harjit Singh*3

* 1M.Tech Scholar 2Assistant Professor.

1,2EEE Department, Arni University, Himachal Pradesh, India ---------------------------------------------------------------------***----------------------------------------------------------------------Abstract - Manet is a streamlining of connection state directing. It is a gathering of versatile hubs sharing a remote channel with no brought together control or built up correspondence spine. The problem in the manet is Packet collisions in the network cause packet loss which again decreases the routing performance which results in difficulty to evaluate local topology for transmission. It results in a heavy loss due this factor beacon lost and a lost beacon cannot be retransmitted. In this research the problem solution is An Enhanced APU strategy in the proposed system use destination aware routing with minimum distance dynamically adjusts the beacon update intervals based on the minimum distance from source to destination, mobility dynamics of the nodes and the forwarding patterns in the network.

Keywords: MANET, Hub, Network, Data Packet, APU, Nodes

1. INTRODUCTION

MANET is a self-masterminding remote system of portable hosts associated through self-assertive topology without the guide of any brought together organization. It is a streamlining of connection state directing. It is a gathering of versatile hubs sharing a remote channel with no brought together control or built up correspondence spine. They have no fixed switches with all hubs fit for development and subjectively unique. These hubs can go about as both end frameworks and switches in the meantime. When going about as switches, they find and keep up courses to different hubs in the system. The topology of the specially appointed system relies upon the transmission intensity of the hubs and the area of the versatile hubs, which may change every once in a while. Typical directing convention which functions admirably in fixed systems does not indicate same execution in Mobile Ad Hoc Networks. In these systems steering conventions should be increasingly powerful with the goal that they quickly respond to topological changes. Figure 1.1 delineates the specially appointed system and the steering of parcels in the system. Diverse employments of MANET are portrayed which join military war zones, business segment like crisis salvage activities, neighborhood levels like gatherings or study halls, individual territory network and various more application.

Figure 1 Mobile Ad-Hoc Network

I.METHODOLOGY

Research methodology is a combination of two-research and methodology. Research is used to describe a collection of information about a particular subject. Methodology means the science of dealing with principles of procedure in research




and study. Research methodology means an abstraction or constitution of research. It is a way to systematically solve the research problem by research.

PROPOSED WORK:

An Enhanced APU methodology in the proposed framework use goal mindful directing with least separation powerfully changes the signal update interims dependent on the base separation from source to goal, portability elements of the hubs and the sending designs in the system.

An exact portrayal of the neighborhood topology is especially wanted at those hubs that are in charge of sending bundles. Thus, APU tries to expand the recurrence of reference point refreshes at those hubs that catch information bundle transmissions. Subsequently, hubs engaged with sending bundles can assemble an enhanced perspective on the neighborhood topology.

Points of interest of the Proposed System:

Cost decrease in Beacon Update: Due to goal mindful steering cost to refresh the situation of reference point diminishes. Increment in Performance: profoundly versatile hubs can communicate visit guides to guarantee that their neighbors know about the quickly evolving topology.

II. MODELING AND ANALYSIS

At first the hubs in the system have been sent so that every one of the hubs are area mindful. Area mindful hubs are called reference points. All area mindful hubs communicate guides to their neighbor hubs to figure the separation from source hub at occasion of time T. after that the separation at time (t+T) is determined. In the event that the distinction between the determined separations is not as much as edge, at that point it is considered as steady connection. Select the connection having the base separation by ascertaining the separation between goal hub and profoundly stable connection and after that information can be exchanged over the system.

Start

Initialize the nodes in the

network

Find the distance [d(t)] of each

neighbor node from source node

at time T

Find distance [d(t+T)] of each

neighbor from source at time

(T+t)

If [d(t+T)]-

[d(t)]<

Threshold

Make the link on stable link

YES

NO




Figure 2 Flow chart of proposed work (Enhanced APU)

Node Deployment:

(a) (b)

Figure 3 Node deployment in NS2

Calculate the distance between the desti-

nation and the node having highly stable link

Transfer the data over the link

Select the link having minimum

distance

End




Periodic Beaconing:

(a) (b)

Figure 4 Periodic beaconing showing (a) data lost and (b) node selection for data forwarding

Above depictions or figures portrays the usage in NS2 test system. First the earth settings are accomplished for NS2 test

system. Every one of the parameters are characterized as channel, engendering, number of hubs; x-organize and y-

facilitate then hubs are sent on the territory of NAM window as appeared in Figure 4.8 at that point utilized intermittent

beaconing as follows in Figure 4.9(a) indicates Source 0 sends information to goal 40. Information isn't conveyed

legitimately to the goal because of parcel crash brought about by intermittent reference points and much information is

lost. Figure 4.9(b) Nexthop determination for information sending is done dependent on just separation.

Adaptive Position Update (APU):

Mobility and distance based forwarding node selection

Figure 5next hop selection in APU

In Figure 4.10 shows the beacon update and transmission range and node having high stability and less distance to

destination is selected as next hop. Source: 0, Destination: 40

Next hop: 14 – 18 – 28 – 36 – 37 – 41.

Beacon update based on ODL rule:




Figure 6 Beacon update based on ODL rule

Figure 6. demonstrating reference point update dependent on ODL principle and hubs catching information transmission send signal parcel to next hop. Hubs in dodger blue shading catch information transmission. Consequently, they send reference point parcels to refresh their quality which can be utilized by the source hub on account of disappointment of current next jump.

III. RESULTS AND DISCUSSION

Given the results from our research work and analysis done in this thesis

The following are the main parameters to evaluate the performance:

PDR (Packets Delivery Ratio): PDR is the extent to the aggregate sum of bundles achieved the recipient and measure of parcel sent by source. In the event that the measure of malevolent hub expands, PDR diminishes. The higher portability of hubs causes PDR to diminish.

Energy Consumption: It is the measure of vitality devoured by the sensors for the information transmission over the system.

Energy Consumption = Sum of energy consumed by each sensor.

Overhead: It is characterized as the quantity of messages engaged with the reference point update process.

Overhead = Number of messages involved in beacon update process

NS3 Environment implementation of the proposed system:




Figure 7 periodically broadcast beacons in NS2

Above snapshot (Figure 7) shows each node periodically broadcast the beacon which causes high overhead and packet collision and high energy consumption.

Figure 8 Node selection in Enhanced APU

In this Figure 5.2 Nodes in orange shading portrays the source and goal hub and maroon hued hubs are reference point refreshed hubs and hubs in blue shading are MP hubs which are having the real area with bigger contrast from its anticipated area. Henceforth MP hubs update the signal bundle. Deviation edge is fixed as 60m. In the event that there exists contrast between genuine areas and anticipated of a hub is more prominent than 60m at that point guide bundle is sent by the hub generally the other hub remove is considered having the base separation.

Energy Consumption versus Time




Figure 9 X-graph for Energy consumption

Given diagram delineates that Energy utilization in proposed conspire is high contrasted with existing APU since occasional signal causes high vitality utilization in the hubs. APU spares vitality by maintaining a strategic distance from pointless guide update and do the signal update adaptively.

Beacon Overhead versus Time

Given the table 5.2 for Beacon overhead qualities in existing framework and proposed framework and portrays that there is considerably less overhead in proposed framework.




Figure 10 X-graph for Beacon overhead

Given diagram portrays that Beacon overhead in existing APU plot is high contrasted with proposed conspire because of occasional guide. APU diminishes the guide overhead by keeping away from superfluous signal update and just does the reference point update process adaptively.

Packet Delivery Ratio versus Time

Given the table 5.3 for Packet conveyance proportion in existing framework and proposed framework and delineates that there is high bundle conveyance proportion in proposed framework.




Figure 11 X-graph for Packet delivery ratio

Given chart delineates that Packet conveyance proportion of proposed plot is high contrasted with existing APU conspire. Since system traffic in APU is diminished because of versatile reference point update rather than intermittent guides on account of occasional signal plan. In PB information gets dropped because of high traffic in the system.

IV. CONCLUSIONS

In this proposal, the need to adjust the signal update is recognized and the relating approach is utilized in geographic directing conventions to the hub versatility elements and the traffic load. The Adaptive Position Update (APU) system is proposed to address these issues. The APU plot utilizes two fundamentally unrelated standards. The MP rule utilizes portability forecast to appraise the exactness of the area gauge and adjusts the signal update interim in like manner, rather than utilizing intermittent beaconing. The ODL rule permits hubs along the information sending way to keep up an exact perspective on the nearby topology by trading reference points in light of information parcels that are caught from new neighbors. Execution of APU is assessed utilizing broad NS-2 reenactments for shifting hub speeds and traffic load. Results demonstrate that the APU system creates less or comparable measure of reference point overhead as other beaconing plans however accomplish better parcel conveyance proportion, less overhead and vitality utilization.

Future work will be the investigating the new strategies to the proposed work to decrease the overhead and vitality utilization further in the system. The accompanying can be future rules to improve the execution of the proposed framework:

1. To build up a methodology that consider a wide range of vitality parameters like battery control, switch vitality, way vitality in a mix with hub vitality to limit the vitality utilization in the system.

2. In Future, another capacity of way security checking can likewise be actualized that can check the strength of the chose way after each effective information exchange to improve the general execution of the system.

V. REFERENCES

[1] J. Hightower and G. Borriello, “Location System for Ubiquitous Computing”, IEEE computer Society Press Los Alamitos, CA, US Proceeding, Vol. 34, pp. 57-66, No. 8,2001.

[2] L.M. Feeney and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment”, Proc. IEEE INFOCOM, Proceedings. IEEE (Volume:3 ) pp. 1548-1557, 2001.

[3] Tracy Camp, Jeff Boleng, Brad Williams, Lucas Wilcox, William Navidi,“Performance Comparison of Two Location Based Routing Protocols for Ad Hoc Networks”, IEEE INFOCOM 2002, Proceedings. IEEE (Volume:3 ).




[4]C. Perkins, E. Belding-Royer and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing”. RFC3561, July 2003.

[5] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica,“Geographic Routing without Location Information,” Proc. ACM MobiCom, Network Working Group Proceeding, pp. 96-108, Sept. 2003.

[6] Michele Zorzi, Ramesh R. Rao, “Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance”, IEEE Transactions on Mobile Computing, Vol. 2, No. 4, Dec. 2003.

[7]B. Blum, T.He, S.Son, and J. Stankovic, “IGF: A state-free robust communication protocol for wireless sensor networks”, Tech. Report, Department of Computer Science, University of Virginia, USA, 2003.

[8] Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K. Tripathi, “A Framework for Reliable Routing in Mobile Ad-hoc Networks”, IEEE INFOCOM 2003.

[9] Quan Jun Chen, Salil S. Kanhere, Mahbub Hassan, Kun-Chan Lan, “Adaptive Position Update in Geographic Routing”, School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia,2005.

[10]Dongjin Son, Ahmed Helmy, Bhaskar Krishnamachari, “The Effect of Mobility-induced Location Errors on Geographic Routing in Mobile Ad Hoc and Sensor Networks”, Analysis and Improvement using Mobility Prediction, Department of Electrical Engineering,University of Southern California, 90089,2005.

[11] C. Bettstetter, “Connectivity of Wireless Multihop Networks in a Shadow Fading Environment,” Wireless Network, vol. 11, no. 5, pp. 571-579, 2005.

[12] S. Lee, B. Bhattacharjee, and S. Banerjee, “Efficient Geographic Routing in Multihop Wireless Networks,” Proc. ACM MobiHoc, pp. 230-241, May 2005.

[13] Y. Kim, R. Govindan, B. Karp and S. Shenker, “Geographic routing made practical”, in Proceedings of the 2nd Conference on Symposium on Networked Systems Design and Implementation, Berkeley, CA, USA, pp. 217-230, May 2005.

[14]Nitesh Jain, “Routing Protocols in Mobile Ad Hoc Network”, Seminar Report at School of Information Technology, Indian Institute of Technology Kharagpur, Kharagpur, pp. 1-20, Oct 2005.

[15]Marc Heissenbuttel, Torsten Braun, Markus Walchli, Thomas Bernoulli,“Evaluating the limitations and alternatives in beaconing”, Ad Hoc Networks, pp. 558-578, 2006.

[16] Tavli B, Heinzelman W, “Mobile Ad-Hoc Networks- Energy Efficient Real Time Data Communication”, Springer, 1-7, 9-26, 59-67, 2006.

[17] D. Johnson, Y. Hu and D. Maltz, “The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4”, RFC4728, Feb 2007.

[18]P. Casari, M. Nati, C. Petrioli and M.Zorzi. “Efficient Non Planar Routing around Dead Ends in Sparse Topologies using Random Forwarding”, in Proceedings of IEEE ICC, Scotland, UK, pp. 3122-3129, June 2007.

[19] Sangeeta, Kirti Singh, “Energy Efficient Routing In MANET Using OLSR”, International Journal on Computer Science and Engineering (IJCSE), Vol. 3, No.4, April 2011.

[20] Amandeep Makkar, Bharat Bhushan, Shelja, Sunil Taneja,“Behavioral Study of MANET Routing Protocols”, International Journal of Innovation, Management and Technology, Vol. 2, No. 3, June 2011.

[21] Anuj K. Gupta, Harsh Sadawarti, and Anil K. Verma, “Review of Various Routing Protocols for MANETs”, International Journal of Information and Electronics Engineering, Vol. 1, No. 3, November 2011.

[22] Smita Singh, Shradha Singh,Soniya jain,S.R.Biradar, “Comparison and Study of AOMDV and DSDV Routing Protocols in MANET Using NS-2”, International Journal on Computer Science and Engineering (IJCSE), Vol. 4, No.3,March 2012.

[23] Ana Maria Popescu, Ion Gabriel Tudorache, Bo Peng, A.H. Kemp. “Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks”, International Journal of Communication Networks and Information Security, Vol. 4, No. 1, April 2012.




[24] Gurpinder Singh, Asst. Prof. Jaswinder Singh, “MANET: Issues and Behavior Analysis of Routing Protocols”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 2, Issue 4, April 2012.

[25] Sanjeev Sharma and Sanjay Singh, “A Survey of Routing Protocols and Geographic Routing Protocol Using GPS in MANET”, Journal of Global Research in Computer Science, Vol. 3, No. 12, Dec 2012.

[26] Alex Hinds, Michael Ngulube, Shaoying Zhu, Hussain Al-Aqrabi, “A Review of Routing Protocols for Mobile Ad-Hoc Networks (MANET)”, International Journal of Information and Education Technology, Vol. 3, No. 1, Feb 2013.

[27] Quanjun Chen, Salil S. Kanhere, Mahbub Hassan, “Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Vol. 12, No. 3, March 2013.

[28] Gaurav Sachan, D. K. Sharma, Karishma Tyagi, Abhimanyu Prasad, “Enhanced Energy Aware Geographic Routing Protocol in MANET: A Review”, International Journal of Modern Engineering Research (IJMER), Vol.3, Issue 2, pp.845-848, April 2013.

[29] Varun G Menon, Joe Prathap P M, “Performance Analysis of Geographic Routing Protocols in Highly Mobile Ad Hoc Network”, Journal of Theoretical and Applied Information Technology, Vol. 54, No.1, Aug 2013.

[30] Prof. P.L.Ramteke, Dr.D.N.Chaudhari. “Self Adaptive Position Updates Proactive Protocol in Mobile ADHOC Network for Geographic Routing”, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 3, Issue 10, 2013.

[31] Archana S.S, Arulprakash P, Barath Kumar.S.S, Dhanasekaran.G, “Mobility Prediction for Beacon Update in GPSR Protocol in MANETs”, International Journal of Engineering Science and Innovative Technology (IJESIT) Vol. 2, Issue 6, Nov 2013.

[32] Dhanarasan P, Gopi S, “Beacon Update for Greedy Perimeter Stateless Routing Protocol in MANETs”, International Journal of Computer Science and Mobile Applications, Vol.2, Issue 1, pp. 135-141, Jan 2014.

[33] Gibin N.G, S. Ashok Kumar, “Adaptive Position Update for Geographic Routing In Mobile Ad Hoc Networks”, IOSR Journal of Electronics and Communication Engineering (IOSR-JECE), Vol. 9, Issue 1, pp. 53-59, Feb 2014.

[34] Ankur O. Bang, Prabhakar L. Ramteke, “Model for Geographic Routing In Mobile AdHoc Networks Using Adaptive Position Update”, International Journal of Application or Innovation in Engineering & Management (IJAIEM), Vol.3, Issue 3, March 2014.

[35] Ravi Kumar Poluru, T. Sunil Kumar Reddy, D.Nagaraju. “Updating the Routing Position in Ad hoc Networks by using Adaptive Position”, International Journal of Computer Trends and Technology (IJCTT), Vol. 10, No.3, April 2014.

[36] Babitha U B, “Adaptive Quadrant-Based Geographic Routing For MANET”, International Journal of Computer Science Trends and Technology (IJCST), Vol. 2, Issue 3, Jun 2014.

[37] Pasupuleti Neelima, K.Bhargavi, “Beaconing Strategy for Geographic Routing in Mobile Ad Hoc Network”,International Journal of Innovative Research in Computer and Communication Engineering, Vol. 2, Issue 7, July 2014.

[38] Ms. Pranoti A. Bedekar, Dr. Y. M. Patil, Dr. A. S. Vaingankar, “Review paper on Adaptive Position Update for efficient routing in mobile ad hoc networks”, Journal of Emerging Technologies and Innovative Research (JETIR), Vol. 1, Issue 6, Nov 2014.

[39] Xin Jin, Hongbo Wang, Yaoxue Zhang, Dong Chang, “A Dynamic Self adaptive Routing Update Algorithm for MANET”, Proceedings of ICCT2003, pp.909-912.

[40] Dr.M.Bala Ganesh, S.Lalitha,“A Survey of Adaptive Position Update for Geographic Routing in Mobile ad-hoc Networks”,International Journal of Advanced Computer Technology (IJACT), Vol. 2, No. 6.

Documents

EFFICIENT GOEGRAPHIC MANAGEMENT ROUTING WITH …