Location-Based Routing Scheme with Adaptive Request Zone in Mobile Ad Hoc Networks

Abstract

Putthiphong KIRDPIPAT †a) , Student Member and Sakchai THIPCHAKSURAT †b) , Nonmember SUMMARYRoute discovery process is a major mechanism in the most routing protocols in Mobile Ad Hoc Network (MANET). Routing overhead is one of the problems caused by broadcasting the route discovery packet. To reduce the routing overhead, the location-based routing schemes have been proposed. In this paper, we propose our scheme called Location-based Routing scheme with Adaptive Request Zone (LoRAReZ). In LoRAReZ scheme, the size of expected zone is set adaptively depending on the distance between source and destination nodes. Computer simulation has been conducted to show the effectiveness of our propose scheme. We evaluate the performances of LoRAReZ scheme in the terms of packet delivery fraction (PDF), routing overhead, average end-to-end delay, throughput, packet collision, average hop count, average route setup time, and power consumption. We compare those performance metrics with those of Location Aided Routing (LAR) and Location Aware Routing Protocol with Dynamic Adaptation of Request Zone (LARDAR) protocols. The simulation results show that LoRAReZ can provide all the better performances among those of LAR and LARDAR schemes. key words: MANET, expected zone, request zone, LARDAR, LoRAReZ IntroductionMobile Ad Hoc Network (MANET) is an infrastructure-less networking. Mobile node in MANET communicates with each other by sharing the limited radio channel in peer to peer fashion. Mobile node operates as a router by forwarding packet to other nodes in order to establish the communication path between source node and destination node.Routing protocol is one of the major topics in MANET. Several routing protocols have been proposed to improve the network performance [1]- [3]. These protocols are reactive protocols in which the source node will broadcast the route request packet to entire network for discovering the route to the destination node. However, some nodes may not locate in the path between the source and destination nodes have to process those packets thereby increasing the routing overhead and power consumption. To reduce the routing overhead, the location-based routing schemes have been proposed [4]- [8]. Those schemes use the concept of setting the expected zone and request zone for limiting the route searching area thereby decreasing route discovery packet. The authors in [4] and [5] propose the request zones by using the rectangular shapes. The request zone in [6] 6], the author proposes the mechanism of expanding the request zone size when the first of route discovery process is failed. The greedy algorithm is proposed in [7]. This algorithm selects the node in request zone for sending the data packet until reach the destination node without broadcasting the route discovery packet but the node selection may error if the node position is not correct. The adaptive request zone was proposed in [8]. In this scheme, the request zone can be explained in case of the source node could not found the route to the destin...