Sie sind auf Seite 1von 6

IPASJ International Journal of Information Technology (IIJIT)

A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

AMCPMAHN: An Approach for finding Minimum cost path in Mobile Ad-hoc Network
Dr. L. R. Eydgahi
Dept. of Information Technology, CAS-Ministry of Higher Education Sultanate of Oman., OMAN

ABSTRACT
A Mobile circumstantial Network (MANET) is one consisting of a group of mobile hosts capable of communication with one another while not the help of base stations. Mobile circumstantial networks square measure self-organizing and selfconfiguring multi hop wireless networks wherever, the structure of the network changes dynamically. Since a destination node could be out of vary of a supply node, a routing procedure is usually required to seek out a path, thus on forward the packets fittingly between the supply and also the destination. This paper suggests Associate in Nursing approach to attenuate the routing overhead and focuses to on finding the shortest route to deliver the packet from supply to destination and conjointly minimize the time delay for locating the route.

Keywords: wireless networks, mobile circumstantial networks, routing, route, time delay.

1. INTRODUCTION
A Manet is one consisting of a group of mobile hosts which may communicate with each other and swan around at their can. No base stations square measure supported in such Associate in Nursing surroundings. Associate in Nursing ad-hoc network could be a assortment of wireless mobile hosts forming a short lived network while not the help of any complete infrastructure or centralized administration. Ad-hoc networks are often remarked a Mobile Ad-hoc network or Manet as a result of these networks are often designed to permit quality and perform routing over multiple hops. Nodes in these networks utilize an equivalent random access wireless channel, co-operating in a very friendly manner to partaking themselves in multi hop forwarding. The nodes within the network not solely act as hosts however conjointly as routers that route information to/from different nodes in network.

It is assumed that a mobile host is aware of its current physical location, and therefore such location data are often exploited to facilitate routing. we have a tendency to decision protocols with such capability location-aware protocols. Mobile nodes forming the circumstantial network square measure usually autonomous and may move at their own discretion, leading to dynamic topologies of such network. The self organized characteristic of such networks build them significantly fitted to the situations wherever fast readying of communication network is desired while not

Volume 1, Issue 1, June 2013

Page 21

IPASJ International Journal of Information Technology (IIJIT)


A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

reckoning on Associate in Nursing existing infrastructure. Classification of routing protocols in Manet are often worn out many ways, however most of those square measure done reckoning on routing strategy. in line with the routing strategy the routing protocols are often classified as proactive, reactive and hybrid routing protocol. Proactive routing tries to stay up thus far data regarding the complete network, so once there's a routing request, the request is consummated with none delay. In proactive routing, every node has one or additional tables that contain the most recent data of the routes to any node within the network. Reactive routing protocols decide to scale back the quantity of management overhead in network by crucial routes to a destination only if it's needed. to save lots of the route discovery value, the present location of a supply host and also the past location of a destination host square measure wont to confine the realm to look for a route to the destination. Another necessary routing technique in Manet is geographical routing protocols. during this routing technique the position of every node is employed because the basis for many routing selections. the fundamental assumption in location-aware routing protocols is that the convenience of a positioning device like a world Positioning System (GPS) receiver at every mobile Host. The rest of this paper is organized as follows: Section II provides a comparative study of a number of the present routing topologies. In Section III, a brand new routing protocol has been projected to scale back the overhead for maintaining all routing data for every mobile node. In Section IV a performance analysis of recent projected routing protocol. In Section V a Conclusion.

2. LITERATURE REVIEW
In this section we have a tendency to square measure presenting a short comparison between some existing routing protocols. it's supported a group of guiding routes, which incorporates a series of necessary positions between a try of supply and destination locations. In every mobile node (MN) maintains a location table for all different nodes within the circumstantial network. during this method by creating a distinction between distances of nodes, then tries to scale back the overhead of location packets.

The LBGR [12] algorithmic rule could be a reactive routing algorithmic rule wherever geographic region is split into variety of logical grids pertaining to a hard and fast purpose within the network. All the nodes will acquire the present location data provided by a GPS receiver. With the assistance of node position data. Each location packet contains the coordinate of the supply node, the supply nodes speed, and also the time of transmission of that LP. Location assisted Routing [13] is another approach to utilize location data to enhance performance of routing protocols for ad-hoc networks. By mistreatment location data, the LAR protocols limit the explore for a brand new route to a smaller request zone of the circumstantial network. With the provision of GPS [3], it's doable for a mobile host to grasp its physical location. Location assisted information Extraction Routing Protocol [4] uses Associate in Nursing on demand request-reply mechanism in route discovery. LAKER [4] bit by bit discovers information of topological characteristics like population density distribution of the network. When a mobile host desires to speak with another mobile host, applicable routing data has got to be setup at the supply and maybe some intermediate nodes. GPSR [5] nodes value more highly to forward the packet to the neighbor settled nearer to the destination. If greedy forwarding isn't doable as a result of the constellation, GPSR [5] recovers by

Volume 1, Issue 1, June 2013

Page 22

IPASJ International Journal of Information Technology (IIJIT)


A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

traversing the topology graph round the perimeter of this region. GPSR [5] specifies an easy beaconing algorithmic rule utilized by network nodes to update their neighbors with positioning data at regular intervals. Location Prediction based mostly Routing Protocol [3] doesn't need the periodic broadcast of beacons within the neighborhood and it assumes nodes square measure position-aware and also the clocks across all nodes square measure synchronised. In LPBR [7], every node forwards the Route-Request packet when incorporating all the relevant parameters. The destination node collects the placement update vector data of all the nodes within the network from the RREQ packets and sends a Route-Reply packet to the supply on the minimum hop. In LPBR [7] the supply node uses the route learnt through the most recent LPBR-RREP packet to send the info packets. GRID [1] protocol could be a reactive protocol that is absolutely location-aware as a result of it tries to use location data. GRID [1] protocol can incur less route discovery packets, will scale back the likelihood of route breakage, and may lengthen the time period of routes. In GRID [1], when routing discovery, communication is conducted over a path of virtual grid that connects supply and destination nodes. In GRID [1] protocol, efforts square measure created in 2 directions to scale back the route search cost: to confine the route search vary and to delegate the looking responsibility to the entryway hosts. The LBGR [12] algorithmic rule sets virtual grids abundant smaller than GRID [1]. a completely unique LocationBased Routing algorithmic rule for Mobile circumstantial Networks [12] doesn't use {hierarchical structure|hierarchical information structure|data structure} and every one the nodes in every grid on a path are often candidates to forward data packets. Within the next section we have a tendency to square measure getting to propose a brand new routing protocol and check out to scale back the issues of antecedently mentioned routing protocols.

3. PROJECTED ROUTING PROTOCOL


The basic advantage of mistreatment position data for wireless routing is to enhance network quantifiability by reducing overall routing overhead. Location data are often wont to scale back propagation of management packets, to perform controlled flooding, to keep up routes in quality conditions and to form simplified packet forwarding selections. within the position-based routing protocols, a mobile node (MN) uses a aerial or GPS system to estimate its own (x, y) position.

The main objective of this freshly enforced routing protocol is, it'll scale back the routing overhead and minimize the overhead of maintaining an oversized routing table and conjointly scale back the time delay for locating the route. Our proposes protocol is additionally energy economical approach because it utilizes location data of mobile nodes with the goal of decreasing routing connected overhead in mobile circumstantial networks. The node itself utilizes a operate for scheming the shortest path between the supply node and destination node and also the supply node forwards the packet through that path. it uses location data for MNs to seek out the shortest route from supply to destination. The route is maintained as long because the sender mobile node is causing the packet to its destination. The necessary options during this topology square measure that no intermediate nodes participate within the route discovery. in line with however route data is collected, routing protocols are often classified as proactive and reactive. The supply node obtains the placement data of all the nodes within the network through GPS. the space between every mobile node and also the angle between them are often simply realized by straightforward co-ordinate pure mathematics as mentioned earlier. The key plan during this routing protocol is that as location data is obtained by the supply node only if it needs discovering the route, the overhead of maintaining routing table at every node is decreased . Since this protocol focuses on finding the shortest route, the time taken for routing a packet is additionally significantly less. It uses location data of the nodes to limit the explore for a brand new route to a smaller space of the circumstantial network.. Here the routing message is shipped solely to the node that lies among the shortest distance from the actual node.

Volume 1, Issue 1, June 2013

Page 23

IPASJ International Journal of Information Technology (IIJIT)


A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

Fun1( ) Step1. Start. Step2. decision fun2( ). Step3. decision calcfunc( ). Step4. End. Fun2( ) Step1. Start. Step2. Take range of nodes _mn. Step3. Assign node id against every node. Step4. Take input the x and y co-ordinates of every node. Step5. Repeat Step3 and Step4 for i=0, 1, 2, 3...mn. Step6. End. Fun3( ) Step1. Start. Step2. Set vary to an exact price. Step3. Declare the vary for every node (as it's taken same for all nodes n this algorithm) Step4. For i=0 and i Step5. Store distne[i] in a matrix of mn X mn. Step6. If dist > range, the destination is unreachable and in this case a large value is assigned to it. Step7. End. minmnfunc1( ) Step1. Start. Step2. Assign variable min = distne [0] of the primary node from the supply node. Step3. for each unvisited node, if min > distne[i] (distance of the ith node from the supply node) Then min=distne[i]. Step4. End. routfunc2( ) Step1. Start. Step2. Take input the supply node_s. Step3. Take the destination node_d. Step4. Check if d is directly reached from s, if affirmative then attend Step5, else Step6. Step5. Destination reached and route is dist(s_d). Step6. select the closest node from s, say mn[i]. Step7. See if mn[i] will reach d directly. If affirmative goto Step8, else Step9. Step8. Destination reached and route is dist(s_mn[i]_d). Step9. select the closest from node mn[i], say mn[j]. Step10. Check if dist (prev [mn[i]_mn[j]]) < dist (prev [mn[i]]_mn[i]_mn[j]). If yes, then Step11, else keep the route because it is. Step11. Update the route as prev [mn[i]]_mn[j]. Step12. See if mn[j] will reach the destination directly. Step13. Repeat identical method (Step5 onwards) for this node, till the destination node is reached. Step14. Else destination is unapproachable. Step15. End. By victimization the on top of mentioned algorithm[14] a node will share info with another node at intervals that network.

4. PERFORMANCE ANALYSIS
The simulation model consists of a network model that encompasses a range of mobile wireless node models, that represents the whole network to be simulated. the quantity of the nodes ranges from (3-21) nodes betting on the simulation situation.

Volume 1, Issue 1, June 2013

Page 24

IPASJ International Journal of Information Technology (IIJIT)


A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

Fig. No. of Nodes vs. Time In fig 1, we've got pictured a relation between range of nodes and time needed for route finding. From that it's clearly seen that once the quantity of nodes within the network ar raised then the desired time for route finding conjointly raised. however it's not terribly regular amendment. once the node range will increase from eight fifteen|to fifteen} the desired time will increase over the case wherever the node range amendment from 15 to twenty one.

Fig. No. of Nodes vs H.count In fig. 2, there's a comparison between range of nodes and hop-count for locating route from supply to destination. Here we've got conjointly discovered that if the quantity of nodes increase, at the start hop count conjointly increase. however once an exact worth, hop count fastened in a very bound vary. From the higher than 2 figures, we've got discovered that our new projected and enforced routing algorithmic rule Location primarily based token overhead shortest path routing protocol performs higher and its time quality is additionally but alternative routing protocol named AMOBIROUTE [10].

5. CONCLUSIONS
In this paper, we've got projected and enforced a replacement routing protocol named Location primarily based token Overhead Shortest Path Routing Protocol in Edouard Manet. This protocol focuses to on finding the shortest route to deliver the packet from supply node to destination. during this routing algorithmic rule location info is obtained by the supply node only it needs discovering the route and no intermediate nodes participate within the route discovery. The overhead of maintaining and change routing table at every node is additionally reduced during this topology. As a result, the time taken for routing a packet is additionally significantly less. Some result analyses are incorporated to point out, during which approach the projected algorithmic rule work and a few performance analysis are through with the prevailing routing algorithmic rule for Edouard Manet.

Volume 1, Issue 1, June 2013

Page 25

IPASJ International Journal of Information Technology (IIJIT)


A Publisher for Research Motivation ........

Volume 1, Issue 1, June 2013


REFERENCE

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm Email: editoriijit@ipasj.org ISSN 2321-5976

[1.] S. Saha, S. DasGupta, R. Chaki, "MOADRP: Mobile Ad hoc Network Routing Protocol", in IEEE International Conference on Wireless Communication and Sensor Networks, WCSN 2009. [2.] Natarajan Meghanathan, "LPBR: Location Prediction Based Routing Protocol for Mobile Ad hoc Networks, in proceedings of IEEE Communications Society, GLOBECOM, 2008. [3.] Jian Li and Prasant Mohapatra, LAKER: Location Aided Knowledge Extraction Routing for Mobile Ad Hoc Networks Department of Computer Science University of California, CA 95616, 2007. [4.] Chen Zhuo, Liu Kai, Zhang Jun, "LBGR: A Novel Location-Based Routing Algorithm for Mobile Ad hoc Networks", in IEEE Conference, 2006. [5.] Mehran Abolhasan and Justin Lipman, "Efficient and Highly Scalable Route Discovery for On-demand Routing Protocols in Ad hoc Networks," IEEE conference on local computer networks 30th anniversary (LCN'05), 2005. [6.] B. Hofmann-Wellenhof, H. Lichtenegger and J. Collins, Global Positioning System: Theory and Practice, 5th ed., Springer, Sept. 2004. [7.] Mehran Abolhasan, Tadeusz wysocki, Eryk Dutkiewicz, A review of routing protocols for mobile ad hoc networks in 2003. [8.] D. Johnson, D. Maltz, and J. Jetcheva, " The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks", In Internet Draft, draft-ietf-manetdsr-07.txt, 2002. [9.] Wen-Hwa Liao, Yu-chee Tseng, Kuo-Lun Lo, Jang- Ping Sheu, "GRID: A Fully Location-Aware Routing Protocol for Moblie Ad Hoc Networks", Telecommunication Systems, 2001. [10.] Brad Karp and H. T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, Proc. of ACM/IEEE International Conference on Mobile Computing & Networking 2000. [11.] Mehran Abolhasan, Tadeusz wysocki, Eryk Dutkiewicz, A review of routing protocols for mobile ad hoc networks in 2003.

Volume 1, Issue 1, June 2013

Page 26

Das könnte Ihnen auch gefallen