Adaptive Location Update with Location Free Topology in Mobile Ad Hoc Networks
31 Mar 2009-Vol. 2, pp 528-532
TL;DR: A 2D Markov walk model is used as a mobility model that describes a broad class of mobility patterns such that the location update is designed according to the mobility pattern and traffic parameters adaptively and an iterative greedy heuristic algorithm is used to decrease the complexity of adaptive location update.
Abstract: In this paper we use a 2D Markov walk model as a mobility model that describes a broad class of mobility patterns such that the location update is designed according to the mobility pattern and traffic parameters adaptively. A location free topology control protocol is used which deals with the topology control at the network layer and at the same time overcomes the hidden terminal problem at the MAC layer. Every node in the network determines its power for data transmission and control transmission according to the received messages from its neighbourhood. The implemented protocol works without location information and use little control packet overhead and also prevents the potential collision due to hidden terminals. To decrease the complexity of adaptive location update we use an iterative greedy heuristic algorithm to find an approximate solution of the problems efficiency. The heuristic algorithm can perform effectively even under the most extreme conditions.
References
More filters
TL;DR: Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
Abstract: An ad hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This article examines routing protocols for ad hoc networks and evaluates these protocols based on a given set of parameters. The article provides an overview of eight different protocols by presenting their characteristics and functionality, and then provides a comparison and discussion of their respective merits and drawbacks.
4,278 citations
TL;DR: A novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded is presented, which supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when Mobility rates are high.
Abstract: This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the (/spl alpha/, t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high.
747 citations
26 Apr 2004
TL;DR: The XTC ad-hoc network topology control algorithm introduced shows three main advantages over previously proposed algorithms: it is extremely simple and strictly local, it does not assume the network graph to be a unit disk graph, and XTC proves correct also on general weighted network graphs.
Abstract: Summary form only given. The XTC ad-hoc network topology control algorithm introduced shows three main advantages over previously proposed algorithms. First, it is extremely simple and strictly local. Second, it does not assume the network graph to be a unit disk graph; XTC proves correct also on general weighted network graphs. Third, the algorithm does not require availability of node position information. Instead, XTC operates with a general notion of order over the neighbors' link qualities. In the special case of the network graph being a unit disk graph, the resulting topology proves to have bounded degree, to be a planar graph, and - on average-case graphs - to be a good spanner.
318 citations
"Adaptive Location Update with Locat..." refers methods in this paper
...The heuristic algorithm can perform effectively even under the most extreme conditions....
[...]
TL;DR: In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols, and in smaller networks; the performance is comparable to MANet routing protocols.
Abstract: Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.
263 citations
30 Sep 2001
TL;DR: This paper describes a new and simple random walk mobility model that simplifies the two-dimensional Markov chain based on the properties of symmetry and lumped process that can be adapted to most mobility management studies for architectures.
Abstract: This paper describes a new and simple random walk mobility model that simplifies the two-dimensional Markov chain based on the properties of symmetry and lumped process. Compared to various other approaches, the proposed approach significantly reduces the complexity of the model by reducing the computing states. Based on this model, the location update rate and dwell time can be easily derived. The regular Markov chain and the property of combining states are applied to derive the number of location updates and a modified absorbing Markov chain property can be used to derive the dwell time. Analytical performance results of the model were validated by simulation. Results show the relative error between analytical and simulation performances are within 1%. This is the first model of its kind that can be used for studying area-crossing rates. This model can be adapted to most mobility management studies for architectures.
34 citations