Performance of Dead Reckoning-Based Location Service for Mobile Ad Hoc Networks (original) (raw)
Related papers
Dead reckoning in mobile ad hoc networks
2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2000
A predictive model-based mobility tracking method, called dead reckoning, is proposed for mobile ad hoc networks. It disseminates both location and movement models of mobile nodes in the network so that every node is able to predict or track the movement of every other node with a very low overhead. This technique is applied to solve the unicast routing problem by modeling link costs using both link lifetime and geographic distance from the destination to the link egress point. This method presents a much superior routing performance compared to either DSR or AODV, two other popular routing protocols, particularly in terms of delivery fraction and routing load.
Location service in ad-hoc networks: Modeling and analysis
2004
Location-based routing significantly reduces the control overhead in mobile ad hoc networks (MANETs) by utilizing position information of mobile nodes in forwarding decisions. However a location service is needed before any forwarding scheme can be applied. Therefore the scalability of the location services directly affects the overall scalability of location-based routing. Recently, several location service schemes have been proposed, most of which are evaluated based on only one or two performance metrics, and under only the uniform traffic pattern. We believe that a comprehensive comparative study is needed to gain a deeper understanding of the design trade-offs in developing scalable location services. In this paper, we first present a taxonomy of existing schemes and explore the design space and tradeoffs involved. We then develop a common theoretical framework to analyze five existing and representative schemes in terms of three important cost metrics-location maintenance cost, location query cost, and storage cost-and under different traffic patterns. Our analysis shows that the design of location services involves tradeoffs among all three cost metrics, and overlooking any of them may lead to biased conclusions. We also show that some of the schemes are more effective in exploiting localized traffic patterns, thereby more suitable for large scale MANETs, where traffic patterns are more likely to be highly localized.
Location information services in mobile ad hoc networks
2002
In recent years, many location based routing protocols have been developed for ad hoc networks. Some of these protocols assume a location service exists which provides location information on all the mobile nodes in the network. In this paper, we evaluate three location service alternatives. One is a reactive protocol; the other two are proactive protocols. Of the proactive protocols, one sends location tables to neighbors and the other sends location information to all nodes. In our evaluation, one proactive protocol proved to have the best performance overall. Thus, we also evaluate the main input parameter associated with this protocol for optimal performance.
IEEE Transactions on Mobile Computing, 2004
Geographic routing has been introduced in mobile ad hoc networks and sensor networks. Under ideal settings, it has been proven to provide drastic performance improvement over strictly address-centric routing schemes. While geographic routing has been shown to be correct and efficient when location information is accurate, its performance in the face of location errors is not well understood. In this paper, we study the effect of inaccurate location information caused by node mobility under a rich set of scenarios and mobility models. We identify two main problems, named LLNK and LOOP, that are caused by mobility-induced location errors. Based on analysis via ns-2 simulations, we propose two mobility prediction schemes-neighbor location prediction (NLP) and destination location prediction (DLP) to mitigate these problems. Simulation results show noticeable improvement under all mobility models used in our study. Under the settings we examine, our schemes achieve up to 27 percent improvement in packet delivery and 37 percent reduction in network resource wastage, on average, without incurring any additional communication or intense computation.
Performance Comparison of Two Location Based Routing Protocols for Ad Hoc Networks
2002
In recent years, many location based routing protocols have been developed for ad hoc networks. This paper presents the results of a detailed performance evaluation on two of these protocols: Location-Aided Routing (LAR) and Distance Routing Effect Algorithm for Mobility (DREAM). We compare the performance of these two protocols with the Dynamic Source Routing (DSR) protocol and a minimum standard (i.e., a protocol that floods all data packets). We used NS-2 to simulate 50 nodes moving according to the random waypoint model. Our main goal for the performance investigation was to stress the protocols evaluated with high data load during both low and high speeds. Our performance investigation produced the following conclusions. First, the added protocol complexity of DREAM does not appear to provide benefits over a flooding protocol. Second, promiscuous mode operation improves the performance of DSR significantly. Third, adding location information to DSR (i.e., similar to LAR) increases both the network load and the data packet delivery ratio; our results conclude that the increase in performance is worth the increase in cost. Lastly, our implementation of DREAM provides a simple location service that could be used with other ad hoc network routing protocols.
A scalable location service for geographic ad hoc routing
2000
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its location servers) with its current location. A node sends its position updates to its location servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node.
Comparative Analysis of Throughput and Dropped rate for Location-Aided Routing Protocol
— A wireless LAN is one in which a mobile user can connect to a local area network (LAN) through a wireless (radio) connection. There are many routing protocol used in wireless network for transmission of message. In which, location aided routing protocol are used to find the location of destination. This may be possible using GPS in mobile. This paper proposed an approach to increase the throughput in wireless LAN. The proposed approach is suitable for high density and low density network. Besides calculating the throughput, proposed approach also enhance data dropped rate, load, and retransmission attempts in ad hoc network. This paper aims to achieve Keywords— Wireless LAN, GPS I. INTRODUCTION There are two categories of ad hoc networks: Mobile ad hoc network and Wireless LAN. Mobile ad hoc network works as higher level while wireless LAN work as a low level. WI-FI" protocol or wireless LAN is capable of providing ad-hoc network facilities at low level, when no access point is available. However in this case, the nodes are limited to send and receive information but do not route anything across the network. Mobile ad-hoc networks can operate in a standalone fashion or could possibly be connected to a larger network such as the Internet [1]. The Bluetooth technique is available in some mobile. This technique introduced a new type of wireless systems known as mobile ad-hoc networks. Mobile ad-hoc networks or "short live" networks operate in the absence of fixed infrastructure. Mobile ad-hoc network is an autonomous system of mobile nodes connected by wireless links. Nodes in mobile ad-hoc network are free to move and organize themselves in an arbitrary fashion. Each user is free to roam about while communication with others [1]. A mobile ad-hoc network is a collection of mobile nodes forming an ad-hoc network without the assistance of any centralized structures. These networks introduced a new art of network establishment and can be well suited for an environment where either the infrastructure is lost or where deploy an infrastructure is not very cost effective [2]. Wireless mobile ad hoc networks consist of mobile nodes which can communicate with each other in a peer-to-peer fashion (over single hop or multiple hops) without any fixed infrastructure such as access point or base station. In a multi-hop ad hoc wireless network, which changes its topology dynamically, efficient resource allocation, energy management, routing and end-to-end throughput
Dead reckoning localisation technique for mobile wireless sensor networks
IET Wireless Sensor Systems, 2015
Localization in wireless sensor networks (WSNs) not only provides a node with its geographical location but also a basic requirement for other applications such as geographical routing. Although a rich literature is available for localization in static WSN, not enough work is done for mobile WSNs, owing to the complexity due to node mobility. Most of the existing techniques for localization in mobile WSNs uses Monte-Carlo localization (MCL), which is not only time-consuming but also memory intensive. They, consider either the unknown nodes or anchor nodes to be static. In this paper, we propose a technique called Dead Reckoning Localization for mobile WSNs (DRLMSN). In the proposed technique all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are localized for the first time using three anchor nodes. For their subsequent localizations, only two anchor nodes are used. The proposed technique estimates two possible locations of a node Using Bézout's theorem. A dead reckoning approach is used to select one of the two estimated locations. We have evaluated DRLMSN through simulation using Castalia simulator, and is compared with a similar technique called RSS-MCL proposed by Wang and Zhu [1].
Scalability analysis of location management protocols for mobile ad hoc networks
2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)
With the availability of location based services, applications that use locations for optimal performance will require efficient location management algorithms, where user locations are kept track with minimal system overhead. Geography based routing in mobile ad hoc networks is one such application that uses location information of nodes in a network to route data packets. Previous work in this area has shown that the selection of location management protocol is critical to the performance of such routing algorithms. Many location management schemes have been proposed in literature, and in an effort to quantitatively compare the performance of some of these schemes, we carry out extensive simulations to study SLURP, SLALoM and HGRID, three grid based protocols described in literature. Our study is two pronged-to compare the performance of location management with network mobility as well as traffic load, and to evaluate the effect these protocols have on the performance of geographic routing in mobile ad hoc networks. Our results show that the Hierarchical Grid Location Management protocol (HGRID) achieves steady performance for data throughput and delay, and minimally affects the performance of geographic routing.