Location Update Improvement Using Fuzzy Logic Optimization in Location Based Routing Protocols in MANET

Location Update Improvement Using Fuzzy Logic Optimization in Location Based Routing Protocols in MANET

Amjad Osmani (Islamic Azad University - Saghez, Iran), Abolfazl Toroghi Haghighat (Islamic Azad University - Qazvin, Iran) and Shirin Khezri (Islamic Azad University - Mahabad, Iran)
Copyright: © 2011 |Pages: 19
DOI: 10.4018/jghpc.2011070101
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network. This paper introduces a new schema in management of mobile nodes location in mobile ad hoc networks. Fuzzy logic optimization is applied to a better management of location update operation in hierarchical location services. Update management overhead is decreased without significant loss of query success probability. One-hop-chain-technique is used for Auto compensation. A new composed method can update mobile nodes location when the nodes cross a grid boundary. The proposed method uses a dynamic grid area that ?solves the ping-pong problem between grids. Simulation results show that these methods are effective. The algorithms are distributed and can keep scalability in the scenario of increasing nodes density?. The described solutions are not limited to a special network grid ordering, and can be used in every hierarchical ordering like GLS if the ordering can be mappable on these methods.
Article Preview

Figure 1 shows the classification of the location services proposed so far. Location services can be divided into flooding-based and rendezvous-based approaches. Flooding-based protocols can be further divided into dissemination and reactive approaches. In the dissemination approach, each node periodically floods its location to all nodes in the network. Thus, when a given node requires location information on another node, the information is found in the node’s location table, i.e., the dissemination services usually do not send query messages. They can be classified as an all for-all approach. In the reactive approach, nodes do not send update messages; instead they query location information of a specific node only if needed. The location query is flooded to the whole network. The reactive services belong to all-for some category. In rendezvous-based approach, all nodes agree on the set of location servers. Reactive and dissemination services represent the two extremes of the update strategy and they are not scalable. We focus in the following on the rendezvous based services. Two approaches are used to select the location servers, quorum-based and hashing based (Camp, Boleng, & Wilcox, 2001; Luo, X., Camp, & Navidi, 2005).

Figure 1.

Location services classification

One of the main problems in location service problem is time of sending of location update packets. As per available methods, we can classify those to: 1) Time based, 2) Distance based, 3) Distance deviation based, 4) Combination based, 5) Grid based and 6) parametric based methods. The proposed classification is available in Figure 2.

Figure 2.

Time of update classification

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing