You are here

Mobility pattern-based routing algorithm for mobile ad hoc wireless networks

Download pdf | Full Screen View

Date Issued:
2000
Summary:
This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks lack wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a Location is a frequently used approach, where the searching space for a route is reduced to smaller zone by defining request zone and expected zone. We propose a mobility pattern based algorithm to reduce the overhead, then evaluate the proposed algorithm through simulation. We have implemented two mobility patterns into Location Aided Routing, namely, leading movement and random walk type mobility patterns. We have developed simulation model for each mobility pattern, using SES/Workbench. The performance is measured in terms of overhead of the network. We also discuss various routing algorithms such as dynamic source routing, zone routing protocol, associativity based routing protocol and ad hoc on demand distance vector routing.
Title: Mobility pattern-based routing algorithm for mobile ad hoc wireless networks.
0 views
0 downloads
Name(s): Vyas, Nirav.
Florida Atlantic University, Degree grantor
Mahgoub, Imad, Thesis advisor
College of Engineering and Computer Science
Department of Computer and Electrical Engineering and Computer Science
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2000
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 84 p.
Language(s): English
Summary: This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks lack wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a Location is a frequently used approach, where the searching space for a route is reduced to smaller zone by defining request zone and expected zone. We propose a mobility pattern based algorithm to reduce the overhead, then evaluate the proposed algorithm through simulation. We have implemented two mobility patterns into Location Aided Routing, namely, leading movement and random walk type mobility patterns. We have developed simulation model for each mobility pattern, using SES/Workbench. The performance is measured in terms of overhead of the network. We also discuss various routing algorithms such as dynamic source routing, zone routing protocol, associativity based routing protocol and ad hoc on demand distance vector routing.
Identifier: 9780599809611 (isbn), 12662 (digitool), FADT12662 (IID), fau:9544 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 2000.
Subject(s): Mobile computing
Wireless communication systems
Computer algorithms
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/12662
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.