Power Aware Location Aided Routing in Mobile Ad-hoc Networks

Transcription

1 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 1 Power Aware Location Aided Routing in Mobile Ad-hoc Network Anamika Computer Science, Inderprataha Engineering College anamikachandruka@gmail.com Abtract- Mobile ad-hoc network (MANET) [1] i defined a an autonomou ytem of mobile node and aociated hot connected by wirele link. Network topology change due to change in location of node in the network. Thi make it more difficult to find the route thoe packet. In thi paper, a Power Aware location aided routing algorithm (PALAR) cheme by reducing ize of requet zone, limit flooding and ue available bandwidth and battery life in an efficient manner. Index Term- Requet Zone, Expected Zone, Location aided routing, Global poitioning ytem, Mobile ad-hoc network, Routing. M I. INTRODUCTION obile ad-hoc network (MANET) [1] i defined a an autonomou ytem of mobile node and aociated hot connected by wirele link. Due to the high mobility of node, the network topology of MANET alway change and tak of finding and maintaining route become difficult. Several routing protocol have been propoed for, with the goal of achieving efficient routing[]. Routing protocol for wirele ad hoc network can be mainly arranged into the two categorie: Table-driven (or Proactive) and Ondemand (or Reactive/Source Initiated). Proactive protocol continuouly learn the topology of the network by exchanging topological information among the network node[3]. Thu, when there i a need for a route to a detination, uch route i readily available [, 3].In ource initiated routing protocol mobile node maintain path information for detination only when they need to contact the ource node or relay packet []. In recent time, many routing protocol have been propoed which ue the Global Poitioning Sytem (GPS) [, 4] to identify location information of detination and improve the routing performance. The coordinate of each node can be known by uing GPS. Variou GPS applicable protocol like LAR, DREAM,ILAR,LARDAR etc have been propoed to provide efficient routing. In thi paper, we propoe a routing cheme that make ue of the global poitioning ytem (GPS) to improve routing in MANET. Firt ue the location information of detination node to predict a maller triangle requet zone that cover the poition of detination in the pat. Then decide a baeline, which i the line between the ource node and the detination node, for route dicovery. Then ource node end an information requet to intermediate node and receive their replie and then identifie the node making minimum angle and have required battery life. The ource then forward route requet packet to thi choen node. Thi procedure i repeated till the complete path to detination i found. II. RESEARCH ELABORATION In Location-Aided Routing (LAR) [5] i an on demand routing protocol in which the overhead of route dicovery i decreaed by utilizing location information of mobile node obtained uing Global Poitioning Sytem (GPS) [4]. Location information i ued to identify requet zone and expected zone. Requet zone i an rectangular area that include both ender and receiver. Expected Zone: Expected Zone i the region where ource node S think that the detination node D may contained at ome time t auming that node S know that the node D wa at location L at time t0 and current time i t1. From the viewpoint of S, expected zone of node D i the region that node S expect to contain node D at time t1 baed on the knowledge that node D wa at location L at time t0. Now, If S know that D travel with average peed v, then S aume that the expected zone i the circular region of radiu v(t1- t0) centered at location L

2 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 FIGURE.1:EXPECTED ZONE Requet Zone :The requet zone i created a a rectangle with the ource in one corner and the expected zone in the oppoite corner of the rectangle. FIGURE. :REQUEST ZONE AND EXPECTED ZONE Ditance Routing Effect Algorithm for Mobility The Ditance Routing Effect Algorithm for Mobility (DREAM) protocol i table driven routing protocol reduce overhead of route dicovery by toring location information for every other node within the network in the routing table[6]. DREAM may be conidered part proactive and part reactive in nature. The node within a DREAM environment have a mean of dieminating and collectively updating the location table entrie for each other, behaving a a proactive protocol. When an information packet need to be tranported form node A to node B, node A look up the location of B from within it table and forward the packet to node in the direction of B, a the next hop node. Thee intermediate node in turn perform a lookup and forward the packet in the direction of B. Thi reult in the protocol mechanim reflecting a reactive nature. Improved Location Aided Routing (ILAR) ILAR (Improved Location Aided Routing) [] i another location baed technique which ue the concept of bae line lying in between the ource and detination node. Node which i cloet to thi line of ight will be choen a the next intermediate node. A the tranmitting node check the ditance of every neighboring node from bae line and find the cloet neighbor for further tranmiion. Thi proce will increae the delay in data which in turn decreae battery life.

3 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 3 Aume S (X,Y ) and D(X d,y d ) are the coordinated of ource and detination identified uing location aided routing. Now, baeline can be determined by uing the equation: x x y y y y x x 0 d d DIST A : The ditance between the ource node and node A. VDIST A : The ditance from node A to the baeline. FIGURE.3: EXAMPLE OF BASELINE Node A receive the route requet from ource node S, and calculate the ditance between the ource node and itelf, denoted a DIST A. Moreover, node A will calculate the ditance from the node to the baeline, denoted a VDIST A. We aume that the baeline i ax by c 0.VDIST A can be obtained from the following equation: VDIST A ax A by a A b c FIGURE.4:DIST AND VDIST LARDAR (Location Aware Routing Protocol with Dynamic Adaptation of Requet Zone for Mobile Ad hoc Network) [7] i an on demand routing protocol which decreae the area of requet zone by utilizing detination node location information and velocity which in turn reduce number of route requet. Dynamic adaptation of requet zone technique i ued to trigger intermediate node uing it more freh location information of detination node or the information provide by precedent node to redefine a more precie requet zone to improve the performance of routing protocol. Requet Zone Source node i outide of expected zone: If ource node S i outide of the expected zone, we define the requet zone to be the mallet iocele triangle, named TRIANGLEZONE, which include the current location of S and the expected zone.

4 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 4 FIGURE.5: REQUSET ZONE AND EXPECTED ZONE III. PROPOSED WORK In propoed protocol the ource node dicover the location of the detination and then it etimate the average velocity of the detination uing it knowledge of previou detination movement. Uing thi calculated average peed, the lat time when it know the poition of D, and the location of D, the ource node calculate the expected zone of D. Uing thi expected zone, it create the requet zone of D and end requet to all it 1-hop neighbor. Each neighbor on receiving the requet packet check whether it i the detination or not. If it i the detination then it replie to ource to tart tranmiion of data packet ele it end back a reply to ource with θ 1 and remaining battery life. Source node elect the neighbor node on the bai of mallet θ 1 and battery life after receiving replie from it neighbor within the pecified period of time, and end the requet packet to that node to find the path to the detination. If battery life i le than required battery than another intermediate node with mallet θ 1 and thi proce i repeated at each node (that receive the requet to find the path) till the detination i reached. A. Meage Detail Route Requet packet: Source node end route requet packet to all it one hop neighbor to indicate that it i trying to find a route to a given detination node. SID DID Q1 SrcPo RB SID: Identification Id of Source DID: Identification Id of Detination SrcPo: Location of ource θ 1 = Angle ent by intermediate node RB: Required battery life. Route reply packet: Each node on receiving a route requet packet, end back a route reply. SID Q Battery SID=Identification Id of intermediate node θ 1 =angle ubtended by the intermediate neighbour node with the ource Battery= battery life of intermediate node. B. Calculation of θ 1 Baeline: The traight line connecting ource and detination. The lope of the baeline can be calculated uing the formula: 1 tan y y / x x 1 1

5 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 5 Obervation1: ΔASD ΔBSD FIGURE 3.1:Calculation of Ɵ FIGURE 3.:HOW Ɵ1 AND Ɵ ARE EQUAL Proof: In ΔASD and ΔBSD SA=SB (Tangent to a circle from ame point are of equal length) SO = SO (Common Side ) DA=DB (radiu of circle) Therefore by SSS theorem, ΔASD and ΔBSD are congruent. Obervation: θ 1 = θ = ½ θ Proof: ΔASD ΔBSD (from obervation 1) θ 1 = θ Alo θ + θ = θ From above equation: θ 1 = θ = ½ θ Obervation 3: θ 1 = in -1 v (t 1 t 0 ) / (x x 1 ) + (y y 1 ) Proof: OAS = 90 0 (a DA i line joining centre of circle to tangent) Therefore, in (θ 1 ) = v (t 1 t 0 ) / (x x 1 ) + (y y 1 ) Hence, θ 1 = in -1 v (t 1 t 0 ) / (x x 1 ) + (y y 1 ) Obervation 4: I 1 SD = Slope of SD lope of SI Let T be the point where line DS meet the x axi Let P be the point where line IS meet the x axi Now DTX = lope of SD (a XI 1 i parallel to SD) Now IPX = lope of SI (a XI 1 i parallel to SD)

6 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 6 FIGURE 3.3: CALCULATION OF ANGLE SUBSTENDED BY INTERMEDIATE NODE In ΔSPT, PST = STX - SPX = DTX - IPX = Slope of SD lope of I 1 D C. Algorithm Global parameter for each node: routesearchinprogre : Hah table that track which node are being earched routingtable: Table that tore the routing path at thi node. Any uitable verion can be plugged in. //Thi procedure i executed by node when it i earching for path to ome node Void earchroute(nodeid dt) routesearchinprogre[dt] = 1 ; // calculate expected zone dtlocation = retrieve_location( dt); //retrieve location of dt node T 1 = locationlatupdatedat(dt); // lat time detination location wa updated T 0 = gettime(); V = getavgvelocity( dt); Expected_zone = Calculate_expected_zone( t1, to, v dtlocation ); //calculate requet zone rclocation = retrieve_location( thinode); Requet_zone = Calculate_requet_zone( expected_zone, rclocation); //broadcat route requet to all neighbor Requet = Make_requet (uniquenodeid, dt, requetzone. θ, rclocation,rb) ; Send (requet, -1 ); //intermediate node would run the proce incoming requet function Timer.etTimeout = milli econd; minid = -1, minangle = θ; // proce all replie and chooe the node making minimum angle with baeline While (timer) waitpacket(); CalculateAngle ø with the baeline ( θ-θ 1 ) If ( ø < minangle ) minid = N, minangle = ø // end route requet packet to the elected node If( minid!= -1 ) // create route requet packet and end to node with id minid Packet p = new RouteRequet(uniqueNodeId, dt, rclocation, θ,rb); end(p, minid) ; return Send ( p, RERR); // end packet to indicate that no route could be found

7 International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 7 //Thi procedure i run by all node when litening to the network Void litenatintermediatenode () Packet p; While (true) WaitPacket( p); // wait till a packet come in, and fill that packet into p Handle_packet(p); //helper function for proceing incoming packet //Thi procedure i executed by intermediate node on receiving the route requet packet Void proceincomingrequet(packet p) If( p.did = uniquenodeid ) Packet routereply = new RouteReply( RREP, p.sid, p.did,battery); Send( routereply, -1 ) ; //broadcat the route reply packet ele θ 1 = calculate θ 1 ( p.sid, p. DID, uniquenodeid); //a decribed earlier Packet reply = new reply (uniquenodeid, θ 1 ); Send (reply, p.requetsid); //End of proceing Route Requet packet //Thi procedure i executed by node on receiving a route reply packet Void proceincomingroutereply(packet p) //update routing table a uitable baed on thi packet updateroutingtable(p); If ( routesearchinprogre[dt] == 1 ) //broadcat routing entry for thi node if a path to it i being earched forwardroute(dt); routesearchinprogre[dt] = 0 ; // end of proce incoming route reply IV. CONCLUSION Thi paper preented and evaluated a protocol (PALAR) for routing packet between mobile node in an ad hoc network. Propoed protocol minimize bandwidth conumption, flooding and battery conumption of mobile node by decreaing area of requet zone and minimizing number of requet and repone evaluation at every tep. PALAR will provide efficient routing by chooing the node which have required battery life to tranmit the data packet. REFERENCES [1] S. Gangwar, K. Kumar, Mobile Ad hoc Network: A detailed urvey of QoS Routing Protocol, vol., NO.6, International Journal of Ditributed and Parallel Sytem, 011. [] N. C. Wang, Y. F. Huang, J. S. Chen, S. M. Wang, C. L. Chen, An Improved Location-Aided Routing Protocol for Mobile Ad Hoc Network with Greedy Approach, vol.8, Iue 8, Wea Tranaction on Communication, 009. [3] G. V. Kumar, Y. V. Teddy, M. Nagendra, Current Reearch Work on Routing Protocol for MANET: A Literature Survey, vol., NO.3, International Journal of Computer Science and Engineering, 010, pp [4] E. D. Kaplan, Undertanding GPS: Principle and Application, Artech Houre, Boton, MA. [5] Y. Ko, N. H. Vaidya, L Location-aided routing (LAR) in mobile ad hoc network, vol. 6, NO.4, ACM Wirele Network, 000, pp [6] I. S. Baagn, Chlamtac, V. R. Syrotiuk, A ditance routing effect algorithm for mobility (DREAM), 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Dalla, Texa, USA, [7] T. F. Shih H.C. Yen, "Location-aware routing protocol with dynamic adaptation of requet zone for mobile ad hoc network, Springer Wirele Network 14:31 333,DOI / y, 008.