Certain Investigation on Location Aware Protocols for Wireless Ad hoc Networks

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

Certain Investigation on Location Aware Protocols for Wireless Ad hoc Networks Prof. Syed Jamaesha1, Dr.S.Gopinath2, Prof. M.S. Gowtham3 Assistant Professor, Department of ECE, Karpagam Institute of Technology, Coimbatore, India Assistant Professor, Department of ECE, Karpagam Institute of Technology, Coimbatore, India 3 Assistant Professor, Department of ECE, Karpagam Institute of Technology, Coimbatore, India 1 2

---------------------------------------------------------------------***---------------------------------------------------------------------

Abstract - Tracking location of mobile node is a major issue

• Unicast. MANETS notice a routing path from a supply node to a destination node. These routing protocols are either proactive or reactive. A proactive protocol, like the destination-sequenced distance- vector (DSDV), perpetually updates the routing table at every node to keep up an almost international read on the topology. In distinction, a reactive protocol makes on-demand searches for a path, which may be more cost effective than a proactive protocol once host quality is high. Representative reactive protocols embody dynamic supply routing (DSR), zone routing protocol (ZRP), and unexpected on-demand distance vector (AODV).

• Collective communication. This approach involves over one destination, like multicast, within which the protocols ar either tree based or flooding based. A tree-based protocol tries to determine a multicast tree among the multicast members that comprise a wireline network, whereas a flooding-based protocol merely distributes the multicast message all round the network.

• Quality-of-service routing. This kind of routing supports period applications like audio and video communications.

The protocol should establish a route that satisfies sure QoS constraints, like delay and information measure. As an example, a ticket-based approach avoids unwise blind flooding by mistreatment tickets to limit the amount of route looking packets.

in Mobile ad hoc networks (MANET). It gives the information about the network coverage, deployment, target tracking and rescue. If nodes are moving randomly with high mobility, it leads to path failure. It leads to less location accuracy. Hence there is a need of low overhead based location protocol. In this survey, we analyzed the different categories of location protocols which mainly focus on overhead, path quality and node stability. We conducted the analytical experiments using network simulation tool. ALARM protocol produces best performance in terms of overhead, delay, jitter and throughput.

Key Words: MANET, Location aware protocols, mobility, overhead, end to end delay, path quality and stability

1. INTRODUCTION Advances in wireless communications and little, lightweight, transportable computing devices have created mobile computing attainable. One analysis issue that has attracted abundant attention recently considerations the look of a MANET—a mobile unexpected network that consists of a group of mobile hosts that vagabond at can and communicate with each other. Communication takes place through wireless links among mobile hosts, mistreatment their antennas, however such Associate atmosphere supports no base stations. Further, the transmission distance limitation implies that mobile hosts might not be able to communicate with each other directly. Hence, a multi-hop situation happens, and a number of other hosts might have to relay a packet before it reaches its final destination. this example needs every mobile host in a MANET to function a router. Figure one shows a typical MANET, that works best in things like battlefields, pageant grounds, assemblies, outside activities, rescue actions, or major disaster areas, wherever users have to be compelled to deploy networks straightaway, while not the advantage of base stations or fastened network infrastructures. as an example, once Associate in Nursing earthquake happens, the dearth of electricity pulls all base stations offline. during this case, system directors will simply deploy a powered MANET to line up a network atmosphere.

The in depth MANET analysis efforts [1] specialise in the following: © 2016, IRJET

|

Impact Factor value: 4.45

2. RELATED WORK It is given associate degree algorithmic rule [2] that is location power-assisted and additionally energy economical.

This approach is applicable in GPS scarce network. The most important contribution of the work is in proposing a brand new location power-assisted routing methodology that's energy economical too. The positioning framework that this new protocol uses is appropriate for GPS scarce setting. The projected LACBER could be a higher location power-assisted routing protocol scrutiny LAR in terms of lower hop-count and improved energy utilization. the answer is low price and energy economical. The GPS alter nodes wakes up sporadically to pay attention for changes and goes back to the sleep mode to conserve energy. The placement information helps keeping the amount of management message exchanges low throughout the route discovery method.

|

ISO 9001:2008 Certified Journal

|

Page 787

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

In [3] a unique Power economical Location Aware Routing (PELAR) protocol was projected where energy dependent nodes area unit growing the routing ability of AODV protocol on the supply of LAR (Location power-assisted Routing) protocol. In network nodes aren't aware of their energy standing and additionally come back flooding of routing packets is utilizes additional energy in network by that the majority of the energy is exhausted in acknowledgement method. The most try of projected PELAR protocol was to get improved the energy utilization in network. It has been further accomplished that thanks to the dynamically dynamical topology and infrastructure less, redistributed characteristics, position information and energy awareness is difficult to accomplish in Edouard Manet. Therefore, position and energy awareness strategies ought to be enclosed characteristics for all styles of applications supported Adhoc network. he projected PELAR approach decreases the flooding of routing packets and provides the higher performance as compare to AODV and LAR protocol.

to the supply node, info concerning the placement of destination node may be obtained from each intermediate node. Once within the route maintenance method, associate degree intermediate node is unable to receive 3 consecutive hello messages , it's thought-about that the link is lost and there's break in reactive route. In such case, RGR negates the reactive route and acquire switched to the GGF mode. In GGF mode, information packets area unit sent to the closest neighbor node of destination node Location power-assisted routing protocol [6] has been projected for GPS scarce accidental networks. There area unit contains three styles of nodes: G-nodes, CG-nodes, and N-nodes in LACBER protocol as shown in figure1. Within the network solely a number of nodes got to be G-nodes that area unit GPS enabled and area unit capable of finding their own location exploitation GPS. The remainder of the network will notice their positions in a very method that is delineate later during this section. The CG-nodes square {measure} equipped with antennas that area unit capable of receiving signals from different nodes and might measure the received signals strength indicator (RSSI) and therefore the angle of arrival (AOA) of received signals from different nodes.

In [4] a unique approach have Geographical Distance primarily based accidental On-demand Distance Vector Routing (GD-AOMDV), that selects the trail supported transmission distance worth to limit and management the congestion and management overheads has been projected.

The salient feature of the projected model is that it establishes a relationship between path distance and Edouard Manet style parameters as well as transmission vary, consumption of energy and information measure.

Geographical Distance primarily based accidental Ondemand Multipath distance Vector Routing Protocol (GDAOMDV) from the supply to destination. The projected approach selects multiple paths supported the transmission distance and select minimum transmission distance path for communication. In Route Discovery section, the RREQ packet collects the gap info of all intermediate nodes until it reaches the destination. Then destination kinds all obtainable ways with the thought of transmission distance worth. the explanation for selecting the ways supported the geographical distance is that to cut back end-to-end delay, congestion and to cut back giant queue of packets to maneuver on the shortest path traffic.

Cluster-Based Object Location Services [7](CBOLS) was introduced for locating the article location in a very cluster primarily based topology.

Object Location Clusters algorithmic rule (OLCA) for economical Object Location management in Edouard Manet. This comparison of simulation analysis shown that the CBOLS is a lot of economical and correct in location info services and a lot of sturdy than GLS and HRLS. By exploitation the position of node the protocol [8] will cut back the amount of retransmissions, which might facilitate to reinforce the protocol performance. Here, the improved Flooding algorithmic rule is employed that uses the node position to send the packets. This methodology is applied On Demand Distance Vector (AODV) protocol that reduces the amount of Route Request (RREQ) messages. The RREQ message transmission has been improved by exploitation N hop information and construct of distance primarily based methodology.

A new protocol has been developed [5] recently that is a combination of reactive routing and Greedy Geographic Forwarding (GGF) to handle these shortcomings. In RGR , a reactive protocol ( AODV during this case) is combined with greedy geographic forwarding (GGF) In RGR, If the right route isn't found for information packets , a route discovery procedure (as is that the case in AODV) is started by supply node to achieve the destination node . This area unit was known as flooding Route Request information packets (RREQ). A reactive route is made when receiving of the Route Response (RREP) packet from the destination node.

When route expires, the information packets at supply node may be propagated to the destination. .The novel issue concerning RGR is that as RREP packet get transmitted back Š 2016, IRJET

|

Impact Factor value: 4.45

A neighborhood Split Duty Cycle certain Routing theme [9] was introduced for energy economical Edouard Manet. This theme relies on the cluster based routing protocol, wherever the cluster heads has been designated supported the energy state, node property and transmission vary. The routing region has splitted and given priority supported the placement info of the destination and therefore the cluster head can selects the relay node gift within the highest priority region. Duty Cycle primarily based information transmission has been processed on the chosen region by |

ISO 9001:2008 Certified Journal

|

Page 788

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

utilizing the mac layer information. Furthermore the theme schedule the sleep/ active/ passive state to the nodes effectively within the network so as to attenuate the energy consumption.

accessible cached ways. Typically the choice relies on distance between the communication partners. to enhance information delivery performance and to decrease collisions with different communications it's higher to pick less interference path rather than shortest path. A system has been projected that uses data processing technique for locating most interfered ways. Those ways that area unit having high interference are discarded from the node’s cache.

The aim is to create the communication between completely different nodes anonymous in Edouard Manet. By obscurity we have a tendency to mean that intermediate nodes area unit unaware of the sender and destination [10]. solely the sender can recognize the receiver and solely the receiver can recognize the sender. HPAR can give high obscurity protection at a coffee price in comparison to different obscurity algorithms. It can attain comparable routing potency also offer Resilience to temporal arrangement Attacks and Strategy to Counter Intersection Attacks.

The simple flooding methodology [14] broadcasts the RREQ packet from the supply to the remainder of the nodes in mobile network. However the matter with this methodology is disproportionate repetitive retransmission of RREQ packet that might lead to high competition on the obtainable channel and packet collision because of extreme traffic within the network. an affordable range of routing algorithms are urged for reducing the fatal impact of flooding the RREQ packets. However, most of the algorithms have resulted in hefty quantity of complexness and deduce the outturn by reckoning on special hardware elements and maintaining advanced info which is able to be less often used. By considering routing complexness with the goal of accelerating the outturn of the network, during this paper, we've got introduced a brand new approach known as Dynamic Probabilistic Route (DPR) discovery. The Node’s Forwarding chance (NFP) is dynamically calculated by the DPR mobile nodes exploitation chance operate (PF) that depends on density of native neighbor nodes and therefore the accumulative range of its broadcast lined neighbors.

Because of information transfer capability constraint and vivacious topology of versatile Ad-hoc Networks (MANET), supporting caliber for administration (QoS) [11] to MANETs could be a testing trip. even so each day, a substantial live of exploration are applied for supporting QoS within the net and different network architectures, nonetheless all the larger a part of them aren't appropriate within the MANETs domain. Over this paper, we have a tendency to survey the current researches around QoS facilitate in MANETs, that embrace QoS models, plus reservation signal, QoS directional and QoS Medium Access management (MAC). The explanation for this paper is to depict the whole thing image from claiming QoS facilitate in, MANETs and will exhibit those challenges during this domain. Keywords: Edouard Manet, QoS,

A protocol [15] was given for routing packets between mobile nodes in a poster hoc network exploitation the world Positioning System. Not like routing protocols like LAR, ILAR, LARDAR this protocol considers numerous parameters like information measure demand and battery lifetime of all the intermediate nodes on a path to destination. Increase within the battery life tends to high chance of routing path. supported analysis of LBPAR is proved to be a much better protocol because it helps in lowering the information measure consumption of the network and additionally helps in increasing the battery life by decreasing the amount and complexness of calculations.

The network performance [12] depends on the amount of vehicles within the transport network. So, per this chance for choosing following acceptable node that forwards packet to the required destination depends upon the amount of nodes gift within the network. If the link between networks is broken, another doable node may be chosen instantly relying upon the bottom delay price so range of nodes may be inflated those results in highest packet delivery ratio9. So, there ought to be some technique to seek out the precise location of nodes from supply to destination in extremely dense mobile network (VANETs). The packet overhead ought to be lowest. exploitation minimum angle sender node will choose following hop. to seek out the stable node D-LAR protocol selects the next-hop node within the forwarding node. Therefore, in request zone, a message from node is pass to the next-hop node that minimizes the angle. Inside a similar transmission, angle of the nodes may be calculated within the request zone.

The projected algorithmic rule [16] increases chance to look node for one place. This work has projected algorithmic rule for expected zone of LAR protocol. The expected zone is circular region wherever destination is also move from the purpose of read supply node. This region is split into four segments as a result of it doesn't cause interference. Within the projected system every host still contains a distinctive ID (such as scientific discipline address or mac address). To be location-aware, every mobile host is supplied with a positioning device like a GPS receiver from that it will browse its current location. Every node is aware of their most distance for communication, per their transmitter power.

The reactive routing protocol [13] like DSR performs two steps i.e. route discovery and route maintenance.

Throughout route discovery each node could get multiple ways to each different node within the Edouard Manet. The nodes could choose one in all the most effective ways out of © 2016, IRJET

|

Impact Factor value: 4.45

|

ISO 9001:2008 Certified Journal

|

Page 789

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

to different anonymous routing protocols. Also, ALERT achieves comparable routing potency to the GPSR geographical routing protocol.

Aiming to get a transparent understanding of this trade-off, we have a tendency to use random semi-definite programming (SSDP) [17], a fresh developed improvement model, to cope with the placement uncertainty related to node quality. In specific, we have a tendency to model each the speed and therefore the direction of node movement by random variables and construct random ellipses consequently to raised capture the placement uncertainty and therefore the non uniformity across completely different nodes. Supported SSDP, we have a tendency to propose a random location-aided routing (SLAR) strategy to optimize the trade-off between the message passing overhead and therefore the latency. These results revealed that normally SLAR will considerably cut back the overhead than existing settled algorithms, just because the placement uncertainty within the routing drawback is healthier captured by the SSDP model.

Terminode routing [21] has been proposed that uses a mix of location-based routing (Terminode Remote Routing, TRR), used once the destination is much, and link state routing (Terminode native Routing, TLR), used once the destination is shut. TRR uses anchored methods, an inventory of geographic points (not nodes) used as loose supply routing data. Anchored methods ar discovered and managed by sources, mistreatment one amongst 2 low overhead protocols: Friend assisted Path Discovery and Geographical Map-based Path Discovery.

In [22] it is shown that, by employing a MANET broadcast conversation technique and continuous modification of packet location data, geographical routing in IC-MANETs is possible. The planned location service (LoDiS) has then been integrated with a routing protocol (LAROD) and totally studied as compared with a superior baseline. we've additionally shown that the delivery magnitude relation for LAROD–LoDiS is the same as that obtained mistreatment LAROD with Associate in Nursing oracle location service—a important result. The value of LoDiS is additionally comparatively little compared with the essential cost of routing mistreatment LAROD.

Position and rate power-assisted Routing protocol (PVAR) [18] was projected to resolve the matter. PVAR is intended for MANETs inside that all nodes area unit at a comparatively high rate and conscious of position and rate info of all different nodes similarly as itself. By exploitation the data, we modify the criterion of choosing a node’s neighborhood and route request procedure. The result shows that with a middle level of traffic flow, our projected PVAR contains a sensible performance on packets delivery quantitative relation. Routing packets overhead additionally reduced.

In [23], we have a tendency to address variety of problems arising in suspicious location-based Manet settings by planning and analyzing a privacy-preserving and secure linkstate based mostly routing protocol (ALARM). ALARM uses nodes’ current locations to firmly pass around and construct topology snapshots and forward knowledge. With the help of advanced cryptographical techniques (e.g., cluster signatures), ALARM provides each security and privacy options, as well as node authentication, knowledge integrity, anonymity, and untraceability (tracking-resistance). It additionally offers protection against passive and active business executive and outsider attacks. To the simplest of our information, this work represents the primary comprehensive study of security, privacy, and performance tradeoffs within the context of link-state Manet routing.

Privacy preserving (PRISM) [19] is basically totally different from all previous anonymous on-demand Manet routing protocols on two accounts i.e. PRISM uses a location-centric, rather than Associate identity-centric communication paradigm. Therefore, it doesn't assume any information of semi-permanent node identifiers or public keys. PRISM needs neither pre-distributed pair wise shared secrets nor on-line servers of any kind. As Associate on-demand protocol, PRISM is additionally terribly totally different from the protocol (ALARM), albeit the latter uses cluster signatures and is additionally location-centric. ALARM could be a link-state protocol and exposes the whole topology to any or all insiders.

3. CONCLUSIONS

Anonymous Location-based economical Routing protocol (ALERT) [20] has been planned that dynamically partitions the network field into zones and at random chooses nodes in zones as intermediate relay nodes, that kind a non-traceable anonymous route. Additionally, it hides the information initiator/receiver among several receivers to strengthen supply and destination namelessness protection. Thus, ALERT offers namelessness protection to sources, destinations, and routes. It additionally has ways to effectively counter intersection and temporal order attacks. with the theoretical analysis, and show that ALERT achieves higher route protection and lower overhead value compared © 2016, IRJET

|

Impact Factor value: 4.45

In this survey, we have analyzed some of location aware routing protocols in terms of throughput and overhead. If node contains high mobility, it is difficult to update the node location in the routing table of nearest neighbour node.

Hence there is a need of optimized location aware protocol.

Based on the simulation results, ALARM performs better than previous routing protocols. In future, we have planned to propose energy based location aware routing protocol that attains power efficiency in the presence of high mobile environment. |

ISO 9001:2008 Certified Journal

|

Page 790

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

REFERENCES

& Informatics (IJCI) Vol. 5, No. 2, April 2016, pp.417425.

1.

Yu-Chee Tseng, “Location Awareness in Ad Hoc Wireless Mobile Networks”, IEEE conference, 2011, pp.46-52.

2.

Dipankar Deb, Srijita Barman Roy and Nabendu Chaki, “LACBER: A New Location Aided Routing Protocol For GPS Scarce MANET”, International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 1, August 2009, pp.22-36.

3.

4.

5.

6.

12. Jyoti Sanyal and Sandeep Kumar Arora, “ Performance of D-LAR on the basis of Average Hop Count in VANET”, Indian Journal of Science and Technology, Vol.9, No.20, 2016, pp.1-5.

Pravin kaushik and Prof. Sumit Sharma, “Power Efficient Location Aware Routing Protocol to Improve Routing in MANET”, Computer Engineering and Intelligent Systems, Vol.7, No.2, 2016, pp.34-41.

13. Shirin Bhanu Koduri B and Dr.Seeta M, “Discovering Most Interfered Sub Path of MANET Multi Paths Using Data Mining Technique”, International Journal of Combined Research & Development, Vol.5, No.3, 2016,pp.696-700.

M. Kokilamani and Dr. E. Karthikeyan, “Location and Mobility Optimized On-demand Geographical Multipath Routing Protocol for MANET”, Int. J. Advanced Networking and Applications, Vol.7, No.4, 2016, pp. 2835-2848.

14. Kannan Shanmugam, Karthik Subburathinam, and Arunachalam Velayuthampalayam Palanisamy, “A Dynamic Probabilistic Based Broadcasting Scheme for MANETs”, e Scientific World Journal, Vol.2016, pp.1-8.

Priyanka Sharma1, Inderjeet Yadav, “ Reactive Greedy Reactive Routing in Flying Ad Hoc Networks”, International Journal of Science, Engineering and Technology Research (IJSETR) Volume 5, Issue 5, May 2016, pp.1361-1367.

15. Dr. P.K.Suri1, Dr. M.K.Soni2 and Parul Tomar3, “Framework for Location Based Power Aware Routing in MANET”, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, May 2011, pp.461-466.

Pragati N. Patil, “ Novel Protocol for Location Tracking of Sensor Nodes in Ad hoc Network”, International Journal of Computer Applications,2012, pp.4-7.

7.

Prasad Naik Hamsavath and G. V. Singh, “ Efficient Location Services Using Hierarchical Topology of Mobile Ad Hoc Networks”, Journal of Software Engineering and Applications, 2012, vo.5, pp.14-20.

8.

Mr. Vinayak Bashetti andDr. Sayed Abdulhayan, “ A Cost Effective Flooding Algorithm for AODV Routing Protocol in Mobile Ad Hoc Networks”, International Journal of Advanced Research in Computer and Communication Engineering Vol. 5, Issue 1, January 2016, pp.381-385.

9.

11. Manoj Kumar Khinchi and Dr. Bharat Bhushan, “ Investigation on MANET Routing Protocols and Quality of Services Management Issues”, International Research Journal of Engineering and Technology.Vol.3, No.4, 2016, pp.1912-1916.

16. Neelima Parsendia, Amit Sinhal, “Comparative Analysis of Throughput and Dropped rate for Location-Aided Routing Protocol”, International Journal of Computer Science and Information Technologies, Vol. 3 (3) , 2012, pp.4113-4118 17. Yuntao Zhua,∗, Junshan Zhangb, Kautilya Partel, “Location-aided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach”, Vol.53, 2011, pp.21922203.

18. Taifei Zhao, 2Xizheng Ke, 3Peilin Yang, “Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks”, International Journal of Digital Content Technology and its Applications, Volume 4, Number 3, June 2010, pp.1-9.

D. Maya and C. Kalaiarasan, “Region Split Duty Cycle Bound Routing Scheme for Energy Efficient MANET”, Middle-East Journal of Scientific Research, Vol.24, No.2, 2016,pp.244-250.

19. Karim El Defrawy, Member, and Gene Tsudik, Senior Member, “Privacy-Preserving Location-Based OnDemand Routing in MANETs”, IEEE journal on selected areas in communications, vol. 29, no. 10, december 2011, pp.1926-

10. Fahmida Aseez and Dr.Sheena Mathew, “ Hierarchical Partition-Based Anonymous Routing Protocol (Hpar) In Manet For Efficient And Secure Transmission”, International Journal on Cybernetics © 2016, IRJET

|

Impact Factor value: 4.45

20. Haiying Shen, Member, IEEE, and Lianyu Zhao, “ALERT: An Anonymous Location-Based Efficient |

ISO 9001:2008 Certified Journal

|

Page 791

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395 -0056

Volume: 03 Issue: 11 | Nov -2016

p-ISSN: 2395-0072

www.irjet.net

Routing Protocol in MANETs”, IEEE transactions on mobile computing, vol. 12, no. 6, june 2013, pp.1079-1093.

21. Ljubica Blazevic, Member, IEEE, Jean-Yves Le Boudec, Fellow, IEEE, and Silvia Giordano, Member, IEEE, “A Location-Based Routing Method for Mobile Ad Hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 2, MARCH/APRIL 2005, pp.97-110.

22. Erik Kuiper and Simin Nadjm-Tehrani, Member, IEEE, “Geographical Routing With Location Service in Intermittently Connected MANETs”, IEEE transactions on vehicular technology, vol. 60, no. 2, february 2011, pp.592-604.

23. Karim El Defrawy, Member, IEEE, and Gene Tsudik, Senior Member, IEEE, “ALARM: Anonymous Location-Aided Routing in Suspicious MANETs”, IEEE transactions on mobile computing, vol. 10, no.

9, september 2011, pp.1345-1358.

© 2016, IRJET

|

Impact Factor value: 4.45

|

ISO 9001:2008 Certified Journal

|

Page 792